Patrolling is concerned with the design of continuous trajectories which specify Robots perpetual movements along a curve so that the time between any two consecutive visits to any point of the curve is minimized. In this paper we survey recent rigorous results on patrolling by various number of Robots and Robots’ specifications (e.g., speed), and for various types of curves. We discuss efficient patrolling strategies for mobile agents with various capabilities and behaviors acting on a variety of geometric graph domains.

Additional Metadata
Keywords Agents, Faulty, Graphs, Patrolling, Speeds, Strategies, Trees, Visibility
Persistent URL dx.doi.org/10.1007/978-3-030-11072-7_15
Series Lecture Notes in Computer Science
Citation
Czyzowicz, J. (Jurek), Georgiou, K. (Kostantinos), & Kranakis, E. (2019). Patrolling. In Lecture Notes in Computer Science. doi:10.1007/978-3-030-11072-7_15