首页 | 本学科首页   官方微博 | 高级检索  
     检索      

复杂环境下的移动机器人路径规划
引用本文:陈尔奎,吴梅花.复杂环境下的移动机器人路径规划[J].科学技术与工程,2018,18(33).
作者姓名:陈尔奎  吴梅花
作者单位:山东科技大学电气与自动化学院,山东科技大学电气与自动化学院
摘    要:为了提高移动机器人在复杂环境下的路径规划能力, 通过双层路径规划思想研究了移动机器人路径规划问题:用栅格法对机器人工作环境进行建模,首先采用改进的遗传算法进行全局路径规划,解决了由于交叉概率和变异概率选择不当导致最优个体丢失的问题;然后,在规划好的全局路径的基础上利用改进的人工势场法进行局部动态避障,解决了局部极小点问题。结果表明:移动机器人能够在复杂环境下规划出一条无碰撞的优化路径。可见改进算法的有效性。

关 键 词:移动机器人  自适应概率公式  局部极小点问题  双层路径规划
收稿时间:2018/4/11 0:00:00
修稿时间:2018/9/2 0:00:00

The Path Planning of Mobile Robots in Complex Environment
CHEN Er-kui and WU Mei-hua.The Path Planning of Mobile Robots in Complex Environment[J].Science Technology and Engineering,2018,18(33).
Authors:CHEN Er-kui and WU Mei-hua
Institution:Electrical and Automation College,Shandong University of Science and Technology,Electrical and Automation College,Shandong University of Science and Technology
Abstract:In order to improve the path planning ability of mobile robots in complex environment, a two-level path planning idea was used to investigate the path planning of mobile robots: The mobile robots working environment was modeled with the grid method. First, the improved genetic algorithm was used to plan the global path, and the problem of optimal individual loss caused by the improper selection of crossover probability and mutation probability was solved; Then, the improved artificial potential field algorithm was used to avoid the local dynamic obstacles based on global path, and the problem of local minima was solved. The results show that an optimization without collision path can be planned by mobile robots in complex environment. It is concluded that the improved algorithm is effective.
Keywords:mobile  robots    adaptive  probability formulas  the problem  of local  minima    a  two-level  path planning  idea
点击此处可从《科学技术与工程》浏览原始摘要信息
点击此处可从《科学技术与工程》下载免费的PDF全文
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号