{"title":"求解冗余开放运动链逆任务的加速降梯度算法","authors":"H. Issa, Bence Varga, J. Tar","doi":"10.1109/SACI51354.2021.9465623","DOIUrl":null,"url":null,"abstract":"The solution of the differential inverse kinematic task of redundant open kinematic chains normally can be formulated as an optimization task under constraints in which the kinematic task means the constraint equations and the solution is made unambiguous by minimizing some cost function. This task only in the case of quadratic cost functions can be solved without numerical iteration. The ambiguity of the possible solutions can be utilized by “adding” certain elements of the null space of the Jacobian to this solution. If the cost function has more complex structure the more general numerical procedure of Lagrange’s Reduced Gradient Algorithm can be applied. Recently it was found that this procedure seriously can be accelerated if the computation of the Lagrange multipliers belonging to the individual constraint equations becomes unnecessary. In this case a single vector must be reduced with the components of another one. In the present paper this method is directly applied for the efficient solution of the inverse kinematic task of redundant robot arms. The method is exemplified in designing a particular kinematic structure for a robot arm for specified use.","PeriodicalId":321907,"journal":{"name":"2021 IEEE 15th International Symposium on Applied Computational Intelligence and Informatics (SACI)","volume":"11 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2021-05-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Accelerated Reduced Gradient Algorithm for Solving the Inverse Kinematic Task of Redundant Open Kinematic Chains\",\"authors\":\"H. Issa, Bence Varga, J. Tar\",\"doi\":\"10.1109/SACI51354.2021.9465623\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"The solution of the differential inverse kinematic task of redundant open kinematic chains normally can be formulated as an optimization task under constraints in which the kinematic task means the constraint equations and the solution is made unambiguous by minimizing some cost function. This task only in the case of quadratic cost functions can be solved without numerical iteration. The ambiguity of the possible solutions can be utilized by “adding” certain elements of the null space of the Jacobian to this solution. If the cost function has more complex structure the more general numerical procedure of Lagrange’s Reduced Gradient Algorithm can be applied. Recently it was found that this procedure seriously can be accelerated if the computation of the Lagrange multipliers belonging to the individual constraint equations becomes unnecessary. In this case a single vector must be reduced with the components of another one. In the present paper this method is directly applied for the efficient solution of the inverse kinematic task of redundant robot arms. The method is exemplified in designing a particular kinematic structure for a robot arm for specified use.\",\"PeriodicalId\":321907,\"journal\":{\"name\":\"2021 IEEE 15th International Symposium on Applied Computational Intelligence and Informatics (SACI)\",\"volume\":\"11 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2021-05-19\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2021 IEEE 15th International Symposium on Applied Computational Intelligence and Informatics (SACI)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/SACI51354.2021.9465623\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2021 IEEE 15th International Symposium on Applied Computational Intelligence and Informatics (SACI)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/SACI51354.2021.9465623","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Accelerated Reduced Gradient Algorithm for Solving the Inverse Kinematic Task of Redundant Open Kinematic Chains
The solution of the differential inverse kinematic task of redundant open kinematic chains normally can be formulated as an optimization task under constraints in which the kinematic task means the constraint equations and the solution is made unambiguous by minimizing some cost function. This task only in the case of quadratic cost functions can be solved without numerical iteration. The ambiguity of the possible solutions can be utilized by “adding” certain elements of the null space of the Jacobian to this solution. If the cost function has more complex structure the more general numerical procedure of Lagrange’s Reduced Gradient Algorithm can be applied. Recently it was found that this procedure seriously can be accelerated if the computation of the Lagrange multipliers belonging to the individual constraint equations becomes unnecessary. In this case a single vector must be reduced with the components of another one. In the present paper this method is directly applied for the efficient solution of the inverse kinematic task of redundant robot arms. The method is exemplified in designing a particular kinematic structure for a robot arm for specified use.