期刊文献+

基于改进蚁群算法的工业机器人路径规划研究 被引量:3

Research on path planning of industrial robot based onimproved ant colony algorithm
下载PDF
导出
摘要 针对蚁群算法在机械臂路径规划中存在的问题,如路径过长、收敛速度慢等,文章提出一种改进的蚁群算法。首先将蚁群分为外层蚁群和内层蚁群,分别设计不同的启发函数来提高搜索效率,并引入安全因子提高机械臂运动过程的安全性,利用外层蚁群初始化信息素,引导内层蚁群进行全局寻优;为了加强优质种群的寻优能力,在信息素更新原则中引入狼群的猎物分配机制,同时改善部分路径信息素浓度,防止算法陷入局部最优;得到的机械臂末端有效路径再经过机械臂逆运动学运算和碰撞检测,转化为一条机械臂最优位姿路径。仿真实验表明该算法能为机械臂在不同环境中规划出一条符合运动要求的避障路径。 Aiming at the problems of ant colony algorithm in manipulator path planning,such as long path and slow convergence speed,this paper proposes an improved ant colony algorithm.In this algorithm,the ant colony is divided into outer ant colony and inner ant colony,different heuristic functions are designed to improve the search efficiency,and the safety factor is introduced to improve the safety of the manipulator movement process.The outer ant colony is used to initialize pheromone and guide the inner ant colony to conduct global optimization.In order to strengthen the optimization ability of high-quality population,the mechanism of prey allocation of wolves is introduced into the pheromone update principle.It can improve the concentration of some path pheromones and prevent the algorithm from falling into local optimum.Finally,the effective path at the end of the manipulator is transformed into an optimal position and attitude path of the manipulator through inverse kinematics operation and collision detection.The simulation experiments show that the algorithm can plan a path to avoid obstacles for the manipulator in different environments that meets the motion requirements.
作者 朱敏 肖阳 臧昭宇 ZHU Min;XIAO Yang;ZANG Zhaoyu(School of Electrical Engineering and Automation,Hefei University of Technology,Hefei 230009,China)
出处 《合肥工业大学学报(自然科学版)》 CAS 北大核心 2023年第4期463-467,534,共6页 Journal of Hefei University of Technology:Natural Science
基金 国家自然科学基金资助项目(62073113)。
关键词 改进蚁群算法 机械臂 路径规划 安全因子 碰撞检测 狼群的猎物分配机制 improved ant colony algorithm manipulator path planning safety factor collision detection prey allocation mechanism of wolves
  • 相关文献

参考文献10

二级参考文献88

  • 1赵真明,孟正大.基于加权A~*算法的服务型机器人路径规划[J].华中科技大学学报(自然科学版),2008,36(S1):196-198. 被引量:32
  • 2朱庆保,张玉兰.基于栅格法的机器人路径规划蚁群算法[J].机器人,2005,27(2):132-136. 被引量:121
  • 3张美玉,黄翰,郝志峰,杨晓伟.基于蚁群算法的机器人路径规划[J].计算机工程与应用,2005,41(25):34-37. 被引量:46
  • 4韩华伟,张俊华,李春植.虚拟环境下车身焊装夹具干涉的研究[J].机械科学与技术,2007,26(3):394-398. 被引量:8
  • 5Dorigo M,Di Caro G.Ant algorithms for discrete optimization [J]. Artificial Life, 1999,5(2) : 137 - 172.
  • 6Dodgo M,Bonabeau E, Theraulaz G.Ant algorithms and stigmergy[ J ]. Future Generation Computer Systems, 2000, 16(9): 851 - 871.
  • 7Walter Gutjahr J. A graph-based ant system and its convergence [ J]. Future Generation Computer Systems, 2000, 16:873 - 888.
  • 8Bilchev G,Parmee I C. The ant colony metaphor for searching continuous design spaces [A]. Fogarty T. Lecture Notes in Computer Science[C]. Heidelberg: Springer Berlin, 1995.25 - 39.
  • 9Dero J, Siarry P. Continuous interacting ant colony algorithm based on dense heterarchy [ J ]. Future Generation Computer Systems, 2004,5 (20) : 841 - 856.
  • 10Karaboga N, Kalinli A, Karaboga D. Designing digital IIR filters using ant colony optimization algorithm[ J ]. Engineering Application of Artificial InteUigence, 2004,17(2) :301- 309.

共引文献160

同被引文献21

引证文献3

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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