Speeding up the Parti-Game Algorithm - Robotics Institute Carnegie Mellon University

Speeding up the Parti-Game Algorithm

Maxim Likhachev and Sven Koenig
Conference Paper, Proceedings of (NeurIPS) Neural Information Processing Systems, pp. 1595 - 1602, December, 2002

Abstract

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

BibTeX

@conference{Likhachev-2002-109739,
author = {Maxim Likhachev and Sven Koenig},
title = {Speeding up the Parti-Game Algorithm},
booktitle = {Proceedings of (NeurIPS) Neural Information Processing Systems},
year = {2002},
month = {December},
pages = {1595 - 1602},
}
Copyright notice: This material is presented to ensure timely dissemination of scholarly and technical work. Copyright and all rights therein are retained by authors or by other copyright holders. All persons copying this information are expected to adhere to the terms and constraints invoked by each author's copyright. These works may not be reposted without the explicit permission of the copyright holder.