DMCA
Distributed Algorithms for Multi-Robot Observation of Multiple Moving Targets (2002)
Cached
Download Links
- [www.cs.utk.edu]
- [web.eecs.utk.edu]
- [web.eecs.utk.edu]
- DBLP
Other Repositories/Bibliography
| Venue: | Autonomous Robots |
| Citations: | 103 - 4 self |
BibTeX
@ARTICLE{Parker02distributedalgorithms,
author = {Lynne E. Parker},
title = {Distributed Algorithms for Multi-Robot Observation of Multiple Moving Targets},
journal = {Autonomous Robots},
year = {2002},
volume = {12},
pages = {231--255}
}
Share
 |
 |
 |
 |
||
OpenURL
Abstract
An important issue that arises in the automation of many security, surveillance, and reconnaissance tasks is that of observing the movements of targets navigating in a bounded area of interest. A key research issue in these problems is that of sensor placement -- determining where sensors should be located to maintain the targets in view. In complex applications involving limited-range sensors, the use of multiple sensors dynamically moving over time is required. In this paper, we investigate the use of a cooperative team of autonomous sensor-based robots for the observation of multiple moving targets. In other research, analytical techniques have been developed for solving this problem in complex geometrical environments. However, these previous approaches are very computationally expensive - at least exponential in the number of robots -- and cannot be implemented on robots operating in real-time. Thus, this paper reports on our studies of a simpler problem involving uncluttered environments -- those with either no obstacles or with randomly distributed simple convex obstacles. We focus primarily on developing the on-line distributed control strategies that allow the robot team to attempt to minimize the total time in which targets escape observation by some robot team member in the area of interest. This paper first formalizes the problem (which we term CMOMMT for Cooperative Multi-Robot Observation of Multiple Moving Targets) and discusses related work. We then present a distributed heuristic approach (which we call A-CMOMMT) for solving the CMOMMT problem that uses weighted local force vector control. We analyze the effectiveness of the resulting weighted force vector approach by comparing it to three other approaches. We present the results of our experiments in...
Keyphrases
multiple moving target multi-robot observation uncluttered environment complex application robot team simple convex obstacle discus related work term cmommt cooperative multi-robot observation bounded area many security weighted force vector approach local force vector control on-line distributed control robot team member complex geometrical environment key research issue reconnaissance task simpler problem cmommt problem cooperative team heuristic approach analytical technique total time limited-range sensor important issue previous approach autonomous sensor-based robot multiple sensor sensor placement
