• DocumentCode
    3186635
  • Title

    Can ant algorithms make automated guided vehicle system more intelligent?

  • Author

    Xing, Bo ; Gao, Wen-Jing ; Battle, Kimberly ; Marwala, Tshilidzi ; Nelwamondo, Fulufhelo V.

  • Author_Institution
    Fac. of Eng. & the Built Environ., Univ. of Johannesburg, Johannesburg, South Africa
  • fYear
    2010
  • fDate
    10-13 Oct. 2010
  • Firstpage
    3226
  • Lastpage
    3234
  • Abstract
    In manufacturing environment, an automated guided vehicle (AGV) system is composed of a set of driver-less vehicles that transport goods and materials between distinct workstations and storage locations of shops. In soft computing area, ant algorithms are a series of population-based approaches inspired by various behaviors of real ant colonies. During the last two decades, ant algorithms have achieved a great success in solving many combinatorial optimization problems. In this article we make an attempt to study the feasibility of applying ant algorithms to different problems encountered in AGV system design and control. By making use of ant algorithms´ strengths, we hope to provide the readers with alternative options for solving conventional AGV system design and control problems, as well as to point out some new directions for AGV system research.
  • Keywords
    automatic guided vehicles; control system synthesis; goods distribution; industrial robots; materials handling; mobile robots; optimisation; ant algorithm; automated guided vehicle system; combinatorial optimization problem; driverless vehicle; goods transportation; materials transportation; population based approach; soft computing; Assembly; Navigation; Vehicle dynamics; ant algorithms; automated guided vehicle; cooperative transportation; dispatching; guide path; loading unit; mobile ad hoc network; routing; traffic control;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Systems Man and Cybernetics (SMC), 2010 IEEE International Conference on
  • Conference_Location
    Istanbul
  • ISSN
    1062-922X
  • Print_ISBN
    978-1-4244-6586-6
  • Type

    conf

  • DOI
    10.1109/ICSMC.2010.5642291
  • Filename
    5642291