Incremental Heuristic Search in AI

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


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.
How to Cite
Koenig, S., Likhachev, M., Liu, Y., & Furcy, D. (2004). Incremental Heuristic Search in AI. AI Magazine, 25(2), 99.