改进蚁群算法优化的密集装配路径规划  

Improved Ant Colony Algorithm for Dense Assembly Path Planning

作　　者：张玉杰 高元楼[1] 李铎 兰治国 韩伟 Zhang Yujie;Gao Yuanlou;Li Duo;Lan Zhiguo;Han Wei(School of Automation Science and Electrical Engineering,Beihang University,Beijing 100191,China;No.2 Scientific Research Institute,Shanxi North Xing’an Chemical Industry Co.,Ltd.,Taiyuan 030000,China)

机构地区：[1]北京航空航天大学自动化科学与电气工程学院,北京100191 [2]山西北方兴安化学工业有限公司科研二所,太原030000

出　　处：《兵工自动化》2023年第11期30-32,共3页Ordnance Industry Automation

摘　　要：为提高密集装配工艺作业效率,针对其装配工艺建立数学模型,得到装配过程中的多目标路径规划问题。根据轮盘赌原则对蚁群算法进行改进,克服了算法容易陷入局部最优解问题并对装配轨迹进行优化。结果表明:该规划探索出密集装配工艺的最优路径,提高了装配工艺效率。In order to improve the efficiency of dense assembly process,this paper establishes a mathematical model for its assembly process,obtains the multi-objective path planning problem in the assembly process,improves the ant colony algorithm according to the roulette principle,overcomes the problem that the algorithm is easy to fall into the local optimal solution,optimizes the assembly trajectory,explores the optimal path of dense assembly process,and improves the efficiency of assembly process.

关 键 词：密集装配 蚁群算法 轮盘赌 路径规划 

分 类 号：TJ410.52[兵器科学与技术—火炮、自动武器与弹药工程]