On optimal cooperative patrolling

Proceedings of the IEEE Conference on Decision and Control

Volumn , Issue , 2010, Pages 7153-7158

  Pasqualetti, Fabio ^a   Franchi, Antonio ^b   Bullo, Francesco ^a  

^a UNIVERSITY OF CALIFORNIA   (United States)

^b MAX PLANCK INSTITUTE FOR BIOLOGICAL CYBERNETICS   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

MACHINE DESIGN; MULTI AGENT SYSTEMS; NP-HARD; TOPOLOGY; TRAJECTORIES;

MULTI AGENT; PERFORMANCE CRITERION; PERFORMANCE GUARANTEES; TIME GAP; TRAJECTORY DESIGNS;

OPTIMIZATION;

EID: 79953127424     PISSN: 07431546     EISSN: 25762370     Source Type: Conference Proceeding    
DOI: 10.1109/CDC.2010.5717873     Document Type: Conference Paper

References (15)

1. D. W. Casbeer, D. B. Kingston, R. W. Beard, T. W. Mclain, S.-M. Li, and R. Mehra, "Cooperative forest fire surveillance using a team of small unmanned air vehicles," International Journal of Systems Sciences, vol. 37, no. 6, pp. 351-360, 2006.
2. Y. Elmaliach, A. Shiloni, and G. A. Kaminka, "A realistic model of frequency-based multi-robot polyline patrolling," in International Conference on Autonomous Agents, Estoril, Portugal, May 2008, pp. 63-70.
3. B. C. Tansel, R. L. Francis, and T. J. Lowe, "Location on networks: a survey. Part I: the p-center and p-median problems," Management Science, vol. 29, no. 4, pp. 482-497, 1983.
4. E. M. Arkin, R. Hassin, and A. Levin, "Approximations for minimum and min-max vehicle routing problems," Journal of Algorithms, vol. 59, no. 1, pp. 1-18, 2006.
5. F. Amigoni, N. Basilico, and N. Gatti, "Finding the optimal strategies for robotic patrolling with adversaries in topologically-represented environments," in IEEE Int. Conf. on Robotics and Automation, Kobe, Japan, May 2009, pp. 2005-2010.
6. Y. Elmaliach, N. Agmon, and G. A. Kaminka, "Multi-robot area patrol under frequency constraints," in IEEE Int. Conf. on Robotics and Automation, Roma, Italy, Apr. 2007, pp. 385-390.
7. A. Machado, G. Ramalho, J. D. Zucker, and A. Drogoul, "Multi-agent patrolling: An empirical analysis of alternative architectures," in Multi- Agent-Based Simulation II, ser. Lecture Notes in Computer Science. Springer, 2003, pp. 155-170.
8. Y. Chevaleyre, "Theoretical analysis of the multi-agent patrolling problem," in IEEE/WIC/ACM Int. Conf. Intelligent Agent Technology, Beijing, China, Sep. 2004, pp. 302-308.
9. D. B. Kingston, R. S. Holt, R. W. Beard, T. W. McLain, and D. W. Casbeer, "Decentralized perimeter surveillance using a team of UAVs," in AIAA Conf. on Guidance, Navigation and Control, San Francisco, CA, Aug. 2005.
10. M. R. Garey and D. S. Johnson, Computers and Intractability. Springer, 1979.
11. A. Ganguli, J. Cortés, and F. Bullo, "Distributed deployment of asynchronous guards in art galleries," in American Control Conference, Minneapolis, MN, Jun. 2006, pp. 1416-1421.
12. S. M. LaValle, Planning Algorithms. Cambridge University Press, 2006, available at http://planning.cs.uiuc.edu.
13. D. Peleg, Distributed Computing. A Locality-Sensitive Approach, ser. Monographs on Discrete Mathematics and Applications. SIAM, 2000.
14. I. Averbakh and O. Berman, "A heuristic with worst-case analysis for minimax routing of two travelling salesmen on a tree," Discrete Applied Mathematics, vol. 68, no. 1-2, pp. 17-32, 1996.
15. H. Nagamochi and K. Okada, "A faster 2-approximation algorithm for the minmax p-traveling salesmen problem on a tree," Discrete Applied Mathematics, vol. 140, no. 1-3, pp. 103-114, 2004.