Accurate computation of quaternions from rotation matrices
10.1007/978-3-319-93188-3_5
Inclou dades d'ús des de 2022
Cita com:
hdl:2117/124384
Tipus de documentText en actes de congrés
Data publicació2018
EditorSpringer International Publishing
Condicions d'accésAccés obert
Tots els drets reservats. Aquesta obra està protegida pels drets de propietat intel·lectual i
industrial corresponents. Sense perjudici de les exempcions legals existents, queda prohibida la seva
reproducció, distribució, comunicació pública o transformació sense l'autorització del titular dels drets
Abstract
The main non-singular alternative to 3×3 proper orthogonal matrices, for representing rotations in R3, is quaternions. Thus, it is important to have reliable methods to pass from one representation to the other. While passing from a quaternion to the corresponding rotation matrix is given by Euler-Rodrigues formula, the other way round can be performed in many different ways. Although all of them are algebraically equivalent, their numerical behavior can be quite different. In 1978, Shepperd proposed a method for computing the quaternion corresponding to a rotation matrix which is considered the most reliable method to date. Shepperd’s method, thanks to a voting scheme between four possible solutions, always works far from formulation singularities. In this paper, we propose a new method which outperforms Shepperd’s method without increasing the computational cost.
Descripció
The final publication is available at link.springer.com
CitacióSarabandi, S., Thomas, F. Accurate computation of quaternions from rotation matrices. A: International Conference on Advances in Robot Kinematics. "Vol 8 of Springer Proceedings in Advanced Robotics". Springer International Publishing, 2018, p. 39-46.
Versió de l'editorhttps://link.springer.com/chapter/10.1007%2F978-3-319-93188-3_5
Fitxers | Descripció | Mida | Format | Visualitza |
---|---|---|---|---|
2068-Accurate-C ... from-Rotation-Matrices.pdf | 125,3Kb | Visualitza/Obre |