Cooperative Minimum Time Surveillance With Multiple Ground Vehicles
By David A. Anisi, Petter Ögren, Xiaoming Hu. 2010
46 citations recorded by the source corpus.
In this paper, we formulate and solve two different minimum time problems related to unmanned ground vehicle (UGV) surveillance. The first problem is the following. Given a set of surveillance UGVs and a polyhedral area, find waypoint-paths for all UGVs such that every point of the area is visible from a point on a path and such that the time for executing the search in parallel is minimized. Here, the sensors' field of view are assumed to have a limited coverage range and be occluded by the obstacles.
Subfields: Aerospace Engineering, Computer Networks and Communications, Computer Vision and Pattern Recognition
How researchers see this paper
The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.
In Aerospace Engineering
- Yongcan Cao
- Guanrong Chen
- Wei Ren
- Wenwu Yu
- Shimon Whiteson
- Aryan Mokhtari
- Jean-Jacques E. Slotine
- Alejandro Ribeiro
In Computer Networks and Communications
In Computer Vision and Pattern Recognition
- Guanrong Chen
- Wei Ren
- Wenwu Yu
- Yongcan Cao
- Shimon Whiteson
- Aryan Mokhtari
- Alejandro Ribeiro
- Shujun Li
Citations in the corpus
- An Overview of Recent Progress in the Study of Distributed Multi-Agent Coordination (2012, background): “Recent research in distributed surveillance has been repor ted in [262]–[269], where a number of physical limitations were identified and considered such as time dela y and uncertainties [ 265], [268], collision”