# Lesson 24 - Module 9 Planning Version 1 CSE IIT Kharagpur...

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

Module 9 Planning Version 1 CSE IIT, Kharagpur

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

View Full Document
Lesson 24 Planning algorithm - I Version 1 CSE IIT, Kharagpur
9.4 Planning as Search Planning as Search: There are two main approaches to solving planning problems, depending on the kind of search space that is explored: 1. Situation-space search 2. Planning-space search 9.4.1 Situation-Space Search In situation space search the search space is the space of all possible states or situations of the world initial state defines one node a goal node is a state where all goals in the goal state are satisfied a solution plan is the sequence of actions (e.g. operator instances) in the path from the start node to a goal node 9.4.2 Plan-Space Search the search space is the space of all possible plans a node corresponds to a partial plan initially we will specify an "initial plan" which is one node in this space a goal node is a node containing a plan which is complete, satisfying all of the goals in the goal state the node itself contains all of the information for determining a solution plan (e.g. sequence of actions) Version 1 CSE IIT, Kharagpur

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

View Full Document
9.4.3 Situation-Space Planning Algorithms There are 2 approaches to situation-space planning: 1. Progression situation-space planning 2. Regression situation-space planning Progression Planning: Forward-chaining from initial state to goal state Looks just like a state-space search except STRIPS operators are specified instead of a set of next-move functions You can use any search method you like (i.e. BFS, DFS, A*)
This is the end of the preview. Sign up to access the rest of the document.

{[ snackBarMessage ]}

### Page1 / 7

Lesson 24 - Module 9 Planning Version 1 CSE IIT Kharagpur...

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

View Full Document
Ask a homework question - tutors are online