ADVANCED PLANNING TECHNIQUES Dr. Adam Anthony Lecture 22.

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.
Artificial Intelligence 2005/06 Partial Order Planning.
Chapter 5 Plan-Space Planning.
1 Planning Chapter CMSC 471 Adapted from slides by Tim Finin and Marie desJardins. Some material adopted from notes by Andreas Geyer-Schulz,
Planning II: Partial Order Planning
Planning Module THREE: Planning, Production Systems,Expert Systems, Uncertainty Dr M M Awais.
Causal-link Planning II José Luis Ambite. 2 CS 541 Causal Link Planning II Planning as Search State SpacePlan Space AlgorithmProgression, Regression POP.
Planning Module THREE: Planning, Production Systems,Expert Systems, Uncertainty Dr M M Awais.
Classical Planning via Plan-space search COMP3431 Malcolm Ryan.
Plan Generation & Causal-Link Planning 1 José Luis Ambite.
Computing & Information Sciences Kansas State University Lecture 20 of 42 CIS 530 / 730 Artificial Intelligence Lecture 20 of 42 Introduction to Classical.
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 [INTELLIGENT AGENTS PARADIGM] Professor Janis Grundspenkis Riga Technical University Faculty of Computer Science and Information.
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.
Planning Copyright, 1996 © Dale Carnegie & Associates, Inc. Chapter 11.
Planning: Part 2 Partial Order Planning COMP151 April 2, 2007.
Planning II GraphPlan and Russell and Norvig: ch.12 CMSC421 – Fall 2006 based on material from Jim Blythe, JC Latombe, Marie desJardins and Daphne Koller.
Artificial Intelligence Chapter 11: Planning
Planning Russell and Norvig: Chapter 11. Planning Agent environment agent ? sensors actuators A1A2A3.
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.
1 Planning Adapted from Tim Finin, UMBC, Marie desJardins Some material adopted from notes by Andreas Geyer-Schulz and Chuck Dyer.
Planning Copyright, 1996 © Dale Carnegie & Associates, Inc. Chapter 11.
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.
For Wednesday Read chapter 12, sections 3-5 Program 2 progress due.
(Classical) AI Planning. Some Examples Route search: Find a route between Lehigh University and the Naval Research Laboratory Project management: Construct.
Dana Nau: Lecture slides for Automated Planning Licensed under the Creative Commons Attribution-NonCommercial-ShareAlike License:
Planning Chapter Some material adopted from notes by Andreas Geyer-Schulz and Chuck Dyer.
Homework 1 ( Written Portion )  Max : 75  Min : 38  Avg : 57.6  Median : 58 (77%)
CS.462 Artificial Intelligence SOMCHAI THANGSATHITYANGKUL Lecture 07 : Planning.
Planning, page 1 CSI 4106, Winter 2005 Planning Points Elements of a planning problem Planning as resolution Conditional plans Actions as preconditions.
Computing & Information Sciences Kansas State University Wednesday, 15 Oct 2008CIS 530 / 730: Artificial Intelligence Lecture 20 of 42 Wednesday, 15 October.
Planning (Chapter 10)
Computing & Information Sciences Kansas State University Lecture 21 of 42 CIS 530 / 730 Artificial Intelligence Lecture 21 of 42 Planning: Graph Planning.
For Friday No reading Homework: –Chapter 11, exercise 4.
Planning (Chapter 10)
Dana Nau: Lecture slides for Automated Planning Licensed under the Creative Commons Attribution-NonCommercial-ShareAlike License:
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.
Automated Planning Dr. Héctor Muñoz-Avila. What is Planning? Classical Definition Domain Independent: symbolic descriptions of the problems and the domain.
Partial Order Planning 1 Brian C. Williams J/6.834J Sept 16 th, 2002 Slides with help from: Dan Weld Stuart Russell & Peter Norvig.
Dana Nau: Lecture slides for Automated Planning Licensed under the Creative Commons Attribution-NonCommercial-ShareAlike License:
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:
(Classical) AI Planning. General-Purpose Planning: State & Goals Initial state: (on A Table) (on C A) (on B Table) (clear B) (clear C) Goals: (on C Table)
Computing & Information Sciences Kansas State University Monday, 23 Oct 2006CIS 490 / 730: Artificial Intelligence Lecture 25 of 42 Monday, 23 October.
Computing & Information Sciences Kansas State University Friday, 20 Oct 2006CIS 490 / 730: Artificial Intelligence Lecture 24 of 42 Friday, 20 October.
1 CMSC 471 Fall 2004 Class #21 – Thursday, November 11.
1 CMSC 471 Fall 2002 Class #24 – Wednesday, November 20.
Planning I: Total Order Planners Sections
Graphplan CSE 574 April 4, 2003 Dan Weld. Schedule BASICS Intro Graphplan SATplan State-space Refinement SPEEDUP EBL & DDB Heuristic Gen TEMPORAL Partial-O.
April 3, 2006AI: Chapter 11: Planning1 Artificial Intelligence Chapter 11: Planning.
Causal-link planning 1 Jim Blythe. 2 USC INFORMATION SCIENCES INSTITUTE Causal Link Planning The planning problem Inputs: 1. A description of the world.
CSE573 Autumn /11/98 Planning Administrative –PS3 due 2/23 –Midterm Friday Last time –regression planning algorithm –introduction to plan-space.
SNS College of Engineering Department of Computer Science and Engineering AI Planning Presented By S.Yamuna AP/CSE 5/23/2018 AI.
CMSC 471 Spring 2014 Class #24 Thursday, April 24, 2014 Planning
Planning Chapter 16.
Planning (Chapter 10) Slides by Svetlana Lazebnik, 9/2016 with modifications by Mark Hasegawa-Johnson, 9/2017
Planning (Chapter 10)
Planning (Chapter 10)
CMSC 471 Fall 2011 Class #16 Tuesday, October 25, 2011 Planning
Planning José Luis Ambite.
Planning Chapter
Class #20 – Wednesday, November 5
Class #15 / 16 – Tuesday, October 20 / Thursday, October 22
CMSC 471 Fall 2002 Class #20/21/23 – Wednesday, November 6 / Monday, November 11 / Monday, November 18.
Class #17 – Tuesday, October 30
Presentation transcript:

ADVANCED PLANNING TECHNIQUES Dr. Adam Anthony Lecture 22

2 Where We’ve Been: State-space planning  We initially have a space of situations (where you are, what you have, etc.)  The plan is a solution found by “searching” through the situations to get to the goal  A progression planner searches forward from initial state to goal state  A regression planner searches backward from the goal  A planning graph can be used as a heuristic tool, or as part of graphplan to perform a type of backward search

3 Plan-space planning  An alternative is to search through the space of plans, rather than situations.  Start from a partial plan which is expanded and refined until a complete plan that solves the problem is generated.  Refinement operators add constraints to the partial plan and modification operators for other changes.  We can still use PDDL-style operators: Op(ACTION: RightShoe, PRECOND: RightSockOn, EFFECT: RightShoeOn) Op(ACTION: RightSock, EFFECT: RightSockOn) Op(ACTION: LeftShoe, PRECOND: LeftSockOn, EFFECT: LeftShoeOn) Op(ACTION: LeftSock, EFFECT: leftSockOn) could result in a partial plan of [RightShoe, LeftShoe]

4 Partial-order planning  A linear planner builds a plan as a totally ordered sequence of plan steps  A non-linear planner (aka partial-order planner) builds up a plan as a set of steps with some temporal constraints  constraints of the form S1<S2 if step S1 must come before S2.  One refines a partially ordered plan (POP) by either:  adding a new plan step, or  adding a new constraint to the steps already in the plan.  A POP can be linearized (converted to a totally ordered plan) by topological sorting

5 Least commitment  Non-linear planners embody the principle of least commitment  only choose actions, orderings, and variable bindings that are absolutely necessary, leaving other decisions till later  avoids early commitment to decisions that don’t really matter  A linear planner always chooses to add a plan step in a particular place in the sequence  A non-linear planner chooses to add a step and possibly some temporal constraints

6 Non-linear plan  A non-linear plan consists of (1) A set of steps { S 1, S 2, S 3, S 4 …} Each step has an operator description, preconditions and post- conditions (2) A set of causal links { … ( S i,C,S j ) …} Meaning a purpose of step S i is to achieve precondition C of step S j (3) A set of ordering constraints { … S i <S j … } if step S i must come before step S j  A non-linear plan is complete iff  Every step mentioned in (2) and (3) is in (1)  If S j has prerequisite C, then there exists a causal link in (2) of the form ( S i,C,S j ) for some S i  If ( S i,C,S j ) is in (2) and step S k is in (1), and S k threatens ( S i,C,S j ) (makes C false), then (3) contains either S k <S i or S j <S k

7 The initial plan Every plan starts the same way S1:Start S2:Finish Initial State Goal State

8 Trivial example Operators: Op(ACTION: RightShoe, PRECOND: RightSockOn, EFFECT: RightShoeOn) Op(ACTION: RightSock, EFFECT: RightSockOn) Op(ACTION: LeftShoe, PRECOND: LeftSockOn, EFFECT: LeftShoeOn) Op(ACTION: LeftSock, EFFECT: leftSockOn) S1:Start S2:Finish RightShoeOn ^ LeftShoeOn Steps: {S1:[Op(Action:Start)], S2:[Op(Action:Finish, Pre: RightShoeOn^LeftShoeOn)]} Links: {} Orderings: {S1<S2}

9 Solution Start Left Sock Right Sock Right Shoe Left Shoe Finish

10 POP constraints and search heuristics  Only add steps that achieve a currently unachieved precondition  Use a least-commitment approach:  Don’t order steps unless they need to be ordered  Honor causal links S 1  S 2 that protect a condition c:  Never add an intervening step S 3 that violates c  If a parallel action threatens c (i.e., has the effect of negating or clobbering c), resolve that threat by adding ordering links: Order S 3 before S 1 (demotion) Order S 3 after S 2 (promotion) c

11

13 Partial-order planning example  Goal: Have milk, bananas, and a drill

14

15

16

17

18 ThreatDemotionPromotion Resolving threats

19

20

21 Real-world planning domains  Real-world domains are complex and don’t satisfy the assumptions of PDDL or partial-order planning methods  Some of the characteristics we may need to deal with:  Modeling and reasoning about resources  Representing and reasoning about time  Planning at different levels of abstractions  Conditional outcomes of actions  Uncertain outcomes of actions  Exogenous events  Incremental plan development  Dynamic real-time replanning } Scheduling } HTN planning } Planning under uncertainty

22 Hierarchical decomposition  Hierarchical decomposition, or hierarchical task network (HTN) planning, uses abstract operators to incrementally decompose a planning problem from a high-level goal statement to a primitive plan network  Primitive operators represent actions that are executable, and can appear in the final plan  Non-primitive operators represent goals (equivalently, abstract actions) that require further decomposition (or operationalization) to be executed  There is no “right” set of primitive actions: One agent’s goals are another agent’s actions!

23 HTN operator: Example OPERATOR decompose PURPOSE: Construction CONSTRAINTS: Length (Frame) <= Length (Foundation), Strength (Foundation) > Wt(Frame) + Wt(Roof) + Wt(Walls) + Wt(Interior) + Wt(Contents) PLOT: Build (Foundation) Build (Frame) PARALLEL Build (Roof) Build (Walls) END PARALLEL Build (Interior)

24 HTN planning: example

25 HTN operator representation  Russell & Norvig explicitly represent causal links; these can also be computed dynamically by using a model of preconditions and effects  Dynamically computing causal links means that actions from one operator can safely be interleaved with other operators, and subactions can safely be removed or replaced during plan repair  Russell & Norvig’s representation only includes variable bindings, but more generally we can introduce a wide array of variable constraints

26 Truth criterion  Determining whether a formula is true at a particular point in a partially ordered plan is, in the general case, NP-hard  Intuition: there are exponentially many ways to linearize a partially ordered plan  In the worst case, if there are N actions unordered with respect to each other, there are N! linearizations  Ensuring soundness of the truth criterion requires checking the formula under all possible linearizations  Use heuristic methods instead to make planning feasible  Check later to be sure no constraints have been violated

27 Truth criterion in HTN planners  Heuristic: prove that there is one possible ordering of the actions that makes the formula true – but don’t insert ordering links to enforce that order  Such a proof is efficient  Suppose you have an action A1 with a precondition P  Find an action A2 that achieves P (A2 could be initial world state)  Make sure there is no action necessarily between A2 and A1 that negates P  Applying this heuristic for all preconditions in the plan can result in infeasible plans

28 Increasing expressivity  Conditional effects  Instead of having different operators for different conditions, use a single operator with conditional effects  Move (block1, from, to) and MoveToTable (block1, from) collapse into one Move (block1, from, to): Op(ACTION: Move(block1, from, to), PRECOND: On (block1, from) ^ Clear (block1) ^ Clear (to) EFFECT: On (block1, to) ^ Clear (from) ^ ~On(block1, from) ^ ~Clear(to) when to<>Table  Negated and disjunctive goals  Universally quantified preconditions and effects

29 Reasoning about resources  Introduce numeric variables that can be used as measures  These variables represent resource quantities, and change over the course of the plan  Certain actions may produce (increase the quantity of) resources  Other actions may consume (decrease the quantity of) resources  More generally, may want different types of resources  Continuous vs. discrete  Sharable vs. nonsharable  Reusable vs. consumable vs. self-replenishing

30 Other real-world planning issues  Conditional planning  Partial observability  Information gathering actions  Execution monitoring and replanning  Continuous planning  Multi-agent (cooperative or adversarial) planning

31 Planning summary  Planning approaches  State-space search (STRIPS, forward chaining, ….)  Plan-space search (partial-order planning, HTN, …)  Constraint-based search (GraphPlan, SATplan, …)  Search strategies  Forward planning  Goal regression  Backward planning  Least-commitment  Nonlinear planning