基于拆卸的高效运动规划

Yuandong Yang, O. Brock
{"title":"基于拆卸的高效运动规划","authors":"Yuandong Yang, O. Brock","doi":"10.15607/RSS.2005.I.014","DOIUrl":null,"url":null,"abstract":"Disassembly-based motion planning (DBMP) is a novel and efficient single-query, sampling-based motion planning approach for free-flying robots. Disassembly-based motion planning uses workspace information to determine the workspace volume of a potential solution path and uses this information to exclude large portions of configuration space from exploration. It also identifies the most constrained placements of the robot along the potential solution path. These placements are referred to as assemblies because they are highly constrained by the environment, much like parts in an assembly are constrained. The constraints limit the possible motions of the robot and thus can be exploited to further limit configuration space exploration. The use of these two sources of workspace information permits the solution of many practical problems with very limited configuration space exploration. This reduction in configuration space exploration results in performance improvements of several orders of magnitude, compared to state-of-the-art motion planning methods. For non-free-flying robots, disassembly-based motion planning performs at least as well as the sampling-based motion planning method it is based on.","PeriodicalId":87357,"journal":{"name":"Robotics science and systems : online proceedings","volume":"8 1","pages":"97-104"},"PeriodicalIF":0.0000,"publicationDate":"2005-06-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"34","resultStr":"{\"title\":\"Efficient Motion Planning Based on Disassembly\",\"authors\":\"Yuandong Yang, O. Brock\",\"doi\":\"10.15607/RSS.2005.I.014\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Disassembly-based motion planning (DBMP) is a novel and efficient single-query, sampling-based motion planning approach for free-flying robots. Disassembly-based motion planning uses workspace information to determine the workspace volume of a potential solution path and uses this information to exclude large portions of configuration space from exploration. It also identifies the most constrained placements of the robot along the potential solution path. These placements are referred to as assemblies because they are highly constrained by the environment, much like parts in an assembly are constrained. The constraints limit the possible motions of the robot and thus can be exploited to further limit configuration space exploration. The use of these two sources of workspace information permits the solution of many practical problems with very limited configuration space exploration. This reduction in configuration space exploration results in performance improvements of several orders of magnitude, compared to state-of-the-art motion planning methods. For non-free-flying robots, disassembly-based motion planning performs at least as well as the sampling-based motion planning method it is based on.\",\"PeriodicalId\":87357,\"journal\":{\"name\":\"Robotics science and systems : online proceedings\",\"volume\":\"8 1\",\"pages\":\"97-104\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2005-06-08\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"34\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Robotics science and systems : online proceedings\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.15607/RSS.2005.I.014\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Robotics science and systems : online proceedings","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.15607/RSS.2005.I.014","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 34

摘要

基于拆卸的运动规划(DBMP)是一种新颖、高效的基于单查询、采样的自由飞行机器人运动规划方法。基于拆卸的运动规划使用工作空间信息来确定潜在解路径的工作空间体积,并使用该信息排除大部分配置空间。它还确定了机器人沿着潜在解路径的最受约束的位置。这些位置被称为组件,因为它们受到环境的高度约束,就像组件中的部件受到约束一样。这些约束限制了机器人可能的运动,因此可以进一步限制构型空间探索。使用这两种工作空间信息源可以在非常有限的配置空间探索的情况下解决许多实际问题。与最先进的运动规划方法相比,减少配置空间探索导致性能提高几个数量级。对于非自由飞行机器人,基于拆卸的运动规划的性能至少与其所基于的基于采样的运动规划方法一样好。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Efficient Motion Planning Based on Disassembly
Disassembly-based motion planning (DBMP) is a novel and efficient single-query, sampling-based motion planning approach for free-flying robots. Disassembly-based motion planning uses workspace information to determine the workspace volume of a potential solution path and uses this information to exclude large portions of configuration space from exploration. It also identifies the most constrained placements of the robot along the potential solution path. These placements are referred to as assemblies because they are highly constrained by the environment, much like parts in an assembly are constrained. The constraints limit the possible motions of the robot and thus can be exploited to further limit configuration space exploration. The use of these two sources of workspace information permits the solution of many practical problems with very limited configuration space exploration. This reduction in configuration space exploration results in performance improvements of several orders of magnitude, compared to state-of-the-art motion planning methods. For non-free-flying robots, disassembly-based motion planning performs at least as well as the sampling-based motion planning method it is based on.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
CiteScore
12.00
自引率
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学术官方微信