{"title":"一种实用的puma560运动规划器","authors":"K. Gupta, Z. Guo","doi":"10.1109/PACRIM.1991.160729","DOIUrl":null,"url":null,"abstract":"A motion planner is implemented that plans collision-free motions for a PUMA 560 manipulator arm among stationary obstacles. The basic idea behind the approach is a novel sequential search strategy that successively plans the motion of each link starting from the base link. The strategy results in one 1-dimensional (the first link is degenerate) and n-1 2-dimensional planning problems instead of one n-dimensional problem for an n-link manipulator arm. The search strategy leads to a fast and efficient algorithm and is especially suited for highly redundant arms. However, the penalty is that the strategy may miss certain paths. In the current implementation for the PUMA 560, only the first three links of the arm are considered.<<ETX>>","PeriodicalId":289986,"journal":{"name":"[1991] IEEE Pacific Rim Conference on Communications, Computers and Signal Processing Conference Proceedings","volume":"42 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1991-05-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":"{\"title\":\"A practical motion planner for PUMA 560\",\"authors\":\"K. Gupta, Z. Guo\",\"doi\":\"10.1109/PACRIM.1991.160729\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"A motion planner is implemented that plans collision-free motions for a PUMA 560 manipulator arm among stationary obstacles. The basic idea behind the approach is a novel sequential search strategy that successively plans the motion of each link starting from the base link. The strategy results in one 1-dimensional (the first link is degenerate) and n-1 2-dimensional planning problems instead of one n-dimensional problem for an n-link manipulator arm. The search strategy leads to a fast and efficient algorithm and is especially suited for highly redundant arms. However, the penalty is that the strategy may miss certain paths. In the current implementation for the PUMA 560, only the first three links of the arm are considered.<<ETX>>\",\"PeriodicalId\":289986,\"journal\":{\"name\":\"[1991] IEEE Pacific Rim Conference on Communications, Computers and Signal Processing Conference Proceedings\",\"volume\":\"42 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1991-05-09\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"2\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"[1991] IEEE Pacific Rim Conference on Communications, Computers and Signal Processing Conference Proceedings\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/PACRIM.1991.160729\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"[1991] IEEE Pacific Rim Conference on Communications, Computers and Signal Processing Conference Proceedings","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/PACRIM.1991.160729","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 2

摘要

实现了PUMA 560机械臂在固定障碍物间的无碰撞运动规划。该方法背后的基本思想是一种新颖的顺序搜索策略,该策略从基本链路开始依次规划每个链路的运动。该策略的结果是一个一维(第一个连杆是退化的)和n-1个二维规划问题,而不是一个n连杆机械臂的一个n维规划问题。该算法具有快速、高效的特点,特别适用于高冗余臂的搜索。然而,代价是该策略可能会错过某些路径。在PUMA 560的当前实现中,只考虑了臂的前三个环节。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
A practical motion planner for PUMA 560
A motion planner is implemented that plans collision-free motions for a PUMA 560 manipulator arm among stationary obstacles. The basic idea behind the approach is a novel sequential search strategy that successively plans the motion of each link starting from the base link. The strategy results in one 1-dimensional (the first link is degenerate) and n-1 2-dimensional planning problems instead of one n-dimensional problem for an n-link manipulator arm. The search strategy leads to a fast and efficient algorithm and is especially suited for highly redundant arms. However, the penalty is that the strategy may miss certain paths. In the current implementation for the PUMA 560, only the first three links of the arm are considered.<>
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Systolic array implementation of 2-D finite memory filters Adaptive signal-subspace processing based on first-order perturbation analysis Suppression of narrow-band interference and multipath by spread-spectrum receiver using decision-feedback filters An LU factorization algorithm for parallel supercomputers with memory hierarchies DEDIP: a user-friendly environment for digital image processing algorithm development
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1