This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Specification and Analysis of Real-Time Problem Solvers
August 1993 (vol. 19 no. 8)
pp. 788-803

The authors provide a method for the specification of real-time artificial intelligence (AI) problem solvers. Using this method, a formal specification of a real-time problem is presented. In addition, a method for analyzing real-time AI problem solvers is examined using a case study of two real-time problem solvers, namely DYNORAII and RTA* for the real-time path planning problem. New results on worst-case and average-case complexity of the problem, and of the algorithms that solve it, and an experimental evaluation of DYNORAII and RTA* for deadline compliance and response-time minimization are provided.

[1] R. E. Korf, "Real-time 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: Addison-Wesley, 1984.
[4] C. L. Liu and J. W. Layland, "Scheduling algorithms for multiprogramming in a hard real-time environment,"J. ACM, vol. 20, no. 1, pp. 46-61, Jan. 1973.
[5] M. R. Garey and D. S. Johnson, "Complexity results for multiprocessor scheduling under resource constraints,"SIAM J. Computing, pp. 397-411, 1975.
[6] E. A. Lee and D. G. Messerschmitt, "Static scheduling of synchronous data flow programs for digital signal processing,"IEEE Trans. Comput., vol. C-36, no. 1, pp. 24-35, Jan. 1987.
[7] J. A. Bannister and K. S. Trivedi, "Task allocation in fault-tolerant distributed systems,"Acta Informatica, pp. 261-281, 1983.
[8] Scientific Supercomputer Subcommittee, "Software for supercomputers,"Computer, vol. 21, no. 12, pp. 70-74, Dec. 1988.
[9] J. F. Kurose, M. Schwartz, and Y. Yemini, "Multiple-access protocols and time-constrained communication,"ACM Computing Surveys, vol. 16, pp. 43-70, 1984.
[10] W. Zhao and K. Ramamritham, "Virtual time CSMA protocols for hard real-time communication,"IEEE Trans. Software Eng., vol. SE-13, no. 8, Aug. 1987.
[11] I. Lee and S. Davidson, "Adding time to synchronous process communications,"IEEE Trans. Comput., pp. 941-948, Aug. 1987.
[12] B. Dasarathy, "Timing constraints of real-time systems: Constructs for expressing them, methods of validating them,"IEEE Trans. Software Eng., vol. SE-11, pp. 80-86, Jan. 1985.
[13] V. H. Hasse, "Real-time behavior of programs,"IEEE Trans. Software Eng., vol. SE-7, pp. 494-501, Sept. 1981.
[14] D. W. Leinbaugh and M.-R. Yamini, "Guaranteed response times in a distributed hard-real-time environment,"IEEE Trans. Software Eng., vol. SE-12, pp. 1139-1144, Dec. 1986.
[15] F. Jahanian and A. K. Mok, "Safety analysis of timing properties in real-time systems,"IEEE Trans. Software Eng., vol. SE-12, no. 9, pp. 890-904, Sept. 1986.
[16] J. E. Coolahan and N. Roussopoulos, "Timing requirements for time-driven systems using augmented petri nets,"IEEE Trans. Software Eng., vol. SE-9, pp. 603-616, Sept. 1983.
[17] N.G. Leveson and J.L. Stolzy, "Safety analysis using Petri nets,"IEEE Trans. Software Eng., vol. SE-13, no. 3, pp. 386-397, Mar. 1987.
[18] M. R. Garey and D. S. Johnson,Computers and Intractability: A Guide to Theory of NP-Completeness. 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. 238-242.
[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. 395-410.
[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. SSC-4, no. 2, pp. 100-107, 1968.
[24] R. E. Korf, "Depth-first iterative deepening: An optimal admissible tree search,"Artificial Intell., vol. 25, pp. 97-109, 1985.
[25] K. Ramamritham, "Channel characteristics in local area hard real-time 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. 49-54, 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. 1121-1127.
[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. 14-23.
[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, "Plan-Guided Reaction,"IEEE Trans. Systems, Man, and Cybernetics, Vol. 20, No. 6, Nov./Dec. 1990, pp. 1,370-1,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. 463-502.
[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. 256-275, 1950.
[35] B. Hamidzadeh and S. Shekar, "DYNORA: A Real-time 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. 218-223.
[38] M. R. Garey and D. S. Johnson, "Complexity results for multiprocessor scheduling Under resource constraints,"SIAM J. Comput., pp. 397-411, 1975.
[39] B. Hamidzadeh and S. Shekhar, "Can real-time search algorithms meet deadlines?," inProc. AAAI Conf., AAAI, 1992.

Index Terms:
real-time artificial intelligence; formal specification; real-time problem; real-time AI problem solvers; DYNORAII; RTA*; real-time path planning problem; average-case complexity; deadline compliance; response-time minimization; computational complexity; formal specification; path planning; problem solving; real-time systems
Citation:
B. Hamidzadeh, S. Shekhar, "Specification and Analysis of Real-Time Problem Solvers," IEEE Transactions on Software Engineering, vol. 19, no. 8, pp. 788-803, Aug. 1993, doi:10.1109/32.238582
Usage of this product signifies your acceptance of the Terms of Use.