Extending Basic Search Techniques

Abstract

Parts I and II of this book reviewed the several foundational techniques for path search and for designing discrete representations for efficient path planning. While the foundational techniques are always present, there are a number of additional challenges to be addressed when design– ing planning solutions for interactive virtual worlds. The remaining chapters of this book review several techniques that can be used for addressing these additional challenges. Of particular im– portance are planning techniques that are able to generate solutions with strict time constraints in large and complex problem domains. While the presentation is focused on describing the work of the authors on these areas, broad discussions on the state of the art are also included.