ML Anthology

Speeding up the Parti-Game Algorithm

Maxim Likhachev, Sven Koenig
NeurIPS 2002 pp. 1595-1602
/neurips/2002/likhachev2002neurips-speeding/

Abstract

In this paper, we introduce an efficient replanning algorithm for nonde- terministic domains, namely what we believe to be the first incremental heuristic minimax search algorithm. We apply it to the dynamic dis- cretization of continuous domains, resulting in an efficient implemen- tation of the parti-game reinforcement-learning algorithm for control in high-dimensional domains.

PDF NeurIPS Semantic Scholar

Cite

Text

Likhachev and Koenig. "Speeding up the Parti-Game Algorithm." Neural Information Processing Systems, 2002.

Markdown

[Likhachev and Koenig. "Speeding up the Parti-Game Algorithm." Neural Information Processing Systems, 2002.](https://mlanthology.org/neurips/2002/likhachev2002neurips-speeding/)

BibTeX

@inproceedings{likhachev2002neurips-speeding,
  title     = {{Speeding up the Parti-Game Algorithm}},
  author    = {Likhachev, Maxim and Koenig, Sven},
  booktitle = {Neural Information Processing Systems},
  year      = {2002},
  pages     = {1595-1602},
  url       = {https://mlanthology.org/neurips/2002/likhachev2002neurips-speeding/}
}