Research work · 2004

Incremental heuristic search in AI

KoenigSven, LikhachevMaxim, LiuYaxin, FurcyDavid

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 since many artificial intelligence systems have to adapt their plans continuously to changes in (their knowledge of) the world. In this article, we therefore give an overview of incremental search, focusing on Lifelong Planning A*, and outline some of its possible applications in artificial intelligence. Overview It is often important that searches be fast. Artificial intelligence has developed several ways of speeding up searches by trading off the search time and the cost of the resulting path. This includes using inadmissible heuristics (Pohl

DOI: 10.5555/1017133.1017140