Skip to main content

The Geometric Constraint Solving Based on the Quantum Particle Swarm

  • Conference paper
Rough Set and Knowledge Technology (RSKT 2010)

Part of the book series: Lecture Notes in Computer Science ((LNAI,volume 6401))

Included in the following conference series:

Abstract

Geometric constraint problem is equivalent to the problem of solving a set of nonlinear equations substantially. The constraint problem can be transformed to an optimization problem. We can solve the problem with quantum particle swarm. The PSO is driven by the simulation of a social psychological metaphor motivated by collective behaviors of bird and other social organisms instead of the survival of the fittest individual. Inspired by the classical PSO method and quantum mechanics theories, this work presents a novel Quantum-behaved PSO (QPSO). The experiment shows that it can improve the algorithmic efficiency.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Bo, Y.: Research and Implementation of Geometric Constraint Solving Technology, doctor dissertation of Tsinghua University, Beijing (1999)

    Google Scholar 

  2. Kennedy, J.F., Eberhart, R.C.: Particle swarm optimization. In: Proceedings of IEEE international conference on neural networks, Perth, Australia, pp. 1942–1948 (1995)

    Google Scholar 

  3. Eberhart, R.C., Kennedy, J.F.: A new optimizer using particle swarm theory. In: Proceedings of international symposium on micromachine and human science, Japan, pp. 39–43 (1995)

    Google Scholar 

  4. Goldberg, D.E.: Genetic algorithms in search, optimization, and machine learning. Addison Wesley, Reading (1989)

    MATH  Google Scholar 

  5. Pang, X.F.: Quantum mechanics in nonlinear systems. World Scientific Publishing Company, River Edge (2005)

    Book  MATH  Google Scholar 

  6. Schweizer, W.: Numerical quantum dynamics. Hingham, MA, USA (2001)

    Google Scholar 

  7. Hogg, T., Portnov, D.S.: Quantum optimization. Inform. Sci. 128, 181–197 (2000)

    Article  MATH  MathSciNet  Google Scholar 

  8. Protopescu, V., Barhen, J.: Solving a class of continuous global optimization problems using quantum algorithms. Phys. Lett. A. 296, 9–14 (2002)

    Article  MathSciNet  Google Scholar 

  9. Bulger, D., Baritompa, W.P., Wood, G.R.: Implementing pure adaptive search with Grover’s quantum algorithm. J. Optim: Theor. Appl. 116(3), 517–529 (2003)

    Article  MATH  MathSciNet  Google Scholar 

  10. Sun, J., Feng, B., Xu, W.: Particle swarm optimization with particles having quantum behavior. In: Proceedings of congress on evolutionary computation, Portland, OR, USA, pp. 325–331 (2004)

    Google Scholar 

  11. Sun, J., Xu, W., Feng, B.: Adaptive parameter control for quantum-behaved particle swarm optimization on individual level. In: Proceedings of IEEE international conference on systems, man and cybernetics, Big Island, HI, USA, pp. 3049–3054 (2005)

    Google Scholar 

  12. Liu, J., Xu, W., Sun, J.: Quantum-behaved particle swarm optimization with mutation operator. In: Proceedings of 17th international conference on tools with artificial intelligence, Hong Kong, China (2005)

    Google Scholar 

  13. Levin, F.S.: An introduction to quantum theory. Cambridge University Press, Cambridge (2002)

    MATH  Google Scholar 

  14. Clerc, M., Kennedy, J.F.: The particle swarm: explosion, stability and convergence in a multi-dimensional complex space. IEEE Trans. Evolution Comput. 6(1), 58–73 (2002)

    Article  Google Scholar 

  15. Shengli, L., Min, T., Jinxiang, D.: Geometric Constraint Satisfaction Using Genetic Simulated Annealing Algorithm. Journal of Image and Graphics 8(8), 938–945 (2003)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2010 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Chunhong, C., Limin, W., Wenhui, L. (2010). The Geometric Constraint Solving Based on the Quantum Particle Swarm. In: Yu, J., Greco, S., Lingras, P., Wang, G., Skowron, A. (eds) Rough Set and Knowledge Technology. RSKT 2010. Lecture Notes in Computer Science(), vol 6401. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-16248-0_79

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-16248-0_79

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-16247-3

  • Online ISBN: 978-3-642-16248-0

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics