机床与液压
機床與液壓
궤상여액압
MACHINE TOOL & HYDRAULICS
2014年
15期
118-122
,共5页
陈岳坪%靳龙%李书平%宋世柳%陈艺
陳嶽坪%靳龍%李書平%宋世柳%陳藝
진악평%근룡%리서평%송세류%진예
自由曲面匹配%微分进化法%最小二乘准则%最小条件原则%尺度变换
自由麯麵匹配%微分進化法%最小二乘準則%最小條件原則%呎度變換
자유곡면필배%미분진화법%최소이승준칙%최소조건원칙%척도변환
Free-form surface matching%Differential evolution method%Least square criterion%Least condition principle%Scale transform
研究自由曲面的高精度匹配技术。采用两步法即粗匹配和精匹配对曲面匹配进行逐步求精:采用微分进化算法进行粗匹配,获得下一步精匹配迭代过程的初始点,解决了迭代最近点算法(ICP)存在的容易收敛于局部最优点的问题,并克服了遗传算法收敛速度较慢的缺陷;基于最小二乘准则和最小条件原则,分别采用单纯形法和坐标轮换法循环计算进行精匹配,同时对设计变量进行尺度变换,改善了优化设计数学模型的性态。以Visual C++6.0为开发工具,编程实现了自由曲面的高精度匹配。运行实例表明,上述算法是可行和有效的。
研究自由麯麵的高精度匹配技術。採用兩步法即粗匹配和精匹配對麯麵匹配進行逐步求精:採用微分進化算法進行粗匹配,穫得下一步精匹配迭代過程的初始點,解決瞭迭代最近點算法(ICP)存在的容易收斂于跼部最優點的問題,併剋服瞭遺傳算法收斂速度較慢的缺陷;基于最小二乘準則和最小條件原則,分彆採用單純形法和坐標輪換法循環計算進行精匹配,同時對設計變量進行呎度變換,改善瞭優化設計數學模型的性態。以Visual C++6.0為開髮工具,編程實現瞭自由麯麵的高精度匹配。運行實例錶明,上述算法是可行和有效的。
연구자유곡면적고정도필배기술。채용량보법즉조필배화정필배대곡면필배진행축보구정:채용미분진화산법진행조필배,획득하일보정필배질대과정적초시점,해결료질대최근점산법(ICP)존재적용역수렴우국부최우점적문제,병극복료유전산법수렴속도교만적결함;기우최소이승준칙화최소조건원칙,분별채용단순형법화좌표륜환법순배계산진행정필배,동시대설계변량진행척도변환,개선료우화설계수학모형적성태。이Visual C++6.0위개발공구,편정실현료자유곡면적고정도필배。운행실례표명,상술산법시가행화유효적。
The high accuracy matching technology of free-form surface was studied.The two-step surface matching method,i.e. the rough matching step and the accurate matching step,was used to obtain higher accuracy results.In the rough matching step,the differential evolution method,which could avoid the local convergence of iterative closest point (ICP)method and overcome the draw-back of low convergence rate of genetic algorithm,was put forward to obtain initial points,which would be used in the next accurate matching step.Based on the least square criterion and the least condition principle,the simplex method and the coordinate alternation method were presented to obtain the best matching result,respectively.To improve the behavior of the mathematical model,a scale transform was done with the design variables.With the development tool Visual C++6.0,a computer program was implemented to re-alize the high accuracy matching of free-form surface.An experiment was conducted to verify the validity and feasibility of these algo-rithms.