{"title":"机械臂逆运动学加速牛顿算法","authors":"I. Dulęba, I. Karcz-Dulęba","doi":"10.1109/MMAR.2018.8486063","DOIUrl":null,"url":null,"abstract":"In this paper a few methods of accelerating computations of an inverse kinematic task for robot manipulators are discussed and compared. The methods adapt known ideas to the domain of robotics, and rely on an approximation of inverse matrices, that are computed in each iteration of the Newton algorithm of inverse kinematics, with much computationally cheaper matrix polynomials. The computational efficiency of the methods is illustrated on planar pendula with a varied degree of redundancy.","PeriodicalId":201658,"journal":{"name":"2018 23rd International Conference on Methods & Models in Automation & Robotics (MMAR)","volume":"34 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2018-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"Accelerating Newton Algorithms of Inverse Kinematics for Robot Manipulators\",\"authors\":\"I. Dulęba, I. Karcz-Dulęba\",\"doi\":\"10.1109/MMAR.2018.8486063\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In this paper a few methods of accelerating computations of an inverse kinematic task for robot manipulators are discussed and compared. The methods adapt known ideas to the domain of robotics, and rely on an approximation of inverse matrices, that are computed in each iteration of the Newton algorithm of inverse kinematics, with much computationally cheaper matrix polynomials. The computational efficiency of the methods is illustrated on planar pendula with a varied degree of redundancy.\",\"PeriodicalId\":201658,\"journal\":{\"name\":\"2018 23rd International Conference on Methods & Models in Automation & Robotics (MMAR)\",\"volume\":\"34 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2018-08-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2018 23rd International Conference on Methods & Models in Automation & Robotics (MMAR)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/MMAR.2018.8486063\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2018 23rd International Conference on Methods & Models in Automation & Robotics (MMAR)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/MMAR.2018.8486063","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Accelerating Newton Algorithms of Inverse Kinematics for Robot Manipulators
In this paper a few methods of accelerating computations of an inverse kinematic task for robot manipulators are discussed and compared. The methods adapt known ideas to the domain of robotics, and rely on an approximation of inverse matrices, that are computed in each iteration of the Newton algorithm of inverse kinematics, with much computationally cheaper matrix polynomials. The computational efficiency of the methods is illustrated on planar pendula with a varied degree of redundancy.