27 Jan 2005
CS 3243 - Heuristics
44
Exploration problems
nExploration problems: agent physically in some part of the state space.
ne.g. solving a maze using an agent with local wall sensors
nSensible to expand states easily accessible to agent (i.e. local states)
nLocal search algorithms apply (e.g.,
hill-climbing)