Paper Info
Title
Can real-time search algorithms meet deadlines?
Abstract
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.
Year
Venue
Keywords
1992
AAAI
real-time constraint,deadline compliance,algorithm analysis,real-time search algorithm,experimental evaluation,real-time ai problem solver,domain analysis,real-time path planning problem,real-time ai problem,execution phase,problem solvers,search algorithm,real time
Field
DocType
ISBN
Domain analysis,Motion planning,Computer science,Algorithm,Solver,Real-time Search
Conference
0-262-51063-4
Citations 
PageRank 
References 
7
0.83
7
Authors
2
Name
Order
Citations
PageRank
Hamidzadeh Babak118424.99
Shashi Shekhar243521098.43