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

Slides:



Advertisements
Similar presentations
A Hierarchical Multiple Target Tracking Algorithm for Sensor Networks Songhwai Oh and Shankar Sastry EECS, Berkeley Nest Retreat, Jan
Advertisements

Coverage by Directional Sensors Jing Ai and Alhussein A. Abouzeid Dept. of Electrical, Computer and Systems Engineering Rensselaer Polytechnic Institute.
MULTI-ROBOT SYSTEMS Maria Gini (work with Elizabeth Jensen, Julio Godoy, Ernesto Nunes, abd James Parker,) Department of Computer Science and Engineering.
Integrated Coverage and Connectivity Configuration in Wireless Sensor Networks Xiaorui Wang, Guoliang Xing, Yuanfang Zhang*, Chenyang Lu, Robert Pless,
AIBO Common World Model Thomas Jellema Stephan Kempkes Emanuele Venneri Rob Verkuylen.
COORDINATION and NETWORKING of GROUPS OF MOBILE AUTONOMOUS AGENTS.
Target Tracking Algorithm based on Minimal Contour in Wireless Sensor Networks Jaehoon Jeong, Taehyun Hwang, Tian He, and David Du Department of Computer.
Fail-Safe Mobility Management and Collision Prevention Platform for Cooperative Mobile Robots with Asynchronous Communications Rami Yared School of Information.
Cognitive Colonization The Robotics Institute Carnegie Mellon University Bernardine Dias, Bruce Digney, Martial Hebert, Bart Nabbe, Tony Stentz, Scott.
Collaborative Robotics and Wireless Sensor Networks in Area-Coverage related Problems John Stergiopoulos Dept. Elect. & Comp. Eng. Univ. of Patras, Greece.
Real-Time Tracking of an Unpredictable Target Amidst Unknown Obstacles Cheng-Yu Lee Hector Gonzalez-Baños* Jean-Claude Latombe Computer Science Department.
Tracking a moving object with real-time obstacle avoidance Chung-Hao Chen, Chang Cheng, David Page, Andreas Koschan and Mongi Abidi Imaging, Robotics and.
Modified Particle Swarm Algorithm for Decentralized Swarm Agent 2004 IEEE International Conference on Robotic and Biomimetics Dong H. Kim Seiichi Shin.
Asynchronous Ad-hoc Leader Election in Complete Networks Nolan Irving.
Chess Review May 11, 2005 Berkeley, CA Tracking Multiple Objects using Sensor Networks and Camera Networks Songhwai Oh EECS, UC Berkeley
A Free Market Architecture for Distributed Control of a Multirobot System The Robotics Institute Carnegie Mellon University M. Bernardine Dias Tony Stentz.
A Probabilistic Approach to Collaborative Multi-robot Localization Dieter Fox, Wolfram Burgard, Hannes Kruppa, Sebastin Thrun Presented by Rajkumar Parthasarathy.
May 11, 2005 Tracking on a Graph Songhwai Oh Shankar Sastry Target trajectoriesEstimated tracks Tracking in Sensor Networks Target tracking is a representative.
1 Efficient Placement and Dispatch of Sensors in a Wireless Sensor Network Prof. Yu-Chee Tseng Department of Computer Science National Chiao-Tung University.
Multirobot Coordination in USAR Katia Sycara The Robotics Institute
Maximum Network lifetime in Wireless Sensor Networks with Adjustable Sensing Ranges Mihaela Cardei, Jie Wu, Mingming Lu, and Mohammad O. Pervaiz Department.
An Energy-efficient Target Tracking Algorithm in Wireless Sensor Networks Wang Duoqiang, Lv Mingke, Qin Qi School of Computer Science and technology Huazhong.
Optimal Placement and Selection of Camera Network Nodes for Target Localization A. O. Ercan, D. B. Yang, A. El Gamal and L. J. Guibas Stanford University.
Robotics.usc.edu/~embedded Physics-based Sensing and State Estimation Algorithms for Robotic Sensor Networks Gaurav. S. Sukhatme Robotic Embedded Systems.
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.
Nuttapon Boonpinon Advisor Dr. Attawith Sudsang Department of Computer Engineering,Chulalongkorn University Pattern Formation for Heterogeneous.
Multiple Autonomous Ground/Air Robot Coordination Exploration of AI techniques for implementing incremental learning. Development of a robot controller.
A Sweeper Scheme for Localization and Mobility Prediction in Underwater Acoustic Sensor Networks K. T. DharanC. Srimathi*Soo-Hyun Park VIT University Vellore,
Limits of Local Algorithms in Random Graphs
Suriya, A. September 19, 2015, Slide 0 Atipong Suriya School of MIME March 16, 2011 FE 640 : Term Project Presentation RFID Network Planning using Particle.
Algorithms for Robot-based Network Deployment, Repair, and Coverage Gaurav S. Sukhatme Center for Robotics and Embedded.
Intelligent Mobile Robotics Czech Technical University in Prague Libor Přeučil
Distributed Robotic Target Acquisition using Bluetooth Communication J.T. McClain, B.J. Wimpey, D.H. Barnhard, and W.D. Potter Artificial Intelligence.
Energy-Aware Scheduling with Quality of Surveillance Guarantee in Wireless Sensor Networks Jaehoon Jeong, Sarah Sharafkandi and David H.C. Du Dept. of.
DARPA TMR Program Collaborative Mobile Robots for High-Risk Urban Missions Third Quarterly IPR Meeting May 11, 1999 P. I.s: Leonidas J. Guibas and Jean-Claude.
Coordinated Sensor Deployment for Improving Secure Communications and Sensing Coverage Yinian Mao, Min Wu Security of ad hoc and Sensor Networks, Proceedings.
Co-Grid: an Efficient Coverage Maintenance Protocol for Distributed Sensor Networks Guoliang Xing; Chenyang Lu; Robert Pless; Joseph A. O ’ Sullivan Department.
Physics Based Formation Behavior in Autonomous Robots Mark Patterson.
1 Distributed and Optimal Motion Planning for Multiple Mobile Robots Yi Guo and Lynne Parker Center for Engineering Science Advanced Research Computer.
Selection and Navigation of Mobile sensor Nodes Using a Sensor Network Atul Verma, Hemjit Sawant and Jindong Tan Department of Electrical and Computer.
Zibin Zheng DR 2 : Dynamic Request Routing for Tolerating Latency Variability in Cloud Applications CLOUD 2013 Jieming Zhu, Zibin.
Multi-Robot System Application
Optimal Self-placement of Heterogeneous Mobile Sensors in Sensor Networks Lidan Miao AICIP Research Oct. 19, 2004.
` Robot Competition for “Dummies” EVQ#t=356 EVQ#t=356.
Chinh T. Vu, Yingshu Li Computer Science Department Georgia State University IEEE percom 2009 Delaunay-triangulation based complete coverage in wireless.
Performance of Adaptive Beam Nulling in Multihop Ad Hoc Networks Under Jamming Suman Bhunia, Vahid Behzadan, Paulo Alexandre Regis, Shamik Sengupta.
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.
Adaptive Tracking in Distributed Wireless Sensor Networks Lizhi Yang, Chuan Feng, Jerzy W. Rozenblit, Haiyan Qiao The University of Arizona Electrical.
1 Energy-Efficient Mobile Robot Exploration Yongguo Mei, Yung-Hsiang Lu Purdue University ICRA06.
Mobile Sensor Deployment for a Dynamic Cluster-based Target Tracking Sensor Network Niaoning Shan and Jindong Tan Department of Electrical and Computter.
U of Minnesota DIWANS'061 Energy-Aware Scheduling with Quality of Surveillance Guarantee in Wireless Sensor Networks Jaehoon Jeong, Sarah Sharafkandi and.
Mobile Sensor Network Deployment Using Potential Fields: A Distributed, Scalable Solution to the Area Coverage Problem Andrew Howard, Maja J Matari´c,
A Protocol for Tracking Mobile Targets using Sensor Networks H. Yang and B. Sikdar Department of Electrical, Computer and Systems Engineering Rensselaer.
Learning for Physically Diverse Robot Teams Robot Teams - Chapter 7 CS8803 Autonomous Multi-Robot Systems 10/3/02.
Problem Description: One line explanation of the problem to be solved Problem Description: One line explanation of the problem to be solved Proposed Solution:
Outline Introduction Network model Two-phase algorithm Simulation
Selection and Navigation of Mobile Sensor Nodes Using a Sensor Network Atul Verma, Hemjit Sawant and Jindong Tan Department of Electrical and Computer.
On Mobile Sink Node for Target Tracking in Wireless Sensor Networks Thanh Hai Trinh and Hee Yong Youn Pervasive Computing and Communications Workshops(PerComW'07)
Efficient Placement and Dispatch of Sensors in a Wireless Sensor Network You-Chiun Wang, Chun-Chi Hu, and Yu-Chee Tseng IEEE Transactions on Mobile Computing.
KAIS T Sensor Deployment Based on Virtual Forces Reference: Yi Zou and Krishnendu Chakarabarty, “Sensor Deployment and Target Localization Based on Virtual.
Of 17 Limits of Local Algorithms in Random Graphs Madhu Sudan MSR Joint work with David Gamarnik (MIT) 7/11/2013Local Algorithms on Random Graphs1.
Zijian Wang, Eyuphan Bulut, and Boleslaw K. Szymanski Center for Pervasive Computing and Networking and Department of Computer Science Rensselaer Polytechnic.
Flocks of Robots Coordinated Multi-robot Systems Dylan A. Shell Distributed AI Robotics Lab Department of Computer Science & Engineering Texas A&M University.
Implementing Interval Algebra to Schedule Mechanically Scanned Multistatic Radars Richard W Focke (CSIR & UCT) Leon O Wabeke (CSIR) J Pieter de Villiers.
Scalable and Distributed GPS free positioning for Sensor Networks Rajagopal Iyengear and Biplab Sikdar IEEE International Conference on Communications.
Prof. Yu-Chee Tseng Department of Computer Science
Market-based Dynamic Task Allocation in Mobile Surveillance Systems
Overview: Chapter 2 Localization and Tracking
Presentation transcript:

Distributed Algorithms for Multi-Robot Observation of Multiple Moving Targets Lynne E. Parker Autonomous Robots, 2002 Yousuf Ahmad Distributed Information Systems Lab School of Computer Science COMP765: Mobile Robotics Winter 2011

Outline Distributed Algorithms for Multi-Robot Observation of Multiple Moving Targets [Parker 2002] COMP765: Mobile Robotics [Winter 2011] 1. Introduction 2. Problem Description 3. Related Work 4. Approach 5. Experiments 6. Conclusion 2/42

Outline Distributed Algorithms for Multi-Robot Observation of Multiple Moving Targets [Parker 2002] COMP765: Mobile Robotics [Winter 2011] 1. Introduction 2. Problem Description 3. Related Work 4. Approach 5. Experiments 6. Conclusion 3/42

1. Introduction Distributed Algorithms for Multi-Robot Observation of Multiple Moving Targets [Parker 2002] COMP765: Mobile Robotics [Winter 2011]  Tracking a moving target  Multiple targets  Multiple observers  Mobile observers  Sensor placement  Coverage  Cooperation  Real-time  Applications  Surveillance  Search & Rescue 4/42

Outline Distributed Algorithms for Multi-Robot Observation of Multiple Moving Targets [Parker 2002] COMP765: Mobile Robotics [Winter 2011] 1. Introduction 2. Problem Description 3. Related Work 4. Approach 5. Experiments 6. Conclusion 5/42

2. Problem Description (1/5) Distributed Algorithms for Multi-Robot Observation of Multiple Moving Targets [Parker 2002] COMP765: Mobile Robotics [Winter 2011]  Cooperative Multi-Robot Observation of Multiple Moving Targets (CMOMMT) 6/42

2. Problem Description (1/5) Distributed Algorithms for Multi-Robot Observation of Multiple Moving Targets [Parker 2002] COMP765: Mobile Robotics [Winter 2011]  Cooperative Multi-Robot Observation of Multiple Moving Targets (CMOMMT) 7/42

2. Problem Description (1/5) Distributed Algorithms for Multi-Robot Observation of Multiple Moving Targets [Parker 2002] COMP765: Mobile Robotics [Winter 2011]  Cooperative Multi-Robot Observation of Multiple Moving Targets (CMOMMT) 8/42

2. Problem Description (2/5) Distributed Algorithms for Multi-Robot Observation of Multiple Moving Targets [Parker 2002] COMP765: Mobile Robotics [Winter 2011]  Cooperative Multi-Robot Observation of Multiple Moving Targets (CMOMMT) 9/42

2. Problem Description (3/5) Distributed Algorithms for Multi-Robot Observation of Multiple Moving Targets [Parker 2002] COMP765: Mobile Robotics [Winter 2011]  Cooperative Multi-Robot Observation of Multiple Moving Targets (CMOMMT) 10/42

2. Problem Description (3/5) Distributed Algorithms for Multi-Robot Observation of Multiple Moving Targets [Parker 2002] COMP765: Mobile Robotics [Winter 2011]  Cooperative Multi-Robot Observation of Multiple Moving Targets (CMOMMT) 11/42

2. Problem Description (4/5) Distributed Algorithms for Multi-Robot Observation of Multiple Moving Targets [Parker 2002] COMP765: Mobile Robotics [Winter 2011]  Cooperative Multi-Robot Observation of Multiple Moving Targets (CMOMMT)  Goal: Maximize average num of targets observed by at least one robot throughout a mission of total duration T. 12/42

2. Problem Description (5/5) Distributed Algorithms for Multi-Robot Observation of Multiple Moving Targets [Parker 2002] COMP765: Mobile Robotics [Winter 2011]  Cooperative Multi-Robot Observation of Multiple Moving Targets (CMOMMT)  Robots employ limited-range broadcast communication  Robots can move faster than targets  Robots move within a shared global coordinate system 13/42

Outline Distributed Algorithms for Multi-Robot Observation of Multiple Moving Targets [Parker 2002] COMP765: Mobile Robotics [Winter 2011] 1. Introduction 2. Problem Description 3. Related Work 4. Approach 5. Experiments 6. Conclusion 14/42

3. Related Work Distributed Algorithms for Multi-Robot Observation of Multiple Moving Targets [Parker 2002] COMP765: Mobile Robotics [Winter 2011]  Mostly centralized algorithms  Complex environments  Computationally expensive  Do not scale well  Off-line  Single vs. multiple targets/observers  Trajectory analysis 15/42

Outline Distributed Algorithms for Multi-Robot Observation of Multiple Moving Targets [Parker 2002] COMP765: Mobile Robotics [Winter 2011] 1. Introduction 2. Problem Description 3. Related Work 4. Approach 5. Experiments 6. Conclusion 16/42

4. Approach (1/5) Distributed Algorithms for Multi-Robot Observation of Multiple Moving Targets [Parker 2002] COMP765: Mobile Robotics [Winter 2011] 17/42

4. Approach (2/5) Distributed Algorithms for Multi-Robot Observation of Multiple Moving Targets [Parker 2002] COMP765: Mobile Robotics [Winter 2011]  No centralized control  Collective autonomy  Behavioral motivations  Broadcast communication  Adaptive & fault-tolerant  Robot failures  Mission/team changes  Communication failures/noise 18/42

4. Approach (3/5) Distributed Algorithms for Multi-Robot Observation of Multiple Moving Targets [Parker 2002] COMP765: Mobile Robotics [Winter 2011]  Sensing  Robots, targets, obstacles  Limited-range  Cooperative 19/42

4. Approach (3/5) Distributed Algorithms for Multi-Robot Observation of Multiple Moving Targets [Parker 2002] COMP765: Mobile Robotics [Winter 2011]  Sensing  Robots, targets, obstacles  Limited-range  Cooperative  Global positioning system 20/42

4. Approach (4/5) Distributed Algorithms for Multi-Robot Observation of Multiple Moving Targets [Parker 2002] COMP765: Mobile Robotics [Winter 2011]  Force vectors  Local  Weighted  Reduce overlap  Summed 21/42

4. Approach (5/5) Distributed Algorithms for Multi-Robot Observation of Multiple Moving Targets [Parker 2002] COMP765: Mobile Robotics [Winter 2011]  Force vectors 22/42

4. Approach (5/5) Distributed Algorithms for Multi-Robot Observation of Multiple Moving Targets [Parker 2002] COMP765: Mobile Robotics [Winter 2011]  Force vectors  Initialization 23/42

Outline Distributed Algorithms for Multi-Robot Observation of Multiple Moving Targets [Parker 2002] COMP765: Mobile Robotics [Winter 2011] 1. Introduction 2. Problem Description 3. Related Work 4. Approach 5. Experiments 6. Conclusion 24/42

5. Experiments (1/15) Distributed Algorithms for Multi-Robot Observation of Multiple Moving Targets [Parker 2002] COMP765: Mobile Robotics [Winter 2011]  Platform 1. Simulation 2. Physical  Robot control 1. A-CMOMMTweighted force vectors 2. Localnon-weighted 3. Random 4. Fixed  Target control 1. Random/linear 2. Evasivesimulation only  Obstacles 25/42

5. Experiments (2/15) Distributed Algorithms for Multi-Robot Observation of Multiple Moving Targets [Parker 2002] COMP765: Mobile Robotics [Winter 2011] 26/42

5. Experiments (3/15) Distributed Algorithms for Multi-Robot Observation of Multiple Moving Targets [Parker 2002] COMP765: Mobile Robotics [Winter 2011] 27/42

5. Experiments (4/15) Distributed Algorithms for Multi-Robot Observation of Multiple Moving Targets [Parker 2002] COMP765: Mobile Robotics [Winter 2011] 28/42

5. Experiments (5/15) Distributed Algorithms for Multi-Robot Observation of Multiple Moving Targets [Parker 2002] COMP765: Mobile Robotics [Winter 2011] 29/42

5. Experiments (6/15) Distributed Algorithms for Multi-Robot Observation of Multiple Moving Targets [Parker 2002] COMP765: Mobile Robotics [Winter 2011] 30/42

5. Experiments (7/15) Distributed Algorithms for Multi-Robot Observation of Multiple Moving Targets [Parker 2002] COMP765: Mobile Robotics [Winter 2011] 31/42

5. Experiments (8/15) Distributed Algorithms for Multi-Robot Observation of Multiple Moving Targets [Parker 2002] COMP765: Mobile Robotics [Winter 2011] 32/42

5. Experiments (9/15) Distributed Algorithms for Multi-Robot Observation of Multiple Moving Targets [Parker 2002] COMP765: Mobile Robotics [Winter 2011] 33/42

5. Experiments (10/15) Distributed Algorithms for Multi-Robot Observation of Multiple Moving Targets [Parker 2002] COMP765: Mobile Robotics [Winter 2011] 34/42

5. Experiments (11/15) Distributed Algorithms for Multi-Robot Observation of Multiple Moving Targets [Parker 2002] COMP765: Mobile Robotics [Winter 2011] 35/42

5. Experiments (12/15) Distributed Algorithms for Multi-Robot Observation of Multiple Moving Targets [Parker 2002] COMP765: Mobile Robotics [Winter 2011] 36/42

5. Experiments (13/15) Distributed Algorithms for Multi-Robot Observation of Multiple Moving Targets [Parker 2002] COMP765: Mobile Robotics [Winter 2011] 37/42

5. Experiments (14/15) Distributed Algorithms for Multi-Robot Observation of Multiple Moving Targets [Parker 2002] COMP765: Mobile Robotics [Winter 2011] 38/42

5. Experiments (15/15) Distributed Algorithms for Multi-Robot Observation of Multiple Moving Targets [Parker 2002] COMP765: Mobile Robotics [Winter 2011] 39/42

Outline Distributed Algorithms for Multi-Robot Observation of Multiple Moving Targets [Parker 2002] COMP765: Mobile Robotics [Winter 2011] 1. Introduction 2. Problem Description 3. Related Work 4. Approach 5. Experiments 6. Conclusion 40/42

6. Conclusion Distributed Algorithms for Multi-Robot Observation of Multiple Moving Targets [Parker 2002] COMP765: Mobile Robotics [Winter 2011]  Cooperative multi-robot observation of multiple moving targets  Distributed approach  Weighted local force vectors  Comparison  Weighted vs. non-weighted  Heuristic vs. random vs. fixed  Random/linear vs. evasive  Other interesting approaches  Multi-robot learning  Other interesting applications  Border security  AQUA team 41/42

Thank you! Distributed Algorithms for Multi-Robot Observation of Multiple Moving Targets [Parker 2002] COMP765: Mobile Robotics [Winter 2011]  Questions? 42/42