Efficient Extreme Motion Planning by Learning from Experience

Kyungjae Lee
{"title":"Efficient Extreme Motion Planning by Learning from Experience","authors":"Kyungjae Lee","doi":"10.1109/ICTC55196.2022.9952449","DOIUrl":null,"url":null,"abstract":"In this paper, we propose the segment-based roadmap (SRM) method for extreme motion planning. Unlike existing roadmap-based approaches, each vertex in the SRM contains a sequence of configurations. This segment-based motion planning can effectively handle the narrow passage problem caused by stability constraints in a high dimensional space. The SRM is generated from trajectory examples and trajectory optimization. We extract motion segments from the trajectory examples. The extracted motion segments and its connection is stored in vertex set and edge set, respectively. Furthermore, a trajectory optimization method is used to increase the con-nectivity of the SRM. In particular, a Gaussian random path (GRP) is used to initialize the trajectory optimization problem and shown to be more effective in terms of final cost as well as the running time. In simulation study, the average final cost using the GRP initialization shows 96.7% improvements compared to the initialization with linear interpolation which is often used in practice. In experiment study, we conducted experiments on NAO in order to verify the proposed motion planner using the SRM.","PeriodicalId":441404,"journal":{"name":"2022 13th International Conference on Information and Communication Technology Convergence (ICTC)","volume":"28 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2022-10-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2022 13th International Conference on Information and Communication Technology Convergence (ICTC)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICTC55196.2022.9952449","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

Abstract

In this paper, we propose the segment-based roadmap (SRM) method for extreme motion planning. Unlike existing roadmap-based approaches, each vertex in the SRM contains a sequence of configurations. This segment-based motion planning can effectively handle the narrow passage problem caused by stability constraints in a high dimensional space. The SRM is generated from trajectory examples and trajectory optimization. We extract motion segments from the trajectory examples. The extracted motion segments and its connection is stored in vertex set and edge set, respectively. Furthermore, a trajectory optimization method is used to increase the con-nectivity of the SRM. In particular, a Gaussian random path (GRP) is used to initialize the trajectory optimization problem and shown to be more effective in terms of final cost as well as the running time. In simulation study, the average final cost using the GRP initialization shows 96.7% improvements compared to the initialization with linear interpolation which is often used in practice. In experiment study, we conducted experiments on NAO in order to verify the proposed motion planner using the SRM.
从经验中学习有效的极限运动规划
本文提出了一种基于分段的极限运动规划方法(SRM)。与现有的基于路线图的方法不同,SRM中的每个顶点都包含一系列配置。这种基于分段的运动规划可以有效地解决高维空间中由于稳定性约束导致的狭窄通道问题。SRM是通过轨迹示例和轨迹优化生成的。我们从轨迹示例中提取运动段。提取的运动段及其连接分别存储在顶点集和边缘集中。在此基础上,采用轨迹优化方法提高了SRM的连通性。特别地,使用高斯随机路径(GRP)来初始化轨迹优化问题,并证明了在最终成本和运行时间方面更有效。在仿真研究中,与实践中常用的线性插值初始化相比,使用GRP初始化的平均最终成本提高了96.7%。在实验研究中,我们使用SRM对NAO进行了实验,以验证所提出的运动规划器。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约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学术官方微信