Incremental Heuristic Search in AI

Authors

  • Sven Koenig
  • Maxim Likhachev
  • Yaxin Liu
  • David Furcy

DOI:

https://doi.org/10.1609/aimag.v25i2.1763

Abstract

Incremental search reuses information from previous searches to find solutions to a series of similar search problems potentially faster than is possible by solving each search problem from scratch. This is important because many AI systems have to adapt their plans continuously to changes in (their knowledge of) the world. In this article, we give an overview of incremental search, focusing on LIFELONG PLANNING A*, and outline some of its possible applications in AI.

Downloads

Published

2004-06-15

How to Cite

Koenig, S., Likhachev, M., Liu, Y., & Furcy, D. (2004). Incremental Heuristic Search in AI. AI Magazine, 25(2), 99. https://doi.org/10.1609/aimag.v25i2.1763

Issue

Section

Articles