Temporal Planning: Part 2

Slides:



Advertisements
Similar presentations
Learning to Improve the Quality of Plans Produced by Partial-order Planners M. Afzal Upal Intelligent Agents & Multiagent Systems Lab.
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.
Artificial Intelligence 2005/06 Partial Order Planning.
Planning II: Partial Order Planning
SHOP2: An HTN Planning System Nau, D.S., Au, T.C., Ilghami, O., Kuter, U., Murdock, J.W., Wu, D. and Yaman, F. (2003) "SHOP2: An HTN Planning System",
1 Update on Learning By Observation Learning from Positive Examples Only Tolga Konik University of Michigan.
MBD and CSP Meir Kalech Partially based on slides of Jia You and Brian Williams.
MBD in real-world system… Self-Configuring Systems Meir Kalech Partially based on slides of Brian Williams.
TIMBER A Native XML Database Xiali He The Overview of the TIMBER System in University of Michigan.
SRTA: The Soft-Real Time Agent Control Architecture Bryan Horling, Victor Lesser, Regis Vincent, Thomas Wagner presented by Anita Raja.
WPI CS534 Showcase Jeff Martin. * Computer Software on Deep Space 1 * Used to execute plans/mission objectives * Model based * Constraint based * Fault.
Best-First Search: Agendas
1 ICWS 2006, Chicago ICWS 2006 A Framework for Intelligent Web Services: Combined HTN and CSP Approach Incheon Paik, University of Aizu Daisuke Maruyama,
Artificial Intelligence 2005/06
Artificial Intelligence Chapter 11: Planning
Constraint Logic Programming Ryan Kinworthy. Overview Introduction Logic Programming LP as a constraint programming language Constraint Logic Programming.
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.
4/15: LPG contd. And Temp. constraint networks. --~30 min of LPG discussion --Temporal constraint networks --Next class: Read Scheduling paper --Next Week:
© J. Christopher Beck Lecture 11: Constraint Programming 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.
The Need of Unmanned Systems
Planning II CSE 573. © Daniel S. Weld 2 Logistics Reading for Wed Ch 18 thru 18.3 Office Hours No Office Hour Today.
(9.1) COEN Logic Programming  Logic programming and predicate calculus  Prolog statements  Facts and rules  Matching  Subgoals and backtracking.
Notes for Chapter 12 Logic Programming The AI War Basic Concepts of Logic Programming Prolog Review questions.
A Hierarchical Approach to Model-based Reactive Planning in Large State Spaces Artificial Intelligence & Space Systems Laboratories Massachusetts Institute.
The Role of Optimization and Deduction in Reactive Systems P. Pandurang Nayak NASA Ames Research Center Brian.
Features, Policies and Their Interactions Joanne M. Atlee Department of Computer Science University of Waterloo.
CHA2555 Week2: Knowledge Representation, Logic and Planning Lee McCluskey First term:
June 28, 2000 Architecture Review 1 The Decision Layer.
Introduction to Job Shop Scheduling Problem Qianjun Xu Oct. 30, 2001.
3/11/2002copyright Brian Williams1 Propositional Logic and Satisfiability Brian C. Williams /6.834 October 7 th, 2002.
Probabilistic Reasoning for Robust Plan Execution Steve Schaffer, Brad Clement, Steve Chien Artificial Intelligence.
1 Gromit has an IDEA Felix Ingrand (LAAS/CAAR) NASA/IDEA Team LAAS Eden Team.
Carnegie Mellon Interactive Resource Management in the COMIREM Planner Stephen F. Smith, David Hildum, David Crimm Intelligent Coordination and Logistics.
Artificial Intelligence 2005/06 Partially Ordered Plans - or: "How Do You Put Your Shoes On?"
Robotic Space Explorers Brian C. Williams Space Systems Lab & Artificial Intelligence Lab, MIT.
The AI War LISP and Prolog Basic Concepts of Logic Programming
AI ● Dr. Ahmad aljaafreh. What is AI? “AI” can be defined as the simulation of human intelligence on a machine, so as to make the machine efficient to.
Partial Order Planning 1 Brian C. Williams J/6.834J Sept 16 th, 2002 Slides with help from: Dan Weld Stuart Russell & Peter Norvig.
June 6 th, 2005 ICAPS-2005 Workshop on Constraint Programming for Planning and Scheduling 1/12 Stratified Heuristic POCL Temporal Planning based on Planning.
AI Lecture 17 Planning Noémie Elhadad (substituting for Prof. McKeown)
Mike Graves Summer 2005 University of Texas at Dallas Implicit Invocation: The Task Control Architecture Mike Graves CS6362 Term Paper Dr. Lawrence Chung.
Model-based Programming of Cooperative Explorers Prof. Brian C. Williams Dept. of Aeronautics and Astronautics Artificial Intelligence Labs And Space Systems.
Robotic Space Explorers: To Boldly Go Where No AI System Has Gone Before A Story of Survival J/6.834J September 19, 2001.
Outline Deep Space One and Remote Agent Model-based Execution OpSat and the ITMS Model-based Reactive Planning Space Robotics.
Space Systems Laboratory Massachusetts Institute of Technology AUTONOMY MIT Graduate Student Open House March 24, 2000.
Design of a Deep Space Network Scheduling Application Bradley J. Clement, Mark D. Johnston Jet Propulsion Laboratory, California Institute of Technology.
9/18/2000copyright Brian Williams1 Propositional Logic Brian C. Williams J/6.834J October 10, 2001.
Copyright B. Williams J/6.834J, Fall 02 Lecture 3: Immobile Robots and Space Explorers Prof. Brian Williams Rm Wednesday, September 11 th,
Summary for final exam Agent System..
Temporal Plan Execution: Dynamic Scheduling and Simple Temporal Networks Brian C. Williams J/6.834J December 2nd,
SQL Environment.
Monitoring Dynamical Systems: Combining Hidden Markov Models and Logic
Learning Teleoreactive Logic Programs by Observation
Model-based Diagnosis: The Single Fault Case
NASA Ames Research Center
Constraint Satisfaction Problems (CSPs)
STATE SPACE REPRESENTATION
Knowledge Representation
Intro to Config Management Using Salt Open Source
AI in Space – Lessons From NASA’s Deep Space 1 Mission
Chapter 3: Finite Constraint Domains
Temporal Planning, Scheduling and Execution
CIS 488/588 Bruce R. Maxim UM-Dearborn
STATE SPACE REPRESENTATION
Model-based Diagnosis
MIT AI Lab: B. Williams, H. Shrobe, R. Laddaga
easYgen-3000XT Series Training
Constraint based scheduling
Presentation transcript:

Temporal Planning: Part 2 Brian C. Williams 16.412J/6.834J Oct 3rdst, 2001 1

Flexible Sequence (Plans) Histories(?) Goals Projective Task Expansion Temporal Planner Scheduler Flexible Sequence (Plans) Task Dispatch Plan Runner Goals Modes Model-based Execution (w planner) Task-Decomposition Execution Reactive Task Expansion Observations Commands

Outline Representing Plans Representing Time Plan Consistency and Scheduling

Cassini Saturn Orbital Insertion courtesy JPL

Planning in a continuous world Attitude Control System

Planning in a continuous world Attitude Control System Turn (a, b) Attitude Control System

Planning in a continuous world Attitude Control System Turn (a, b) Attitude Control System

Planning in a continuous world Attitude Control System Turn (a, b) Attitude Control System

Planning in a continuous world Attitude Control System Turn (a, b) Attitude Control System

Planning in a continuous world Attitude Control System Turn (a, b) Attitude Control System

Planning in a continuous world Attitude Control System Turn (a, b) Attitude Control System

Planning in a continuous world: Attitude Control System Point (b) Attitude Control System

Planning in a continuous world: Attitude Control System Point (b) Attitude Control System

Action/State dichotomy in a continuous world Attitude Control System Turn is an action, Point is a state Both Turn and Point are actions Both Turn and Point are state Point (b) Turn (a, b) Attitude Control System

Both Actions and States are Tokens Tokens represent procedure invocations Thrust Goals Delta_V(direction=b, magnitude=200) Power Attitude Point(a) Turn(a,b) Point(b) Turn(b,a) Engine Off Warm Up Thrust (b, 200) Off

Planning Constraints are Specified by Compatibilities Thrust Goals Delta_V(?x, ?y) Power contained_by equals Attitude Point(?x) contained_by meets met_by Engine Warm Up Thrust (?x, ?y) Off f

Example of Compatibility Instantiation Thrust Goals Delta_V(direction=b, magnitude=200) Power contains Attitude Engine Thrust (b, 200)

Example of Compatibility Instantiation Thrust Goals Delta_V(direction=b, magnitude=200) Power contained_by equals Attitude Point(b) contained_by meets met_by Engine Warm Up Thrust (b, 200) Off

Planner/Scheduler Architecture Engine Domain Knowledge Search Control Planning Experts Search engine Model (DDL) Goals Plan Plan Database Initial state to EXEC from EXEC

Planner Resolves Flaws Plan has flaws NO Uninstantiated compatibility . Instantiate compatibility . Backtrack Schedule token Plan is consistent NO YES

Types of Flaws No Disjunct of Compatibility Selected. Unsatisfied Subgoal There is a hole in the timeline immediately before Thrust (b, 200) Floating Token, Needs to be Placed on Timeline. Uninstantiated Variable in a Token Thrust (?x = {a, b, c}, ?y = [190, 300] The Plan Database can be modified only by primitives that resolve each of these flaws.

Planner/Scheduler Architecture Engine Domain Knowledge Search Control Planning Experts Search engine Model (DDL) Goals Plan Plan Database Initial state to EXEC from EXEC

Search Control Determines Order and Type of Flaw Resolution PLAN f2I(P): Plan has no subgoal flaws T Unsatisfied subgoal . Search Control Instantiate subgoal . . Backtrack Schedule token f1I(P): Plan is consistent F {T, ?}

Search Control Language met_by Turning_on( ) Ready( ) Camera: (:subgoal (:master-match (Camera = Ready)) (:slave-match (Camera = Turning_on))  (:priority 50) (:method-priority ((:method :add) (:sort :asap)) ((:method :connect)) ((:method :defer))))

DS1 Planner/Scheduler DS1 PS is a constraint-based, backtrack search, generative planner operating on a fully temporal domain model Model size (Remote Agent Experiment) state variables 18 procedure types 42 Plan size tokens 154 variables 288 (81 time points) constraints 232 (114 distance bounds) Performance search nodes 649 search efficiency 64 %

Flexible Sequence (Plans) Histories(?) Goals Projective Task Expansion Temporal Planner Scheduler Flexible Sequence (Plans) Task Dispatch Plan Runner Goals Modes Model-based Execution (w planner) Task-Decomposition Execution Reactive Task Expansion Observations Commands