Specification and Analysis of Real-time Problem Solvers

IEEE Transactions on Software Engineering

Volumn 19, Issue 8, 1993, Pages 788-803

  Hamidzadeh, Babak ^a   Shekhar, Shashi ^a  

^a UNIVERSITY OF MINNESOTA   (United States)

Author keywords

Problem solving; real time search

Indexed keywords

ALGORITHMS; ARTIFICIAL INTELLIGENCE; COMPUTATIONAL COMPLEXITY; COMPUTATIONAL METHODS; COMPUTER SOFTWARE; CONSTRAINT THEORY; CONTROL SYSTEMS; DATABASE SYSTEMS; FORMAL LANGUAGES; PROBLEM ORIENTED LANGUAGES; RESPONSE TIME (COMPUTER SYSTEMS); STATE SPACE METHODS;

FORMAL SPECIFICATION; PROBLEM SOLVING; REAL TIME PROBLEM SOLVERS; SEARCH; SOFTWARE PACKAGE DYNORAII; SOFTWARE PACKAGE RTA; TIME CONSTRAINTS;

REAL TIME SYSTEMS;

EID: 0027646161     PISSN: 00985589     EISSN: None     Source Type: Journal    
DOI: 10.1109/32.238582     Document Type: Article

References (39)

1. R. E. Korf, “Real-time heuristic search first results,” in Proc. AAAI Conf., 1987.
2. N. J. Nilsson, Principles of Artificial Intelligence. Palo Alto, CA: Tioga Press, 1980.
3. P. H. 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. Assoc. Comput. Mach., pp. 46–61, Feb. 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, 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. C. M. Krishna and K. G. Shin, “On scheduling tasks with a quick recovery from failure,” IEEE Trans. Comput., vol. C-35, pp. 448–455, May 1986.
9. J. F. Kurose, M. Schwartz, and Y. Yemini, “Multiple-access protocols and time-constrained communication,” Computing Survey, pp. 43–70, Mar. 1984.
10. W. Zhao and K. Ramamritham, “Virtual time CSMA protocols for hard real-time communication,” IEEE Trans. Software Eng., vol. SE-13, pp. 938–952, Aug. 1987.
11. I. Lee and S. B. Davidson, “Adding time to synchronous process communication,” IEEE Trans. Comput., vol. C-36, 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, 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, pp. 386–397, Mar. 1987.
18. M. R. Garey and D. S. Johnson, Computers and Intractability. New York: W. H. Freeman, 1979.
19. S. Shekhar and S. Dutta, “Minimizing response times in real time planning and search,” in Proc. 11th Int. Joint Conf. Artificial Intelligence, 1989, pp. 238–242.
20. L. P. Kaelbling, “An architecture for intelligent reactive system,” in Reasoning about Actions and Plans: Proc. 1986 Workshop. Los Altos, CA: Morgan Kauffman, 1987, pp. 395—410.
21. R. Reiter, “Nonmonotonic reasoning,” in 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,” in Exploring 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 Intelligence, vol. 27, pp. 97–109, 1985.
25. K. Ramamritham, “Channel characteristics in local area hard real-time systems,” Computer Networks and ISDN Syst., pp. 3–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 881435, 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,” in Proc. 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 Automat., vol. RA-2, pp. 14—23, Mar. 1986.
30. “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. Syst., Man, Cybern., vol. 20, Nov./Dec. 1990.
32. J. McCarthy and P. J. Hayes, “Some philosophic problems from the standpoint of artificial intelligence,” in Machine Intelligence 4, B. Meltzer and D. Michie, Eds., Edinburgh University Press, 1969, pp. 463–502.
33. R. E. Korf, “RealTime heuristic search new results, in Proc. 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,” in Proc. 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?,” in Proc. AAAI Conf., AAAI, 1992.