L9. Planning Agents L7_exAnswer and explanation Review

Slides:



Advertisements
Similar presentations
REVIEW : Planning To make your thinking more concrete, use a real problem to ground your discussion. –Develop a plan for a person who is getting out of.
Advertisements

Language for planning problems
CSE391 – 2005 NLP 1 Planning The Planning problem Planning with State-space search.
Artificial Intelligence Chapter 21 The Situation Calculus Biointelligence Lab School of Computer Sci. & Eng. Seoul National University.
Planning Russell and Norvig: Chapter 11 Slides adapted from: robotics.stanford.edu/~latombe/cs121/2003/ home.htm.
Artificial Intelligence II S. Russell and P. Norvig Artificial Intelligence: A Modern Approach Chapter 11: Planning.
Planning Some material adapted from slides by Tim Finin,Jean-Claude Latombe, Lise Getoor, and Marie desJardins.
Notes 10: Planning; STRIPs Planning Systems ICS 271 Fall 2008.
Planning Search vs. planning STRIPS operators Partial-order planning.
ARTIFICIAL INTELLIGENCE [INTELLIGENT AGENTS PARADIGM] Professor Janis Grundspenkis Riga Technical University Faculty of Computer Science and Information.
Artificial Intelligence 2005/06
CS 460, Session 20 1 Planning Search vs. planning STRIPS operators Partial-order planning.
Artificial Intelligence Chapter 11: Planning
Planning Russell and Norvig: Chapter 11. Planning Agent environment agent ? sensors actuators A1A2A3.
1 DCP 1172 Introduction to Artificial Intelligence Chang-Sheng Chen Topics Covered: Introduction to Planning (generalized state-space search) Means-Ends.
CS 561, Session Planning Search vs. planning STRIPS operators Partial-order planning.
Artificial Intelligence 2005/06 Planning: STRIPS.
Intro to AI Fall 2002 © L. Joskowicz 1 Introduction to Artificial Intelligence LECTURE 12: Planning Motivation Search, theorem proving, and planning Situation.
AI Principles, Lecture on Planning Planning Jeremy Wyatt.
PLANNING Partial order regression planning Temporal representation 1 Deductive planning in Logic Temporal representation 2.
Planning Department of Computer Science & Engineering Indian Institute of Technology Kharagpur.
PLANNING Partial order regression planning Temporal representation 1 Deductive planning in Logic Temporal representation 2.
1 07. The planning problem 2  Inputs: 1. A description of the world state 2. The goal state description 3. A set of actions  Output: A sequence of actions.
April 3, 2006AI: Chapter 11: Planning1 Artificial Intelligence Chapter 11: Planning Michael Scherger Department of Computer Science Kent State University.
CS.462 Artificial Intelligence SOMCHAI THANGSATHITYANGKUL Lecture 07 : Planning.
Planning, page 1 CSI 4106, Winter 2005 Planning Points Elements of a planning problem Planning as resolution Conditional plans Actions as preconditions.
Automated Planning and Decision Making Prof. Ronen Brafman Automated Planning and Decision Making Introduction.
Introduction to Planning Han Yu University of Central Florida.
For Monday Read chapter 12, sections 1-2 Homework: –Chapter 10, exercise 3.
Artificial Intelligence Chapter 22 Planning Biointelligence Lab School of Computer Sci. & Eng. Seoul National University.
CPS 270: Artificial Intelligence Planning Instructor: Vincent Conitzer.
1 Search vs. planning Situation calculus STRIPS operators Search vs. planning Situation calculus STRIPS operators.
1 Unification ( 統一 ) Forward Chaining ( 前向き仮説推理 ) Backward Chaining ( 後ろ向き仮説推理 ) Unification ( 統一 ) Forward Chaining ( 前向き仮説推理 ) Backward Chaining ( 後ろ向き仮説推理.
For Friday Finish chapter 10 No homework. Program 2 Any questions?
For Friday No reading Homework: –Chapter 11, exercise 4.
CPS 570: Artificial Intelligence Planning Instructor: Vincent Conitzer.
Planning (Chapter 10)
Lecture 3-1CS251: Intro to AI/Lisp II Planning to Learn, Learning to Plan.
1 Chapter 16 Planning Methods. 2 Chapter 16 Contents (1) l STRIPS l STRIPS Implementation l Partial Order Planning l The Principle of Least Commitment.
Introduction to Planning Dr. Shazzad Hosain Department of EECS North South Universtiy
1 Unification ( 統一 ) Forward Chaining ( 前向き推論 ) Backward Chaining ( 後ろ向き推論 ) Unification ( 統一 ) Forward Chaining ( 前向き推論 ) Backward Chaining ( 後ろ向き推論 )
AI Lecture 17 Planning Noémie Elhadad (substituting for Prof. McKeown)
1/16 Planning Chapter 11- Part1 Author: Vali Derhami.
Intro to Planning Or, how to represent the planning problem in logic.
Notes 9: Planning; Strips Planning Systems ICS 270a Spring 2003.
Planning I: Total Order Planners Sections
April 3, 2006AI: Chapter 11: Planning1 Artificial Intelligence Chapter 11: Planning.
Planning in FOL Systems sequences of actions to achieve goals.
The situation calculus K. V. S. Prasad Notes for TIN171/DIT410 (Friday, 26 March 2010) Based on Nils Nilsson, “Artificial Intelligence: a new synthesis”,
Artificial Intelligence 2004 Planning: Situation Calculus Review STRIPS POP Hierarchical Planning Situation Calculus (John McCarthy) situations.
Consider the task get milk, bananas, and a cordless drill.
Planning (Chapter 10) Slides by Svetlana Lazebnik, 9/2016 with modifications by Mark Hasegawa-Johnson, 9/2017
For Wednesday Read Chapter 18, sections 1-3 Homework:
Planning (Chapter 10)
10. A rule based system Forward Chaining based rule base system.
Introduction Contents Sungwook Yoon, Postdoctoral Research Associate
Planning Search vs. planning STRIPS operators Partial-order planning
Planning (Chapter 10)
Consider the task get milk, bananas, and a cordless drill
Planning Search vs. planning STRIPS operators Partial-order planning
Planning Search vs. planning STRIPS operators Partial-order planning
AI Planning.
L11. Planning Agents and STRIPS
Course Outline Advanced Introduction Expert Systems Topics Problem
Unification Unification (Unify.java) Doing exercises.
Notes 8: Predicate logic and inference
Artificial Intelligence Chapter 21. The Situation Calculus
Russell and Norvig: Chapter 11 CS121 – Winter 2003
L9. STRIPS Examples Recursive STRIPS Block world
Prof. Pushpak Bhattacharyya, IIT Bombay
Presentation transcript:

L9. Planning Agents L7_exAnswer and explanation Review Search vs. planning Situation calculus STRIPS operators

L7_ex 解答例

Forward chaining example Let us add facts r1, r2, r3, f1, f2, f3 in turn into KB. r1. Buffalo(x)  Pig(y)  Faster(x,y) r2. Pig(y)  Slug(z)  Faster(y,z) r3. Faster(x,y) Faster(y,z)  Faster(x,z) f1. Buffalo(Bob) [r1-c1, Bob/x, yes] f2. Pig(Pat) [r1-c2, Pat/y, yes]  f4. Faster(Bob, Pat) f3. Slug(Steve) [r2-c2, Steve/z, yes] [r2, f2, f3, Pat/y, Steve/z, yes]  f5. Faster(Pat, Steve) [r3, f4, f5, Bob/x, Pat/y, Steve/z, yes]  f6. Faster(Bob, Steve)  x, y, z

Backward chaining example Bob is a buffalo | 1. Buffalo(Bob) --f1 Pat is a pig | 2. Pig(Pat) --f2 Buffaloes run faster than pigs | 3.  x, y Buffalo(x)  Pig(y)  Faster(x,y) --r1 Goal: to prove Faster(Bob, Pat) Faster(x, y) r1 Buffalo(x)  Pig(y) R(2) – And Elimination Buffalo(x) Pig(y) R(8) – Universal Elimination R(8) – Universal Elimination {x/Bob} {y/Pat} Buffalo(Bob) Pig(Pat) {} {}

Search in problem solving Problem solution: A path through the state space tree State space search: Search is a traversal of the tree until the goals is reached. State transitions is performed by operators   a b c

Search in problem solving Difficulty using standard search algorithms Standard search algorithms seems to fail miserably since the goal test is inadequate. What is “finish”?

Search in problem solving Planning problem in situation calculus Consider the same task get milk, bananas, and a cordless drill A planning problem is represented in situation calculus by logical sentences that describe the three main parts of a problem. Initial state: At(home, S0)  Have(Milk, S0)  Have(Banana, S0)  Have(Drill, S0) Goal state:  s At(home, s)  Have(Milk, s)  Have(Bananas, s)  Have(Drill, s) Operators: a, s Have(Milk, Result (a,s)) [ (a=Buy(Milk)) At(Supermarket, s)  (Have(Milk, s) a Drop(Milk) )] Plan: p = [Go(Supermarket), Buy(Milk), Buy(Bananas), Go(HWS), …]

Search in problem solving Problem solving vs. planning Representation of states PS: Direct assignment of a symbol to each state PL: Logic sentences Representation of goals PS: A goal state symbol PL: Sentences that describe objective Representation of actions PS: Operators that transform one state symbol into another PL: Addition/deletion of logic sentences describing world state Representation of plans PS: Path through state space PL: Ordered or partially-orderer sequence of actions.

Search in problem solving Advantages of Planning Systems Uniform language for describing states, goals, actions, and their effects. Ability to add actions to a plan whenever they are needed, not just in an incremental sequence from some initial state. Ability to capture the fact that most parts of the world are independent of most other parts. It performs better for complex worlds over standard search algorithm since searching space becomes huge when there are many initial states and operators in standard search algorithms.

The Situation Calculus Wff - well formed formula A goal can be described by a wff:  x On(x, B) if we want to have a block on B Planning: finding a set of actions to achieve a goal wff. Situation Calculus (McCarthy, Hayes, 1969, Green 1969) A Predicate Calculus formalization of states, actions, and their effects. So state in figure can be described by: On(B, A)  On(A, C)  On(A, Fl)  Clear(B) we reify the state and include them as arguments The atoms denotes relations over states. On(B, A, S0)  On(A, C, S0)  On(C, Fl, S0)  Clear(B, S0) We can also have. x, y, s On(x, y, s)  (y = Fl)   Clear(y, s) s Clear(Fl, s)

Representing actions Reify the actions: denote an action by a symbol actions are functions move(B,A,Fl): move block B from block A to Fl move (x,y,z) - action schema do: A function constant, do denotes a function that maps actions and states into states Express the effects of actions. Example: (on, move) (expresses the effect of move on On) positive effect axiom: action state

Effect axioms for (clear, move) move(x, y, z) matching? precondition are satisfied with B/x, A/y, S0/s, F1/z what was true in S0 remains true figure 21

Frame axioms Not everything true can be inferred Such as, On(C,Fl) remains true but cannot be inferred Actions have local effect We need frame axioms for each action and each fluent that does not change as a result of the action example: frame axioms for (move, on) If a block is on another block and move is not relevant, it will stay the same. Positive Negative Frame axioms for (move, clear) A fluent is something that flows and changes across situations

STRIPS: describing goals and state STRIPS: STanford Research Institute Planning System Basic approach in GPS (general Problem Solver): Find a “difference” (Something in G that is not provable in S0) Find a relevant operator f for reducing the difference Achieve precondition of f; apply f; from resultant state, achieve G.

STRIPS planning STRIPS uses logical formulas to represent the states S0, G, P, etc: Description of operator f:

A STRIPS planning example On(B,A) On(A,C) On(C,F1) Clear(B) Clear(Fl) The formula describes a set of world states Planning search for a formula satisfying a goal description On(A, C) On(C, Fl) On(B, Fl) Clear(A)

STRIPS Description of Operators A STRIPS operator has 3 parts: A set, PC - preconditions A set D - the delete list A set A - the add list Usually described by Schema: Move(x,y,z) PC: On(x,y) and On(Clear(x) and Clear(z) D: Clear(z) , On(x,y) A: On(x,z), Clear(y), Clear(F1) A state S1 is created applying operator O by adding A and deleting D from S1.

Example: The move operator

Example1: The move operator G S0  f(P)->G S0->P    x/B, y/A, z/Fl x/B, y/A, z/Fl   On(x,y) Clear(x) Clear(z) f: move(x,y, z) add: On(x,z), Clear(y) del: On(x,y), Clear(z) On(x,z) Clear(x) Clear(y) P: f(P):

Example1: The move operator ABC + Clear(F2) G S0  f(P)->G S0->P    x/B, y/A, z/Fl x/B, y/A, z/Fl   On(x,y) Clear(x) Clear(z) f: move(x,y, z) add: On(x,z), Clear(y) del: On(x,y), Clear(z) On(x,z) Clear(x) Clear(y) P: f(P):

STRIPS algorithms are to search for operators!!! We will leave the discussion of STRIPS algorithms to next week.

? Quiz: What differences are between standard search algorithms for problem solving and planning systems?