Solving problems by searching

14 Jan 2004

CS 3243 - Blind Search

Problem types

nDeterministic, fully observable à single-state problem

nAgent knows exactly which state it will be in; solution is a sequence

nNon-observable à sensorless problem (conformant problem)

nAgent may have no idea where it is; solution is a sequence

nNondeterministic and/or partially observable à contingency problem

npercepts provide new information about current state

noften interleave} search, execution

nUnknown state space à exploration problem