420 likes | 533 Views
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. Introduction Problem Description
E N D
Distributed Algorithms for Multi-Robot Observation of Multiple Moving TargetsLynne E. ParkerAutonomous Robots, 2002 Yousuf Ahmad Distributed Information Systems Lab School of Computer Science • COMP765: Mobile Robotics • Winter 2011
Outline • Introduction • Problem Description • Related Work • Approach • Experiments • Conclusion Distributed Algorithms for Multi-Robot Observation of Multiple Moving Targets [Parker 2002] COMP765: Mobile Robotics [Winter 2011]
Outline • Introduction • Problem Description • Related Work • Approach • Experiments • Conclusion Distributed Algorithms for Multi-Robot Observation of Multiple Moving Targets [Parker 2002] COMP765: Mobile Robotics [Winter 2011]
1. Introduction • Tracking a moving target • Multiple targets • Multiple observers • Mobile observers • Sensor placement • Coverage • Cooperation • Real-time • Applications • Surveillance • Search & Rescue Distributed Algorithms for Multi-Robot Observation of Multiple Moving Targets [Parker 2002] COMP765: Mobile Robotics [Winter 2011]
Outline • Introduction • Problem Description • Related Work • Approach • Experiments • Conclusion Distributed Algorithms for Multi-Robot Observation of Multiple Moving Targets [Parker 2002] COMP765: Mobile Robotics [Winter 2011]
2. Problem Description (1/5) • Cooperative Multi-Robot Observation of Multiple Moving Targets (CMOMMT) Distributed Algorithms for Multi-Robot Observation of Multiple Moving Targets [Parker 2002] COMP765: Mobile Robotics [Winter 2011]
2. Problem Description (1/5) • Cooperative Multi-Robot Observation of Multiple Moving Targets (CMOMMT) Distributed Algorithms for Multi-Robot Observation of Multiple Moving Targets [Parker 2002] COMP765: Mobile Robotics [Winter 2011]
2. Problem Description (1/5) • Cooperative Multi-Robot Observation of Multiple Moving Targets (CMOMMT) Distributed Algorithms for Multi-Robot Observation of Multiple Moving Targets [Parker 2002] COMP765: Mobile Robotics [Winter 2011]
2. Problem Description (2/5) • Cooperative Multi-Robot Observation of Multiple Moving Targets (CMOMMT) Distributed Algorithms for Multi-Robot Observation of Multiple Moving Targets [Parker 2002] COMP765: Mobile Robotics [Winter 2011]
2. Problem Description (3/5) • Cooperative Multi-Robot Observation of Multiple Moving Targets (CMOMMT) Distributed Algorithms for Multi-Robot Observation of Multiple Moving Targets [Parker 2002] COMP765: Mobile Robotics [Winter 2011]
2. Problem Description (3/5) • Cooperative Multi-Robot Observation of Multiple Moving Targets (CMOMMT) Distributed Algorithms for Multi-Robot Observation of Multiple Moving Targets [Parker 2002] COMP765: Mobile Robotics [Winter 2011]
2. Problem Description (4/5) • Cooperative Multi-Robot Observation of Multiple Moving Targets (CMOMMT) • Goal: Maximize average num of targets observed by at least one robotthroughout a mission of total duration T. Distributed Algorithms for Multi-Robot Observation of Multiple Moving Targets [Parker 2002] COMP765: Mobile Robotics [Winter 2011]
2. Problem Description (5/5) • 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 Distributed Algorithms for Multi-Robot Observation of Multiple Moving Targets [Parker 2002] COMP765: Mobile Robotics [Winter 2011]
Outline • Introduction • Problem Description • Related Work • Approach • Experiments • Conclusion Distributed Algorithms for Multi-Robot Observation of Multiple Moving Targets [Parker 2002] COMP765: Mobile Robotics [Winter 2011]
3. Related Work • Mostly centralized algorithms • Complex environments • Computationally expensive • Do not scale well • Off-line • Single vs. multiple targets/observers • Trajectory analysis Distributed Algorithms for Multi-Robot Observation of Multiple Moving Targets [Parker 2002] COMP765: Mobile Robotics [Winter 2011]
Outline • Introduction • Problem Description • Related Work • Approach • Experiments • Conclusion Distributed Algorithms for Multi-Robot Observation of Multiple Moving Targets [Parker 2002] COMP765: Mobile Robotics [Winter 2011]
4. Approach (1/5) Distributed Algorithms for Multi-Robot Observation of Multiple Moving Targets [Parker 2002] COMP765: Mobile Robotics [Winter 2011]
4. Approach (2/5) • No centralized control • Collective autonomy • Behavioral motivations • Broadcast communication • Adaptive & fault-tolerant • Robot failures • Mission/team changes • Communication failures/noise Distributed Algorithms for Multi-Robot Observation of Multiple Moving Targets [Parker 2002] COMP765: Mobile Robotics [Winter 2011]
4. Approach (3/5) • Sensing • Robots, targets, obstacles • Limited-range • Cooperative Distributed Algorithms for Multi-Robot Observation of Multiple Moving Targets [Parker 2002] COMP765: Mobile Robotics [Winter 2011]
4. Approach (3/5) • Sensing • Robots, targets, obstacles • Limited-range • Cooperative • Global positioning system Distributed Algorithms for Multi-Robot Observation of Multiple Moving Targets [Parker 2002] COMP765: Mobile Robotics [Winter 2011]
4. Approach (4/5) • Force vectors • Local • Weighted • Reduce overlap • Summed Distributed Algorithms for Multi-Robot Observation of Multiple Moving Targets [Parker 2002] COMP765: Mobile Robotics [Winter 2011]
4. Approach (5/5) • Force vectors Distributed Algorithms for Multi-Robot Observation of Multiple Moving Targets [Parker 2002] COMP765: Mobile Robotics [Winter 2011]
4. Approach (5/5) • Force vectors • Initialization Distributed Algorithms for Multi-Robot Observation of Multiple Moving Targets [Parker 2002] COMP765: Mobile Robotics [Winter 2011]
Outline • Introduction • Problem Description • Related Work • Approach • Experiments • Conclusion Distributed Algorithms for Multi-Robot Observation of Multiple Moving Targets [Parker 2002] COMP765: Mobile Robotics [Winter 2011]
5. Experiments (1/15) • Platform • Simulation • Physical • Robot control • A-CMOMMT weighted force vectors • Local non-weighted • Random • Fixed • Target control • Random/linear • Evasive simulation only • Obstacles Distributed Algorithms for Multi-Robot Observation of Multiple Moving Targets [Parker 2002] COMP765: Mobile Robotics [Winter 2011]
5. Experiments (2/15) Distributed Algorithms for Multi-Robot Observation of Multiple Moving Targets [Parker 2002] COMP765: Mobile Robotics [Winter 2011]
5. Experiments (3/15) Distributed Algorithms for Multi-Robot Observation of Multiple Moving Targets [Parker 2002] COMP765: Mobile Robotics [Winter 2011]
5. Experiments (4/15) Distributed Algorithms for Multi-Robot Observation of Multiple Moving Targets [Parker 2002] COMP765: Mobile Robotics [Winter 2011]
5. Experiments (5/15) Distributed Algorithms for Multi-Robot Observation of Multiple Moving Targets [Parker 2002] COMP765: Mobile Robotics [Winter 2011]
5. Experiments (6/15) Distributed Algorithms for Multi-Robot Observation of Multiple Moving Targets [Parker 2002] COMP765: Mobile Robotics [Winter 2011]
5. Experiments (7/15) Distributed Algorithms for Multi-Robot Observation of Multiple Moving Targets [Parker 2002] COMP765: Mobile Robotics [Winter 2011]
5. Experiments (8/15) Distributed Algorithms for Multi-Robot Observation of Multiple Moving Targets [Parker 2002] COMP765: Mobile Robotics [Winter 2011]
5. Experiments (9/15) Distributed Algorithms for Multi-Robot Observation of Multiple Moving Targets [Parker 2002] COMP765: Mobile Robotics [Winter 2011]
5. Experiments (10/15) Distributed Algorithms for Multi-Robot Observation of Multiple Moving Targets [Parker 2002] COMP765: Mobile Robotics [Winter 2011]
5. Experiments (11/15) Distributed Algorithms for Multi-Robot Observation of Multiple Moving Targets [Parker 2002] COMP765: Mobile Robotics [Winter 2011]
5. Experiments (12/15) Distributed Algorithms for Multi-Robot Observation of Multiple Moving Targets [Parker 2002] COMP765: Mobile Robotics [Winter 2011]
5. Experiments (13/15) Distributed Algorithms for Multi-Robot Observation of Multiple Moving Targets [Parker 2002] COMP765: Mobile Robotics [Winter 2011]
5. Experiments (14/15) Distributed Algorithms for Multi-Robot Observation of Multiple Moving Targets [Parker 2002] COMP765: Mobile Robotics [Winter 2011]
5. Experiments (15/15) Distributed Algorithms for Multi-Robot Observation of Multiple Moving Targets [Parker 2002] COMP765: Mobile Robotics [Winter 2011]
Outline • Introduction • Problem Description • Related Work • Approach • Experiments • Conclusion Distributed Algorithms for Multi-Robot Observation of Multiple Moving Targets [Parker 2002] COMP765: Mobile Robotics [Winter 2011]
6. Conclusion • 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 Distributed Algorithms for Multi-Robot Observation of Multiple Moving Targets [Parker 2002] COMP765: Mobile Robotics [Winter 2011]
Thank you! • Questions? Distributed Algorithms for Multi-Robot Observation of Multiple Moving Targets [Parker 2002] COMP765: Mobile Robotics [Winter 2011]