Sussman anomaly - analysis The start state is given by: ON(C, A) ONTABLE(A) ONTABLE(B) ARMEMPTY The goal by: ON(A,B) ON(B,C) This immediately leads to.

Slides:



Advertisements
Similar presentations
Artificial Intelligence 2005/06 Partial Order Planning.
Advertisements

Chapter 5 Plan-Space Planning.
Planning  We have done a sort of planning already  Consider the “search” applied to general problem solving  The sequence of moves with the “Jugs” was.
Planning Module THREE: Planning, Production Systems,Expert Systems, Uncertainty Dr M M Awais.
Planning Graphs * Based on slides by Alan Fern, Berthe Choueiry and Sungwook Yoon.
TWEAK solving the Sussman anomaly ON(A,B) ON(B,C) ON(C,A) ONTABLE(A) ONTABLE(B) CLEAR(C) CLEAR(B) ARMEMPTY STACK(A,B) STACK(B,C) Two step additions to.
Chapter 4 - Planning 4.1 State Space Planning 4.2 Partial Order Planning 4.3Planning in the Real World Part II: Methods of AI.
Planning Chapter 10.
Artificial Intelligence University Politehnica of Bucharest Adina Magda Florea
Planning Planning is fundamental to “intelligent” behaviour. E.g.
All rights reserved ©L. Manevitz Lecture 61 Artificial Intelligence Planning System L. Manevitz.
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.
1 Chapter 4 State-Space Planning. 2 Motivation Nearly all planning procedures are search procedures Different planning procedures have different search.
Planning Some material adapted from slides by Tim Finin,Jean-Claude Latombe, Lise Getoor, and Marie desJardins.
1 Classical STRIPS Planning Alan Fern * * Based in part on slides by Daniel Weld.
EXAMPLE OF PARTIAL ORDER PLANNING. Action Recipes: Action: Stack(x,y) Prec: Clear(x) ^ Clear(y) ^ OnTable(x) Effect: ~Clear(y) ^ ~OnTable(x) ^ On(x,y)
CPSC 322 Introduction to Artificial Intelligence November 19, 2004.
Planning Russell and Norvig: Chapter 11. Planning Agent environment agent ? sensors actuators A1A2A3.
OnT-A onT-B onT-C cl-A cl-C cl-B he Pick-A Pick-B Pick-C onT-A onT-B onT-C cl-A cl-C cl-B he h-A h-B h-C ~cl-A ~cl-B ~cl-C ~he st-A-B st-A-C st-B-A st-B-C.
CPSC 322 Introduction to Artificial Intelligence November 26, 2004.
1 Planning Adapted from Tim Finin, UMBC, Marie desJardins Some material adopted from notes by Andreas Geyer-Schulz and Chuck Dyer.
1 Lecture 12 example (from slides prepared by Prof. J. Rosenchein)
Intro to AI Fall 2002 © L. Joskowicz 1 Introduction to Artificial Intelligence LECTURE 12: Planning Motivation Search, theorem proving, and planning Situation.
1 Pertemuan 17 Planning Matakuliah: T0264/Intelijensia Semu Tahun: Juli 2006 Versi: 2/1.
Dynamic Bayesian Networks CSE 473. © Daniel S. Weld Topics Agency Problem Spaces Search Knowledge Representation Reinforcement Learning InferencePlanningLearning.
Planning Where states are transparent and actions have preconditions and effects Notes at
AI Principles, Lecture on Planning Planning Jeremy Wyatt.
PLANNING Partial order regression planning Temporal representation 1 Deductive planning in Logic Temporal representation 2.
An Introduction to Artificial Intelligence CE Chapter 11 – Planning Ramin Halavati In which we see how an agent can take.
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.
Nonlinear Planning Lecture Module 9. Nonlinear Planning with Goal Set Generate a plan by doing some work on one goal, then some on another and then some.
April 3, 2006AI: Chapter 11: Planning1 Artificial Intelligence Chapter 11: Planning Michael Scherger Department of Computer Science Kent State University.
22/11/04 AIPP Lecture 16: More Planning and Operators1 More Planning Artificial Intelligence Programming in Prolog.
CS.462 Artificial Intelligence SOMCHAI THANGSATHITYANGKUL Lecture 07 : Planning.
1 CMSC 671 Fall 2010 Class #12/13 – Wednesday, October 13/ Monday, October 18 Some material adapted from slides by Jean-Claude Latombe / Lise Getoor.
Planning, page 1 CSI 4106, Winter 2005 Planning Points Elements of a planning problem Planning as resolution Conditional plans Actions as preconditions.
Planning (Chapter 10)
Partial Ordering Planning Lecture Module 10. Partial Ordering Any planning algorithm that can place two actions into a plan without specifying which comes.
CPS 270: Artificial Intelligence Planning Instructor: Vincent Conitzer.
PLANNING He whose undertakings are all devoid of plan and desire for results, and whose actions are burnt by the fire of knowledge, him the sages call.
For Friday No reading Homework: –Chapter 11, exercise 4.
1 Planning Chapter 10 Some material adopted from notes by Tim Finin, Marie desJardins Andreas Geyer-Schulz, and Chuck Dyer.
CPS 570: Artificial Intelligence Planning Instructor: Vincent Conitzer.
Planning (Chapter 10)
AI Lecture 17 Planning Noémie Elhadad (substituting for Prof. McKeown)
1/16 Planning Chapter 11- Part1 Author: Vali Derhami.
Towards Model-lite Planning A Proposal For Learning & Planning with Incomplete Domain Models Sungwook Yoon Subbarao Kambhampati Supported by DARPA Integrated.
Intelligent Systems Planning.
Planning in FOL Systems sequences of actions to achieve goals.
CS621: Artificial Intelligence Pushpak Bhattacharyya Computer Science and Engineering Department IIT Bombay Lecture 19: Hidden Markov Models.
1 Planning Chapter 10 Some material adopted from notes by Tim Finin, Marie desJardins Andreas Geyer-Schulz, and Chuck Dyer.
1 Planning Some material adopted from notes by Andreas Geyer-Schulz and Chuck Dyer.
CMSC 471 Spring 2014 Class #24 Thursday, April 24, 2014 Planning
An Introduction to Artificial Intelligence CE 40417
Fast Propositional Algorithms for Planning
Planning Chapter 16.
Introduction Contents Sungwook Yoon, Postdoctoral Research Associate
Planning (Chapter 10)
Introduction Defining the Problem as a State Space Search.
CMSC 471 Fall 2011 Class #16 Tuesday, October 25, 2011 Planning
AI Planning.
Planning Chapter and Chuck Dyer
Planning Chapter
CPSC 322 Introduction to Artificial Intelligence
CS344 : Introduction to Artificial Intelligence
Class #15 / 16 – Tuesday, October 20 / Thursday, October 22
Russell and Norvig: Chapter 11 CS121 – Winter 2003
CMSC 471 Fall 2002 Class #20/21/23 – Wednesday, November 6 / Monday, November 11 / Monday, November 18.
Prof. Pushpak Bhattacharyya, IIT Bombay
Presentation transcript:

Sussman anomaly - analysis The start state is given by: ON(C, A) ONTABLE(A) ONTABLE(B) ARMEMPTY The goal by: ON(A,B) ON(B,C) This immediately leads to two approaches as given below 1. ON(A,B) ON(B,C) ON(A,B) ON(B,C) 2. ON(B,C) ON(A,B) ON(A,B) ON(B,C)

Sussman anomaly - analysis Choosing path 1 and trying to get block A on block B leads to the goal stack: ON(C,A) CLEAR(C) ARMEMPTY ON(C,A) CLEAR(C) ARMEMPTY UNSTACK(C,A) ARMEMPTY CLEAR(A) ARMEMPTY PICKUP(A) CLEAR(B) HOLDING(A) STACK(A,B) ON(B,C) ON(A,B) ON(B,C)

Sussman anomaly - analysis This achieves block A on block B which was produced by putting block C on the table. The sequence of operators is 1.UNSTACK(C,A) 2.PUTDOWN(C) 3.PICKUP(A) 4.STACK (A,B) Working on the next goal of ON(B,C) requires block B to be cleared so that it can be stacked on block C. Unfortunately we need to unstack block A which we just did.

Sussman anomaly - analysis Thus the list of operators becomes 1.UNSTACK(C,A) 2.PUTDOWN(C) 3.PICKUP(A) 4.STACK (A,B) 5.UNSTACK(A,B) 6.PUTDOWN(A) 7.PICKUP(B) 8.STACK (B,C) To get to the state that block A is not on block B two extra operations are needed: 8 1.PICKUP(A) 2.STACK(A,B)

Sussman anomaly - analysis Analysing this sequence we observe that Steps 4 and 5 are opposites and therefore cancel each other out, Steps 3 and 6 are opposites and therefore cancel each other out as well. So a more efficient scheme is: 1.UNSTACK(C,A) 2.PUTDOWN(C) 3.PICKUP(B) 4.STACK (B,C) 5.PICKUP(A) 6.STACK(A,B) To produce in all such cases this efficient scheme where this interaction between the goals requires more sophisticated techniques

Sussman anomaly - analysis Nonlinear Planning Using Constraint Posting Let us reconsider the SUSSMAN ANOMALY Problems like this require subproblems to be worked on simultaneously. Thus a nonlinear plan using heuristics such as: 1.Try to achieve ON(A,B) clearing block A putting block C on the table. 2.Achieve ON(B,C) by stacking block B on block C. 3.Complete ON(A,B) by stacking block A on block B.

Sussman anomaly - analysis Constraint posting has emerged as a central technique in recent planning systems (E.g. MOLGEN and TWEAK) Constraint posting builds up a plan by: suggesting operators, trying to order them, and produce bindings between variables in the operators and actual blocks. The initial plan consists of no steps and by studying the goal state ideas for the possible steps are generated. There is no order or detail at this stage.

Gradually more detail is introduced and constraints about the order of subsets of the steps are introduced until a completely ordered sequence is created. In this problem means-end analysis suggests two steps with end conditions ON(A,B) and ON(B,C) which indicates the operator STACK giving the layout shown below where the operator is preceded by its preconditions and followed by its post conditions: CLEAR(B) CLEAR(C) *HOLDING(A) *HOLDING(B)

STACK(A,B) STACK(B,C)ARMEMPTY ON(A,B) ON(B,C) CLEAR(B) CLEAR(C) HOLDING(A) HOLDING(B) There is no order at this stage. Unachieved preconditions are starred (*). Both of the HOLDING preconditions are unachieved since the arm holds nothing in the initial state. Delete postconditions are marked by ().

Example (cont.)

Partial vs. Total Order Plans Start Left Sock Right Sock Left Shoe Right Shoe Finish Start Finish Right Sock Left Sock Left Shoe Right Shoe Partial Order Plan:Total Order Plan: Start Finish Left Sock Right Sock Right Shoe Left Shoe Start Finish Left Sock Right Sock Left Shoe Right Shoe Start Finish Right Sock Right Shoe Left Sock Left Shoe Start Finish Right Sock Left Sock Right Shoe Left Shoe Start Finish Left Sock Left Shoe Right Sock Right Shoe

Example plan to buy groceries and drill

 Stage one, choose preconditions of goal state and select operators that satisfy them  Note, actions added to plan in quite different order than they are executed  Also, note possible satisfactions for new preconditions in start state

Create protected links from states where they are already true (here, the start)

Add go actions to satisfy at() preconditions of buy operators

Find protected links