S. Koenig. Real-Time Heuristic Search: Research Issues. In AIPS-98 Workshop on Planning as Combinatorial Search: Propositional, Graph-Based, and Disjunctive Planning Methods, pages 75-79, 1998.

Abstract: Real-time (heuristic) search methods allow for fine-grained control over how much planning to do between plan executions. Many real-time search methods can use heuristic knowledge to guide planning, be interrupted at any state and resume execution at a different state, and improve their plan-execution time as they solve similar planning tasks, until their plan-execution time is optimal. Unfortunately, the behavior of real-time search methods is not yet well understood. In this paper, we show that the behavior of real-time search methods often differs from the behavior of more traditional and well-studied search methods and argue that it is important to investigate how properties of the heuristic functions, the domains, and the real-time search methods themselves influence their performance.

Download the paper in pdf.

Download the paper in gzipped postscript (large download time).

Many publishers do not want authors to make their papers available electronically after the papers have been published. Please use the electronic versions provided here only if hardcopies are not yet available. If you have comments on any of these papers, please send me an email! Also, please send me your papers if we have common interests.

This page was automatically created by a bibliography maintenance system that was developed as part of an undergraduate research project, advised by Sven Koenig.