EXCALIBUR
Adaptive Constraint-Based Agents in Artificial Environments

[INTRODUCTION]   [AI for Games]   [Agents]   [Planning]   [Search Paradigms]   [Search Frameworks]   [Conclusion]

[ Please note: The project has been discontinued as of May 31, 2005 and is superseded by the projects of the ii Labs. There won't be further updates to these pages. ]

Search Paradigms

(Related publication: [PUBLink])

In addition to the plan representation, a technique for building plans is needed. The task of plan construction can be formulated as a search problem, where we search in a space containing all possible plans for a consistent plan that satisfies our goal conditions. There are two main paradigms for search: refinement search and local search. The figure below contrasts these paradigms.

Subsections:


[INTRODUCTION]   [AI for Games]   [Agents]   [Planning]   [Search Paradigms]   [Search Frameworks]   [Conclusion]

For questions, comments or suggestions, please contact us.

Last update:
May 19, 2001 by Alexander Nareyek