Parallel Search Algorithm for Geometric Constraints Solving

摘要：

In this paper, we propose a hybrid algorithm – (Parallel Search Algorithm) to solve geometric constraint problems. First, Particle Swarm Optimization is employed to gain parallelization while solution diversity is maintained. Second, simplex method reduces the number of infeasible solutions while solution quality is improved with an operation order search. Performance results on Geometric constraint problems show that Parallel Search Algorithm outperforms existing techniques.

作者: Kong ZHAO Hua YUAN Wenhui LI Rongqin YI

作者单位: Suzhou Top Institute of Information Technology, China Jilin University of Changchun, China

会议类型: 国际会议

会议名称: 2nd IEEE Conference on Industrial Electronics and Applications(ICIEA 2007)(第二届IEEE工业电子与应用国际会议)

会议地点: 哈尔滨

会议语种:英文

在线出版日期: 2007-05-23（万方平台首次上网日期，不代表论文的发表时间）