Incremental A*
Conference Paper, Proceedings of (NeurIPS) Neural Information Processing Systems, pp. 1539 - 1546, December, 2001
Abstract
Incremental search techniques find optimal solutions to series of similar search tasks much faster than is possible by solving each search task from scratch. While researchers have developed incremental versions of uninformed search methods, we develop an incremental version of A*. The first search of Lifelong Planning A* is the same as that of A* but all subsequent searches are much faster because it reuses those parts of the previous search tree that are identical to the new search tree. We then present experimental results that demonstrate the advantages of Lifelong Planning A* for simple route planning tasks.
BibTeX
@conference{Koenig-2001-109744,author = {Sven Koenig and Maxim Likhachev},
title = {Incremental A*},
booktitle = {Proceedings of (NeurIPS) Neural Information Processing Systems},
year = {2001},
month = {December},
pages = {1539 - 1546},
}
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.