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.

Slides:

Advertisements

Similar presentations

Planning II: Partial Order Planning

Advertisements

Planning Graphs * Based on slides by Alan Fern, Berthe Choueiry and Sungwook Yoon.

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.

Planning Planning is fundamental to “intelligent” behaviour. E.g.

All rights reserved ©L. Manevitz Lecture 61 Artificial Intelligence Planning System L. Manevitz.

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.

1  Planning (under complete Knowledge) Intro to Artificial Intelligence.

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 CSC 8520 Spring Paula Matuszek On the syllabus page there are links to two Prolog programs: a simple Prolog planner and an ADT library. Download.

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.

CLASSICAL PLANNING AND GRAPHPLAN Classes 17 and 18 All slides created by Dr. Adam P. Anthony.

1 Classical STRIPS Planning Alan Fern * * Based in part on slides by Daniel Weld.

Flat Tire Example init: {tire(flat),tire(spare),at(flat,axle),at(spare,trunk)} goal: at(spare,axle) operators: –Remove(obj,loc) precond: at(obj,loc) effect:

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.

The way in which a piece of knowledge is expressed by a human expert carries important information, example: if the person has fever and feels tummy-pain.

Rule-based deduction systems The way in which a piece of knowledge is expressed by a human expert carries important information, example: if the person.

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.

A: A Unified Brand-name-Free Introduction to Planning Subbarao Kambhampati Jan 28 th My lab was hacked and the systems are being rebuilt.. Homepage is.

CSE 574: Planning & Learning Subbarao Kambhampati 1/17: State Space and Plan-space Planning Office hours: 4:30—5:30pm T/Th.

1 Lecture 12 example (from slides prepared by Prof. J. Rosenchein)

Planning Where states are transparent and actions have preconditions and effects Notes at

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.

1 Action Planning (Where logic-based representation of knowledge makes search problems more interesting) R&N: Chap. 11, Sect. 11.1–4.

Planning Where states are transparent and actions have preconditions and effects Notes at

AI Principles, Lecture on Planning Planning Jeremy Wyatt.

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.

Planning Chapter Some material adopted from notes by Andreas Geyer-Schulz and Chuck Dyer.

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 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.

1 Planning Chapter 10 Some material adopted from notes by Tim Finin, Marie desJardins Andreas Geyer-Schulz, and Chuck Dyer.

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.

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.

Ch. 11 – Planning Supplemental slides for CSE 327 Prof. Jeff Heflin.

1 Planning Some material adopted from notes by Andreas Geyer-Schulz and Chuck Dyer.

Planning Chapter Some material adopted from notes by Andreas Geyer-Schulz and Chuck Dyer.

Introduction to Artificial Intelligence – Unit 6 Planning Course The Hebrew University of Jerusalem School of Engineering and Computer Science Academic.

1 Sheila McIlraith, CSC384, University of Toronto, Winter 2016 Planning This material is covered in R&N 3 rd edition chapter 10 This material is covered.

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.

Planning Chapter and Chuck Dyer

Combined Lecture CS621: Artificial Intelligence (lecture 19) CS626/449: Speech-NLP-Web/Topics-in-AI (lecture 20) Hidden Markov Models Pushpak Bhattacharyya.

Introduction Contents Sungwook Yoon, Postdoctoral Research Associate

CSC 8520 Spring Paula Matuszek

An Overview of AI Planning

CMSC 471 Fall 2011 Class #16 Tuesday, October 25, 2011 Planning

Planning Chapter and Chuck Dyer

Planning Chapter and Chuck Dyer

Planning Chapter

© James D. Skrentny from notes by C. Dyer, et. al.

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:

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 satisfy the two goals Also, simple establishment achieves highlighted propositions. ON(A,B) CLEAR(A) ~CLEAR(B) ARMEMPTY ON(B,C) CLEAR(B) ~CLEAR(C) ARMEMPTY ONTABLE(A) CLEAR(A) CLEAR(B) HOLDING(A) ONTABLE(B) CLEAR(B) CLEAR(C) HOLDING(B) Start state Goal state

ON(A,B) ON(B,C) STACK(A,B) STACK(B,C) Two more step additions to satisfy the two HOLDING preconditions ON(A,B) CLEAR(A) ~CLEAR(B) ARMEMPTY ON(B,C) CLEAR(B) ~CLEAR(C) ARMEMPTY ~ONTABLE(A) HOLDING(A) CLEAR(B) PICKUP(A) PICKUP(B) ONTABLE(A) CLEAR(A) ARMEMPTY ONTABLE(B) CLEAR(B) ARMEMPTY ON(C,A) ONTABLE(A) ONTABLE(B) CLEAR(C) CLEAR(B) ARMEMPTY Start state Goal state ~ONTABLE(B) HOLDING(B) CLEAR(C) Normally, when steps are added to the plan, two states should be created: a precondition and a result (effect). This is because other steps might be inserted inbetween. In these diagrams, I have omitted some of these states so that the diagrams can fit on the slides.

Promotion (or is it Declobbering??) establishes CLEAR(B) IN STATE A State A ON(A,B) ON(B,C) STACK(A,B) STACK(B,C) ON(A,B) CLEAR(A) ~CLEAR(B) ARMEMPTY ON(B,C) CLEAR(B) ~CLEAR(C) ARMEMPTY ~ONTABLE(A) HOLDING(A) CLEAR(B) ~ARMEMPTY PICKUP(A) PICKUP(B) ONTABLE(A) CLEAR(A) ARMEMPTY ONTABLE(B) CLEAR(B) ARMEMPTY ON(C,A) ONTABLE(A) ONTABLE(B) CLEAR(C) CLEAR(B) ARMEMPTY Start state Goal state ~ONTABLE(B) HOLDING(B) CLEAR(C) ~ARMEMPTY

Step Addition achieves CLEAR(A) in State B State B ON(A,B) ON(B,C) STACK(A,B) STACK(B,C) ON(A,B) CLEAR(A) ~CLEAR(B) ARMEMPTY ON(B,C) CLEAR(B) ~CLEAR(C) ARMEMPTY ~ONTABLE(A) HOLDING(A) CLEAR(B) ~ARMEMPTY PICKUP(A) PICKUP(B) ONTABLE(A) CLEAR(A) ARMEMPTY ONTABLE(B) CLEAR(B) ARMEMPTY ON(C,A) ONTABLE(A) ONTABLE(B) CLEAR(C) CLEAR(B) ARMEMPTY Start state Goal state ~ONTABLE(B) HOLDING(B) CLEAR(C) ~ARMEMPTY UNSTACK(C,A) CLEAR(C) ON(C,A) ARMEMPTY HOLDING(C) ~ON(C,A) ~ARMEMPTY

ON(A,B) ON(B,C) STACK(A,B) STACK(B,C) Step Addition achieves ARMEMPTY in State C ON(A,B) CLEAR(A) ~CLEAR(B) ARMEMPTY ON(B,C) CLEAR(B) ~CLEAR(C) ARMEMPTY CLEAR(B) HOLDING(A) ~ARMEMPTY PICKUP(A) PICKUP(B) ~ONTABLE(A) HOLDING(A) ~ARMEMPTY CLEAR(C) HOLDING(B) ~ARMEMPTY ~ONTABLE(B) HOLDING(B) ~ARMEMPTY ONTABLE(A) CLEAR(A) ARMEMPTY ONTABLE(B) CLEAR(B) ARMEMPTY ON(C,A) ONTABLE(A) ONTABLE(B) CLEAR(C) CLEAR(B) ARMEMPTY UNSTACK(C,A) HOLDING(C) CLEAR(A) ~ARMEMPTY ARMEMPTY ON(C,A) CLEAR(C) Start state Goal state State C PUTDOWN(C)

ON(A,B) ON(B,C) STACK(A,B) STACK(B,C) ON(A,B) CLEAR(A) ~CLEAR(B) ARMEMPTY ON(B,C) CLEAR(B) ~CLEAR(C) CLEAR(A) ARMEMPTY CLEAR(B) HOLDING(A) ~ARMEMPTY PICKUP(A) PICKUP(B) ~ONTABLE(A) HOLDING(A) ~ARMEMPTY CLEAR(C) HOLDING(B) ~ARMEMPTY ~ONTABLE(B) HOLDING(B) ~ARMEMPTY ONTABLE(A) CLEAR(A) ARMEMPTY ONTABLE(B) CLEAR(B) ARMEMPTY ON(C,A) ONTABLE(A) ONTABLE(B) CLEAR(C) CLEAR(B) ARMEMPTY UNSTACK(C,A) HOLDING(C) CLEAR(A) ~ARMEMPTY ARMEMPTY ON(C,A) CLEAR(C) Start state Goal state State D PUTDOWN(C) Promotion (or is it Declobbering??) establishes ARMEMPTY IN STATE D