ML Anthology

Can Real-Time Search Algorithms Meet Deadlines?

Babak Hamidzadeh, Shashi Shekhar
AAAI 1992 pp. 486-491
/aaai/1992/hamidzadeh1992aaai-real/

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.

PDF AAAI Semantic Scholar

Cite

Text

Hamidzadeh and Shekhar. "Can Real-Time Search Algorithms Meet Deadlines?." AAAI Conference on Artificial Intelligence, 1992.

Markdown

[Hamidzadeh and Shekhar. "Can Real-Time Search Algorithms Meet Deadlines?." AAAI Conference on Artificial Intelligence, 1992.](https://mlanthology.org/aaai/1992/hamidzadeh1992aaai-real/)

BibTeX

@inproceedings{hamidzadeh1992aaai-real,
  title     = {{Can Real-Time Search Algorithms Meet Deadlines?}},
  author    = {Hamidzadeh, Babak and Shekhar, Shashi},
  booktitle = {AAAI Conference on Artificial Intelligence},
  year      = {1992},
  pages     = {486-491},
  url       = {https://mlanthology.org/aaai/1992/hamidzadeh1992aaai-real/}
}