Extending the Applications of Recent Real-Time Heuristic Search

Abstract

Real-time heuristic search algorithms that precompute search space-specific databases have demonstrated exceptional performance in video-game pathfinding. We discuss the first steps towards extending these algorithms to other search spaces that also benefit from the real-time property. We present our initial progress in characterizing the performance of current algorithms based on the features of a search space, and discuss future directions of this research.

Cite

Text

Huntley and Bulitko. "Extending the Applications of Recent Real-Time Heuristic Search." AAAI Conference on Artificial Intelligence, 2011. doi:10.1609/AAAI.V25I1.8060

Markdown

[Huntley and Bulitko. "Extending the Applications of Recent Real-Time Heuristic Search." AAAI Conference on Artificial Intelligence, 2011.](https://mlanthology.org/aaai/2011/huntley2011aaai-extending/) doi:10.1609/AAAI.V25I1.8060

BibTeX

@inproceedings{huntley2011aaai-extending,
  title     = {{Extending the Applications of Recent Real-Time Heuristic Search}},
  author    = {Huntley, Daniel Andrew and Bulitko, Vadim},
  booktitle = {AAAI Conference on Artificial Intelligence},
  year      = {2011},
  pages     = {1792-1793},
  doi       = {10.1609/AAAI.V25I1.8060},
  url       = {https://mlanthology.org/aaai/2011/huntley2011aaai-extending/}
}