复杂结构条件下的装配路径求解与优化技术  

Research on Assembly Path Planning and Optimization of Complex Structures

作　　者：刘密[1] 刘检华[1] 何永熹[1] 尚炜[1] 

机构地区：[1]川北京理工大学先进加工技术国防重点学科实验室,北京100081

出　　处：《机械工程学报》2013年第9期97-105,共9页Journal of Mechanical Engineering

基　　金：国家自然科学基金(51275047);国家商用飞机制造工程技术研究中心创新基金(07205)资助项目

摘　　要：针对复杂结构条件下的零部件装配路径自动求解困难的问题,提出基于障碍和贪心规则的快速扩展随机树(Rapidly-exploring random tree,RRT)算法。该算法以基本RRT算法为基础,采用随机采样、终点采样、局部采样相结合的采样方式,利用目标零件与障碍物的碰撞面片法向量和碰撞点位置来引导随机树的扩展方向,在每个扩展方向上按贪心规则进行扩展,并提出先平移后旋转的扩展策略。对求解得到的初始装配路径,提出运用分段线性拟合的方法进行路径自动优化。设计并开发了装配路径求解软件原型系统,进行了算例测试和实例应用,结果验证了算法的高效可行。In order to solve the difficult problem of assembly path planning of complex structures, an obstacle and greedy rule based rapidly-exploring random tree （OG-RRT） algorithm is proposed. The algorithm is based on basic RRT algorithm, adopts the combination of random sampling, goal sampling and local sampling, guides the extended direction of the random tree with the collision information （collision normal vector and collision point） of the target part and obstacles, extends nodes by greedy rule along each direction with translation-after-rotation expansion strategy. The piecewise linear approximation method is utilized to optimize the original assembly path. An assembly path planning prototype system is developed and some examples are tested to verify feasibility of the proposed algorithrn.

关 键 词：装配路径求解 快速扩展随机树 碰撞面片法矢量 路径优化 

分 类 号：TP391[自动化与计算机技术—计算机应用技术]