期刊文献+

移动机器人自主定位和导航系统设计与实现 被引量:16

Design and Implementation of Mobile Robot Autonomous Positioning and Navigation System
下载PDF
导出
摘要 为实现未知环境下,移动机器人自主定位和导航,构建精准的环境地图,提出移动机器人导航系统设计方法。采用蒙特卡洛算法对机器人进行定位,通过栅格地图扫描匹配方法进行地图构建,利用Dijkstra算法对当前地图进行路径规划。将上位机和下位机串口通信,把上位机路径规划的Twist消息发送给下位机,采用底层控制器来控制电机,实现移动机器人自主运动。实验结果表明:在实际环境中,移动机器人能够从起始点出发,自主绕过障碍物到达目的地,验证了该移动机器人自主导航系统设计方法的有效性。 To realize the autonomous mobile robot localization and navigation,and to construct a precise environment map,a mobile robot navigation system design method was proposed.The Monte Carlo algorithm was used to locate the robot.The grid map scanning matching method was used to construct the map,and the Dijkstra algorithm was used to plan the current map.The serial port communication between the upper computer and the lower computer was built,and the Twist message of the upper machine path planning was sent to the lower computer,and the bottom controller was used to control the motor to realize the autonomous movement of the mobile robot.The experimental results show that in the actual environment,the mobile robot can start from the starting point and autonomously bypass the obstacle to reach the destination,which verifies the effectiveness of the mobile robot autonomous navigation system design method proposed.
作者 仉新 张禹 苏晓明 ZHANG Xin;ZHANG Yu;SU Xiaoming(School of Mechanical Engineering,Shenyang University of Technology,Shenyang Liaoning 110870,China)
出处 《机床与液压》 北大核心 2020年第10期88-91,共4页 Machine Tool & Hydraulics
基金 国家自然科学基金资助项目(61573249)。
关键词 自主导航 移动机器人 定位 路径规划 Autonomous navigation Mobile robot Positioning Path planning
  • 相关文献

参考文献2

二级参考文献18

  • 1张红良,郭鹏宇,李壮.一种视觉辅助的惯性导航系统动基座初始对准方法[J].中国惯性技术学报,2014,12(4):469-473. 被引量:8
  • 2杨磊,宋涛.基于数组的桶排序算法[J].计算机研究与发展,2007,44(2):341-347. 被引量:13
  • 3Raja P, Pugazhenthi S. Optimal path planning of mobile ro- bots : A review [ J ]. International Journal of Physical Sci- ences, 2012,7(9) : 1314-1320.
  • 4Huang Biao, Kadali R. Dynamic Modeling, Predictive Con- trol and Performance Monitoring: A Data-driven Subspace Approach [ M ]. Springer, 2008.
  • 5Chen Yi-zhou, Shen Shi-fei, Chen Tao, et al. Path optimi- zation study for vehicles evacuation based on Dijkstra algo- rithm[ J]. Procedia Engineering, 2014,71 : 159-165.
  • 6Cui S G, Wang H, Yang L. A simulation study of A-star algorithm for robot path planning[ C] // 16th International Conference on Mechatronics Technology. 2012:506-510.
  • 7Harabor D D, Grastien A. Online graph pruning for path- finding on GridMaps [ C ]// Proceedings of the 25th AAAI Conference on Artificial Intelligence. 2011 : 1114-1119.
  • 8Ammar A, Bennaceur H, Chiari I, et al. Relaxed Dijkstra and A * with linear complexity for robot path planning problems in large-scale grid environments [ J ]. Soft Compu- ting, 2015,20(10) :4149-4171.
  • 9Wang Pei-dong, Tang Gong-you, Li Yang, et al. Ant colo- ny algorithm using endpoint approximation for robot path planning[ C]//2012 the 31st Chinese Control Conference. 2012:4960-4965.
  • 10Shihagh N A, Jalal L D. Optimal path planning for intelli- gent mobile robot navigation using modified particle swarm optimization [ J ]. International Journal of Engineering and Advanced Technology, 2013,2 (4) : 260-267.

共引文献43

同被引文献139

引证文献16

二级引证文献38

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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