Convergence and rate of convergence of simple ant models

Amine Boumaza 1 Bruno Scherrer 1
1 MAIA - Autonomous intelligent machine
INRIA Lorraine, LORIA - Laboratoire Lorrain de Recherche en Informatique et ses Applications
Abstract : We present an original ant model to solve the foraging problem. We describe simulations and provide a convergence analysis. We prove the convergence of the model in the discrete and in the continuous cases. We show that the ant population computes the solution of an optimal control problem and converges in a well defined sense. We discuss the rate of convergence with respect to the number of ants for the discrete case: 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 and more generally any problem that involves the computation of the fixed point of a contraction mapping. This allows us to design a large class of formally well understood ant-like algorithms for problem solving.
Document type :
Preprints, Working Papers, ...
Complete list of metadatas

Cited literature [24 references]  Display  Hide  Download
Contributor : Amine Boumaza <>
Submitted on : Wednesday, March 12, 2008 - 1:28:39 PM
Last modification on : Thursday, January 11, 2018 - 6:19:50 AM
Long-term archiving on : Tuesday, June 28, 2011 - 10:59:11 AM


Files produced by the author(s)


  • HAL Id : inria-00263536, version 1



Amine Boumaza, Bruno Scherrer. Convergence and rate of convergence of simple ant models. 2007. ⟨inria-00263536⟩



Record views


Files downloads