期刊文献+

几何约束问题求解的方向可选指数进制步长优化算法 被引量:3

A variable step-size revisable optimization algorithm to solve geometry constraint
下载PDF
导出
摘要 针对参数化设计中的复杂几何约束求解问题,提出1种可选指数进制变步长数值求解优化算法。在给定的优化目标下,采用指数进制变步长,对每个设计参数变量进行"前进、后退、保持一步"的方向选择式试探判断,即算法每迭代循环1次,误差以指数方式进行递减,变量则逐渐逼近先前设定的参数目标。利用该优化算法,求解相切圆填充和正二十面体优化2个经典的几何优化问题。研究结果表明:该算法稳定性强,收敛速度快,求解精度高并对初始值不敏感;该算法能够求解多变量复杂参数化设计问题,并不受优化变量个数的影响;利用方向可选指数变进制变步长优化算法能有效解决二维和三维空间内的参数化几何约束优化问题。 To solve the problems of complex geometry constraint in parametric design, a variable step-size revisable optimization algorithm was presented. For the optimization objective, with the exponential notation variable step and the test strategy of"forward, backward or maintain a step" to approach the optimization objective for each design parameter, the precision solution was gotten with iterative search. The filling problem for single circularity and iscsahedron problem were solved using this optimization approach. The results show that this algorithm is not sensitive to initial variable and has high convergence. And by solving the iscsahedron problem, this algorithm is not restricted by the number of parametric design variable and can solve the complex geometric constraint problem. The variable step-size revisable optimization algorithm can solve olanar and three-dimensional geometry constraint effectively.
出处 《中南大学学报(自然科学版)》 EI CAS CSCD 北大核心 2011年第5期1326-1331,共6页 Journal of Central South University:Science and Technology
基金 湖南省高校创新平台开放基金资助项目(10K063) 教育留学回国人员科研启动基金资助项目(2009-1590) 湖南省科技计划项目(2010NK3044)
关键词 几何约束 变步长 参数化设计 优化目标:特殊进制 geometry constraints variable step-size parametric design optimization objective special scale
  • 相关文献

参考文献13

二级参考文献155

共引文献80

同被引文献24

  • 1黄学良,李娜,陈立平.三维装配几何约束组合的分类求解策略[J].图学学报,2014,35(2):236-242. 被引量:3
  • 2刘善综.梯形渠道临界水深的计算及讨论[J].水利学报,1995,27(6):83-84. 被引量:3
  • 3王书亭,王战江.粒子群优化算法求解非线性问题的应用研究[J].华中科技大学学报(自然科学版),2005,33(12):4-7. 被引量:13
  • 4赵建玉,贾磊,杨立才,朱文兴.基于粒子群优化的RBF神经网络交通流预测[J].公路交通科技,2006,23(7):116-119. 被引量:22
  • 5Ait-Aoudia S, Foufl~u S. A 2D geometric t'onstraint solver using a graph reduction method [ J ]. Advances in Engineering Software, 2010,41(10) :1187-1194.
  • 6Mathis P, Sehreek P, lmbach R. Decomposition of geometrical con- straint systems with reparameterization [ C ]//Proc of the 27th Annual ACM Symposium on Applied C()mputing. 2012 : 102- 108.
  • 7Mathis P. A follnalization of geometric constraint systems and their decomposition [ J ]. Formal Aspects of Computing, 2010,22 ( 2 ) : 129- 151.
  • 8Kim J, Kim K, Choi K. Solving 317 geometric constraints fi~r assem- bly modeling [ J ]. International Journal of Advanced Manufactu- ring Technology,2000,16( 11 ) :843-849.
  • 9Zhang Guifang, Gad Xiaoshan. ~'ell-eonstrained completion and de- composition for under-eonstrained geometric constraint problems [ J ]. International Journal of Computational Geometry & Applica- tions,2006, t 6 ( 5/6 ) :461-478.
  • 10Gad Xiaoshan, Lin Qiang, Zhang Guifang. A C-tree decomposition algorithm fir 2D and 3D geometric Gnnstraint solving[ J]. Computer- Aided Design,2006,38( 1 ) : 1- 13.

引证文献3

二级引证文献1

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部