Towards Proactive Replanning for Multi-Robot Teams Brennan Sellner and Reid Simmons 5th International Workshop on Planning and Scheduling for Space October.

Slides:



Advertisements
Similar presentations
Evaluating Heuristics for the Fixed-Predecessor Subproblem of Pm | prec, p j = 1 | C max.
Advertisements

1 Stochastic Event Capture Using Mobile Sensors Subject to a Quality Metric Nabhendra Bisnik, Alhussein A. Abouzeid, and Volkan Isler Rensselaer Polytechnic.
Characterizing the Distribution of Low- Makespan Schedules in the Job Shop Scheduling Problem Matthew J. Streeter Stephen F. Smith Carnegie Mellon University.
Effective Coordination of Multiple Intelligent Agents for Command and Control The Robotics Institute Carnegie Mellon University PI: Katia Sycara
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.
CPSC 322, Lecture 15Slide 1 Stochastic Local Search Computer Science cpsc322, Lecture 15 (Textbook Chpt 4.8) February, 6, 2009.
Scaling Distributed Machine Learning with the BASED ON THE PAPER AND PRESENTATION: SCALING DISTRIBUTED MACHINE LEARNING WITH THE PARAMETER SERVER – GOOGLE,
Planning Among Movable Obstacles with Artificial Constraints Presented by: Deborah Meduna and Michael Vitus by: Mike Stilman and James Kuffner.
A Free Market Architecture for Distributed Control of a Multirobot System The Robotics Institute Carnegie Mellon University M. Bernardine Dias Tony Stentz.
WIC: A General-Purpose Algorithm for Monitoring Web Information Sources Sandeep Pandey (speaker) Kedar Dhamdhere Christopher Olston Carnegie Mellon University.
Deterministic Scheduling
Multirobot Coordination in USAR Katia Sycara The Robotics Institute
Planning in the Real World Time and Resources Hierarchical Task Network Conditional Planning Execution Monitoring and Replanning Continuous Planning MultiAgent.
1 Planning and Scheduling to Minimize Tardiness John Hooker Carnegie Mellon University September 2005.
Impact of Problem Centralization on Distributed Constraint Optimization Algorithms John P. Davin and Pragnesh Jay Modi Carnegie Mellon University School.
ECE 510 Brendan Crowley Paper Review October 31, 2006.
Router modeling using Ptolemy Xuanming Dong and Amit Mahajan May 15, 2002 EE290N.
Interference Minimization and Uplink Relaying For a 3G/WLAN Network Ju Wang Virginia Commonwealth University May, 2005.
©Ian Sommerville 2000Software Engineering, 6th edition. Chapter 4 Slide 1 Chapter 4 Project Management.
The Power of Choice in Data-Aware Cluster Scheduling
LEARN. NETWORK. DISCOVER. | #QADexplore Implementing Business Process Management: Steps to Success WCUG – November 18, 2014.
New Challenges in Cloud Datacenter Monitoring and Management
Aeronautics & Astronautics Autonomous Flight Systems Laboratory All slides and material copyright of University of Washington Autonomous Flight Systems.
Policy Generation for Continuous-time Stochastic Domains with Concurrency Håkan L. S. YounesReid G. Simmons Carnegie Mellon University.
Business Process Performance Prediction on a Tracked Simulation Model Andrei Solomon, Marin Litoiu– York University.
1/27 Ensemble Visualization for Cyber Situation Awareness of Network Security Data Lihua Hao 1, Christopher G. Healey 1, Steve E. Hutchinson 2 1 North.
A Web Crawler Design for Data Mining
1 Quincy: Fair Scheduling for Distributed Computing Clusters Michael Isard, Vijayan Prabhakaran, Jon Currey, Udi Wieder, Kunal Talwar, and Andrew Goldberg.
Using Abstraction in Multi-Rover Scheduling Bradley J. Clement and Anthony C. Barrett Artificial Intelligence Group Jet Propulsion Laboratory {bclement,
June 21, 2007 Minimum Interference Channel Assignment in Multi-Radio Wireless Mesh Networks Anand Prabhu Subramanian, Himanshu Gupta.
Probabilistic Reasoning for Robust Plan Execution Steve Schaffer, Brad Clement, Steve Chien Artificial Intelligence.
Stochastic DAG Scheduling using Monte Carlo Approach Heterogeneous Computing Workshop (at IPDPS) 2012 Extended version: Elsevier JPDC (accepted July 2013,
 A System Performance Model  Static Process Scheduling  Dynamic Load Sharing and Balancing  Real-Time Scheduling.
Architecture for Autonomous Assembly 1 Reid Simmons Robotics Institute Carnegie Mellon University.
Carnegie Mellon Interactive Resource Management in the COMIREM Planner Stephen F. Smith, David Hildum, David Crimm Intelligent Coordination and Logistics.
Presented by: Meysam rahimi
Multi-Robot System Application
Advanced Computer Architecture Lab University of Michigan Compiler Controlled Value Prediction with Branch Predictor Based Confidence Eric Larson Compiler.
POMDPs: 5 Reward Shaping: 4 Intrinsic RL: 4 Function Approximation: 3.
Network-Aware Scheduling for Data-Parallel Jobs: Plan When You Can
June 30 - July 2, 2009AIMS 2009 Towards Energy Efficient Change Management in A Cloud Computing Environment: A Pro-Active Approach H. AbdelSalamK. Maly.
Static Process Scheduling
Xi He Golisano College of Computing and Information Sciences Rochester Institute of Technology Rochester, NY THERMAL-AWARE RESOURCE.
Commentary on Controllability and Makespan Issues with Robot Action Planning and Execution Matthieu Gallien and Félix Ingrand, LAAS-CNRS Commentary by.
Workload Clustering for Increasing Energy Savings on Embedded MPSoCs S. H. K. Narayanan, O. Ozturk, M. Kandemir, M. Karakoy.
Urban Planning Group Implementation of a Model of Dynamic Activity- Travel Rescheduling Decisions: An Agent-Based Micro-Simulation Framework Theo Arentze,
Mobile Analyzer A Distributed Computing Platform Juho Karppinen Helsinki Institute of Physics Technology Program May 23th, 2002 Mobile.
INCOSE IW12 MBSE Workshop 15 INCOSE (MBSE) Model Based System Engineering Integration and Verification Scenario Ron Williamson, PhD Raytheon
Autonomy: Executive and Instruments Life in the Atacama 2004 Science & Technology Workshop Nicola Muscettola NASA Ames Reid Simmons Carnegie Mellon.
Application-Aware Traffic Scheduling for Workload Offloading in Mobile Clouds Liang Tong, Wei Gao University of Tennessee – Knoxville IEEE INFOCOM
1 Chapter 5 Branch-and-bound Framework and Its Applications.
Resource Optimization for Publisher/Subscriber-based Avionics Systems Institute for Software Integrated Systems Vanderbilt University Nashville, Tennessee.
Pradeep Konduri Static Process Scheduling:  Proceedance process model  Communication system model  Application  Dicussion.
Introduction to Performance Tuning Chia-heng Tu PAS Lab Summer Workshop 2009 June 30,
Ocean Observatories Initiative OOI CI Kick-Off Meeting Devils Thumb Ranch, Colorado September 9-11, 2009 Observation Planning and Autonomous Mission Execution.
Event Planner 2004 Peng Tea and Justin Quan. Introduction Friendster – a computer social network Evite – an online hub for party invites to gather and.
Using Abstraction to Coordinate Multiple Robotic Spacecraft Brad Clement, Tony Barrett, Gregg Rabideau Artificial Intelligence Group Jet Propulsion Laboratory.
Mission Planning Life in the Atacama 2004 Science & Technology Workshop Paul Tompkins Carnegie Mellon.
Optimal Acceleration and Braking Sequences for Vehicles in the Presence of Moving Obstacles Jeff Johnson, Kris Hauser School of Informatics and Computing.
Lecture 11: Tree Search © J. Christopher Beck 2008.
On Scheduling in Map-Reduce and Flow-Shops
Planning for Human-Robot Collaboration
Introduction to Scheduling Chapter 1
Laura Bright David Maier Portland State University
Topic 15 Job Shop Scheduling.
Presenter : Seokjun Lee Kyonggi University
Expedite Project Updates Using a Custom Status View
The MPAS project Multi-agent Pathfinding Algorithms Simulator
Presentation transcript:

Towards Proactive Replanning for Multi-Robot Teams Brennan Sellner and Reid Simmons 5th International Workshop on Planning and Scheduling for Space October 23, 2006 Trestle Project Robotics Institute Carnegie Mellon University

IWPSS Brennan Slide 2 Motivation Human workers: Predict likely outcomes Move between teams mid-task Can multi-robot teams do the same?

IWPSS Brennan Slide 3 What is Proactive Replanning? Predict problems and opportunities Replan before they manifest

IWPSS Brennan Slide 4 Idea Iterative repair planner Add Proactive Replanning Duration Prediction Live Task Modification Replan and modify active teams to: Forestall problems Grasp opportunities

IWPSS Brennan Slide 5 Results Preview Stochastic domain Metric is schedule makespan Makespan reductions of 11-32%

IWPSS Brennan Slide 6 Approach Overview Domain Architecture Duration Prediction Live Task Modification

IWPSS Brennan Slide 7 Domain Multi-agent, multi-team assembly Goal: Minimize schedule length

IWPSS Brennan Slide 8 Scenario

IWPSS Brennan Slide 9 Architecture Planner (ASPEN): Centralized Repairs & optimizes schedule Dispatches tasks Duration Prediction & Live Task Modification Executive: Manages execution of tasks Monitors resource usage Transmits state to planner Behavioral: Interfaces with hardware Transmits state to executive Behavioral and hardware both simulated

IWPSS Brennan Slide 10 Planner ASPEN: Iterative repair and optimization Duration Prediction within constraint network Live Task Modification during repair and optimization

IWPSS Brennan Slide 11 Planner: Conflict Resolution

IWPSS Brennan Slide 12 Planner: Optimization Metric: schedule length Use idle agents to: Start tasks on the “critical path” Speed up executing tasks on the critical path

IWPSS Brennan Slide 13 Duration Prediction: Why?

IWPSS Brennan Slide 14 Duration Prediction: How? Predict remaining duration at each timestep Replan in response Challenge: Accurate predictions within resource bounds Current approach: Offline simulation + lookup table

IWPSS Brennan Slide 15 Live Task Modification: Why?

IWPSS Brennan Slide 16 Live Task Modification: How? As part of schedule repair or optimization Heuristically select a new team Subject to constraints Currently assume instant transfers

IWPSS Brennan Slide 17 Live Task Modification: How? Challenge: search large space of teams and agents

IWPSS Brennan Slide 18 Experimental Results Scenario Conditions Data

IWPSS Brennan Slide 19 Experimental Scenario

IWPSS Brennan Slide 20 Experimental Approach 50 simulated assemblies per condition 4 conditions

IWPSS Brennan Slide 21 Baseline Condition ASPEN No Proactive Replanning Each time step: Right-shift Left-shift Optimize Repair

IWPSS Brennan Slide 22 Experimental Conditions Baseline, plus: Prediction, or: Live Modification, or: Combined

IWPSS Brennan Slide 23 Summary of Results

IWPSS Brennan Slide 24 Results Details 50 runs per condition mean (std dev) Baseline (ASPEN) PredictionModificationCombination Schedule length (s) (343.58) (273.32) (123.55) (141.53) Reduction in length ---- (----)10.8%30.3%31.8% Repair episodes (36.60) (23.06) (8.00) (23.86) Useful team modifications (6.15) (5.46) (6.19) (7.58)

IWPSS Brennan Slide 25 Future Work Function approximation and Duration Prediction Durative agent transfers Risk management

IWPSS Brennan Slide 26 Summary Initial implementation of Proactive Replanning Results are promising: Makespan reductions of up to 32% Further work is underway

IWPSS Brennan Slide 27 Thanks! The executive's first name was Tanner, A shy, but proactive, replanner Who solved every trouble With a change, on the double, Which finished the job in fine manner.