{"title":"Regularization of the differential inverse positioning problem of an elbow manipulator","authors":"D. Drexler","doi":"10.1109/SISY.2015.7325397","DOIUrl":null,"url":null,"abstract":"Solution of the differential inverse positioning sub-task is an important problem in robotics, that is burdened with kinematic singularities. This problem can be handled by regularizing the task Jacobian, however this requires the knowledge of the regularization vector. A candidate for the regularization vector for an elbow manipulator is given, and it is proved that this candidate can be used in almost every configuration. The candidate is the linear velocity generator of the last joint, so the calculation of the regularization vector does not require high computational capacity. The smallest singular value of the regularized task Jacobian is further analyzed in different singular configurations.","PeriodicalId":144551,"journal":{"name":"2015 IEEE 13th International Symposium on Intelligent Systems and Informatics (SISY)","volume":"152 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2015-11-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"3","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2015 IEEE 13th International Symposium on Intelligent Systems and Informatics (SISY)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/SISY.2015.7325397","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 3
Abstract
Solution of the differential inverse positioning sub-task is an important problem in robotics, that is burdened with kinematic singularities. This problem can be handled by regularizing the task Jacobian, however this requires the knowledge of the regularization vector. A candidate for the regularization vector for an elbow manipulator is given, and it is proved that this candidate can be used in almost every configuration. The candidate is the linear velocity generator of the last joint, so the calculation of the regularization vector does not require high computational capacity. The smallest singular value of the regularized task Jacobian is further analyzed in different singular configurations.