Incremental Heuristic Search in AI

@article{Koenig2004IncrementalHS,
  title={Incremental Heuristic Search in AI},
  author={Sven Koenig and Maxim Likhachev and Yaxin Liu and David Furcy},
  journal={AI Magazine},
  year={2004},
  volume={25},
  pages={99-112}
}
Overview It is often important that searches be fast. AI has developed several ways of speeding up searches by trading off the search time and the cost of the resulting path, which includes using inadmissible heuristics (Pohl 1973, 1970) and search with limited look ahead (Korf 1990; Ishida and Korf 1991; Koenig 2001), which is also called real-time or agent-centered search. In this article, we discuss a different way of speeding up searches, namely, incremental search. Incremental search is a… CONTINUE READING
Highly Cited
This paper has 46 citations. REVIEW CITATIONS
31 Citations
83 References
Similar Papers

Citations

Publications citing this paper.
Showing 1-10 of 31 extracted citations

References

Publications referenced by this paper.
Showing 1-10 of 83 references

Speeding Up the PARTIGAME Algorithm

  • M. Likhachev, S. Koenig
  • Advances in Neural Information Processing Systems…
  • 2003
Highly Influential
11 Excerpts

D* Lite

  • S. Koenig, M. Likhachev
  • Proceedings of the Eighteenth National Conference…
  • 2002
Highly Influential
5 Excerpts

Similar Papers

Loading similar papers…