skip to main content
10.1145/1363686.1364136acmconferencesArticle/Chapter ViewAbstractPublication PagessacConference Proceedingsconference-collections
research-article

Percolation analyses in a swarm based algorithm for shortest-path finding

Authors Info & Claims
Published:16 March 2008Publication History

ABSTRACT

In this paper we show that the convergence in the Ant Colony Optimization (ACO) algorithm can be described as a "phase- transition" phenomenon. The analysis of the ACO with the Percolation Theory approach includes: the pheromone evaporation and the number of agents parameters, so, for a given routing environment, it is possible to select these parameters in order to ensure convergence and to avoid overhead in the algorithm. The objective of this work is to present some experiments that support our hypothesis and to show the methodology used to correlate some algorithm parameters and how they influence in its general performance.

References

  1. H. M. Balch T. Social potentials for scalable multi-robot formations. IEEE International Conference on Robotics and Automation, 2000.Google ScholarGoogle ScholarCross RefCross Ref
  2. T. G. Bonabeau E., Dorigo M. Swarm Intelligence: From Natural to Artificial Systems. MIT Press, Cambridge, MA, 1999. Google ScholarGoogle ScholarDigital LibraryDigital Library
  3. A. R. C. Behavior-Based Robotics. MIT Press, Cambridge, MA, 1998.Google ScholarGoogle Scholar
  4. A. Efros. Fisica y Geometria del Desorden. Ed. Mir, Moscow, 1987. traslated. Belosov, S.Google ScholarGoogle Scholar
  5. W. H. S. Kwang M. S. Ant colony optimization for routing and load-balancing: Survey and new direction. IEEE Transaction on systems, man, and cybernetics, Vol 33(No. 5), September 2003. Google ScholarGoogle ScholarDigital LibraryDigital Library
  6. H. R. Leung H. Phase transition in a swarm algorithm for self-organized construction. Physical Review, (E. 68), 2003.Google ScholarGoogle Scholar
  7. K. R. Leung H. Self-organized construction of spatial structures by swarms of autonomous mobile agents. Master's thesis, College of Engineering. University of Cincinnate., 2003.Google ScholarGoogle Scholar
  8. A. A. Stauffer D. Percolation Theory. Taylor and Francis, London, 1992.Google ScholarGoogle Scholar

Index Terms

  1. Percolation analyses in a swarm based algorithm for shortest-path finding

      Recommendations

      Comments

      Login options

      Check if you have access through your login credentials or your institution to get full access on this article.

      Sign in
      • Published in

        cover image ACM Conferences
        SAC '08: Proceedings of the 2008 ACM symposium on Applied computing
        March 2008
        2586 pages
        ISBN:9781595937537
        DOI:10.1145/1363686

        Copyright © 2008 ACM

        Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

        Publisher

        Association for Computing Machinery

        New York, NY, United States

        Publication History

        • Published: 16 March 2008

        Permissions

        Request permissions about this article.

        Request Permissions

        Check for updates

        Qualifiers

        • research-article

        Acceptance Rates

        Overall Acceptance Rate1,650of6,669submissions,25%

      PDF Format

      View or Download as a PDF file.

      PDF

      eReader

      View online with eReader.

      eReader