Lesson 23 - Module 9 Planning Version 1 CSE IIT, Kharagpur...

Info iconThis preview shows pages 1–4. Sign up to view the full content.

View Full Document Right Arrow Icon
Module 9 Planning Version 1 CSE IIT, Kharagpur
Background image of page 1

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

View Full DocumentRight Arrow Icon
Lesson 23 Planning systems Version 1 CSE IIT, Kharagpur
Background image of page 2
9.3 Planning Systems Classical Planners use the STRIPS (Stanford Research Institute Problem Solver) language to describe states and operators. It is an efficient way to represent planning algorithms. 9.3.1 Representation of States and Goals States are represented by conjunctions of function-free ground literals, that is, predicates applied to constant symbols, possibly negated. An example of an initial state is: At(Home) /\ - Have(Milk) /\ - Have(Bananas) /\ - Have(Drill) /\ . .. A state description does not have to be complete. We just want to obtain a successful plan to a set of possible complete states. But if it does not mention a given positive literal, then the literal can be assumed to be false. Goals are a conjunction of literals. Therefore the goal is At(Home) /\ Have(Milk) /\ Have(Bananas) /\ Have(Drill) Goals can also contain variables. Being at a store that sells milk is equivalent to
Background image of page 3

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

View Full DocumentRight Arrow Icon
Image of page 4
This is the end of the preview. Sign up to access the rest of the document.

This note was uploaded on 09/20/2010 for the course MCA DEPART 501 taught by Professor Hemant during the Fall '10 term at Institute of Computer Technology College.

Page1 / 5

Lesson 23 - Module 9 Planning Version 1 CSE IIT, Kharagpur...

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

View Full Document Right Arrow Icon
Ask a homework question - tutors are online