Supplemental slides for CSE 327 Prof. Jeff Heflin

Slides:



Advertisements
Similar presentations
CSE391 – 2005 NLP 1 Planning The Planning problem Planning with State-space search.
Advertisements

CLASSICAL PLANNING What is planning ?  Planning is an AI approach to control  It is deliberation about actions  Key ideas  We have a model of the.
Planning Graphs * Based on slides by Alan Fern, Berthe Choueiry and Sungwook Yoon.
Graphplan Joe Souto CSE 497: AI Planning Sources: Ch. 6 “Fast Planning through Planning Graph Analysis”, A. Blum & M. Furst.
Ch. 2 – Intelligent Agents Supplemental slides for CSE 327 Prof. Jeff Heflin.
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.
Planning Planning is fundamental to “intelligent” behaviour. E.g.
Planning Russell and Norvig: Chapter 11 Slides adapted from: robotics.stanford.edu/~latombe/cs121/2003/ home.htm.
CLASSICAL PLANNING AND GRAPHPLAN Classes 17 and 18 All slides created by Dr. Adam P. Anthony.
Notes 10: Planning; STRIPs Planning Systems ICS 271 Fall 2008.
Ch. 10 – Planning Supplemental slides for CSE 327 Prof. Jeff Heflin.
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)
Planning: Part 2 Partial Order Planning COMP151 April 2, 2007.
Planning Russell and Norvig: Chapter 11. Planning Agent environment agent ? sensors actuators A1A2A3.
Planning: Part 3 Planning Graphs COMP151 April 4, 2007.
Planning Problem Solving  Planning –Action Centred –More flexible decision strategies A Representation for Planning –Add & Delete Lists Planning Techniques.
1 Lecture 12 example (from slides prepared by Prof. J. Rosenchein)
Planning: Part 1 Representation and State-space Search COMP151 March 30, 2007.
1 Action Planning (Where logic-based representation of knowledge makes search problems more interesting) R&N: Chap. 11, Sect. 11.1–4.
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.
Classical Planning Chapter 10.
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.
Automated Planning and Decision Making Prof. Ronen Brafman Automated Planning and Decision Making Introduction.
Artificial Intelligence 1: Planning
April 3, 2006AI: Chapter 11: Planning1 Artificial Intelligence Chapter 11: Planning Michael Scherger Department of Computer Science Kent State University.
1 CSC 8520 Spring Paula MatuszekBased on
Planning Chapter Planning The Planning problem Planning with State-space search Partial-order planning Planning graphs Planning with propositional.
Action Planning (Where logic-based representation of knowledge makes search problems more interesting) R&N: Chap. 10.3, Chap. 11, Sect. 11.1–4 (2 nd edition.
CS.462 Artificial Intelligence SOMCHAI THANGSATHITYANGKUL Lecture 07 : Planning.
Automated Planning and Decision Making Prof. Ronen Brafman Automated Planning and Decision Making Introduction.
Artificial Intelligence Chapter 22 Planning Biointelligence Lab School of Computer Sci. & Eng. Seoul National University.
CPS 270: Artificial Intelligence Planning Instructor: Vincent Conitzer.
CPS 570: Artificial Intelligence Planning Instructor: Vincent Conitzer.
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.
AI Lecture 17 Planning Noémie Elhadad (substituting for Prof. McKeown)
Supplemental slides for CSE 327 Prof. Jeff Heflin
Notes 9: Planning; Strips Planning Systems ICS 270a Spring 2003.
Koen HindriksMulti-Agent Systems 2012 Introduction Agent Programming Koen Hindriks Delft University of Technology, The Netherlands Learning to program.
Ch. 3 – Search Supplemental slides for CSE 327 Prof. Jeff Heflin.
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”,
Introduction to Artificial Intelligence April 11, 2012 Planning 1 Introduction to Artificial Intelligence CSCE476/876, Spring 2012:
Ch. 11 – Planning Supplemental slides for CSE 327 Prof. Jeff Heflin.
An Introduction to Artificial Intelligence CE 40417
Ch. 2 – Intelligent Agents
Instructor: Vincent Conitzer
Introduction Contents Sungwook Yoon, Postdoctoral Research Associate
Planning (AIMA Ch. 10) Planning problem defined Simple planning agent
EA C461 – Artificial Intelligence Planning
AI Planning.
Supplemental slides for CSE 327 Prof. Jeff Heflin
Planning as Satisfiability with Blackbox
Artificial Intelligence: Planning
Planning Problems On(C, A)‏ On(A, Table)‏ On(B, Table)‏ Clear(C)‏
Dave Touretzky Read R&N Chapter 10
AI Planning Introduction to Artificial Intelligence
CPS 570: Artificial Intelligence Planning
CS344 : Introduction to Artificial Intelligence
Russell and Norvig: Chapter 11 CS121 – Winter 2003
L9. STRIPS Examples Recursive STRIPS Block world
Artificial Intelligence Planning
An Introduction to Planning Graph
Prof. Pushpak Bhattacharyya, IIT Bombay
Supplemental slides for CSE 327 Prof. Jeff Heflin
Ch. 2 – Intelligent Agents
Presentation transcript:

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

Goal-Based Agent Environment Agent sensors State What the world is like now How the world evolves Environment What it will be like if I do action A What my actions do What action I should do now Goals actuators Agent From Fig. 2.13, p. 52

Blocks World Example initial state goal actions On(A,Table)  On(B,Table)  Clear(A)  Clear(B)  Clear(Table)  Block(A)  Block(B) goal On(A,B) actions Action(Move(b,x,y) , Precond: On(b,x)  Clear(b)  Clear(y)  Block(y), Effect: On(b,y)  Clear(x)  On(b,x)  Clear(y)) Action(MoveToTable(b,x), Precond: On(b,x)  Clear(b), Effect: On(b,Table)  Clear(x)  On(b,x))

Applicable Actions an action a is applicable in any state that satisfies the precondition e.g., Move(A,Table,B) is applicable in initial state unify with action description apply substitution  ={b/A, x/Table, y/B} to the action’s Precondition initial state satisfies On(A,Table)  Clear(A)  Clear(B)  Block(B) Action(Move(b,x,y), Precond: On(b,x)  Clear(b)  Clear(y)  Block(y), Effect: On(b,y)  Clear(x)  On(b,x)  Clear(y)) Action(MoveToTable(b,x), Precond: On(b,x)  Clear(b), Effect: On(b,Table)  Clear(x)  On(b,x)) Initial State: On(A,Table)  On(B,Table)  Clear(A)  Clear(B)  Clear(Table)  Block(A)  Block(B)

A Blocks World Problem initial state goal state actions On(A,Table)  On(B,Table)  On(C,Table)  Clear(A)  Clear(B)  Clear(C)  Clear(Table)  Block(A)  Block(B)  Block(C) goal state On(B,C)  On(A,B)  On(C,Table) actions Action(Move(b,x,y) , Precond: On(b,x)  Clear(b)  Clear(y)  Block(y), Effect: On(b,y)  Clear(x)  On(b,x)  Clear(y)) Action(MoveToTable(b,x), Precond: On(b,x)  Clear(b), Effect: On(b,Table)  Clear(x)  On(b,x))

Forward State-Space Search Move(A,T,B) MoveToTable(B,C) Move(A,T,C) Move(B,T,A) Move(B,C,A) On(A,T) ^ On(B,T) ^ On(C,T) ^ Clear(A) ^ Clear(B) ^ Clear(C) ^ Clear(T) Move(B,T,C) On(A,T) ^ On(B,T) ^ On(C,T) ^ Clear(A) ^ Clear(B) ^ Clear(C) ^ Clear(T) ^ On(B,C) Move(A,T,B) On(A,T) ^ On(C,T) ^ Clear(A) ^ Clear(B) ^ Clear(T) ^ On(B,C) ^ On(A,B) Move(A,T,A) Move(C,T,A) spurious actions Move(B,C,B) Move(C,T,B) MoveToTable(A,T) MoveToTable(A,T) MoveToTable(B,T) MoveToTable(C,T) spurious actions Move(A,T,A) Move(B,T,B) Move(C,T,C)

Backward State-Space Search On(B,C) ^ On(A,B) ^ On(C,T) GOAL: MoveToTable(C,x) Move(B,x,C) xC Move(A,x,B) xB Move(C,x,T) On(A,B) ^ On(C,T) ^ On(B,x) ^ Clear(B) ^ Clear(C) On(B,C) ^ On(C,T) ^ On(A,x) ^ Clear(A) ^ Clear(B) ? ? Move(B,y,C) yC Move(A,y,B)? On(C,T) ^ On(A,x) ^ Clear(A) ^ Clear(B) ^ On(B,y) ^ Clear(C) INITIAL STATE: (if x=T and y= T) Not relevant: has effect delete Clear(B) bold – literal that was added to the predecessor underline – goal is not satisfied by initial state

Planning Graph Example Init(Have(Cake) Goal(Have(Cake)  Eaten(Cake)) Action(Eat(Cake) PRECOND: Have(Cake) EFFECT: Have(Cake)  Eaten(Cake)) Action(Bake(Cake) PRECOND: Have(Cake) EFFECT: Have(Cake) Missing from book From Fig. 10.8, p. 380

GraphPlan function GRAPHPLAN(problem) returns solution or failure graph  INITIAL-PLANNING-GRAPH(problem) goals  CONJUNCTS(problem.GOAL) nogoods  an empty hash table for t = 0 to  do if goals all non-mutex in St of graph then solution  EXTRACT-SOLUTION(graph, goals, NUMLEVELS(graph), nogoods) if graph and nogoods have both leveled off then return failure graph  EXPAND-GRAPH(graph, problem) From Fig. 10.9, p. 383

Spare Tire Problem Init(Tire(Flat)  Tire(Spare)  At(Flat,Axle)  At(Spare,Trunk)) Goal(At(Spare,Axle)) Action(Remove(obj,loc), PRECOND: At(obj,loc), EFFECT: At(obj,loc)  At(obj,Ground)) Action(PutOn(t, Axle), PRECOND: Tire(t)  At(t,Ground)  At(Flat,Axle), EFFECT: At(t,Ground)  At(t,Axle)) Action(LeaveOvernight, PRECOND: , EFFECT: At(Spare,Ground)  At(Spare,Axle)  At(Spare,Trunk)  At(Flat,Ground)  At(Flat,Axle)  At(Flat,Trunk)) From Fig. 10.2, p. 370

Spare Tire Planning Graph From Fig. 10.10, p. 384