基于局部地图信息的移动机器人增量路径规划

X. Lai, S. Ge, P. T. Ong, A. Mamun
{"title":"基于局部地图信息的移动机器人增量路径规划","authors":"X. Lai, S. Ge, P. T. Ong, A. Mamun","doi":"10.1109/ICARCV.2006.345286","DOIUrl":null,"url":null,"abstract":"This paper proposes a practical method for planning paths incrementally for mobile robots in unknown environments using the latest sensory information. A* algorithm was modified in this research for it to be able to handle an occupancy grid map with unknown information. Then the paper presented an algorithm that is able to robustly and incrementally searching for an optimal path based on the partial map simultaneously built by the robot. Waypoints was generated to further optimize the obtained path and were sequentially traced by the robot in a simple, reactive way. Extensive simulations and experiments were carried out to verify the proposed planning algorithm","PeriodicalId":415827,"journal":{"name":"2006 9th International Conference on Control, Automation, Robotics and Vision","volume":"123 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2006-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"3","resultStr":"{\"title\":\"Incremental Path Planning Using Partial Map Information for Mobile Robots\",\"authors\":\"X. Lai, S. Ge, P. T. Ong, A. Mamun\",\"doi\":\"10.1109/ICARCV.2006.345286\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"This paper proposes a practical method for planning paths incrementally for mobile robots in unknown environments using the latest sensory information. A* algorithm was modified in this research for it to be able to handle an occupancy grid map with unknown information. Then the paper presented an algorithm that is able to robustly and incrementally searching for an optimal path based on the partial map simultaneously built by the robot. Waypoints was generated to further optimize the obtained path and were sequentially traced by the robot in a simple, reactive way. Extensive simulations and experiments were carried out to verify the proposed planning algorithm\",\"PeriodicalId\":415827,\"journal\":{\"name\":\"2006 9th International Conference on Control, Automation, Robotics and Vision\",\"volume\":\"123 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2006-12-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"3\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2006 9th International Conference on Control, Automation, Robotics and Vision\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICARCV.2006.345286\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2006 9th International Conference on Control, Automation, Robotics and Vision","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICARCV.2006.345286","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 3

摘要

本文提出了一种利用最新的感知信息对未知环境中的移动机器人进行增量路径规划的实用方法。本文对A*算法进行了改进,使其能够处理未知信息的占用网格图。在此基础上,提出了一种基于机器人同时生成的局部地图鲁棒增量搜索最优路径的算法。生成路径点,进一步优化得到的路径,并由机器人以简单、反应的方式进行顺序跟踪。进行了大量的仿真和实验来验证所提出的规划算法
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Incremental Path Planning Using Partial Map Information for Mobile Robots
This paper proposes a practical method for planning paths incrementally for mobile robots in unknown environments using the latest sensory information. A* algorithm was modified in this research for it to be able to handle an occupancy grid map with unknown information. Then the paper presented an algorithm that is able to robustly and incrementally searching for an optimal path based on the partial map simultaneously built by the robot. Waypoints was generated to further optimize the obtained path and were sequentially traced by the robot in a simple, reactive way. Extensive simulations and experiments were carried out to verify the proposed planning algorithm
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术官方微信