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 Frameworks

(Related publication: [PUBLink])

As discussed in the previous section, local search techniques for search and optimization are needed. There are lots of specific approaches for search, like neural networks or evolutionary algorithms. This section discusses frameworks for search, i.e., methods for specifying and formalizing search problems in a general manner. Specific solution methods can then be applied to solve these problems.

The advantage of using a general framework instead of specific approaches is the availability of ready-to-use off-the-shelf solution methods. In addition, future changes/extensions in the problem specification must be considered only at the modeling level and not in the underlying search algorithms. The main research areas that provide frameworks to formulate search problems are operations research, propositional satisfiability and constraint programming.


[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