Parallel Search Algorithm for Geometric Constraints Solving

被引：0
|
作者：
Yuan, Hua [1 ,2 ]
Li, Wenhui [1 ]
Zhao, Kong [3 ]
Yi, Rongqin [1 ]
机构：
[1] Jilin Univ, Key Lab Symbol Computat & Knowledge Engn, Minist Educ, Coll Comp Sci & Technol, Changchun 130012, Peoples R China
[2] Changchun Univ Technol, Sch Comp Sci & Engn, Changchun 130012, Peoples R China
[3] Inst Informat Technol, Suzhou 215311, Peoples R China
来源：
VIRTUAL REALITY, PROCEEDINGS | 2007年 / 4563卷
关键词：
geometric constraint solving; particle swarm optimization; simplex method; Parallel Search;
D O I：
暂无
中图分类号：
TP3 [计算技术、计算机技术];
学科分类号：
0812 ;
摘要：
We propose a hybrid algorithm - (Parallel Search Algorithm) between PSO and simplex methods to approximate optimal solution for the Geometric Constraint problems. Locally, simplex is extended to reduce the number of infeasible solutions while solution quality is improved with an operation order search. Globally, PSO is employed to gain parallelization while solution diversity is maintained. Performance results on Geometric Constraint problems show that Parallel Search Algorithm outperforms existing techniques.
引用
收藏
页码：157 / +
页数：2
相关论文
共 50 条
  • [21] Solving geometric constraints by iterative projections and backprojections
    Thomas, F
    2004 IEEE INTERNATIONAL CONFERENCE ON ROBOTICS AND AUTOMATION, VOLS 1- 5, PROCEEDINGS, 2004, : 1789 - 1794
  • [22] Symbolic constraints in constructive geometric constraint solving
    Hoffmann, CM
    JoanArinyo, R
    JOURNAL OF SYMBOLIC COMPUTATION, 1997, 23 (2-3) : 287 - 299
  • [23] Solving dynamic geometric constraints involving inequalities
    Hong, Hoon
    Li, Liyun
    Liang, Tielin
    Wang, Dongming
    ARTIFICIAL INTELLIGENCE AND SYMBOLIC COMPUTATION, PROCEEDINGS, 2006, 4120 : 181 - 195
  • [24] A parallel algorithm for solving BSDEs
    Labart, Celine
    Lelong, Jerome
    MONTE CARLO METHODS AND APPLICATIONS, 2013, 19 (01): : 11 - 39
  • [25] Large scale parallel Iterated Local Search algorithm for solving Traveling Salesman Problem
    Rocki, Kamil
    Suda, Reiji
    HIGH PERFORMANCE COMPUTING SYMPOSIUM 2012 (HPC 2012), 2012, 44 (06): : 26 - 33
  • [26] On a parallel genetic-tabu search based algorithm for solving the graph colouring problem
    Ben Mabrouk, Bchira
    Hasni, Hamadi
    Mahjoub, Zaher
    EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2009, 197 (03) : 1192 - 1201
  • [27] Search inliers based on redundant geometric constraints
    Rongrong Lu
    Feng Zhu
    Qingxiao Wu
    Xingyin Fu
    The Visual Computer, 2020, 36 : 253 - 266
  • [28] Search inliers based on redundant geometric constraints
    Lu, Rongrong
    Zhu, Feng
    Wu, Qingxiao
    Fu, Xingyin
    VISUAL COMPUTER, 2020, 36 (02): : 253 - 266
  • [29] Geometric constraints solving by a decomposition-recombination method
    Ait-Aoudia, S
    Meraihi, R
    Moussaoui, A
    Proceedings of the 8th Joint Conference on Information Sciences, Vols 1-3, 2005, : 1743 - 1746
  • [30] Solving geometric constraints invariant modulo the similarity group
    Schramm, I
    Schreck, P
    COMPUTATIONAL SCIENCE AND ITS APPLICATIONS - ICCSA 2003, PT 3, PROCEEDINGS, 2003, 2669 : 356 - 365
12345