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.

Slides:



Advertisements
Similar presentations
Practical Planning: Scheduling and Hierarchical Task Networks Chapter CS 63 Adapted from slides by Tim Finin and Marie desJardins.
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
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 II: Partial Order Planning
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:
1 Graphplan José Luis Ambite * [* based in part on slides by Jim Blythe and Dan Weld]
Situation Calculus for Action Descriptions We talked about STRIPS representations for actions. Another common representation is called the Situation Calculus.
Planning with Constraints Graphplan & SATplan Yongmei Shi.
Best-First Search: Agendas
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.
1 Classical STRIPS Planning Alan Fern * * Based in part on slides by Daniel Weld.
CPSC 322, Lecture 19Slide 1 Propositional Logic Intro, Syntax Computer Science cpsc322, Lecture 19 (Textbook Chpt ) February, 23, 2009.
Lecturer: Sebastian Coope Ashton Building, Room G.18 COMP 201 web-page: Lecture.
Planning Copyright, 1996 © Dale Carnegie & Associates, Inc. Chapter 11.
1 Chapter Planning & Planning Methods. 2 Planning l Deciding upon a course of action before acting. l A plan is a representation of a course of.
1 Planning. R. Dearden 2007/8 Exam Format  4 questions You must do all questions There is choice within some of the questions  Learning Outcomes: 1.Explain.
Inference and Resolution for Problem Solving
1 Chapter 7 Propositional and Predicate Logic. 2 Chapter 7 Contents (1) l What is Logic? l Logical Operators l Translating between English and Logic l.
Planning II CSE 473. © Daniel S. Weld 2 Logistics Tournament! PS3 – later today Non programming exercises Programming component: (mini project) SPAM detection.
Dr. Muhammed Al-Mulhem 1ICS ICS 535 Design and Implementation of Programming Languages Part 1 Fundamentals (Chapter 4) Axiomatic Semantics ICS 535.
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.
Planning II CSE 573. © Daniel S. Weld 2 Logistics Reading for Wed Ch 18 thru 18.3 Office Hours No Office Hour Today.
Planning Department of Computer Science & Engineering Indian Institute of Technology Kharagpur.
Classical Planning Chapter 10.
Dana Nau: Lecture slides for Automated Planning Licensed under the Creative Commons Attribution-NonCommercial-ShareAlike License:
Jonathon Doran. The Planning Domain A domain describes the objects, facts, and actions in the universe. We may have a box and a table in our universe.
Dana Nau: Lecture slides for Automated Planning Licensed under the Creative Commons Attribution-NonCommercial-ShareAlike License:
Homework 1 ( Written Portion )  Max : 75  Min : 38  Avg : 57.6  Median : 58 (77%)
Planning (Chapter 10)
Advanced Topics in Propositional Logic Chapter 17 Language, Proof and Logic.
Copyright © Cengage Learning. All rights reserved. CHAPTER 3 THE LOGIC OF QUANTIFIED STATEMENTS THE LOGIC OF QUANTIFIED STATEMENTS.
Copyright © Curt Hill Quantifiers. Copyright © Curt Hill Introduction What we have seen is called propositional logic It includes.
Planning (Chapter 10)
Dana Nau: Lecture slides for Automated Planning Licensed under the Creative Commons Attribution-NonCommercial-ShareAlike License:
Automated Reasoning Early AI explored how to automated several reasoning tasks – these were solved by what we might call weak problem solving methods as.
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.
Dana Nau: Lecture slides for Automated Planning Licensed under the Creative Commons Attribution-NonCommercial-ShareAlike License:
Predicate Logic One step stronger than propositional logic Copyright © Curt Hill.
Robust Planning using Constraint Satisfaction Techniques Daniel Buettner and Berthe Y. Choueiry Constraint Systems Laboratory Department of Computer Science.
1 CMSC 471 Fall 2004 Class #21 – Thursday, November 11.
1 CMSC 471 Fall 2002 Class #24 – Wednesday, November 20.
Automated Planning and Decision Making Prof. Ronen Brafman Automated Planning and Decision Making Graphplan Based on slides by: Ambite, Blyth and.
Graphplan CSE 574 April 4, 2003 Dan Weld. Schedule BASICS Intro Graphplan SATplan State-space Refinement SPEEDUP EBL & DDB Heuristic Gen TEMPORAL Partial-O.
Dana Nau: Lecture slides for Automated Planning Licensed under the Creative Commons Attribution-NonCommercial-ShareAlike License:
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 -
Planning as Satisfiability
Planning as Search State Space Plan Space Algorihtm Progression
Planning (Chapter 10) Slides by Svetlana Lazebnik, 9/2016 with modifications by Mark Hasegawa-Johnson, 9/2017
Planning (Chapter 10)
Planning (Chapter 10)
Consider the task get milk, bananas, and a cordless drill
Class #17 – Thursday, October 27
Graphplan/ SATPlan Chapter
Class #19 – Monday, November 3
Class #20 – Wednesday, November 5
Knowledge and reasoning – second part
Graphplan/ SATPlan Chapter
Graphplan/ SATPlan Chapter
Class #17 – Tuesday, October 30
Presentation transcript:

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 l Propositional Planning l SAT Planning

3 Chapter 16 Contents (2) l Planning Graphs l GraphPlan l ADL and PDDL l Probabilistic Planning l Dynamic World Planning l Case-Based Planning l Scheduling

4 STRIPS (1) l Stanford Research Institute Problem Solver. l An operator based planning system. l STRIPS uses wffs in FOPC to describe the world. l For example: l STRIPS was designed to enable a planner to devise plans for a robot which is to solve problems in the blocks world.

5 STRIPS (2) l STRIPS defines operators as in the following rule schemata: Precondition:AT(r, x) Λ AT(o, x) Delete:AT(r, x) AT(o, x) Add:AT(r, y) AT(o, y) l The preconditions specify what must be true for the operator to be applied. l The delete and add lists specify the changes that will take place after the operator is applied.

6 STRIPS Implementation l STRIPS uses resolution and means- ends analysis to devise plans: l The goal is negated, and the rule schemata are instantiated with objects from the real world. l If the resolution fails, then the goal has been achieved. l Otherwise, a plan must be devised.

7 Partial Order Planning (1) l A total order plan specifies the order in which all actions must be carried out. l A partial order plan can specify some actions in parallel – these actions can be carried out in any order relative to each other.

8 Partial Order Planning (2) l A partial order plan can be implemented in one of several ways. l The partial order plan on the left is implemented in one of two ways, shown in the total order plans, center and right:

9 The Principle of Least Commitment l In building a plan there will be some variables and objects that can be ignored, as they are superfluous to the goal of the plan. l Some variables do not need to be instantiated – for example it is preferable, where possible, to use MoveOnto (a, y) than to use MoveOnto (a, b). l This is the Principle of Least Commitment.

10 Propositional Planning (1) l Any STRIPS plan can be expressed in propositional logic. l This will often involve increasing the number of variables.

11 Propositional Planning (2) l Any STRIPS plan can be expressed in propositional logic. l This will often involve increasing the number of variables. For example: Clear (x) On (x, y) l These predicates can be represented as propositions: X 1 is equivalent to Clear (A) X 2 is equivalent to Clear (B) X 3 is equivalent to On (A, B) X 4 is equivalent to On (B, A)

12 Propositional Planning (3) l States can be represented as an assignment of truth values to the propositions: X 1 Λ ¬X 2 Λ X 3 Λ ¬ X 4 l This state can be represented in STRIPS notation as: Clear (A) Λ ¬Clear (B) Λ On (A, B) Λ ¬On (B, A) l The following sentence represents all states in which A is clear and B is not clear: X 1 Λ ¬X 2

13 Propositional Planning (4) l Actions can also be represented as the preconditions and the results of the action. l We use the notation ¬X 1 ’ to indicate that X 1 ’ is no longer true after the action. l Hence, an action might be: X 1 Λ X 2 Λ ¬X 3 Λ ¬X 4 Λ X 1 ’ Λ ¬X 2 ’ Λ X 3 ’ Λ ¬X 4 ’ l This action is MoveOnto (A, B). l This is a simple example, but propositional planning can lead to very complex expressions being used. l The advantage of using propositional planning is that automated systems can be built to manipulate the plans.

14 SAT Planning l The satisfiability problem, of determining whether a given propositional logic sentence is satisfiable or not, is NP- Complete. l A number of efficient methods have been developed for devising plans by determining the satisfiability of propositional logic expressions. l Methods are either systematic, which involve checking all possible assignments of truth values, or stochastic.

15 Planning Graphs (1) l Even-numbered levels represent states. Odd-numbered levels actions. l Level 0 contains the propositions that represent the start state. The arrows from level 0 to level 1 show how those propositions match the preconditions of the actions in level 1. l All possible actions are shown in the graph.

16 Planning Graphs (2) l The partial planning graph shown includes persistence actions (things which do not change) as lines with squares on. l The heavy black lines show mutexes: nTwo propositions joined by such a line are mutually exclusive, and cannot both be used in the same plan.

17 Planning Graphs (3) l The planning graph for even a simple problem can be extremely complex. l By producing a complete planning graph for a problem, it can be determined whether a plan is possible, and the plan itself can also be derived. l Algorithms such as GraphPlan can be used to extract the plan.

18 GraphPlan l Problems are expressed in STRIPS notation. l GraphPlan iteratively builds a planning graph, starting from the initial state and working towards the goal state. l All applicable operators are applied at each level to produce the next level. l When the propositions necessary for the goal are included in the current level, and they are not mutex, a possible solution may have been reached.

19 ADL l Another method for representing planning problems. l ADL – Action Description Language: nMore expressive than STRIPS. nAllows quantified expressions such as: x.P(x) Λ ¬ Q(x) nPreconditions can include disjunctions. nAllows conditional effects – effects of actions that are dependent on other factors.

20 Probabilistic Planning l Thus far we have assumed that all actions are deterministic. l In fact, some actions are non- deterministic – their effects can vary. l It is possible to extend situation calculus to deal with non- deterministic actions.

21 Dynamic World Planning l Our discussion so far has assumed the world is static. l In fact, the world is dynamic – things outside of the control of the planner change. l Execution monitoring is used to monitor the execution of plans: nIf something changes during execution, replanning may be necessary. l Another approach is conditional planning – this includes every possible outcome in the plan.

22 Case-Based Planning l Case-based planning involves storing each plan that is devised. l Plans (and partial plans) can be re-used later to solve other, similar problems. l Example: CHEF. A system that is used to devise recipes for Chinese food given a set of ingredients. l If presented with a set of ingredients it has not seen before, it is able to use similar sets of ingredients it has seen before to devise a new recipe.

23 Scheduling l Scheduling is like planning, but also takes into account the length of time each action takes to execute. l Job-shop scheduling involves allocating machinery to a set of tasks. l The scheduler plans when each task will start, and how long it will take. l Scheduling can be treated as planning with constraints, where the constraints specify how long tasks will take.