ai-prolog6

# ai-prolog6 - Artificial Intelligence: Planning Problems...

This preview shows pages 1–7. Sign up to view the full content.

1 Artificial Intelligence: Planning Problems with state space search Planning Operators A Simple Planning Algorithm (Game Playing)

This preview has intentionally blurred sections. Sign up to view the full version.

View Full Document
2 AI Planning Planning concerns problem of finding sequence of actions to achieve some goal. Action sequence will be system’s plan. State-space search techniques, discussed in lecture 6, may be viewed as simplest form of planning. Based on rules that specify, for possible actions, how the problem state changes. But need to consider further how to represent these state-change rules.
3 Reminder of Robot Planning expressed as search. . Me Rob Beer Me Rob Beer Robot opens door Me Rob Beer Robot picks up Me Me Rob Beer Robot moves to next room Etc etc

This preview has intentionally blurred sections. Sign up to view the full version.

View Full Document
4 Problem State How do we capture how the different possible actions change the state of world (problem state)? For “Jugs” problem, problem state was just a pair of numbers, so could specify explicitly how it changed. For more complex problems, representing the problem state requires specifying all the (relevant) things that are “true”. Can be done using statements in predicate logic: in(john, room1) open_door(room1, room2) Note how we give objects in world unique labels (e.g., room1).
5 Problem State So, for simple robot planning problem we might have an initial state described by: in(robot, room1) door_closed(room1, room2) in(john, room) in(beer, room2) And target state must include: in(beer, room1) (But many different ways of formulating same problem.)

This preview has intentionally blurred sections. Sign up to view the full version.

View Full Document
6 Representing Actions We now specify what the possible actions are (with capitals to indicate variables) move(R1, R2) carry(R1, R2, Object) open(R1, R2) (open door between R1 and R2)
This is the end of the preview. Sign up to access the rest of the document.

## This note was uploaded on 01/20/2011 for the course CS 6810 taught by Professor Hecker during the Spring '10 term at CSU East Bay.

### Page1 / 20

ai-prolog6 - Artificial Intelligence: Planning Problems...

This preview shows document pages 1 - 7. Sign up to view the full document.

View Full Document
Ask a homework question - tutors are online