A New Principle for Incremental Heuristic Search: Theoretical Results
Conference Paper, Proceedings of 15th International Conference on Automated Planning and Scheduling (ICAPS '05), pp. 402 - 405, June, 2005
Abstract
Planning is often not a one-shot task because either the world or the agent’s knowledge of the world changes. In this paper, we introduce a new principle that can be used to solve a series of similar search tasks faster with heuristic search methods than running individual searches in isolation, by updating the heuristics over time to make them more informed and thus future searches more focused. This principle is simple and easy to integrate into heuristic search methods, and it is easy to prove the correctness of the resulting heuristic search methods.
BibTeX
@conference{Koenig-2005-109752,author = {Sven Koenig and Maxim Likhachev},
title = {A New Principle for Incremental Heuristic Search: Theoretical Results},
booktitle = {Proceedings of 15th International Conference on Automated Planning and Scheduling (ICAPS '05)},
year = {2005},
month = {June},
pages = {402 - 405},
}
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.