Theoretical Analysis of the Multi-agent Patrolling Problem
IAT '04 Proceedings of the IEEE/WIC/ACM International Conference on Intelligent Agent Technology
A realistic model of frequency-based multi-robot polyline patrolling
Proceedings of the 7th international joint conference on Autonomous agents and multiagent systems - Volume 1
On redundancy, efficiency, and robustness in coverage for multiple robots
Robotics and Autonomous Systems
Multiple Heterogeneous Unmanned Aerial Vehicles
Multiple Heterogeneous Unmanned Aerial Vehicles
Multi-robot adversarial patrolling: facing a full-knowledge opponent
Journal of Artificial Intelligence Research
Decentralized Perimeter Surveillance Using a Team of UAVs
IEEE Transactions on Robotics
Cooperative Large Area Surveillance with a Team of Aerial Mobile Robots for Long Endurance Missions
Journal of Intelligent and Robotic Systems
Hi-index | 0.00 |
This paper presents a decentralized algorithm for area partition in surveillance missions that ensures information propagation among all the robots in the team. The robots have short communication ranges compared to the size of the area to be covered, so a distributed one-to-one coordination schema has been adopted. The goal of the team is to minimize the elapsed time between two consecutive observations of any point in the area. A grid-shape area partition strategy has been designed to guarantee that the information gathered by any robot is shared among all the members of the team. The whole proposed decentralized strategy has been simulated in an urban scenario to confirm that fulfils all the goals and requirements and has been also compared to other strategies.