Convergence and Rate of Convergence of a Foraging Ant Model

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 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 can be 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 for problem solving.
Document type :
Conference papers
IEEE Congress on Evolutionary Computation - IEEE CEC 2007, Sep 2007, Singapour, Singapore. IEEE, 8 p., 2007
Liste complète des métadonnées


https://hal.inria.fr/inria-00170183
Contributor : Amine Boumaza <>
Submitted on : Thursday, September 6, 2007 - 4:12:28 PM
Last modification on : Tuesday, October 25, 2016 - 5:02:23 PM
Document(s) archivé(s) le : Thursday, April 8, 2010 - 9:43:32 PM

File

article.pdf
Files produced by the author(s)

Identifiers

  • HAL Id : inria-00170183, version 1

Collections

Citation

Amine Boumaza, Bruno Scherrer. Convergence and Rate of Convergence of a Foraging Ant Model. IEEE Congress on Evolutionary Computation - IEEE CEC 2007, Sep 2007, Singapour, Singapore. IEEE, 8 p., 2007. <inria-00170183>

Share

Metrics

Record views

197

Document downloads

124