Dana Nau University of Maryland 1 IMPACT Multi-Agent Planning Research.

Slides:



Advertisements
Similar presentations
1 Hierarchical Task Network (HTN) Planning José Luis Ambite* [* Based in part on presentations by Dana Nau and Rao Kambhampati]
Advertisements

In the name of God An Application of Planning An Application of PlanningJSHOP BY: M. Eftekhari and G. Yaghoobi.
ARCHITECTURES FOR ARTIFICIAL INTELLIGENCE SYSTEMS
Hierarchical Task Network (HTN) Planning Hai Hoang 4/17/2007.
Adopt Algorithm for Distributed Constraint Optimization
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",
Classical Planning via Plan-space search COMP3431 Malcolm Ryan.
OntoPlan: Knowledge Fusion Using Semantic Web Ontologies Héctor Muñoz-Avila Jeff Heflin.
Systems Analysis and Design Feasibility Study. Introduction The Feasibility Study is the preliminary study that determines whether a proposed systems.
Distributed Systems 1 Topics  What is a Distributed System?  Why Distributed Systems?  Examples of Distributed Systems  Distributed System Requirements.
Lecture 5 Themes in this session Building and managing the data warehouse Data extraction and transformation Technical issues.
CPSC 322, Lecture 19Slide 1 Propositional Logic Intro, Syntax Computer Science cpsc322, Lecture 19 (Textbook Chpt ) February, 23, 2009.
8.
Effective Coordination of Multiple Intelligent Agents for Command and Control The Robotics Institute Carnegie Mellon University PI: Katia Sycara
1 Chapter 12: Decision-Support Systems for Supply Chain Management CASE: Supply Chain Management Smooths Production Flow Prepared by Hoon Lee Date on 14.
V.S. Subrahmanian University of Maryland 1 IMPACT: Future Directions (years 3 and 4)
Software Connectors. Attach adapter to A Maintain multiple versions of A or B Make B multilingual Role and Challenge of Software Connectors Change A’s.
Performance of Coordinating Concurrent Hierarchical Planning Agents Using Summary Information Brad Clement and Ed Durfee University of Michigan Artificial.
Paper Title Your Name CMSC 838 Presentation. CMSC 838T – Presentation Motivation u Problem paper is trying to solve  Characteristics of problem  … u.
Implementation of RRT based Path planner and conversion into Temporal Plan Network By: Aisha Walcott Final Project Presentation Dec. 10, J.
1RADAR – Scheduling Task © 2003 Carnegie Mellon University RADAR – Scheduling Task May 20, 2003 Manuela Veloso, Stephen Smith, Jaime Carbonell, Brett Browning,
Nicholas Mifsud.  Behaviour Trees (BT) proposed as an improvement over Finite State Machines (FSM)  BTs are simple to design, implement, easily scalable,
Automated Planning and HTNs Planning – A brief intro Planning – A brief intro Classical Planning – The STRIPS Language Classical Planning – The STRIPS.
Lead Black Slide. © 2001 Business & Information Systems 2/e2 Chapter 11 Management Decision Making.
Feasibility Criteria for Investigating Potential Application Areas of AI Planning T.L.McCluskey, The University of Huddersfield,UK
Army Doctrine Publication (ADP) 3-37; and Army
Dana Nau: Lecture slides for Automated Planning Licensed under the Creative Commons Attribution-NonCommercial-ShareAlike License:
Katanosh Morovat.   This concept is a formal approach for identifying the rules that encapsulate the structure, constraint, and control of the operation.
(Classical) AI Planning. Some Examples Route search: Find a route between Lehigh University and the Naval Research Laboratory Project management: Construct.
Strategic Planning for Unreal Tournament© Bots Héctor Muñoz-Avila Todd Fisher Department of Computer Science and Engineering Lehigh University USA Héctor.
Dana Nau: Lecture slides for Automated Planning Licensed under the Creative Commons Attribution-NonCommercial-ShareAlike License:
Space-Based Network Centric Operations Research. Secure Autonomous Integrated Controller for Distributed Sensor Webs Objective Develop architectures and.
SAMANVITHA RAMAYANAM 18 TH FEBRUARY 2010 CPE 691 LAYERED APPLICATION.
Software Project Management Lecture # 7. What are we studying today? Chapter 24 - Project Scheduling  Effort distribution  Defining task set for the.
DBSQL 12-1 Copyright © Genetic Computer School 2009 Chapter 12 Recent Concepts and Application of Databases.
Database Design and Management CPTG /23/2015Chapter 12 of 38 Functions of a Database Store data Store data School: student records, class schedules,
Carnegie Mellon Interactive Resource Management in the COMIREM Planner Stephen F. Smith, David Hildum, David Crimm Intelligent Coordination and Logistics.
Integrated Systems Division Service-Oriented Programming Guy Bieber, Lead Architect Motorola ISD C4I 2000 OOPSLA Jini Pattern Language Workshop Guy Bieber,
Center of Excellence PEACE OPERATIONS ROLE OF THE MILITARY IN UN OPERATIONS IN UN OPERATIONS Col (Ret) Peter Leentjes Center of Excellence in Disaster.
SFWR ENG 3KO4 Slide 1 Management of Software Engineering Chapter 8: Fundamentals of Software Engineering C. Ghezzi, M. Jazayeri, D. Mandrioli.
Dana Nau: Lecture slides for Automated Planning Licensed under the Creative Commons Attribution-NonCommercial-ShareAlike License:
Automated Planning Dr. Héctor Muñoz-Avila. What is Planning? Classical Definition Domain Independent: symbolic descriptions of the problems and the domain.
Distributed Models for Decision Support Jose Cuena & Sascha Ossowski Pesented by: Gal Moshitch & Rica Gonen.
Multiagent System Katia P. Sycara 일반대학원 GE 랩 성연식.
OPERATING SYSTEMS CS 3530 Summer 2014 Systems and Models Chapter 03.
1 Joint Doctrine: The Authoritative Vocabulary For and Explanation of Joint Warfare and Joint Operations October 16, 2015 Representing Reality\Big Data\Big.
Dana Nau: Lecture slides for Automated Planning Licensed under the Creative Commons Attribution-NonCommercial-ShareAlike License:
Center of Excellence PEACE OPERATIONS ROLE OF THE MILITARY IN UN OPERATIONS IN UN OPERATIONS Col (Retd) Mike Morrison.
Specializing Project 06/07 HTN Presentation for MS1 By Glenn Wissing.
(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)
Fire Emissions Network Sept. 4, 2002 A white paper for the development of a NSF Digital Government Program proposal Stefan Falke Washington University.
Software Agents & Agent-Based Systems Sverker Janson Intelligent Systems Laboratory Swedish Institute of Computer Science
Task Analysis Lecture # 8 Gabriel Spitz 1. Key Points  Task Analysis is a critical element of UI Design  It describes what is a user doing or will.
1 Power to the Edge Agility Focus and Convergence Adapting C2 to the 21 st Century presented to the Focus, Agility and Convergence Team Inaugural Meeting.
A Brief Maximum Entropy Tutorial Presenter: Davidson Date: 2009/02/04 Original Author: Adam Berger, 1996/07/05
Scalability and Development of Space Networks Vincenzo Liberatore, Ph.D. Disclaimer: the views expressed here are solely the author’s, not the presenter’s.
MOPS: an Infrastructure for Examining Security Properties of Software Authors Hao Chen and David Wagner Appears in ACM Conference on Computer and Communications.
SM Sec.1 Dated 13/11/10 STRATEGY & STRUCTURE Group 3.
Resource Optimization for Publisher/Subscriber-based Avionics Systems Institute for Software Integrated Systems Vanderbilt University Nashville, Tennessee.
Dana Nau: Lecture slides for Automated Planning Licensed under the Creative Commons Attribution-NonCommercial-ShareAlike License:
DOWeR Detecting Outliers in Web Service Requests Master’s Presentation of Christian Blass.
OPERATING SYSTEMS CS 3502 Fall 2017
Introduction Project Management.
SNS College of Engineering Department of Computer Science and Engineering AI Planning Presented By S.Yamuna AP/CSE 5/23/2018 AI.
Software Design and Architecture
Brad Clement and Ed Durfee Artificial Intelligence Laboratory
SAMANVITHA RAMAYANAM 18TH FEBRUARY 2010 CPE 691
Presented By: Darlene Banta
Brad Clement and Ed Durfee University of Michigan
Presentation transcript:

Dana Nau University of Maryland 1 IMPACT Multi-Agent Planning Research

IMPACT Workshop Motivation: Noncombatant Evacuation Operations (NEOs) Goal: assist DOS to evacuate people whose lives are in danger noncombatants nonessential military personnel host-nation citizens third country nationals Characteristics: Joint task force – geographically distributed – often multinational Uncertainty; complexity (200+ tasks) US Ambassador is senior authority

IMPACT Workshop Difficulties with NEOs Multi-agent planning Planning is the responsibility of the geographic commanders Resources: Doctrine, Exercises, DOS, EAP, etc. Supplies are not centralized Information about supplies is not centralized either Potential for conflicts among simultaneous operations Example (not a NEO): moving Apache helicopters from Ramstein to Albania during the Kosovo crisis

IMPACT Workshop Key Technologies Access to distributed,heterogeneous data sources Seamless interoperability between different software capabilities Ability to coordinate multiple agents Scalable, high performance planning systems create plans interact with the above data and software sources Already being developed in the IMPACT project To be added to IMPACT

IMPACT Workshop Generate sequences of actions to perform tasks and achieve objectives Driving force The need for ways to aid human planning Example application areas military operations and logistics design and manufacturing space exploration What Planning Is

IMPACT Workshop Limitations of Classical Planning Classical planning theory: Either purely symbolic (AI planning) or purely numeric (OR planning) Single agent (the planner) Perfect information No interaction with users What’s needed in practice: Mixed symbolic & numeric computation Multiple agents Imperfect information, external information sources Human user in control of planning The above limitations may be overcome using a mix of IMPACT and scalable planning algorithms

IMPACT Workshop Approach Extend IMPACT to include (1) planning actions (2) temporal constraints for plans (3) complex planning tasks

IMPACT Workshop (1) Planning Actions Extend IMPACT rules so that heads of rules contain planning actions Example: if an item’s current inventory level has dropped below its restocking threshold, then create a plan to restock it at its stock level, by a given date, and within the given budget DO build-plan(restock(‘widget-25’,X.rstocklev,8/30/99,100k)) <= in(X,oracle:select(‘inventory”,item,=,‘widget-25’)) & <(X.qty,X.threshold). Problem: semantics of agent programs forces all executed actions to have a well-defined add/del list build-plan(…) may or may not be achievable, so we don’t know what the add/del list should be

IMPACT Workshop Planning Actions (Contd.) Extend IMPACT rule syntax to allow heads of rules to: contain a planning action and support actions whose outcomes may involve “conditional” add/delete lists of the form “fail” or “add/delete ”. Extend the IMPACT implementation to support invocation of such planning actions

IMPACT Workshop (2) Temporal Constraints for Plans A tcass (temporally- constrained action status set) is a set of action status atoms with temporal constraints on the actions Example: < {a1,a2,a3}, { st(a1) = st(a2), et(a1) where st(a) denotes a’s start time et(a) denotes a’s end time Increase the expressive power of agent rules by allowing rules of the form: Op tcass <= Body Also allow replacing tcass by a call to a planner which generates a tcass as its output We plan to refine the syntax and study semantics of such programs sound/complete status-set computation algorithms implementation techniques and experiments applications such as NEO planning

IMPACT Workshop (3) Complex Tasks Extend agent program rules so that the head of an agent program rule can have the form Op htn <= Body where htn is either an HTN (a hierarchical task network) – (see next slide) a call to an HTN generation program – e.g., the SHOP planning system (described later) We plan to refine the syntax and study the semantics computation algorithms for feasible status sets implementation and experiments applications

IMPACT Workshop HTN Planning: An Example Decompose tasks into (more tactical) subtasks Consider restrictions (e.g., transport helicopters available) Resolve interactions (e.g., deploy security force first) If necessary, backtrack and try other methods Launch from Carrier Battle Group Security force available (F) Transport helicopters available (H) Establish Base within Flying Distance alternative methods Select Helicopter Launching Base Select possible area (A) Transport sec. force (F,A,H) Embark sec. force (F,H) Fly(H,A) Disembark (F,H,A) Position security force (F,A) Transport fuel to (A)... Helicopters have air refuel. capability (H) Transport helicopters available (H)

IMPACT Workshop Leverage (1) SHOP - Simple Hierarchical Ordered Planner New HTN planning system [Nau et al., IJCAI-99] Outgrowth of some of the ideas explored in the Bridge Baron Sound and complete over a large class of planning problems Much more expressivity than most other planning systems – Mixed symbolic & numeric computations – External information sources Solves standard benchmark problems orders of magnitude faster than other domain-independent planning systems Complete implementation in Common Lisp – Available via FTP; downloaded by dozens of researchers Implementation in Java underway

IMPACT Workshop Leverage (2) HICAP: Non-Combatant Evacuation Planning Joint ongoing work with the Naval Research Laboratory Combines SHOP with case-based reasoning – Makes use of military doctrine and previous successful plans Nominated for best-paper award at ICCBR-99 Héctor Muñoz will demo HICAP during the demo session

IMPACT Workshop Multi-Agent Planning We intend to do the following Incorporate the extensions mentioned earlier – planning actions – temporal constraints for plans – complex planning tasks Develop protocols by which multiple agents may coordinate planning activities with one another Derive results showing that (under certain conditions to be determined), such protocols guarantee convergence on a plan – This will ensure termination within predictable running times Develop applications – TBD, but a likely possibility is multi-agent planning for NEOs