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

果园移动机器人的全局最优路径规划研究
引用本文:涂亮杰,李林升,林国湘.果园移动机器人的全局最优路径规划研究[J].南华大学学报(自然科学版),2017,31(4):71-74.
作者姓名:涂亮杰  李林升  林国湘
作者单位:南华大学 机械工程学院,湖南 衡阳 421001,南华大学 机械工程学院,湖南 衡阳 421001,南华大学 机械工程学院,湖南 衡阳 421001
基金项目:湖南省教育厅重点项目(15A160);衡阳市重点项目(2015KC06)
摘    要:为了实现移动机器人在果园环境下自主行走,对果园移动机器人在复杂果园环境中的最优路径规划进行研究.首先,利用栅格法定义了移动机器人在栅格上的运动方向、障碍物及信息编码,模拟建立出果园的环境地图模型.然后分别编写Dijkstra算法、A*算法,对果园机器人进行全局最优路径规划.通过分析比较,得出A*算法所规划的最优路径更为方便,搜索效率更高,更加满足果园机器人的实际工作需求,提高其工作效率.

关 键 词:果园机器人  全局最优路径规划  Dijkstra算法  A*算法
收稿时间:2017/7/3 0:00:00

Orchard Global Optimal Path Planning for Mobile Robot Research
TU Liang-jie,LI Lin-sheng and LIN Guo-xiang.Orchard Global Optimal Path Planning for Mobile Robot Research[J].Journal of Nanhua University:Science and Technology,2017,31(4):71-74.
Authors:TU Liang-jie  LI Lin-sheng and LIN Guo-xiang
Institution:School of Mechanical Engineering,University of South China,Hengyang,Hunan 421001,China,School of Mechanical Engineering,University of South China,Hengyang,Hunan 421001,China and School of Mechanical Engineering,University of South China,Hengyang,Hunan 421001,China
Abstract:In order to realize mobile robot autonomous walking in orchard environment,the optimal path planning of the orchard mobile robot in complex orchard environment was studied.First of all,using the grid method,the movement direction of the mobile robot on the grid,obstacles and information coding was defined,the environment map model of the orchard was established by simulation.Then,write Dijkstra algorithm and A* algorithm,and carry out global optimal path planning for orchard robot.Through analysis and comparison,it''s concluded that the optimal path planning by the A * algorithm was more convenient,efficiency of search was more higher,more satisfying the actual work demand of the orchard robot,and its working efficiency was improved.
Keywords:orchard robot  global optimal path planning  Dijkstra algorithm  A* algorithm
本文献已被 CNKI 等数据库收录!
点击此处可从《南华大学学报(自然科学版)》浏览原始摘要信息
点击此处可从《南华大学学报(自然科学版)》下载免费的PDF全文
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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