Depth-first iterative-deepening: an optimal admissible tree search
Artificial Intelligence
Principles of artificial intelligence
Principles of artificial intelligence
Search: A survey of recent results
Exploring artificial intelligence
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
Specification and Analysis of Real-Time Problem Solvers
IEEE Transactions on Software Engineering
Decision-Theoretic Control of Reasoning: General Theory and an
Decision-Theoretic Control of Reasoning: General Theory and an
Minimizing response times in real time planning and search
IJCAI'89 Proceedings of the 11th international joint conference on Artificial intelligence - Volume 1
Reflection and action under scarce resources: theoretical principles and empirical study
IJCAI'89 Proceedings of the 11th international joint conference on Artificial intelligence - Volume 2
A Dynamic Scheduling Benchmark: Design, Implementation and Performance Evaluation
ICTAI '99 Proceedings of the 11th IEEE International Conference on Tools with Artificial Intelligence
| Hi-index | 0.00 |
A real-time AI problem solver performs a task or a set of tasks in two phases: planning and execution. Under real-time constraints, a real-time AI problem solver must balance the planning and the execution phases of its operation to comply With deadlines. This paper provides a methodology for specification and analysis of real-time AI problems and problem solvers. This methodology is demonstrated via domain analysis of the real-time path planning problem and via algorithm analysis of DYNORAII and RTA* [1]. We provide new results on worst-case complexity of the problem. We also provide experimental evaluation of DYNORAII and RTA* for deadline compliance.