• DocumentCode
    2848113
  • Title

    A novel poly-clone particle swarm optimization algorithm and its application in mobile robot path planning

  • Author

    Shen, Yi ; Yuan, Mingxin

  • Author_Institution
    Sch. of Mech. & Metall. Eng., Jiangsu Univ. of Sci. & Technol., Zhangjiagang, China
  • fYear
    2010
  • fDate
    26-28 May 2010
  • Firstpage
    2271
  • Lastpage
    2276
  • Abstract
    Particle swarm optimization (PSO) algorithm is a new random global optimization algorithm, and the simple PSO algorithm (SPSOA) is short of high convergence speed, strong optimization ability and so on. To improve the optimization ability of SPSOA, the clonal copy, clonal crossover, hyper-mutation and clonal selection are introduced in the SPSOA, and a novel poly-clone particle swarm optimization algorithm (PCPSOA) is presented. Compared with the corresponding SPSOA and inertia weight PSO algorithm (IWPSOA), the simulation results of some complex functions optimization indicate that the proposed PCPSOA is characterized by strong searching ability and quick convergence speed. Finally, the PCPSOA is introduced into the path planning of mobile robot and the global path is optimized using PCPSOA on the basis of MAKLINK graph. The simulation results show that the path planning based on PCPSOA is feasible and effective.
  • Keywords
    graph theory; mobile robots; particle swarm optimisation; MAKLINK graph; PCPSOA; PSO; clonal crossover; clonal selection; hypermutation; inertia weight PSO algorithm; mobile robot path planning; polyclone particle swarm optimization algorithm; Artificial intelligence; Fuzzy logic; Fuzzy reasoning; Genetic algorithms; Intelligent sensors; Joining processes; Mobile robots; Particle swarm optimization; Path planning; Robustness; Clonal Selection; MAKLINK Graph; Particle Swarm Optimization; Path Planning;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Control and Decision Conference (CCDC), 2010 Chinese
  • Conference_Location
    Xuzhou
  • Print_ISBN
    978-1-4244-5181-4
  • Electronic_ISBN
    978-1-4244-5182-1
  • Type

    conf

  • DOI
    10.1109/CCDC.2010.5498837
  • Filename
    5498837