Minimizing Response Times in Real Time Planning and Search

Real time artificial intelligence (AI) systems are required to respond within a given deadline, or have optimal response times. While some researchers have addressed the issue of planning under deadline constraints, there has been very little research towards optimizing the response time of problem-solving methods. The costs for a response consists of the cost to plan for a solution and the cost of executing the chosen solution. There is an intimate trade-off between these two costs. This paper presents an algorithm for providing near optimal response times by formalizing the trade-offs between planning and execution costs. We provide a proof of correctness and describe an implementation of the algorithm in a real time application of query planning. We also provide a model for considering response times in the context of the A* heuristic search algorithm.

[1]  S. B. Yao,et al.  Optimization of query evaluation algorithms , 1979, ACM Trans. Database Syst..

[2]  Thomas J. Laffey,et al.  Real-Time Knowledge-Based Systems , 1988, AI Mag..

[3]  C. V. Ramamoorthy,et al.  New optimization techniques in database access and maintenance , 1988 .

[4]  R. Peter Bonasso.  What AI Can Do for Battle Management: A Report of the First AAAI Workshop on AI Applications to Battle Management , 1988, AI Mag..

[5]  Nils J. Nilsson,et al.  Principles of Artificial Intelligence , 1980, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[6]  Richard E. Korf,et al.  Depth-First Iterative-Deepening: An Optimal Admissible Tree Search , 1985, Artif. Intell..

[7]  Eric Horvitz,et al.  Reasoning under Varying and Uncertain Resource Constraints , 1988, AAAI.

[8]  Nils J. Nilsson,et al.  A Formal Basis for the Heuristic Determination of Minimum Cost Paths , 1968, IEEE Trans. Syst. Sci. Cybern..

[9]  Richard E. Korf,et al.  Real-Time Heuristic Search: First Results , 1987, AAAI.

[10]  Stuart J. Russell,et al.  Decision-Theoretic Control of Reasoning: General Theory and an , 1988 .

[11]  Richard E. Korf,et al.  Real-time heuristic search: new results , 1988, AAAI 1988.

[12]  Andrew S. Cromarty,et al.  "Fast" Is Not "Real-Time": Designing Effective Real-Time AI Systems , 1985, Other Conferences.

[13]  Jonathan J. King.  QUIST: A System for Semantic Query Optimization in Relational Databases , 1981, VLDB.

[14]  R. Peter Bonasso.  What AI can do for battle management , 1988 .

[15]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[16]  David Gelperin,et al.  The optimality of A , 1988 .