Planning in the Real World Time and Resources Hierarchical Task Network Conditional Planning Execution Monitoring and Replanning Continuous Planning MultiAgent.

Slides:



Advertisements
Similar presentations
Solving problems by searching Chapter 3. Outline Problem-solving agents Problem types Problem formulation Example problems Basic search algorithms.
Advertisements

Additional Topics ARTIFICIAL INTELLIGENCE
Practical Planning: Scheduling and Hierarchical Task Networks Chapter CS 63 Adapted from slides by Tim Finin and Marie desJardins.
1 Planning 2 Some material adapted from slides by Tim Finin,Jean-Claude Latombe, Lise Getoor, and Marie desJardins.
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 with Non-Deterministic Uncertainty (Where failure is not an option) R&N: Chap. 12, Sect (+ Chap. 10, Sect 10.7)
Artificial Intelligence CS482, CS682, MW 1 – 2:15, SEM 201, MS 227 Prerequisites: 302, 365 Instructor: Sushil Louis,
Planning Module THREE: Planning, Production Systems,Expert Systems, Uncertainty Dr M M Awais.
Monitoring Partial Order Snapshots Doron Peled Bar Ilan University, Israel & University of Warwick, UK Joint work with Peter Niebert.
Classical Planning via Plan-space search COMP3431 Malcolm Ryan.
Problem Solving by Searching Copyright, 1996 © Dale Carnegie & Associates, Inc. Chapter 3 Spring 2007.
Intelligent Agents Russell and Norvig: 2
Planning with Resources at Multiple Levels of Abstraction Brad Clement, Tony Barrett, Gregg Rabideau Artificial Intelligence Group Jet Propulsion Laboratory.
Feng Zhiyong Tianjin University Fall 2008 Planning and Acting in the Real World.
14 Jan 2004CS Blind Search1 Solving problems by searching Chapter 3.
January 11, 2006AI: Chapter 2: Intelligent Agents1 Artificial Intelligence Chapter 2: Intelligent Agents Michael Scherger Department of Computer Science.
CS 380: Artificial Intelligence Lecture #3 William Regli.
Week 14 - Monday.  What did we talk about last time?  Bounding volume/bounding volume intersections.
An Introduction to Artificial Intelligence CE Chapter 12 – Planning and Acting in Real World Ramin Halavati In which we.
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:
Problem Solving What is AI way of solving problem?
Problem Solving by Searching Copyright, 1996 © Dale Carnegie & Associates, Inc. Chapter 3 Spring 2004.
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.
Multi-agent Oriented Constraint Satisfaction Authors: Jiming Liu, Han Jing and Y.Y. Tang Speaker: Lin Xu CSCE 976, May 1st 2002.
Performance of Coordinating Concurrent Hierarchical Planning Agents Using Summary Information Brad Clement and Ed Durfee University of Michigan Artificial.
GraphPlan ● (you don't have to know anything about this, but I put it here to point out that there are many clever approaches to try to find plans more.
Planning & Acting Copyright, 1996 © Dale Carnegie & Associates, Inc. Chapter 12 Scheduling (12.1), Planning and Acting in nondetermininistic domains (12.3),
Artificial Intelligence 2005/06 Hierarchical Planning and Other Stuff Russell and Norvig, Chapter 11.
Automated Planning and HTNs Planning – A brief intro Planning – A brief intro Classical Planning – The STRIPS Language Classical Planning – The STRIPS.
Planning & Acting Copyright, 1996 © Dale Carnegie & Associates, Inc. Chapter 12 Scheduling (12.1), Planning and Acting in nondetermininistic domains (12.3),
Machine Intelligence Cairo University Faculty of Engineering Computer Engineering Department Course Instructor: Prof. Dr. Nevin Darwish.
Chapter Seven Process Modeling, Process Improvement, and ERP Implementation.
Finite Capacity Scheduling 6.834J, J. Overview of Presentation What is Finite Capacity Scheduling? Types of Scheduling Problems Background and History.
Course Overview  What is AI?  What are the Major Challenges?  What are the Main Techniques?  Where are we failing, and why?  Step back and look at.

Project Management What is Project Management?
European Network of Excellence in AI Planning Intelligent Planning & Scheduling An Innovative Software Technology Susanne Biundo.
Stochastic Algorithms Some of the fastest known algorithms for certain tasks rely on chance Stochastic/Randomized Algorithms Two common variations – Monte.
Graph Coloring with Ants
Swarm Computing Applications in Software Engineering By Chaitanya.
Topics for Today Task planning for non-player characters Coping with player character interactions and their effect on narrative In Hamlet on the Holodeck,
Homework 1 ( Written Portion )  Max : 75  Min : 38  Avg : 57.6  Median : 58 (77%)
Using Abstraction in Multi-Rover Scheduling Bradley J. Clement and Anthony C. Barrett Artificial Intelligence Group Jet Propulsion Laboratory {bclement,
1 Solving problems by searching This Lecture Chapters 3.1 to 3.4 Next Lecture Chapter 3.5 to 3.7 (Please read lecture topic material before and after each.
Boğaziçi University Planning and Coordination in A Multi-Agent Environment. Gökay Burak AKKUŞ cmpe530.
Some Software Engineering Principles by D. L. Parnas Presented by Team 7: Amitkumar Dhameja Cincy Francis Rong Gu CS575 - Software Design, Team 7.
Agents CPSC 386 Artificial Intelligence Ellen Walker Hiram College.
Artificial Intelligence 2005/06 Partially Ordered Plans - or: "How Do You Put Your Shoes On?"
Towards Proactive Replanning for Multi-Robot Teams Brennan Sellner and Reid Simmons 5th International Workshop on Planning and Scheduling for Space October.
SOLVING PROBLEMS BY SEARCHING Chapter 3 August 2008 Blind Search 1.
A General Introduction to Artificial Intelligence.
Artificial Intelligence
AI Lecture 17 Planning Noémie Elhadad (substituting for Prof. McKeown)
1 CMSC 471 Fall 2004 Class #21 – Thursday, November 11.
CPSC 7373: Artificial Intelligence Lecture 9: Planning Jiang Bian, Fall 2012 University of Arkansas at Little Rock.
1 CMSC 471 Fall 2002 Class #24 – Wednesday, November 20.
GE 121 – Engineering Design Engineering Design GE121 Managing The Design Process Part II Lecture 11B.
ADVANCED PLANNING TECHNIQUES Dr. Adam Anthony Lecture 22.
Lecture 2: Intelligent Agents Heshaam Faili University of Tehran What is an intelligent agent? Structure of intelligent agents Environments.
1. WHAT IS A PROJECT? “A project is a problem scheduled for solution.” This definition forces us to recognize that projects are aimed at solving problems.
1 Solving problems by searching Chapter 3. 2 Outline Problem types Example problems Assumptions in Basic Search State Implementation Tree search Example.
Using Abstraction to Coordinate Multiple Robotic Spacecraft Brad Clement, Tony Barrett, Gregg Rabideau Artificial Intelligence Group Jet Propulsion Laboratory.
Review Midterm 1.
EE562 ARTIFICIAL INTELLIGENCE FOR ENGINEERS
Problem Solving by Searching
Solving problems by searching
Class #20 – Wednesday, November 5
Class #17 – Tuesday, October 30
Presentation transcript:

Planning in the Real World Time and Resources Hierarchical Task Network Conditional Planning Execution Monitoring and Replanning Continuous Planning MultiAgent Planning Summary

Time Constraints Planning gets complicated in: Scheduling Hubble Space Telescope Operating Factories Manufacturing Cooperating Agents

Time Constraints Goal: Complete jobs within time requirement. Start: Chassis(C1) ^ Chassis(C2) ^ Engine(E1,C1,30) ^ Engine(E2,C2,60) ^ Wheels(W1,C1,30) ^ Wheels(W2,C2,15) Goal: Done(C1) ^ Done(C2)

Time Constraints First Step: Partial Order. Start Add Engine 1 30 Add Wheels 1 30 Inspect 1 10 Finish Add Engine 2 60 Add Wheels 2 15 Inspect 2 10 Critical path

Resource Constraints Resource(k): k units of resource are needed by the action. The resource is reduced by k during the duration of the action.

Resource Constraints Example: Action(AddEngine(e,c,d) Precond: … Effect: … Resource: EngineHoists(1)) Other examples: Inspectors(2)

Planning in the Real World Time and Resources Hierarchical Task Network Conditional Planning Execution Monitoring and Replanning Continuous Planning MultiAgent Planning Summary

Hierarchical Task Network High Order Goal Subgoal 1 Subgoal 2 … Subgoal n Build House Get Land Construct Pay Builder

Decomposition A decomposition should be a correct implementation of the action (plan should be complete and consistent). A subplan is attained by unifying its variables with the state of the environment.

Hierarchical Task Network  HTN is complicated (undecidable).  Recursion is a problem.  Allows subtask sharing.  It is in general more efficient than naïve planning (linear rather than exponential).

A Successful Story Successful story: O-Plan (Bell and Tate ‘85) It helps develop production plans for Hitachi (350 products, 35 assembly machines, 2000 operations). It generates a schedule for 30 days with 8-hr shifts. The plan has tens of millions of steps.

Planning in the Real World Time and Resources Hierarchical Task Network Conditional Planning Execution Monitoring and Replanning Continuous Planning MultiAgent Planning Summary

Conditional Planning What to do with incomplete and incorrect information? Assume “bounded indeterminacy” Solution: Construct a conditional plan with branches to consider all sorts of contingencies (include sensing actions)

Actions Actions can have disjunctive effects: Example: Vaccum Cleaner Action(Left, Precond: At Right Effect: At Left V AtRight)

Effects Also add conditional effects: Example: Vaccum Cleaner Action(Suck, Precond: Effect: When (At Left) CleanL When (AtRight) CleanR)

Example Vacuum cleaner: Sometimes deposits dirt when it moves to a clean destination square. Sometimes deposits dirt if suck is applied to a clean square.

Planning in the Real World Time and Resources Hierarchical Task Network Conditional Planning Execution Monitoring and Replanning Continuous Planning MultiAgent Planning Summary

Execution Monitoring  Check to see if all is going according to the plan.  Re-planning agents repair old plans if something goes wrong.  Uses action monitoring to repair and continue with the plan.

Planning in the Real World Time and Resources Hierarchical Task Network Conditional Planning Execution Monitoring and Replanning Continuous Planning MultiAgent Planning Summary

Continuous Planning o The agent persists in the environment indefinitely. o The agent is part of the way through executing a plan. Example: Blocks-world problem.

Planning in the Real World Time and Resources Hierarchical Task Network Conditional Planning Execution Monitoring and Replanning Continuous Planning MultiAgent Planning Summary

MultiAgent Planning Interaction can be Cooperative Joint plan A goal is achieved when each agent performs its assigned actions. Competitive

Cooperative Play Tennis (doubles) Plan 1: A: [Go(A, [Right,Baseline]), Hit(A,Ball)] B: [NoOp(B), NoOp(B)]

Cooperative A common solution is to have a convention (constraint on joint plan). Conventions arise in evolutionary processes. Example: An ant colony. Flocking behavior of birds Besides convention you may have communication.

Planning in the Real World Time and Resources Hierarchical Task Network Conditional Planning Execution Monitoring and Re-planning Continuous Planning Multi-agent Planning Summary

Actions need resources (time being an important one) Planning can be divided in a hierarchy of subtasks Conditional plans help under uncertainty Execution Monitoring detects violations Replanning tries to repair plans Continuous planning creates new goals Multiagent planning is needed when different agents interact.