X hits on this document

Powerpoint document

Lecture 2: Problem Solving using State Space Representations - page 20 / 49

116 views

0 shares

0 downloads

0 comments

20 / 49

Slide Set 2: State-Space Search 20

ICS 271, Fall 2007: Professor Padhraic Smyth

State-Space Problem Formulation

A problem is defined by four items:

initial state e.g., "at Arad“

actions or successor function

     S(x) = set of action–state pairs  e.g., S(Arad) = {<Arad Zerind, Zerind>, … }

3.  goal test (or set of goal states)

      e.g., x = "at Bucharest”, Checkmate(x)

4. path cost (additive)

e.g., sum of distances, number of actions executed, etc.

c(x,a,y) is the step cost, assumed to be ≥ 0

A solution is a sequence of actions leading from the initial state to a goal state

Document info
Document views116
Page views116
Page last viewedWed Dec 07 09:12:35 UTC 2016
Pages49
Paragraphs815
Words3134

Comments