MSP algorithm: Multi-robot patrolling based on territory allocation using balanced graph partitioning

Proceedings of the ACM Symposium on Applied Computing

Volumn , Issue , 2010, Pages 1271-1276

  Portugal, David ^a   Rocha, Rui ^a  

^a UNIVERSITY OF COIMBRA   (Portugal)

Author keywords

G.2.2 Discrete Mathematics : Graph Theory; Graph algorithms; Path and circuit problems; I.2.8 Articial Intelligence : Problem Solving, Control Methods, and Search | Graph and tree search strategies; Heuristic methods; Plan execution, formation, and generation

Indexed keywords

CONTROL METHODS; DISCRETE MATHEMATICS; G.2.2 [DISCRETE MATHEMATICS]: GRAPH THEORY; GRAPH ALGORITHMS; I.2.8 [ARTICIAL INTELLIGENCE]: PROBLEM SOLVING, CONTROL METHODS, AND SEARCH | GRAPH AND TREE SEARCH STRATEGIES HEURISTIC METHODS PLAN EXECUTION, FORMATION, AND GENERATION; PLAN EXECUTION; TREE SEARCH;

GRAPH THEORY; HEURISTIC ALGORITHMS; HEURISTIC METHODS; INDUSTRIAL ROBOTS; MOBILE AGENTS; MULTIPURPOSE ROBOTS; PROBLEM SOLVING;

TREES (MATHEMATICS);

EID: 77954723294     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1774088.1774360     Document Type: Conference Paper

References (17)

1. R. Rocha. Building Volumetric Maps with Cooperative Mobile Robots and Useful Information Sharing: a Distributed Control Approach based on Entropy. Ph.D. Thesis, Faculty of Engineering of University of Porto, Portugal, October, 2005.
2. Y. Elmaliach, N. Agmon and G. Kaminka. Multi-Robot Area Patrol under Frequency Constraints. IEEE International Conference on Robotics and Automation (ICRA 07), 385-390, Rome, Italy, Apr. 10-14, 2007. ISBN 1-4244-0601-3.
3. A. Kolling and S. Carpin. The GRAPH-CLEAR Problem: Definition, Theoretical Properties and its Connections to Multirobot Aided Surveillance. IEEE/RSJ International Conf. on Intelligent Robots and Systems, 1003-1008, San Diego, California, U.S.A., Oct. 29-Nov. 2, 2007. ISBN 978-1-4244-0912-9.
4. A. Kolling and S. Carpin. Multi-robot Surveillance: an Improved Algorithm for the GRAPH-CLEAR Problem. IEEE International Conf. on Robotics and Automation, 2360-2365, Pasadena, California, U.S.A., May 19-23, 2008. ISBN 978-1-244-1646-2.
5. A. Kolling and S. Carpin. Extracting Surveillance Graphs from Robot Maps. International Conf. on Intelligent Robots and Systems, 2323-2328, Nice, France, Sept. 22-26, 2008. ISBN 978-1-4244-2057-5.
6. K. Wurm, C. Stachniss and W. Burgard. Coordinated Multi-Robot Exploration using a Segmentation of the Environment. International Conference on Intelligent Robots and Systems, 1160-1165, Nice, France, Sept. 22-26, 2008. ISBN 978-1-4244-2057-5.
7. M. Batalin and G. Sukhatme. Multi-Robot Dynamic Coverage of a Planar Bounded Environment. Technical Report, Robotic Embedded Systems Laboratory, University of Southern California, 2002.
8. M. Miazaki. Sistema de controle multi-robô baseado em colônia de formigas artificiais. Master Thesis, Instituto de Ciências Matemáticas e de Computação - University of São Paulo, Brazil, February, 2007.
9. A. Sgorbissa and R. Arkin. Local Navigation Strategies for a Team of Robots. Robotica, 461-473, 21(5), Cambridge Univ. Press, 2003. ISSN 0263-5747.
10. Y. Guo, L. Parker and R. Madhavan. 9 Collaborative Robots for Infrastructure Security Applications. Studies in Computational Intelligence, 185-200, Vol. 50, Springer-Verlag Berlin Heidelberg, April 22, 2007.
11. A. Almeida, G. Ramalho, H. Sanana, Y. Chaveleyre et al. Recent Advances on Multi-Agent Patrolling. Brazilian Symp. on Artificial Intelligence, 474-483, 3171, São Luís, Brazil, 2004. ISBN 3-540-23237-0.
12. P. Beeson, N. Jong and B. Kuipers. Towards Autonomous Topological Place Detection Using the Extended Voronoi Graph. Int. Conf. on Robotics and Automation, 4373-4379, Barcelona, Spain, 2005.
13. G. Karypis and V. Kumar. A Fast and High Quality Multilevel Scheme for Partitioning Irregular Graphs. Society for Industrial and Applied Mathematics Journal of Scientific Computing, 359-392, 20(1), 1998.
14. C. Hierholzer. Über die Möglichkeit, einen Linienzug ohne Wiederholung und ohne Unterbrechnung zu umfahren. Mathematische Annalen 6, 30-32, 1873.
15. Fleury. Deux problemes de geometrie de situation. Journal de mathematiques elementaires, 257-261, 1883.
16. D. Angluin, L. Valiant. Fast Probabilistic Algorithms for Hamiltonian Circuits and Matchings. Journal of Computer and System Sciences, 155-193, 18(2), April 1979.
17. E. W. Dijkstra. A Note on Two Problems in Connection with Graphs. Numerische Math, 269-271, Vol. 1, 1959.