移动机器人导航的自定位与路径规划技术

Jiawei Zhou, H. Lin
{"title":"移动机器人导航的自定位与路径规划技术","authors":"Jiawei Zhou, H. Lin","doi":"10.1109/WCICA.2011.5970604","DOIUrl":null,"url":null,"abstract":"In this paper, we propose a system to cope with the problem of autonomous mobile robot navigation. It is able to perform path planning and localize the robot in the real world environment. The path planning is first carried out using the known map, and the laser range scanner is then used to localize the robot based on the ICP registration technique. During the robot motion, the potential field is taken into account for obstacle avoidance. For the path planning, the visibility graph is established based on the current position of the robot. The Dijkstra algorithm is then used to find the shortest path to the goal position. Experimental results for both the simulation and real world environment are presented.","PeriodicalId":211049,"journal":{"name":"2011 9th World Congress on Intelligent Control and Automation","volume":null,"pages":null},"PeriodicalIF":0.0000,"publicationDate":"2011-06-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"19","resultStr":"{\"title\":\"A self-localization and path planning technique for mobile robot navigation\",\"authors\":\"Jiawei Zhou, H. Lin\",\"doi\":\"10.1109/WCICA.2011.5970604\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In this paper, we propose a system to cope with the problem of autonomous mobile robot navigation. It is able to perform path planning and localize the robot in the real world environment. The path planning is first carried out using the known map, and the laser range scanner is then used to localize the robot based on the ICP registration technique. During the robot motion, the potential field is taken into account for obstacle avoidance. For the path planning, the visibility graph is established based on the current position of the robot. The Dijkstra algorithm is then used to find the shortest path to the goal position. Experimental results for both the simulation and real world environment are presented.\",\"PeriodicalId\":211049,\"journal\":{\"name\":\"2011 9th World Congress on Intelligent Control and Automation\",\"volume\":null,\"pages\":null},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2011-06-21\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"19\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2011 9th World Congress on Intelligent Control and Automation\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/WCICA.2011.5970604\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2011 9th World Congress on Intelligent Control and Automation","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/WCICA.2011.5970604","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 19

摘要

本文提出了一种解决自主移动机器人导航问题的系统。它能够在现实环境中进行路径规划和定位机器人。首先利用已知的地图进行路径规划,然后利用激光测距仪基于ICP配准技术对机器人进行定位。在机器人运动过程中,考虑了势场的影响,进行了避障。对于路径规划,根据机器人的当前位置建立可见性图。然后使用Dijkstra算法寻找到目标位置的最短路径。给出了仿真和现实环境下的实验结果。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
A self-localization and path planning technique for mobile robot navigation
In this paper, we propose a system to cope with the problem of autonomous mobile robot navigation. It is able to perform path planning and localize the robot in the real world environment. The path planning is first carried out using the known map, and the laser range scanner is then used to localize the robot based on the ICP registration technique. During the robot motion, the potential field is taken into account for obstacle avoidance. For the path planning, the visibility graph is established based on the current position of the robot. The Dijkstra algorithm is then used to find the shortest path to the goal position. Experimental results for both the simulation and real world environment are presented.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信