Dynamic Mission Planning for Multiple Mobile Robots Barry Brumitt and Anthony Stentz 26 Oct, 1999 AMRS-99 Class Presentation Brian Chemel.

Slides:

Advertisements

Similar presentations

Manuela Veloso, Anthony Stentz, Alexander Rudnicky Brett Browning, M. Bernardine Dias Faculty Thomas Harris, Brenna Argall, Gil Jones Satanjeev Banerjee.

Advertisements

D* Lite an incremental version of A* for navigating in unknown terrain Focussed Dynamic A* It implements the same behavior as Stentz’

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.

Learning from Demonstrations Jur van den Berg. Kalman Filtering and Smoothing Dynamics and Observation model Kalman Filter: – Compute – Real-time, given.

CS 795 – Spring  “Software Systems are increasingly Situated in dynamic, mission critical settings ◦ Operational profile is dynamic, and depends.

Robot Localization Using Bayesian Methods

Projects. 1. Path planning – Input: 2D map, initial location, destination Output: waypoints (or false if there is no path). – Input: 2D map, initial location,

Yiannis Demiris and Anthony Dearden By James Gilbert.

Multi-agent Planning Amin Atrash. Papers Dynamic Planning for Multiple Mobile Robots –Barry L. Brummit, Anthony Stentz OBDD-based Universal Planning:

DESIGN OF A GENERIC PATH PATH PLANNING SYSTEM AILAB Path Planning Workgroup.

1 E190Q – Project Introduction Autonomous Robot Navigation Team Member 1 Name Team Member 2 Name.

A Cloud-Assisted Design for Autonomous Driving Swarun Kumar Shyamnath Gollakota and Dina Katabi.

What Are Partially Observable Markov Decision Processes and Why Might You Care? Bob Wall CS 536.

Large Scale Navigation Based on Perception Maria Joao Rendas I3S, CNRS-UNSA.

Cognitive Colonization The Robotics Institute Carnegie Mellon University Bernardine Dias, Bruce Digney, Martial Hebert, Bart Nabbe, Tony Stentz, Scott.

Autonomous Robot Navigation Panos Trahanias ΗΥ475 Fall 2007.

Blue Bear Systems Research Hardware Architectures for Distributed Agents Dr Simon Willcox 24 th Soar Workshop 9 th – 11 th June 2004 Building 32, Twinwoods.

Situational Planning for the MIT DARPA Challenge Vehicle Thomas Coffee Image Credit: David Moore et al.

Brent Dingle Marco A. Morales Texas A&M University, Spring 2002

Cognitive Colonization Tony Stentz, Martial Hebert, Bruce Digney, Scott Thayer Robotics Institute Carnegie Mellon University.

A Free Market Architecture for Distributed Control of a Multirobot System The Robotics Institute Carnegie Mellon University M. Bernardine Dias Tony Stentz.

Field Navigational GPS Robot Final Presentation & Review Chris Foley, Kris Horn, Richard Neil Pittman, Michael Willis.

Motor Schema Based Navigation for a Mobile Robot: An Approach to Programming by Behavior Ronald C. Arkin Reviewed By: Chris Miles.

Multirobot Coordination in USAR Katia Sycara The Robotics Institute

On the Task Assignment Problem : Two New Efficient Heuristic Algorithms.

Behavior- Based Approaches Behavior- Based Approaches.

Distributed Robot Agent Brent Dingle Marco A. Morales.

Motion Planning in Dynamic Environments Two Challenges for Optimal Path planning.

Traffic Sign Recognition Jacob Carlson Sean St. Onge Advisor: Dr. Thomas L. Stewart.

Chapter 10: Architectural Design

8/9/20151 DARPA-MARS Kickoff Adaptive Intelligent Mobile Robots Leslie Pack Kaelbling Artificial Intelligence Laboratory MIT.

What is it? A mobile robotics system controls a manned or partially manned vehicle-car, submarine, space vehicle | Website for Students.

CS Reinforcement Learning1 Reinforcement Learning Variation on Supervised Learning Exact target outputs are not given Some variation of reward is.

June 12, 2001 Jeong-Su Han An Autonomous Vehicle for People with Motor Disabilities by G. Bourhis, O.Horn, O.Habert and A. Pruski Paper Review.

Intelligent Agents. Software agents O Monday: O Overview video (Introduction to software agents) O Agents and environments O Rationality O Wednesday:

Zereik E., Biggio A., Merlo A. and Casalino G. EUCASS 2011 – 4-8 July, St. Petersburg, Russia.

JPL Robotics Technology Program Rover Navigation for Very Rough Terrain - 1 Overview (GUI Part) 1.pRRT Viewer Initialization Execute Vortex_Runner (Vortex_Visualizer)

VOLTAGE SCHEDULING HEURISTIC for REAL-TIME TASK GRAPHS D. Roychowdhury, I. Koren, C. M. Krishna University of Massachusetts, Amherst Y.-H. Lee Arizona.

Sérgio Ronaldo Barros dos Santos (ITA-Brazil) Sidney Nascimento Givigi Júnior (RMC-Canada) Cairo Lúcio Nascimento Júnior (ITA-Brazil) Autonomous Construction.

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.

Cooperating AmigoBots Framework and Algorithms

Introduction to AI Robotics Chapter 2. The Hierarchical Paradigm Hyeokjae Kwon.

Faculty: Manuela Veloso, Anthony Stentz, Alex Rudnicky Brett Browning, M. Bernardine Dias Students: Thomas Harris, Brenna Argall, Gil Jones Satanjeev Banerjee.

Stochastic DAG Scheduling using Monte Carlo Approach Heterogeneous Computing Workshop (at IPDPS) 2012 Extended version: Elsevier JPDC (accepted July 2013,

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.

Distributed Algorithms for Multi-Robot Observation of Multiple Moving Targets Lynne E. Parker Autonomous Robots, 2002 Yousuf Ahmad Distributed Information.

Real-Time Simultaneous Localization and Mapping with a Single Camera (Mono SLAM) Young Ki Baik Computer Vision Lab. Seoul National University.

Learning to Navigate Through Crowded Environments Peter Henry 1, Christian Vollmer 2, Brian Ferris 1, Dieter Fox 1 Tuesday, May 4, University of.

Intelligence Surveillance and Reconnaissance System for California Wildfire Detection Presented by- Shashank Tamaskar Purdue University

Introduction to Artificial Intelligence CS 438 Spring 2008 Today –AIMA, Ch. 25 –Robotics Thursday –Robotics continued Home Work due next Tuesday –Ch. 13:

Abstract A Structured Approach for Modular Design: A Plug and Play Middleware for Sensory Modules, Actuation Platforms, Task Descriptions and Implementations.

Mike Graves Summer 2005 University of Texas at Dallas Implicit Invocation: The Task Control Architecture Mike Graves CS6362 Term Paper Dr. Lawrence Chung.

CBR and CNP Applied to Litoral Reconnaissance Goal: –Apply the research on the integration of CBR mission specification with CNP task allocation towards.

Behavior-based Multirobot Architectures. Why Behavior Based Control for Multi-Robot Teams? Multi-Robot control naturally grew out of single robot control.

Thrust IIB: Dynamic Task Allocation in Remote Multi-robot HRI Jon How (lead) Nick Roy MURI 8 Kickoff Meeting 2007.

1 Travel Times from Mobile Sensors Ram Rajagopal, Raffi Sevlian and Pravin Varaiya University of California, Berkeley Singapore Road Traffic Control TexPoint.

Antidio Viguria Ann Krueger A Nonblocking Quorum Consensus Protocol for Replicated Data Divyakant Agrawal and Arthur J. Bernstein Paper Presentation: Dependable.

MIT Dept of Aeronautics and Astronautics March 21, 2003 Graduate Open House Programming Cooperative Teams To Perform Global Science HOME TWO Enroute COLLECTION.

Discriminative n-gram language modeling Brian Roark, Murat Saraclar, Michael Collins Presented by Patty Liu.

Vision-Guided Humanoid Footstep Planning for Dynamic Environments

Project Objective Develop Mission control architecture for Autonomous System (AS) Designing the mission controller It guides the AS to execute certain.

Timothy Boger and Mike Korostelev

Multiple Robot navigation and Mapping for Combat environment

E190Q – Project Introduction Autonomous Robot Navigation

Reinforcement Learning with Partially Known World Dynamics

EA C461 – Artificial Intelligence Problem Solving Agents

Market-based Dynamic Task Allocation in Mobile Surveillance Systems

Presented By: Darlene Banta

Presentation transcript:

Dynamic Mission Planning for Multiple Mobile Robots Barry Brumitt and Anthony Stentz 26 Oct, 1999 AMRS-99 Class Presentation Brian Chemel

Dynamic Mission Planning for Multiple Mobile Robots Overview Problem description Mission grammar System architecture: GRAMMPS Brief digression: D* Results Analysis and limitations

Dynamic Mission Planning for Multiple Mobile Robots Problem Description: Environment Dynamic, complex environment Typical situation  World state initially unknown  Runtime observations incorporated into shared world model

Dynamic Mission Planning for Multiple Mobile Robots Problem Description: Robots Multiple, heterogeneous mobile robots Assumptions  Robots have relatively open workspaces, so solution set is not too sparse  Effective positioning, communication and perception are a given

Dynamic Mission Planning for Multiple Mobile Robots Problem Description: Goals Robot task: move to specified locations, in specified order Reconnaissance example  Waypoints to be scouted by team of robots Warehouse example  Multiple pickup points, to be followed by multiple delivery points

Dynamic Mission Planning for Multiple Mobile Robots Problem Description: GRAMMPS Planner Military reconnaissance task Outdoor environment Multiple robot vehicles (Navlab HMMWV’s, in practice) Multiple distributed goals, with sequencing  Requires mission grammar to pass parameters to distributed planning system

Dynamic Mission Planning for Multiple Mobile Robots Mission Grammar ExpressionMeaning “Do A, then do B” A OR B A AND B Robot i Goal j “Move robot r to goal g”

Dynamic Mission Planning for Multiple Mobile Robots Mission Grammar: Example “Move either robot 1 or robot 2 to goals 1, 2, 3, and 4. Then move both robots 1 and 2 to goal 5.”

Dynamic Mission Planning for Multiple Mobile Robots System Architecture: Overview Global (shared) dynamic planners Global (shared) mission planner Local (individual) plan execution Mission Planner D* … Dynamic Planners (one per goal) Robot 1Robot 2Robot n …

Dynamic Mission Planning for Multiple Mobile Robots System Architecture: Local Navigators Input Path to assigned goal Perception information Output Steering commands Mission Planner D* … Dynamic Planners (one per goal) Robot 1Robot 2Robot n …

Dynamic Mission Planning for Multiple Mobile Robots System Architecture: Mission Planner Input Estimated path costs for each (robot,goal) pair Output Mapping from robots to goals Algorithm TSP heuristic Mission Planner D* … Dynamic Planners (one per goal) Robot 1Robot 2Robot n …

Dynamic Mission Planning for Multiple Mobile Robots System Architecture: Dynamic Planners Input Current world state knowledge Output Path to each goal for each robot Planning algorithm D* Mission Planner D* … Dynamic Planners (one per goal) Robot 1Robot 2Robot n …

Dynamic Mission Planning for Multiple Mobile Robots Brief Digression: The D* Algorithm Modification of the A* planning algorithm Provides efficient, optimal and complete path planning in unknown, partially known, and changing environments As new information about the environment is learned, cost information is propagated through state space Each time new information makes previous path calculations obsolete, a new path is calculated Original paper: Stentz, ICRA ‘94

Dynamic Mission Planning for Multiple Mobile Robots Example: Simulation Initial Plan Mission statement:

Dynamic Mission Planning for Multiple Mobile Robots Example: Simulation Final Plan Goals re-assigned on the fly Mission successfully completed

Dynamic Mission Planning for Multiple Mobile Robots Highlights Demonstration implementation on Navlab HMMWVs allows real-time, team-based mission planning in dynamic environments System scales gracefully up to large numbers of robots and goals

Dynamic Mission Planning for Multiple Mobile Robots Limitations Waypoint task structure is very limiting No discussion of how to modify TSP approach to allow heterogeneity One robot must act as “leader” of the entire team When D* fails, system can lock up

Dynamic Mission Planning for Multiple Mobile Robots Related Work Stentz, T. “Optimal and Efficient Path Planning for Partially-Known Environments.” ICRA ’94 Brumitt, B., Stentz, T. “GRAMMPS: A Generalized Mission Planner for Multiple Mobile Robots in Unstructured Environments.” ICRA ‘98 Brumitt, B., Hebert, M. “Experiments in Autonomous Driving With Concurrent Goals and Multiple Vehicles.” ICRA ‘98