提高时间最优路径跟踪算法的效率

J. Slotine, Hyun S. Yang
{"title":"提高时间最优路径跟踪算法的效率","authors":"J. Slotine, Hyun S. Yang","doi":"10.1109/70.88024","DOIUrl":null,"url":null,"abstract":"This paper presents a new method which significantly improves the computational efficiency of time-optimal path-following planning algorithms for robot manipulators with limited actuator torques. The approach exploits the fact that the characteristic switching points of earlier techniques can be found directly in a straightforward fashion. Numerical examples, while showing the consistency of the algorithm with the existing techniques, demonstrate its potential for increasing computational efficiency by several orders of magnitude.","PeriodicalId":6395,"journal":{"name":"1988 American Control Conference","volume":"21 1","pages":"2129-2134"},"PeriodicalIF":0.0000,"publicationDate":"1988-06-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"271","resultStr":"{\"title\":\"Improving the Efficiency of Time-Optimal Path-Following Algorithms\",\"authors\":\"J. Slotine, Hyun S. Yang\",\"doi\":\"10.1109/70.88024\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"This paper presents a new method which significantly improves the computational efficiency of time-optimal path-following planning algorithms for robot manipulators with limited actuator torques. The approach exploits the fact that the characteristic switching points of earlier techniques can be found directly in a straightforward fashion. Numerical examples, while showing the consistency of the algorithm with the existing techniques, demonstrate its potential for increasing computational efficiency by several orders of magnitude.\",\"PeriodicalId\":6395,\"journal\":{\"name\":\"1988 American Control Conference\",\"volume\":\"21 1\",\"pages\":\"2129-2134\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1988-06-15\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"271\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"1988 American Control Conference\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/70.88024\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"1988 American Control Conference","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/70.88024","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 271

摘要

本文提出了一种新的方法,该方法显著提高了有限执行机构力矩的机器人时间最优路径跟踪规划算法的计算效率。该方法利用了这样一个事实,即早期技术的特征开关点可以直接以一种简单的方式找到。数值算例显示了该算法与现有技术的一致性,并证明了其将计算效率提高几个数量级的潜力。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Improving the Efficiency of Time-Optimal Path-Following Algorithms
This paper presents a new method which significantly improves the computational efficiency of time-optimal path-following planning algorithms for robot manipulators with limited actuator torques. The approach exploits the fact that the characteristic switching points of earlier techniques can be found directly in a straightforward fashion. Numerical examples, while showing the consistency of the algorithm with the existing techniques, demonstrate its potential for increasing computational efficiency by several orders of magnitude.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术官方微信