The geometric constraint solving based on the quantum particle swarm

Authors:
Cao Chunhong;Wang Limin;Li Wenhui
Affiliations:
Collge of Information Science and Engineering, Northeastern University, Shenyang, P.R. China;College of Computer Science and Technology, Jilin University, Changchun, P.R. China;College of Computer Science and Technology, Jilin University, Changchun, P.R. China
Venue:
RSKT'10 Proceedings of the 5th international conference on Rough set and knowledge technology
Year:
2010

Citing 4
Cited 0

Quantum optimization

Information Sciences—Informatics and Computer Science: An International Journal - Special Issue on Quantum Computing and Neural Information Processing
Genetic Algorithms in Search, Optimization and Machine Learning

Genetic Algorithms in Search, Optimization and Machine Learning
Quantum-Behaved Particle Swarm Optimization with Mutation Operator

ICTAI '05 Proceedings of the 17th IEEE International Conference on Tools with Artificial Intelligence
The particle swarm - explosion, stability, and convergence in amultidimensional complex space

IEEE Transactions on Evolutionary Computation

Quantified Score

Hi-index	0.00

Visualization

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.