New Method For Geometric Constraint Solving Based on the Genetic Quantum Algorithm
Chunhong Cao, Wenhui Li · Digital Library (University of West Bohemia) · 2004
This paper proposes a novel genetic quantum algorithm (GQA) to solve geometric constraint problems. Instead of binary, numeric or symbolic representation, we introduce qubit chromosome representation. GQA is based on qubit and superposition of states and is used in the process of geometric constraint solving in order to get the solution sequence. As GQA has diversity caused by the qubit representation, there is no need to use the genetic operator. Qubit chromosome can be updated by proper quantum gate in the circulation. The experiment indicates GQA can solve the geometric constraint problem effectively. Keywords Geometric constraint solving geometric decomposing genetic algorithm quantum computing genetic quantum algorithm quantum gate qubit chromosome 1. Geometric Constraint Solving Geometric constraint solving is a remarkable problem based on the constraint design. Once a user defines a series of relations, the system will satisfy the constraints by selecting proper state after the