Multirobot Coordination in USAR Katia Sycara The Robotics Institute

Slides:



Advertisements
Similar presentations
Mathematical Optimization in Stata: LP and MILP
Advertisements

1 An Adaptive GA for Multi Objective Flexible Manufacturing Systems A. Younes, H. Ghenniwa, S. Areibi uoguelph.ca.
1 University of Southern California Keep the Adversary Guessing: Agent Security by Policy Randomization Praveen Paruchuri University of Southern California.
Modeling Maze Navigation Consider the case of a stationary robot and a mobile robot moving towards a goal in a maze. We can model the utility of sharing.
MULTI-ROBOT SYSTEMS Maria Gini (work with Elizabeth Jensen, Julio Godoy, Ernesto Nunes, abd James Parker,) Department of Computer Science and Engineering.
SB Research Presentation – 12/2/05 Finding Rectilinear Least Cost Paths in the Presence of Convex Polygonal Congested Regions # Avijit Sarkar School of.
Pradeep Varakantham Singapore Management University Joint work with J.Y.Kwak, M.Taylor, J. Marecki, P. Scerri, M.Tambe.
Hierarchical mission control of automata with human supervision Prof. David A. Castañon Boston University.
MokSAF: Agent-based Team Assistance for Time Critical Tasks Katia Sycara The Robotics Institute
Effective Coordination of Multiple Intelligent Agents for Command and Control The Robotics Institute Carnegie Mellon University PI: Katia Sycara
Cognitive Colonization The Robotics Institute Carnegie Mellon University Bernardine Dias, Bruce Digney, Martial Hebert, Bart Nabbe, Tony Stentz, Scott.
AAMAS 2009, Budapest1 Analyzing the Performance of Randomized Information Sharing Prasanna Velagapudi, Katia Sycara and Paul Scerri Robotics Institute,
Improving Market-Based Task Allocation with Optimal Seed Schedules IAS-11, Ottawa. September 1, 2010 G. Ayorkor Korsah 1 Balajee Kannan 1, Imran Fanaswala.
Decentralized prioritized planning in large multirobot teams Prasanna Velagapudi Paul Scerri Katia Sycara Carnegie Mellon University, Robotics Institute.
In practice, we run into three common issues faced by concurrent optimization algorithms. We alter our model-shaping to mitigate these by reasoning about.
Cognitive Science 1 Kartik Talamadupula Subbarao Kambhampati J. Benton Dept. of Computer Science Arizona State University Paul Schermerhorn Matthias Scheutz.
1 Introduction to Linear and Integer Programming Lecture 9: Feb 14.
1 University of Southern California Towards A Formalization Of Teamwork With Resource Constraints Praveen Paruchuri, Milind Tambe, Fernando Ordonez University.
Towards an Understanding of the Impact of Autonomous Path Planning on Victim Search in USAR Paul Scerri, Prasanna Velagapudi, Katia Sycara, Huadong Wang,
Mary (Missy) Cummings Humans & Automation Lab
A Free Market Architecture for Distributed Control of a Multirobot System The Robotics Institute Carnegie Mellon University M. Bernardine Dias Tony Stentz.
Solving the Protein Threading Problem in Parallel Nocola Yanev, Rumen Andonov Indrajit Bhattacharya CMSC 838T Presentation.
Software Testing for Safety- Critical Applications Presented by: Ciro Espinosa & Daniel Llauger.
Distributed Scheduling. What is Distributed Scheduling? Scheduling: –A resource allocation problem –Often very complex set of constraints –Tied directly.
1 Combinatorial Problems in Cooperative Control: Complexity and Scalability Carla Gomes and Bart Selman Cornell University Muri Meeting March 2002.
Aeronautics & Astronautics Autonomous Flight Systems Laboratory All slides and material copyright of University of Washington Autonomous Flight Systems.
Universität Dortmund  P. Marwedel, Univ. Dortmund, Informatik 12, 2003 Hardware/software partitioning  Functionality to be implemented in software.
INTEGRATED PROGRAMME IN AERONAUTICAL ENGINEERING Coordinated Control, Integrated Control and Condition Monitoring in Uninhabited Air-Vehicles Ian Postlethwaite,
Machine Learning and Optimization For Traffic and Emergency Resource Management. Milos Hauskrecht Department of Computer Science University of Pittsburgh.
Controlling and Configuring Large UAV Teams Paul Scerri, Yang Xu, Jumpol Polvichai, Katia Sycara and Mike Lewis Carnegie Mellon University and University.
Improving Human-Robot Interaction Jill Drury, The MITRE Corporation Improving Human-Robot Interaction Jill Drury, The MITRE Corporation Collaborators:
Trust-based Multi-Objective Optimization for Node-to-Task Assignment in Coalition Networks 1 Jin-Hee Cho, Ing-Ray Chen, Yating Wang, and Kevin S. Chan.
Intelligent Mobile Robotics Czech Technical University in Prague Libor Přeučil
Adaptive CSMA under the SINR Model: Fast convergence using the Bethe Approximation Krishna Jagannathan IIT Madras (Joint work with) Peruru Subrahmanya.
Optimal Power Control, Rate Adaptation and Scheduling for UWB-Based Wireless Networked Control Systems Sinem Coleri Ergen (joint with Yalcin Sadi) Wireless.
Sliding Autonomy for Peer-To-Peer Human-Robot Teams M.B. Dias, B. Kannan, B. Browning, E. Jones, B. Argall, M.F. Dias, M.B. Zinck, M. Veloso, and A. Stentz.
Kevin Ross, UCSC, September Service Network Engineering Resource Allocation and Optimization Kevin Ross Information Systems & Technology Management.
1 Embedded Distributed Real-Time Resource Management Carl Hein, Aron Rubin Lockheed Martin Advanced Technology Lab Cherry Hill NJ September 25, 2003 HPEC.
Energy/Reliability Trade-offs in Fault-Tolerant Event-Triggered Distributed Embedded Systems Junhe Gan, Flavius Gruian, Paul Pop, Jan Madsen.
MURI: Integrated Fusion, Performance Prediction, and Sensor Management for Automatic Target Exploitation 1 Dynamic Sensor Resource Management for ATE MURI.
1 Distributed and Optimal Motion Planning for Multiple Mobile Robots Yi Guo and Lynne Parker Center for Engineering Science Advanced Research Computer.
Mobile Agent Migration Problem Yingyue Xu. Energy efficiency requirement of sensor networks Mobile agent computing paradigm Data fusion, distributed processing.
Issues and Challenges for Co-operative UAV Missions Chris Halliday and Tony Dodd.
Distributed Algorithms for Multi-Robot Observation of Multiple Moving Targets Lynne E. Parker Autonomous Robots, 2002 Yousuf Ahmad Distributed Information.
Towards Proactive Replanning for Multi-Robot Teams Brennan Sellner and Reid Simmons 5th International Workshop on Planning and Scheduling for Space October.
Real-Time Support for Mobile Robotics K. Ramamritham (+ Li Huan, Prashant Shenoy, Rod Grupen)
1 Iterative Integer Programming Formulation for Robust Resource Allocation in Dynamic Real-Time Systems Sethavidh Gertphol and Viktor K. Prasanna University.
CS 484 Designing Parallel Algorithms Designing a parallel algorithm is not easy. There is no recipe or magical ingredient Except creativity We can benefit.
Multiagent System Katia P. Sycara 일반대학원 GE 랩 성연식.
December 20, 2015 Decentralized Mission Planning for Heterogeneous Human-Robot Teams Sameera Ponda Prof. Jonathan How Department of Aeronautics and Astronautics.
ANTs PI meeting, Dec. 17, 2001Washington University / DCMP1 Flexible Methods for Multi-agent Distributed Resource Allocation by Exploiting Phase Transitions.
Behavior-based Multirobot Architectures. Why Behavior Based Control for Multi-Robot Teams? Multi-Robot control naturally grew out of single robot control.
Global Hybrid Control and Cooperative Mobile Robotics Yi Guo Center for Engineering Science Advanced Research Computer Science and Mathematics Division.
Scaling Human Robot Teams Prasanna Velagapudi Paul Scerri Katia Sycara Mike Lewis Robotics Institute Carnegie Mellon University Pittsburgh, PA.
Bounded Optimal Coordination for Human-Robot Teams G. Ayorkor Mills-Tettey Thesis Proposal: 12 th December 2008 Committee: Anthony Stentz, M. Bernardine.
Robust Decentralized Planning for Large-Scale Heterogeneous Human-Robot Teams Prof. Jonathan P. How Department of Aeronautics and Astronautics Massachusetts.
Thrust IIB: Dynamic Task Allocation in Remote Multi-robot HRI Jon How (lead) Nick Roy MURI 8 Kickoff Meeting 2007.
Learning for Physically Diverse Robot Teams Robot Teams - Chapter 7 CS8803 Autonomous Multi-Robot Systems 10/3/02.
Dynamic Mission Planning for Multiple Mobile Robots Barry Brumitt and Anthony Stentz 26 Oct, 1999 AMRS-99 Class Presentation Brian Chemel.
Venu Veeravalli ECE Dept and Coordinated Science Lab University of Illinois at Urbana-Champaign
Multi-robot
Keep the Adversary Guessing: Agent Security by Policy Randomization
Optimal Acceleration and Braking Sequences for Vehicles in the Presence of Moving Obstacles Jeff Johnson, Kris Hauser School of Informatics and Computing.
Timothy Boger and Mike Korostelev
Parallel Programming in C with MPI and OpenMP
Multi-Agent Exploration
Towards Next Generation Panel at SAINT 2002
Market-based Dynamic Task Allocation in Mobile Surveillance Systems
Parallel Programming in C with MPI and OpenMP
Presentation transcript:

Multirobot Coordination in USAR Katia Sycara The Robotics Institute

2 Motivation Rate of change of environment is slow No model of uncertainty due to uniqueness of disaster Incident Commander provides initial map and goals (do ASAP)

3 Technical Challenges Joint goals require robots to work together Heterogeneous multirobot task allocation Robots must coordinate schedules Additional system constraints Communication failures Need good allocation/schedule since traveling is slow Team must quickly react to discrepancies in plan (interleaving planning & execution)

4 Problem Formalization Time Critical Tight Coordination Team Planning Problem: R : Robots G : Goals E : Environment C : System constraints T max : Time allocated for mission R : Robots G : Goals Goal rewards decrease with time Maximize reward subject to constraints

5 Mathematical Programming Optimize objective function Linear Program (LP): Maximize c T x (x is vector of variables) Subject to Ax  b (constraints) l  x  u (bounds) Mixed Integer Linear Program (MILP): some variables must be integer (much harder) Q 1 f(x 1 )+…Q m f(x m ) Q i : reward for goal i x i : time that goal i is done f(x i ): dependence on time Goal requirements must be met Robots must take legal paths System constraints must be met Some variables must be integer (½ Robot???)

6 Experimental Results Fractured Subteams Dynamic Replanning How much better is the anytime algorithm? Number of goals Anytime algorithm: Combination of MILP And heuristic Koes, Nourbakhsh, Sycara, “Heterogeneous, Multi-robot coordination with Spatial and temporal constraints, AAAI-05, Pittsburgh, PA. July 2005.

7 Replanning with Fractured Subteams Challenge: The “optimal” plan when replanning may fail since robots in other fractured subteams follow initial plan Our approach: Avoid changes to the schedule that affect robots in other fractured subteams (especially short term)

8 Results of SDM with Communication Failures Performance compared to perfect communication Partitions in Environment 1 of 5 robots was disabled at randomly selected time 10 possible goals

9

10 Contributions General framework for coordination with multirobot task allocation, scheduling, system constraints Time critical tight coordination team planning problem (Multirobot/Time Extended) –Formalization –Benchmarks –Analysis System constraints: design & implementation Fractured subteams model Selective Disruption Minimization Robust plan generation

11 Challenges of Large Scale Teams Coordinate large number of UAVs in dynamic, open and hostile environments –Limited communication channels –Local information –High uncertainty, high dynamics, complex environment –High “failure” rate –Impractical to centralize Maintaining team status model –Prohibitive volume of communication –Can we limit what needs to be known by others? New problems when knowledge is localized Existing approaches only work for small teams (10s) –Require accurate models of team activities or a centralized information broker Key coordination algorithms are typically NP-Complete (or worse) –Can we build scalable, generic algorithms?

12 Results Developed scalable algorithms for distributed and autonomous: Plan instantiation Role allocation Information sharing Resource allocation Sensor fusion Recovering from faulty sensor readings Tested in team of hundreds of agents

13 Challenges Urban Search and Rescue Uncertainty Time pressure Difficult environment Heterogeneous robots Spatial and temporal constraints Communication failures Human-robot interactions Unstructured (after explosion) Undamaged (chemical leak)