Adaptive Constraint-Based Agents in Artificial Environments


[ 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. ]


A common differentiation is made between a search in a state space and a search in a plan space. A search in a state space is based on a graph with world-state nodes that are connected by directed action arcs. The search tries to find a connection between a start node and a goal node. The resulting plan is the sequence of actions along the connection found. Within the usual framework of search techniques it is more common to use a strategy in which the search space's states are potential solutions (or plans) themselves. This is the approach of plan space search. Since a state space search can easily be expressed as plan space search, only plan spaces are considered here.


For questions, comments or suggestions, please contact us.

Last update:
May 19, 2001 by Alexander Nareyek