Theoretical Study of ant-based Algorithms for Multi-Agent Patrolling - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year : 2008

Theoretical Study of ant-based Algorithms for Multi-Agent Patrolling


This paper addresses the multi-agent patrolling problem, which consists for a set of autonomous agents to visit all the places of an unknown environment as regularly as possible. The proposed approach is based on the ant paradigm. Each agent can only mark and move according to its local perception of the environment. We study EVAW, a pheromone-based variant of the EVAP [Chu07] and VAW [Wagner99]. The main novelty of the paper is the proof of some emergent spatial properties of the proposed algorithm. In particular we show that obtained cycles are necessarily of same length, which ensures an efficient spatial distribution of the agents. We also report some experimental results and discuss open questions concerning the proposed algorithm.
Fichier principal
Vignette du fichier
ecai2008Maia.pdf (172.65 Ko) Télécharger le fichier
Origin : Publisher files allowed on an open archive

Dates and versions

inria-00326963 , version 1 (06-10-2008)



Arnaud Glad, Olivier Simonin, Olivier Buffet, François Charpillet. Theoretical Study of ant-based Algorithms for Multi-Agent Patrolling. 18th European Conference on Artificial Intelligence including Prestigious Applications of Intelligent Systems (PAIS 2008) - ECAI 2008, M. Ghallab et al., Jul 2008, Patras, Greece. pp.626-630, ⟨10.3233/978-1-58603-891-5-626⟩. ⟨inria-00326963⟩
222 View
296 Download



Gmail Facebook X LinkedIn More