Flows, view obstructions, and the lonely runner
Journal of Combinatorial Theory Series B
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
The giving tree: constructing trees for efficient offline and online multi-robot coverage
Annals of Mathematics and Artificial Intelligence
Behavioral control for multi-robot perimeter patrol: a finite state automata approach
ICRA'09 Proceedings of the 2009 IEEE international conference on Robotics and Automation
Multi-agent patrolling: an empirical analysis of alternative architectures
MABS'02 Proceedings of the 3rd international conference on Multi-agent-based simulation II
Euler tour lock-in problem in the rotor-router model: i choose pointers and you choose port numbers
DISC'09 Proceedings of the 23rd international conference on Distributed computing
Multi-robot area patrol under frequency constraints
Annals of Mathematics and Artificial Intelligence
Autonomous multi-agent cycle based patrolling
ANTS'10 Proceedings of the 7th international conference on Swarm intelligence
Observe and remain silent (communication-less agent location discovery)
MFCS'12 Proceedings of the 37th international conference on Mathematical Foundations of Computer Science
Position discovery for a system of bouncing robots
DISC'12 Proceedings of the 26th international conference on Distributed Computing
Multi-robot repeated area coverage
Autonomous Robots
Optimal patrolling of fragmented boundaries
Proceedings of the twenty-fifth annual ACM symposium on Parallelism in algorithms and architectures
Localization for a system of colliding robots
ICALP'13 Proceedings of the 40th international conference on Automata, Languages, and Programming - Volume Part II
Hi-index | 0.00 |
A set of k mobile agents are placed on the boundary of a simply connected planar object represented by a cycle of unit length. Each agent has its own predefined maximal speed, and is capable of moving around this boundary without exceeding its maximal speed. The agents are required to protect the boundary from an intruder which attempts to penetrate to the interior of the object through a point of the boundary, unknown to the agents. The intruder needs some time interval of length τ to accomplish the intrusion. Will the intruder be able to penetrate into the object, or is there an algorithm allowing the agents to move perpetually along the boundary, so that no point of the boundary remains unprotected for a time period τ? Such a problem may be solved by designing an algorithm which defines the motion of agents so as to minimize the idle time I, i.e., the longest time interval during which any fixed boundary point remains unvisited by some agent, with the obvious goal of achieving I Depending on the type of the environment, this problem is known as either boundary patrolling or fence patrolling in the robotics literature. The most common heuristics adopted in the past include the cyclic strategy, where agents move in one direction around the cycle covering the environment, and the partition strategy, in which the environment is partitioned into sections patrolled separately by individual agents. This paper is, to our knowledge, the first study of the fundamental problem of boundary patrolling by agents with distinct maximal speeds. In this scenario, we give special attention to the performance of the cyclic strategy and the partition strategy. We propose general bounds and methods for analyzing these strategies, obtaining exact results for cases with 2, 3, and 4 agents. We show that there are cases when the cyclic strategy is optimal, cases when the partition strategy is optimal and, perhaps more surprisingly, novel, alternative methods have to be used to achieve optimality.