期刊文献+

融合进化知识和角度信息的机器人路径规划方法 被引量:2

Novel Path Planning Method for Robots Based on Evolution Knowledge and Angle Information
原文传递
导出
摘要 针对已有机器人全局路径规划方法中存在的知识利用不充分问题,借鉴文化算法的双层进化结构,提出一种融合进化知识和角度信息的新型全局路径规划方法。根据问题需求,提出常识知识、角度信息和进化知识三类知识描述。根据各类知识特性不同,分别用于约束环境、指导个体可行性判断和修复算子。针对具有不同障碍物的两类环境,通过仿真分析与对比,表明本方法可以有效降低不可行个体判断和修复中的计算复杂度,提高进化收敛速度和解性能。 Existing global path planning methods do not utilize knowledge enough.To solve this problem,a novel path planning method based on evolution knowledge and angle information was proposed by adopting dual evolution structure in culture algorithms.Considering the need of the problem,three kinds of knowledge,including common sense,angle information and evolution knowledge,were given.These knowledges were used to constrain environment,judge and repair infeasible individuals according to their characters.Taking two types of environments with different obstacles as examples,simulation results indicate that the algorithm can decrease the computation complexity for judgment and repair of infeasible individual.It also can effectively improve the speed of convergence and have better computation stability.
出处 《系统仿真学报》 CAS CSCD 北大核心 2010年第5期1142-1147,共6页 Journal of System Simulation
基金 国家自然科学基金(60805025) 国家863计划项目(2007AA12Z162) 中国博士后科学基金项目(2005037225)
关键词 路径规划 角度信息 进化知识 遗传算法 栅格法 path planning angle information evolution knowledge genetic algorithm grid model
  • 相关文献

参考文献11

  • 1Alexopoulos C, Griffin P M. Path planning for a mobile robot [J]. IEEE Transactions on Systems, Man and Cybernetics (S1083-44119), 1992, 22(2): 318-3221.
  • 2曲道奎,杜振军,徐殿国,徐方.移动机器人路径规划方法研究[J].机器人,2008,30(2):97-101. 被引量:102
  • 3国海涛,朱庆保,徐守江.基于栅格法的机器人路径规划快速搜索随机树算法[J].南京师范大学学报(工程技术版),2007,7(2):58-61. 被引量:22
  • 4Qing Li, Wei Zhang, Yixin Yin, et al. An improved genetic algorithm of optimum path planning for mobile robots [C]// Proceedings of the Sixth International Conference on Intelligent Systems Design and Applications. USA: IEEE, 2006: 637-642.
  • 5J Tu, S Yang. Genetic algorithm based path planning for a mobile robot [C]// Proceedings of IEEE International conference on Robotics and Automation. USA: IEEE, 2003: 1221-1226.
  • 6Kaiyou Lei, Yuhui Qiu, Yi He. A novel path planning for mobile robots using modified particle swarm optimizer [C]//1 st International Symposium on Systems and Control in Aerospace and Astronautics. USA: IEEE, 2006: 981-984.
  • 7TAN Guan-Zheng,HE Huan,SLOMAN Aaron.Ant Colony System Algorithm for Real-Time Globally Optimal Path Planning of Mobile Robots[J].自动化学报,2007,33(3):279-285. 被引量:26
  • 8Tewoldc Girma S, Sheng Weihua. Robot path integration in manufacturing processes: Genetic algorithm versus ant colony optimization [J]. IEEE Transactions on Systems, Man, and Cybernetics Part A: Systems and Humans (S1083-4227), 2008, 38(2): 278-287.
  • 9Yah-tong Hu, Simon X Yang. A knowledge based genetic algorithm for path planning of a mobile robot [C]// Proceedings of the 2004 IEEE international Conference on Robotics & Automation. USA: IEEE, 2004: 4350-4355.
  • 10郭一楠,巩敦卫.双层进化交互式遗传算法的知识提取与利用[J].控制与决策,2007,22(12):1329-1334. 被引量:10

二级参考文献29

  • 1樊晓平,李双艳,陈特放.基于新人工势场函数的机器人动态避障规划[J].控制理论与应用,2005,22(5):703-707. 被引量:41
  • 2刘华军,杨静宇,陆建峰,唐振民,赵春霞,成伟明.移动机器人运动规划研究综述[J].中国工程科学,2006,8(1):85-94. 被引量:76
  • 3[1]Nearchou A C.Path planning of a mobile robot using genetic heuristics[J].Robotica,1998,16(5):575-588.
  • 4[4]D Amico A,Ippoliti G,Longhi S.A radial basis function networks approach for the tracking problem of mobile robots[C]//Proceedings of the IEEE/ASME International Conference on Advanced Intelligent Mechatronics.Como,Italy,2001,1:498-503.
  • 5[5]Allan R Willms,Simon X.Neural network approaches to dynamic collision-free robot trajectory generation[J].IEEE Trans Syst Man,Cybern,2001,31(3):302-318.
  • 6[6]Yang S X,Max M.An efficient neural network approach to dynamic robot motion planning[J].Neural Networks,2000,13(2):143-148.
  • 7[7]Karen I Trovato,Leo Dorst.Differential A*[J].IEEE Transactions on Knowledge and Data Engineering,2002,14(6):1218-1229.
  • 8[8]Bruce J,Veloso M.Real-time randomized path planning for robot navigation[C]//Proceedings for the IEEE/RSJ International Conference on Intelligent Robots and System.EPFL,Lausanne,Switzerland,2002,3:2383-2388.
  • 9[9]Peng Cheng,Steven M LaValle.Resolution complete rapidly-exploring random trees[C]//IEEE International Conference on Robotics and Automation.Washington,2002:267-272.
  • 10He J, Yao X. Drift analysis and average time complexity of evolutionary algorithms [J]. Artificial Intelligence, 2001, 127(1): 57-85.

共引文献155

同被引文献42

引证文献2

二级引证文献10

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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