摘要
路径规划是机器人技术研究领域中的核心问题。本文针对机器人路径规划问题,提出了基于遗传算法的解决方案。在遗传算子的设计中,通过加入自适应调整方法使得算法更加完善,解决进化过程中因陷入局部极小值而不能到达目标点的问题。最后,在模拟环境下进行路径规划仿真,验证了算法的有效性。
Path planning is the kernel problem of the robot technology area.The paper presents a solution to the path planning problem of robots based on the genetic algorithm.In the design of genetic operators,a self adaptation method is also used to make the algorithm more perfect.Therefore,it solves the problem of being not able to reach the target because of being trapped in the local minimum.Finally,path planning is simulated at a simulated environment.It is proved that the algorithm is valid.
出处
《计算机工程与科学》
CSCD
北大核心
2010年第7期104-107,共4页
Computer Engineering & Science
基金
国家863计划资助项目(2003AA411340)
国家自然科学基金资助项目(60473134)
