论文信息 - Computational geometry column 59

Computational geometry column 59

This column is about patrolling problems in a geometric network. Mobile agents patrol a road network, and have to visit every point in the network as frequently as possible. The goal is finding a schedule that minimizes the idle time, i.e., the maximum time between two consecutive visits of some agent over all points in the network.

Csaba D. Tóth | Adrian Dumitrescu

[1] Howie Choset,et al. Coverage for robotics – A survey of recent results , 2001, Annals of Mathematics and Artificial Intelligence.

[2] Akitoshi Kawamura,et al. Fence Patrolling by Mobile Agents with Distinct Speeds , 2012, ISAAC.

[3] Csaba D. Tóth,et al. On Fence Patrolling by Mobile Agents , 2013, CCCG.

[4] Jurek Czyzowicz,et al. Boundary Patrolling by Mobile Agents with Distinct Maximal Speeds , 2011, ESA.

[5] Oriol Serra,et al. The Lonely Runner with Seven Runners , 2007, Electron. J. Comb..

[6] Ron Holzman,et al. Six Lonely Runners , 2001, Electron. J. Comb..

[7] Alexis Drogoul,et al. Multi-agent Patrolling: An Empirical Analysis of Alternative Architectures , 2002, MABS.

[8] Noa Agmon,et al. Multi-Robot Area Patrol under Frequency Constraints , 2007, ICRA.

[9] Sarit Kraus,et al. Multi-robot perimeter patrol in adversarial settings , 2008, 2008 IEEE International Conference on Robotics and Automation.

[10] J. Wills,et al. Zwei Sätze über inhomogene diophantische Approximation von Irrationalzehlen , 1967 .

[11] T. Cusick,et al. View-obstruction problems , 1972 .

[12] Carl Pomerance,et al. View-Obstruction Problems, III , 1984 .

[13] Yann Chevaleyre. Theoretical analysis of the multi-agent patrolling problem , 2004 .

[14] Jurek Czyzowicz,et al. Optimal patrolling of fragmented boundaries , 2013, SPAA.