Abstract : We present a simple ant model that solves a discrete foraging problem. We describe simulations and provide a complete convergence analysis: we show that the ant population computes the solution of some optimal control problem and converges in some well defined sense. We discuss the rate of convergence with respect to the number of ants: we give experimental and theoretical arguments that suggest that this convergence rate is superlinear with respect to the number of agents. Furthermore, we explain how this model can be extended in order to solve optimal control problems in general and argue that such an approach can be applied to any problem that involves the computation of the fixed point of a contraction mapping. This allows to design a large class of formally well understood ant like algorithms.
Type de document :
Communication dans un congrès
International Conference on Autonomous Agents and Multiagent Systems - AAMAS'07, May 2007, Honolulu Hawaii, United States. pp.607-609, 2007
https://hal.inria.fr/inria-00170186
Contributeur : Amine Boumaza
<>
Soumis le : jeudi 6 septembre 2007 - 16:26:49
Dernière modification le : jeudi 11 janvier 2018 - 06:19:51
Document(s) archivé(s) le : vendredi 9 avril 2010 - 01:40:33
Amine Boumaza, Bruno Scherrer. Convergence and rate of convergence of a simple ant model. International Conference on Autonomous Agents and Multiagent Systems - AAMAS'07, May 2007, Honolulu Hawaii, United States. pp.607-609, 2007. 〈inria-00170186〉
