Speeding up the Parti-Game Algorithm

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.

Authors

• Maxim Likhachev Carnegie Mellon University
• Sven Koenig University of California, Irvine

Keywords

No keywords are indexed for this paper.