The D++ algorithm: Real-Time and collision-free path-planning for mobile robot

P. Cheng, Pin-Jyun Chen
{"title":"The D++ algorithm: Real-Time and collision-free path-planning for mobile robot","authors":"P. Cheng, Pin-Jyun Chen","doi":"10.1109/IROS.2010.5652124","DOIUrl":null,"url":null,"abstract":"This paper proposed an improved algorithm that we call “D++” which can be applied to real-time and collision-free path -planning to solve some problems of common methods at present. D++ algorithm combines the Dijkstra's algorithm with sensor-based method so that D++ algorithm can deal with problems of unknown, large, complex, or dynamic environment, and need only local environmental information initially to find a shortest path. In the later of this article, we demonstrated some examples to show that D++ algorithm is very efficient for path-planning and also very practicable on real mobile robot system.","PeriodicalId":420658,"journal":{"name":"2010 IEEE/RSJ International Conference on Intelligent Robots and Systems","volume":"55 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2010-12-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"4","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2010 IEEE/RSJ International Conference on Intelligent Robots and Systems","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/IROS.2010.5652124","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 4

Abstract

This paper proposed an improved algorithm that we call “D++” which can be applied to real-time and collision-free path -planning to solve some problems of common methods at present. D++ algorithm combines the Dijkstra's algorithm with sensor-based method so that D++ algorithm can deal with problems of unknown, large, complex, or dynamic environment, and need only local environmental information initially to find a shortest path. In the later of this article, we demonstrated some examples to show that D++ algorithm is very efficient for path-planning and also very practicable on real mobile robot system.
D++算法:移动机器人实时无碰撞路径规划
本文提出了一种改进算法,我们称之为“d++”,该算法可用于实时无碰撞路径规划,解决了目前常用方法存在的一些问题。D++算法将Dijkstra算法与基于传感器的方法相结合,使得D++算法可以处理未知的、大型的、复杂的或动态的环境问题,并且最初只需要局部环境信息就可以找到最短路径。在本文的后面,我们通过一些例子证明了d++算法对于路径规划是非常有效的,并且在实际的移动机器人系统上也是非常可行的。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
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学术官方微信