{"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}
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.