Extended RRT algorithm with dynamic N-dimensional cuboid domains

C. Fragkopoulos, A. Graeser
{"title":"Extended RRT algorithm with dynamic N-dimensional cuboid domains","authors":"C. Fragkopoulos, A. Graeser","doi":"10.1109/OPTIM.2010.5510401","DOIUrl":null,"url":null,"abstract":"The paper presents an approach to path planning problem for manipulators operating in difficult environments with high probability of collisions. The approach improves the Rapidly exploring Random Trees (RRT) algorithm and produces a new approach with better results. It is achieved by expanding the forward and backward tree and reducing dynamically the sampling area of the free-configuration space (C-Space) by introducing a N-Dimensional cuboid regions. The place of this area could be dynamically or statically defined. The results show that this modification provides a very reasonable solution to the path planning problem applicable also to any kind of manipulators.","PeriodicalId":239366,"journal":{"name":"2010 12th International Conference on Optimization of Electrical and Electronic Equipment","volume":"27 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2010-05-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"6","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2010 12th International Conference on Optimization of Electrical and Electronic Equipment","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/OPTIM.2010.5510401","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 6

Abstract

The paper presents an approach to path planning problem for manipulators operating in difficult environments with high probability of collisions. The approach improves the Rapidly exploring Random Trees (RRT) algorithm and produces a new approach with better results. It is achieved by expanding the forward and backward tree and reducing dynamically the sampling area of the free-configuration space (C-Space) by introducing a N-Dimensional cuboid regions. The place of this area could be dynamically or statically defined. The results show that this modification provides a very reasonable solution to the path planning problem applicable also to any kind of manipulators.
基于动态n维长方体域的扩展RRT算法
提出了一种求解高碰撞概率复杂环境下机械臂路径规划问题的方法。该方法改进了快速探索随机树(RRT)算法,并产生了一种效果更好的新方法。它是通过扩展正向和向后树,并通过引入n维长方体区域动态减小自由构型空间(c空间)的采样面积来实现的。该区域的位置可以动态或静态地定义。结果表明,这种改进方法为求解任意类型机械手的路径规划问题提供了一种合理的方法。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约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学术文献互助群
群 号:604180095
Book学术官方微信
小红书