运动规划的一种新方法

Huixin. Cheng, Heng-Da Cheng
{"title":"运动规划的一种新方法","authors":"Huixin. Cheng, Heng-Da Cheng","doi":"10.1109/IROS.1993.583193","DOIUrl":null,"url":null,"abstract":"The feasible map approach (FMA) to certain motion planning problems in robotics is introduced. This approach is based on the use of a feasible map representation of a configuration space. When a feasible map is constructed, the topology of a configuration space is derived by shrink transformation. Path planning is done at two levels: first, to find a feasible path in a feasible map, and second, to transform the feasible path in the feasible map into the configuration space. When a feasible map is obtained, the feasible path can be obtained according to any starting and desired configurations, at once. A detailed FMA is given on a sphere world and the performance of the proposed algorithm is demonstrated by experiments. The results indicate that the FMA is efficient, useful and widely applicable.","PeriodicalId":299306,"journal":{"name":"Proceedings of 1993 IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS '93)","volume":"5 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1993-07-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"A novel approach for motion planning\",\"authors\":\"Huixin. Cheng, Heng-Da Cheng\",\"doi\":\"10.1109/IROS.1993.583193\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"The feasible map approach (FMA) to certain motion planning problems in robotics is introduced. This approach is based on the use of a feasible map representation of a configuration space. When a feasible map is constructed, the topology of a configuration space is derived by shrink transformation. Path planning is done at two levels: first, to find a feasible path in a feasible map, and second, to transform the feasible path in the feasible map into the configuration space. When a feasible map is obtained, the feasible path can be obtained according to any starting and desired configurations, at once. A detailed FMA is given on a sphere world and the performance of the proposed algorithm is demonstrated by experiments. The results indicate that the FMA is efficient, useful and widely applicable.\",\"PeriodicalId\":299306,\"journal\":{\"name\":\"Proceedings of 1993 IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS '93)\",\"volume\":\"5 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1993-07-26\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Proceedings of 1993 IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS '93)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/IROS.1993.583193\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings of 1993 IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS '93)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/IROS.1993.583193","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 1

摘要

介绍了机器人运动规划问题的可行映射方法(FMA)。这种方法基于对配置空间的可行映射表示的使用。构造可行映射后,通过收缩变换导出位形空间的拓扑结构。路径规划分为两个层次:一是在可行映射中找到可行路径,二是将可行映射中的可行路径转化为构型空间。当获得可行映射时,可以同时根据任意起始配置和期望配置获得可行路径。给出了球面上的FMA算法,并通过实验验证了该算法的有效性。结果表明,FMA是一种有效、实用的方法,具有广泛的应用前景。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
A novel approach for motion planning
The feasible map approach (FMA) to certain motion planning problems in robotics is introduced. This approach is based on the use of a feasible map representation of a configuration space. When a feasible map is constructed, the topology of a configuration space is derived by shrink transformation. Path planning is done at two levels: first, to find a feasible path in a feasible map, and second, to transform the feasible path in the feasible map into the configuration space. When a feasible map is obtained, the feasible path can be obtained according to any starting and desired configurations, at once. A detailed FMA is given on a sphere world and the performance of the proposed algorithm is demonstrated by experiments. The results indicate that the FMA is efficient, useful and widely applicable.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术官方微信