Content deleted Content added
→Separable solutions: clarify |
m Open access bot: url-access updated in citation with #oabot. |
||
(14 intermediate revisions by 10 users not shown) | |||
Line 1:
{{short description|Robotics problem on coordinating two parts of a robot}}
In [[robotics]] and [[mathematics]], the '''
The problem is an important part of [[robot calibration]], with efficiency and accuracy of the solutions determining the speed accuracy of the calibrations of robots.
Line 8:
===Separable solutions===
Given the equation {{math|AX{{=}}ZB}}, it is possible to decompose the equation into a purely rotational and translational part; methods utilizing this are referred to as separable methods. Where {{math|'''R'''<sub>A</sub>}} represents a 3×3 [[rotation matrix]] and {{math|'''t'''<sub>A</sub>}} a 3×1 translation vector, the equation can be broken into two parts:<ref>Amy Tabb, Khalil Yousef. [https://arxiv.org/abs/1907.12425 "Solving the Robot-World Hand-Eye(s) Calibration Problem with Iterative Methods."] Machine Vision and Applications, August 2017, Volume 28, Issue 5-6, pp 569-590.</ref>
:{{math|'''R'''<sub>A</sub>'''R'''<sub>X</sub>{{=}}'''R'''<sub>Z</sub>'''R'''<sub>B</sub>}}
:{{math|'''R'''<sub>A</sub>'''t'''<sub>X</sub>+'''t'''<sub>A</sub>{{=}}'''R'''<sub>Z</sub>'''t'''<sub>B</sub>+'''t'''<sub>Z</sub>}}
Line 14:
===Simultaneous solutions===
Simultaneous solutions are based on solving for both {{math|X}} and {{math|Z}} at the same time (rather than basing the solution of one part off of the other as in separable solutions), propagation of error is significantly reduced.<ref name="dual-quaternions">Algo Li, et al. [https://web.archive.org/web/20200209164546/https://pdfs.semanticscholar.org/225d/e4ea2d3f18b7743bfeabf925fa603fc47bcb.pdf "Simultaneous robot-world and hand-eye calibration using dual-quaternions and Kronecker product."] International Journal of the Physical Sciences Vol. 5(10), pp. 1530-1536, 4 September 2010.</ref> By formulating the matrices as [[dual quaternion]]s, it is possible to get a [[linear equation]] by which {{math|X}} is solvable in a linear format.<ref name="tsapps"/> An alternative way applies the [[least squares|least-squares method]] to the [[Kronecker product]] of the matrices {{math|A⊗B}}. As confirmed by experimental results, simultaneous solutions have less error than separable quaternion solutions.<ref name="dual-quaternions"/>
===Iterative solutions===
Iterative solutions are another method used to solve the problem of error propagation. One example of an iterative solution is a program based on minimizing {{math|{{!}}{{!}}AX−XB{{!}}{{!}}}}. As the program iterates, it will converge on a solution to {{math|X}} independent to the initial robot orientation of {{math|'''R'''<sub>B</sub>}}. Solutions can also be two-step iterative processes, and like simultaneous solutions can also decompose the equations into [[dual quaternion]]s.<ref>Zhiqiang Zhang, et al. [https://link.springer.com/article/10.1007/s11548-017-1646-x "A computationally efficient method for hand–eye calibration."] 19 July 2017.</ref> However, while iterative solutions to the problem are generally simultaneous and accurate, they can be computationally taxing to carry out and may not always converge on the optimal solution.<ref name="tsapps"/>
===The AX=XB case===
The matrix equation {{math|AX{{=}}XB}}, where {{math|X}} is unknown, has an infinite number of solutions that can be easily studied by a geometrical approach.<ref> Irene Fassi, Giovanni Legnani [https://doi.org/10.1002/rob.20082 "Hand to sensor calibration: A geometrical interpretation of the matrix equation AX =XB."] Journal of Robotic Systems, 28 July 2005</ref> To find {{math|X}} it is necessary to consider a simultaneous set of 2 equations {{math|A<sub>1</sub>X{{=}}XB<sub>1</sub>}} and {{math|A<sub>2</sub>X{{=}}XB<sub>2</sub>}}; the matrices {{math|A<sub>1</sub>, A<sub>2</sub>, B<sub>1</sub>, B<sub>2</sub>}} have to be dermined by experiments to be performed in an optimized way.
<ref> Giovanni Legnani. [https://doi.org/10.2316/Journal.206.2018.1.206-4974 "Optimization of hand-to-camera calibration using geometrical interpretation of matrix equation AX = XB." ] International Journal of Robotics and Automation - January 2018. </ref>
=== The 2D laser profile scanner case ===
<math>\begin{bmatrix} p_b \\ 1 \end{bmatrix}=
\begin{bmatrix} R_b & T_b \\ 0 & 1 \end{bmatrix}\centerdot
\begin{bmatrix} R_s & T_s \\ 0 & 1 \end{bmatrix}\centerdot
\begin{bmatrix} p_s \\ 1 \end{bmatrix}</math>
where <math>p_b</math> represents the unknown coordinate of the point <math>p</math> in the robot base system, <math>R_b, T_b</math> represent the known relationship between the robot base system and end-effector, <math>R_s,T_s</math> are the unknown relationship between the end-effector and the scanner, and <math>p_s</math> is the known coordinate of the point <math>p</math> in the local scanner system. Methods are as follows,
* Straight edges
There is a method using straight edges for hand-eye calibration.<ref>{{Cite journal|last=Xu|first=Jing|last2=Hoo|first2=Jian Li|last3=Dritsas|first3=Stylianos|last4=Fernandez|first4=Javier Gomez|date=2022-02-01|title=Hand-eye calibration for 2D laser profile scanners using straight edges of common objects|url=https://www.sciencedirect.com/science/article/pii/S0736584521001046|journal=Robotics and Computer-Integrated Manufacturing|language=en|volume=73|pages=102221|doi=10.1016/j.rcim.2021.102221|issn=0736-5845|url-access=subscription}}</ref>
==References==
|