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 :
IEEE Congress on Evolutionary Computation - IEEE CEC 2007, Sep 2007, Singapour, Singapore. IEEE, 8 p., 2007
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>