基于快速探索随机树的在线路径规划

Jorge Nieto, E. Slawiñski, V. Mut, Bernardo Wagner
{"title":"基于快速探索随机树的在线路径规划","authors":"Jorge Nieto, E. Slawiñski, V. Mut, Bernardo Wagner","doi":"10.1109/ICIT.2010.5472492","DOIUrl":null,"url":null,"abstract":"This paper proposes an online path-planning algorithm based on Rapidly-Exploring Random Trees (RRT) applied to the autonomous navigation of a mobile robot. The proposed planner includes two heuristics to improve the performance and generates a set of collision-free paths, from which the one with the most similarity to a reference path given by a supervisor human operator is chosen. This reference can be given a priori when setting the start and goal positions, and be defined as the straight path between them. Simulations and experiments are made to evaluate the performance of the proposed method.","PeriodicalId":256385,"journal":{"name":"2010 IEEE International Conference on Industrial Technology","volume":"2 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2010-03-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"31","resultStr":"{\"title\":\"Online path planning based on Rapidly-Exploring Random Trees\",\"authors\":\"Jorge Nieto, E. Slawiñski, V. Mut, Bernardo Wagner\",\"doi\":\"10.1109/ICIT.2010.5472492\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"This paper proposes an online path-planning algorithm based on Rapidly-Exploring Random Trees (RRT) applied to the autonomous navigation of a mobile robot. The proposed planner includes two heuristics to improve the performance and generates a set of collision-free paths, from which the one with the most similarity to a reference path given by a supervisor human operator is chosen. This reference can be given a priori when setting the start and goal positions, and be defined as the straight path between them. Simulations and experiments are made to evaluate the performance of the proposed method.\",\"PeriodicalId\":256385,\"journal\":{\"name\":\"2010 IEEE International Conference on Industrial Technology\",\"volume\":\"2 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2010-03-14\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"31\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2010 IEEE International Conference on Industrial Technology\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICIT.2010.5472492\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2010 IEEE International Conference on Industrial Technology","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICIT.2010.5472492","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 31

摘要

提出了一种基于快速探索随机树(RRT)的在线路径规划算法,应用于移动机器人的自主导航。该规划器采用两种启发式算法来提高性能,并生成一组无冲突路径,从中选择与监督人类操作员给出的参考路径最相似的路径。在设定起点和目标位置时,可以先验地给出这个参考点,并将其定义为两者之间的直线路径。通过仿真和实验对该方法的性能进行了评价。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Online path planning based on Rapidly-Exploring Random Trees
This paper proposes an online path-planning algorithm based on Rapidly-Exploring Random Trees (RRT) applied to the autonomous navigation of a mobile robot. The proposed planner includes two heuristics to improve the performance and generates a set of collision-free paths, from which the one with the most similarity to a reference path given by a supervisor human operator is chosen. This reference can be given a priori when setting the start and goal positions, and be defined as the straight path between them. Simulations and experiments are made to evaluate the performance of the proposed method.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术文献互助群
群 号:604180095
Book学术官方微信