
This Article  
 
Share  
Bibliographic References  
Add to:  
Digg Furl Spurl Blink Simpy Del.icio.us Y!MyWeb  
Search  
 
ASCII Text  x  
B. Hamidzadeh, S. Shekhar, "Specification and Analysis of RealTime Problem Solvers," IEEE Transactions on Software Engineering, vol. 19, no. 8, pp. 788803, August, 1993.  
BibTex  x  
@article{ 10.1109/32.238582, author = {B. Hamidzadeh and S. Shekhar}, title = {Specification and Analysis of RealTime Problem Solvers}, journal ={IEEE Transactions on Software Engineering}, volume = {19}, number = {8}, issn = {00985589}, year = {1993}, pages = {788803}, doi = {http://doi.ieeecomputersociety.org/10.1109/32.238582}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, }  
RefWorks Procite/RefMan/Endnote  x  
TY  JOUR JO  IEEE Transactions on Software Engineering TI  Specification and Analysis of RealTime Problem Solvers IS  8 SN  00985589 SP788 EP803 EPD  788803 A1  B. Hamidzadeh, A1  S. Shekhar, PY  1993 KW  realtime artificial intelligence; formal specification; realtime problem; realtime AI problem solvers; DYNORAII; RTA*; realtime path planning problem; averagecase complexity; deadline compliance; responsetime minimization; computational complexity; formal specification; path planning; problem solving; realtime systems VL  19 JA  IEEE Transactions on Software Engineering ER   
The authors provide a method for the specification of realtime artificial intelligence (AI) problem solvers. Using this method, a formal specification of a realtime problem is presented. In addition, a method for analyzing realtime AI problem solvers is examined using a case study of two realtime problem solvers, namely DYNORAII and RTA* for the realtime path planning problem. New results on worstcase and averagecase complexity of the problem, and of the algorithms that solve it, and an experimental evaluation of DYNORAII and RTA* for deadline compliance and responsetime minimization are provided.
[1] R. E. Korf, "Realtime heuristic search first results," inProc. AAAI Conf., 1987.
[2] N. Nilsson,Principles of Artificial Intelligence. Palo Alto, CA: Tioga, 1980.
[3] P. M. Winston,Artificial Intelligence. Reading, MA: AddisonWesley, 1984.
[4] C. L. Liu and J. W. Layland, "Scheduling algorithms for multiprogramming in a hard realtime environment,"J. ACM, vol. 20, no. 1, pp. 4661, Jan. 1973.
[5] M. R. Garey and D. S. Johnson, "Complexity results for multiprocessor scheduling under resource constraints,"SIAM J. Computing, pp. 397411, 1975.
[6] E. A. Lee and D. G. Messerschmitt, "Static scheduling of synchronous data flow programs for digital signal processing,"IEEE Trans. Comput., vol. C36, no. 1, pp. 2435, Jan. 1987.
[7] J. A. Bannister and K. S. Trivedi, "Task allocation in faulttolerant distributed systems,"Acta Informatica, pp. 261281, 1983.
[8] Scientific Supercomputer Subcommittee, "Software for supercomputers,"Computer, vol. 21, no. 12, pp. 7074, Dec. 1988.
[9] J. F. Kurose, M. Schwartz, and Y. Yemini, "Multipleaccess protocols and timeconstrained communication,"ACM Computing Surveys, vol. 16, pp. 4370, 1984.
[10] W. Zhao and K. Ramamritham, "Virtual time CSMA protocols for hard realtime communication,"IEEE Trans. Software Eng., vol. SE13, no. 8, Aug. 1987.
[11] I. Lee and S. Davidson, "Adding time to synchronous process communications,"IEEE Trans. Comput., pp. 941948, Aug. 1987.
[12] B. Dasarathy, "Timing constraints of realtime systems: Constructs for expressing them, methods of validating them,"IEEE Trans. Software Eng., vol. SE11, pp. 8086, Jan. 1985.
[13] V. H. Hasse, "Realtime behavior of programs,"IEEE Trans. Software Eng., vol. SE7, pp. 494501, Sept. 1981.
[14] D. W. Leinbaugh and M.R. Yamini, "Guaranteed response times in a distributed hardrealtime environment,"IEEE Trans. Software Eng., vol. SE12, pp. 11391144, Dec. 1986.
[15] F. Jahanian and A. K. Mok, "Safety analysis of timing properties in realtime systems,"IEEE Trans. Software Eng., vol. SE12, no. 9, pp. 890904, Sept. 1986.
[16] J. E. Coolahan and N. Roussopoulos, "Timing requirements for timedriven systems using augmented petri nets,"IEEE Trans. Software Eng., vol. SE9, pp. 603616, Sept. 1983.
[17] N.G. Leveson and J.L. Stolzy, "Safety analysis using Petri nets,"IEEE Trans. Software Eng., vol. SE13, no. 3, pp. 386397, Mar. 1987.
[18] M. R. Garey and D. S. Johnson,Computers and Intractability: A Guide to Theory of NPCompleteness. San Francisco, CA: Freeman, 1979.
[19] S. Shekhar and S. Dutta, "Minimizing response times in real time planning and search," inProc. 11th Int. Joint Conf. Artificial Intelligence, 1989, pp. 238242.
[20] L. P. Kaelbling, "An architecture for intelligent reactive system," inReasoning about Actions and Plans: Proc. 1986 Workshop. Los Altos, CA: Morgan Kauffman, 1987, pp. 395410.
[21] R. Reiter, "Nonmonotonic reasoning," inIn Exploring Artificial Intelligence, H. E. Shrobe and AAAI, Eds. Los Altos, CA: Morgan Kauffman, 1988.
[22] R. E. Korf, "Search: A survey of recent results," inExploring Artificial Intelligence, H. Shrobe, Ed. Los Altos, CA: Morgan Kauffman, 1988.
[23] P. E. Hart, N. J. Nilsson, and B. Raphael, "A formal basis for the heuristic determination of minimum cost paths,"IEEE Trans. Syst. Sci. Cybern., vol. SSC4, no. 2, pp. 100107, 1968.
[24] R. E. Korf, "Depthfirst iterative deepening: An optimal admissible tree search,"Artificial Intell., vol. 25, pp. 97109, 1985.
[25] K. Ramamritham, "Channel characteristics in local area hard realtime systems,"Comput. Networks ISDN Syst., vol. 3, no. 13, 1987.
[26] T. Dean and M. Boddy, "An analysis of time dependent planning,"Proc. AAAI, pp. 4954, 1988.
[27] S. Russel and E. H. Wefald, "Decision theoretic control of reasoning: General theory and an algorithm tO game playing,"Report No. UCB/CSD 88/435, p. Computer Science Division, U.C. Berkely (1988).
[28] E.J. Horvitz, G. F. Cooper, and D. E. Heckerman, "Reflection and action under scarce resources: Theoretical principles and empirical study," inProc. 11th Int. Joint Conf. Artificial Intelligence, IJCAI, 1989, pp. 11211127.
[29] R.A. Brooks, "A Robust Layered Control System for a Mobile Robot,"IEEE J. Robotics and Automation, Vol. 2, No. 1, Mar. 1986, pp. 1423.
[30] R. A. Brooks, "Planning is just a way of avoiding figuring out what to do next,"Working Paper 303, Massachusetts Institute of Technology, Artificial Intelligence Laboratory, Sept. 1987.
[31] D.W. Payton, J.K. Rosenblatt, and D.M. Keirsey, "PlanGuided Reaction,"IEEE Trans. Systems, Man, and Cybernetics, Vol. 20, No. 6, Nov./Dec. 1990, pp. 1,3701,382.
[32] J. McCarthy and P. J. Hayes, "Some philosophic problems from the standpoint of artificial intelligence," inMachine Intelligence 4, B. Meltzer and D. Michie, Eds., Edinburgh University Press, 1969, pp. 463502.
[33] R.E. Korf, "RealTime heuristic search new results, inProc. AAAI Conf., 1988.
[34] C. E. Shannon, "Programming a computer for playing chess,"Philosophical Magazine, vol. 41, pp. 256275, 1950.
[35] B. Hamidzadeh and S. Shekar, "DYNORA: A Realtime planning algorithm to meet response time constrains in dynamic environments,"Proc. Tools for Artificial Intelligence Conf., TAI, 1991.
[36] B. Bollobas,Random Graphs. New York: Academic, 1985.
[37] A. Aleliunas, R. M. Karp, R. J. Lipton, L. Lovasz, and C. Rackott, "Random walks, universal traversal sequences and the complexity of maze problems," inProc. 20th Annu. Symp. Foundations of Computer Science, 1979, pp. 218223.
[38] M. R. Garey and D. S. Johnson, "Complexity results for multiprocessor scheduling Under resource constraints,"SIAM J. Comput., pp. 397411, 1975.
[39] B. Hamidzadeh and S. Shekhar, "Can realtime search algorithms meet deadlines?," inProc. AAAI Conf., AAAI, 1992.