M. Shahbazi, Navvab Kashiri, D. Caldwell, N. Tsagarakis
{"title":"Orientation planning in task space using quaternion polynomials","authors":"M. Shahbazi, Navvab Kashiri, D. Caldwell, N. Tsagarakis","doi":"10.1109/ROBIO.2017.8324769","DOIUrl":null,"url":null,"abstract":"This paper introduces a computationally fast method for orientation trajectory planning in point-to-point motion tasks when the angular velocity and acceleration at the endpoints are constrained. Addressing such a problem with existing spherical-interpolation-based methods (in the context of unit quaternion) is not straightforward, since the inherent complexities of spherical curves necessitate task-specific tunings for satisfying all the boundary conditions. To tackle such a difficulty, we propound an interpolation function on the basis of standard polynomials in time with quaternion coefficients. We introduce a novel algorithm to determine varying polynomial coefficients in a way that the unit length of interpolated quaternion can be guaranteed. The performance of the developed planning algorithms is illustrated through a functional analysis and via simulation experiments on an anthropomorphic robotic arm. The results corroborate the merits of the presented approach especially in respecting arbitrary boundary conditions.","PeriodicalId":197159,"journal":{"name":"2017 IEEE International Conference on Robotics and Biomimetics (ROBIO)","volume":"71 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2017-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"3","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2017 IEEE International Conference on Robotics and Biomimetics (ROBIO)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ROBIO.2017.8324769","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 3
Abstract
This paper introduces a computationally fast method for orientation trajectory planning in point-to-point motion tasks when the angular velocity and acceleration at the endpoints are constrained. Addressing such a problem with existing spherical-interpolation-based methods (in the context of unit quaternion) is not straightforward, since the inherent complexities of spherical curves necessitate task-specific tunings for satisfying all the boundary conditions. To tackle such a difficulty, we propound an interpolation function on the basis of standard polynomials in time with quaternion coefficients. We introduce a novel algorithm to determine varying polynomial coefficients in a way that the unit length of interpolated quaternion can be guaranteed. The performance of the developed planning algorithms is illustrated through a functional analysis and via simulation experiments on an anthropomorphic robotic arm. The results corroborate the merits of the presented approach especially in respecting arbitrary boundary conditions.