The Research on a Novel Geometric Constraint Solver

When transferring the geometric constraint equation group into the optimization model, we need a method to jump out of the local beat solution so that we can find a global best solution. Considering the speed and global capability, we adopt compound particle group optimization algorithm. Particle swarm optimization algorithm is a kind of evolution computation technology based on group intelligence. In all the evolution computations heuristic function should be included to control its one´s own characteristic. These parameters are usually correlated with the specific problem and are defined by the users. Suitable parameter choice needs user abundant experience and correct judgment on the information offered by the problem. More important thing is that these heuristic parameters will influence the convergence characteristic of the algorithm. Because of this even experienced users may choose the not appropriate parameter and then make the problem unable to get effective solution. It needs to carry on some research on these parameters more and more. Here we choose the control parameters as an optimization question in the particle swarm algorithm. Thus heuristic function in the PSO can be controlled by the ordinal genetic algorithm and we form the composite particle swarm optimization algorithm. And we use this algorithm into the geometric constraint solving successfully