A theoretical analysis of multi-agent patrolling strategies

Proceedings of the Third International Joint Conference on Autonomous Agents and Multiagent Systems, AAMAS 2004

Volumn 3, Issue , 2004, Pages 1524-1525

  Chevaleyre, Yann ^a   Sempé, Francois ^b   Ramalho, Geber ^c  

^a UNIVERSITÉ PARIS DAUPHINE   (France)

^b SORBONNE UNIVERSITÉ   (France)

^c FEDERAL UNIVERSITY OF PERNAMBUCO   (Brazil)

Author keywords

[No Author keywords available]

Indexed keywords

CHRISTOFIDES ALGORITHM; PATROLLING PROCESSES; SINGLE-AGENT CYCLIC STRATEGIES; SOFTWARE PACKAGES;

ALGORITHMS; APPROXIMATION THEORY; COMPUTER SIMULATION; DECISION MAKING; FUNCTIONS; GRAPH THEORY; SOFTWARE ENGINEERING; THEOREM PROVING; TRAVELING SALESMAN PROBLEM;

MULTI AGENT SYSTEMS;

EID: 4544322678     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (3)

1. Aydano Machado, Geber Ramalho, Jean-Daniel Zucker, Alexis Drogoul (2002). Multi-Agent Patrolling: an Empirical Analysis of Alternative Architectures. Third International Workshop on Multi-Agent Based Simulation.
2. Chevaleyre, Y. (2003). The patrolling problem. Tech. Rep. of Univ. Paris 9. Available in french at http://l1.lamsade.dauphine.fr/~chevaley/patrol
3. Reinelt G., (1994), "The Traveling Salesman: Computational Solutions for TSP Applications," Lectures Notes in Computer Science 840, Springer-Verlag.