Advertisement

Merging Groups for the Exploration of Complex State Spaces in the CPSO Approach

  • Stefanie Thiem
  • Jörg Lässig
  • Peter Köchel
Part of the Lecture Notes in Computer Science book series (LNCS, volume 5217)

Abstract

In recent years many investigations have shown that Particle Swarm Optimization (PSO) is a very competitive global optimization heuristic. However, in very complex state spaces the classical PSO algorithm converges too fast and hence provides only suboptimal results. Looking at swarm robotics it seems natural to adopt a repulsive force to avoid this undesired behavior as suggested in Charged PSO but the downside of this is the problem of final convergence in static applications.

The contribution of this paper is to introduce a dynamic charge reduction over time defining particle groups which are iteratively merged, reducing the number of charged particles during the optimization run.

A visualization of this process shows spontaneous formation of independent particle groups, redolent very much of swarm movement in nature. Optimization results are superior compared to other PSO approaches especially in very complex high dimensional search spaces.

Keywords

Particle Swarm Optimization Repulsive Force Particle Swarm Optimization Algorithm Particle Group Swarm Robotic 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Kennedy, J., Eberhart, R.: Particle Swarm Optimization. In: Proceedings of IEEE International Conference on Neural Networks, vol. 4, pp. 1942–1948 (1995)Google Scholar
  2. 2.
    Thiem, S.: Swarmintelligence - Simulation, Optimization and Comparative Analysis. Diplom Thesis, Chemnitz University of Technology (2008)Google Scholar
  3. 3.
    Blackwell, M.: Particle Swarms and Population Diversity. Soft Computing 9(11), 793–802 (2005)zbMATHCrossRefGoogle Scholar
  4. 4.
    Shi, Y., Eberhart, R.: A Modified Particle Swarm Optimizer. In: Proceedings of the IEEE International Conference on Evolutionary Computation, pp. 69–73 (1998)Google Scholar
  5. 5.
    Clerc, M., Kennedy, J.: The Particle Swarm - Explosion, Stability, and Convergence in a Multidimensional Complex Space. IEEE Transactions on Evolutionary Computation 6(1), 58–73 (2002)CrossRefGoogle Scholar
  6. 6.
    Spears, W.M., Spears, D.F., Hamann, J.C., Heil, R.: Distributed, Physics-Based Control of Swarms of Vehicles. Autonomous Robots 17(2-3), 137–162 (2004)CrossRefGoogle Scholar
  7. 7.
    Urfalioglu, O.: Robust Estimation of Camera Rotation,Translation and Focal Length at High Outlier Rates. In: Proceedings of the First Canadian Conference on Computer and Robot Vision, pp. 464–471 (2004)Google Scholar
  8. 8.
    Blackwell, T.M.: Particle Swarm Optimization in Dynamic Environments (2008), http://igor.gold.ac.uk/mas01tb/papers/PSOdynenv.pdf
  9. 9.
  10. 10.
    Carlisle, A., Dozier, G.: An off-the-Shelf PSO. In: Proceedings of the Workshop on Particle Swarm Optimization, vol. 1, pp. 1–6 (2001)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2008

Authors and Affiliations

  • Stefanie Thiem
    • 1
  • Jörg Lässig
    • 1
  • Peter Köchel
    • 1
  1. 1.Department of Computer ScienceChemnitz University of TechnologyChemnitzGermany

Personalised recommendations