1/16 Planning Chapter 11- Part1 Author: Vali Derhami.

Slides:



Advertisements
Similar presentations
Planning.
Advertisements

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.
Language for planning problems
CSE391 – 2005 NLP 1 Planning The Planning problem Planning with State-space search.
Planning Module THREE: Planning, Production Systems,Expert Systems, Uncertainty Dr M M Awais.
Planning Module THREE: Planning, Production Systems,Expert Systems, Uncertainty Dr M M Awais.
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.
Dana Nau: Lecture slides for Automated Planning Licensed under the Creative Commons Attribution-NonCommercial-ShareAlike License:
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.
Planning CSE 473 Chapters 10.3 and 11. © D. Weld, D. Fox 2 Planning Given a logical description of the initial situation, a logical description of the.
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.
1 Classical STRIPS Planning Alan Fern * * Based in part on slides by Daniel Weld.
Planning Search vs. planning STRIPS operators Partial-order planning.
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.
Artificial Intelligence 2005/06
CPSC 322 Introduction to Artificial Intelligence November 19, 2004.
Planning Copyright, 1996 © Dale Carnegie & Associates, Inc. Chapter 11.
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.
CS 561, Session Planning Search vs. planning STRIPS operators Partial-order planning.
1 Lecture 12 example (from slides prepared by Prof. J. Rosenchein)
Planning: Part 1 Representation and State-space Search COMP151 March 30, 2007.
Planning Copyright, 1996 © Dale Carnegie & Associates, Inc. Chapter 11.
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.
Automated Planning and HTNs Planning – A brief intro Planning – A brief intro Classical Planning – The STRIPS Language Classical Planning – The STRIPS.
1 Planning Chapters 11 and 12 Thanks: Professor Dan Weld, University of Washington.
Classical Planning via State-space search COMP3431 Malcolm Ryan.
AI Principles, Lecture on Planning Planning Jeremy Wyatt.
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.
An Introduction to Artificial Intelligence CE Chapter 11 – Planning Ramin Halavati In which we see how an agent can take.
Classical Planning Chapter 10.
Feng Zhiyong Tianjin University Fall planning.
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.
Dana Nau: Lecture slides for Automated Planning Licensed under the Creative Commons Attribution-NonCommercial-ShareAlike License:
April 3, 2006AI: Chapter 11: Planning1 Artificial Intelligence Chapter 11: Planning Michael Scherger Department of Computer Science Kent State University.
1 CO Games Development 2 Week 17 – Goal-Oriented Action Planning Gareth Bellaby.
Planning (Chapter 10)
First-Order Logic and Plans Reading: C. 11 (Plans)
CPS 270: Artificial Intelligence Planning Instructor: Vincent Conitzer.
1 Search vs. planning Situation calculus STRIPS operators Search vs. planning Situation calculus STRIPS operators.
CPS 570: Artificial Intelligence Planning Instructor: Vincent Conitzer.
Planning (Chapter 10)
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
Advanced Problem Solving Systems: Planning Lecture Module 8.
AI Lecture 17 Planning Noémie Elhadad (substituting for Prof. McKeown)
Intro to Planning Or, how to represent the planning problem in logic.
Classical Planning Chapter 10 Mausam / Andrey Kolobov (Based on slides of Dan Weld, Marie desJardins)
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.
Consider the task get milk, bananas, and a cordless drill.
CLASSICAL PLANNING. Outline  The challenges in planning with standard search algorithm  Representing Plans – the PDDL language  Planning as state -
Anifuddin Azis PLANNING. Artificial Intelligence A Modern Approach The subtitle of this book is "A Modern Approach." The intended meaning of this rather.
An Introduction to Artificial Intelligence CE 40417
L9. Planning Agents L7_exAnswer and explanation Review
Introduction Contents Sungwook Yoon, Postdoctoral Research Associate
Planning (AIMA Ch. 10) Planning problem defined Simple planning agent
Planning (Chapter 10)
Consider the task get milk, bananas, and a cordless drill
Logic for Artificial Intelligence
L11. Planning Agents and STRIPS
Prof. Pushpak Bhattacharyya, IIT Bombay
Presentation transcript:

1/16 Planning Chapter 11- Part1 Author: Vali Derhami

2/16 Outline Search vs. planning STRIPS operators Forward and backward search algorithms in planning

3/16 Search vs. Planning Consider the task get milk, bananas. Standard search algorithms seem to fail miserably:

4/16 Search vs. Planning (cont.) Assume a problem-solving agent using search... ♦ Which actions are relevant? – Our previous state-space definition does not clarify this ♦ What is a good heuristic function? – Must be provided by a human in each individual case ♦ How to decompose the problem? – Most real-world problems are nearly decomposable – But the state-space definition does not reveal any structure of the problem

5/16 What is planning? Planning in AI is the problem of finding a sequence of actions to achieve some goals. The sequence of actions is the system’s plan which then can be executed. Planning requires the following: – representation of goal to achieve; – knowledge about what actions can be performed; – knowledge about state of the world; to generate a plan to achieve the goal.

6/16 Architecture of a Planner

7/16 Planning Language What is a good language? – Expressive enough to describe a wide variety of problems – Restrictive enough to allow efficient algorithms to operate on it Planning algorithm should be able to take advantage of the logical structure of the problem

8/16 STRIPS Language STanford Research Institute Problems Solver The language of predicate logic to represent  goal to be achieved;  state of environment;  actions available to agent;

9/16 Example: Blocks world To represent this environment, need the following predicate names: On(x, y) obj x on top of obj y OnTable(x) obj x is on the table Clear(x) nothing is on top of obj x Holding(x) arm is holding x ArmEmpty robot arm is empty Here is a FOL representation of the blocks world described above: Clear(A)  Clear(C)  On(A,B)  OnTable(B)  OnTable(C)  ArmEmpty

10/16 Representation of states and goal Representation of States = conjunction of ground and function free literals ترکیت عطفی از لیترالهای مثبت (در اینجا بیشتر لیترالهای گزاره ای) – e.g. At(A,B)  Clear(C),... But not At(A, x) or At(neighbour(A),B)! closed-world assumption is used, meaning that any conditions that are not mentioned in a state are assumed false. Representation of goals: A goal is a particular state – e.g. OnTable(A)  OnTable(B)  OnTable(C) A state s satisfies a goal g if s contains all the atoms in g (and possibly others) Rich  Famous  Miserable satisfies Rich  Famous

11/16 Representation of actions Action(Fly(p, from, to), PRECOND:At(p, from)  Plane(p)  Airport(from)  Airport(to) Effect:  At(p, from)  At(p, to))  Each action schema has: – a name and parameter list – a pre-condition list: conjunction of function-free positive literals, list of facts which must be true for action to be executed; Any variables in the precondition must also appear in the action's parameter list. – an effect list: a conjunction of function-free literals describing how the state changes when the action is executed. may be contains: a delete list: list of facts that are no longer true after action is performed (negative literals); an add list: list of facts made true by executing the action. (positive literals) Each of these may contain variables.

12/16 Applicable actions  An action is applicable in any state satisfying its preconditions  Example: Action(Fly(p, from, to), PRECOND:At(p, from)  Plane(p)  Airport(from)  Airport(to) Effect:  At(p, from)  At(p, to)) Current State: At(Pi, JFK)  At(P2, SFO)  Plane(Pi)  Plane(P2)  Airport(JFK)  Airport(SFO).  ={p/Pi, from/JFK, to/SFO} تعریف جایگزین Thus, the concrete action Fly (Pi, JFK, SFO) is applicable.

13/16 Effect of actions Starting in state s, the result of executing an applicable action a is a state s' that is the same as s except that  Any positive literal P in the effect of a is added to s'  any negative literal P is removed from s‘  all other atoms do not change their value ! After Fly (Pi, JFK, SFO), current state: At(Pi, SFO)  At(P2, SFO)  Plane(Pi)  Plane(P2)  Airport(JFK)  Airport(SFO).

14/16 Expressiveness and extensions

15/16 Air cargo transport In(c, p) means that cargo c is inside plane p, and At(x, a) means that object x (either plane or cargo) is at airport a.

16/16 Air cargo transport (Cont.) Following plan is a solution to the problem: [Load(C1, P1, SFO), Fly(P1, SFO, JFK), Unload(C1,P1, JFK),Load(C2, P2, JFK), Fly(P2, JFK, SFO), Unload(C2, P2, SFO)].