期刊文献+

混合改进人工蜂群算法的机器人路径规划研究 被引量:2

Research on Robot Path Planning Based on Hybrid Improved Artificial Bee Colony Algorithm
下载PDF
导出
摘要 传统群智能算法在研究路径规划时,存在早熟、搜索效率低及难以获取最佳路径等不足。针对这些问题,提出了一种混合改进人工蜂群算法。新算法首先利用人工势场法高效简单的优势将其与标准人工蜂群算法相结合,然后针对算法中存在易于陷入局部最优等缺陷将Levy分布与柯西变异算子引入标准人工蜂群算法中,新算法用Levy分布产生的步长取代食物源更新公式中的随机步长,在随机搜索策略中运用柯西分布的特点进行全局搜索。实验结果表明,改进后的算法在求解机器人运动路径时能够有效提高搜索效率和精度,新算法具有可行性和有效性。 The traditional group intelligence algorithm has shortcomings in path planning research,such as premature aging,low search efficiency,and difficulty in obtaining the best path.In response to these shortcomings,a hybrid improved artificial bee colony algorithm is put forward in the paper.First,because the artificial potential field method has the advantage of high efficiency and simplicity,the new algorithm combines it with the standard artificial bee colony algorithm.Then,the Levy distribution and the Cauchy mutation operator are introduced into the standard artificial bee colony algorithm for the defect that the algorithm is easy to fall into the local optimum.In the new algorithm,the random step size in the food source update formula is replaced by the step size generated through the Levy distribution,and the characteristics of Cauchy distribution are utilized in a random search strategy for global search.The experimental results show that the algorithm search efficiency and accuracy are effectively improved when the improved algorithm is used to solve the robot motion path.The new algorithm is feasible and effective.
作者 陈信华 孟冠军 张伟 张磊 CHEN Xin-hua;MENG Guan-jun;ZHANG Wei;ZHANG Lei(School of Mechanical Engineering,Hefei University of Technology,Anhui Heifei 230009,China)
出处 《机械设计与制造》 北大核心 2022年第7期256-260,共5页 Machinery Design & Manufacture
基金 安徽省科技攻关计划资助项目(1604a0902181) 江苏省科技计划资助项目(BE2017101)。
关键词 路径规划 混合改进人工蜂群算法 人工势场法 Levy分布 柯西变异算子 Path Planning Hybrid Improved Artificial Bee Colony Algorithm Artificial Potential Field Method Levy Distribution Cauchy Mutation Operator
  • 相关文献

参考文献8

二级参考文献80

  • 1彭勇,施宁,林浒.佳点集遗传算法及其在PID控制中的应用[J].计算机应用研究,2009,26(2):524-526. 被引量:5
  • 2于红斌,李孝安.基于栅格法的机器人快速路径规划[J].微电子学与计算机,2005,22(6):98-100. 被引量:63
  • 3Latombe J-C.Robot Motion Planning[M].London:Kluwer Academic Publisher,1991.11 -54.
  • 4Crowley J L.Navigation for an intelligent mobile robot[J].IEEE Transactions on Robotics and Automation,1985,1 (1):31 -41.
  • 5Yang S X,Meng M.Neural network approaches to dynamic collision-free trajectory generation[J].IEEE Transactions on Systems,Man and Cybernetics-Part B,2001,31 (3):302 -317.
  • 6Yang S X,Luo C.A neural network approach to complete coverage path planning[J].IEEE Transactions on Systems,Man and Cybernetics-Part B,2004,34(1):718 -724.
  • 7Hodgkin L,Huxley A F.A quantitative description of membrane current and its application to conduction and excitation in nerve[J].Journal of Physiology,1952,117(4):500 -544.
  • 8Grossberg S.Nonlinear neural networks:principles,mechanism,and architectures[J].IEEE Transactions on Neural Networks,1988,1(1) 17-61.
  • 9Doyle A B,Jones D I.A tangent based method for robot path planning[A].Proceedings of the IEEE International Conference on Robotics and Automation[C].Los Alamitos,CA,USA:IEEE Computer Society Press,1994.1561-1566.
  • 10顾新艳,金世俊.基于A+算法的移动机器人路径规划[J].科技信息,2007,21(4):36-79.

共引文献270

同被引文献15

引证文献2

二级引证文献4

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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