DMCA
A new principle for incremental heuristic search: Theoretical results [poster abstract
Cached
Download Links
| Venue: | In Proceedings of the International Conference on Automated Planning and Scheduling |
| Citations: | 7 - 5 self |
BibTeX
@INPROCEEDINGS{Koenig_anew,
author = {Sven Koenig and Maxim Likhachev},
title = {A new principle for incremental heuristic search: Theoretical results [poster abstract},
booktitle = {In Proceedings of the International Conference on Automated Planning and Scheduling},
year = {},
pages = {402--405}
}
Share
 |
 |
 |
 |
||
OpenURL
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 individ-ual searches in isolation, by updating the heuristics over time to make them more informed and thus fu-ture 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.
