Nonmenclature
- Special Orthogonal Group (SO):
- det = 1
- R−1=RT
- Special Euclidean Group (SE):
- for SE(3) it’s a 4×4 matrix, namely the transformation matrix
Introduction: Least Square Method in Robotics
For pose control and estimation, usually we have a linear form f:Rk→R to evaluate the target value and minimize that value.
The most difficult step is to find a Δx, s.t. ∣∣f(x+Δx)−f(x)∣∣2<∣∣f(x)∣∣2 until the Δx is too small.
For example, in the camera coordinate, we have measured pose p, and the robot has pose SE T, and the measured pose in world coordinate z:
z=Tp
For measurement noise w, we have z=Tp+w, and in consideration of measure error, we have e=z−Tp, and clearly we need to minimize the error e or say minimize the displacement error ∣∣e∣∣2, and what we can modify is the transformation matrix T.
By the method of estimation in statistics, the formula would be like the following:
argTminJ(T)=argTmini=1∑N∣∣zi−Tpi∣∣22
Like the method of maximum likelihood estimation, we should calculate the derivative of the function, and clearly the rotation matrix R is not closed on the (R,+) group space, thus it’s our purpose to find a better method, which we will introduced as Lie Theory.
Definition: Lie Algebra
For simple SO(3), the rotation matrix, it holds the invariant:
R(t)RT(t)=I
By differentiate both sides, it becomes
R˙(t)RT(t)+R(t)R˙T(t)=0
R˙(t)RT(t)=−(R˙(t)RT(t))T
which means that the R˙(t)RT(t) is a anti-symmetric matrix, which thus could be expressed in the form of ϕ(t)∧. And then we right multiply a R(t) to both sides below, and obtain:
R˙(t)RT(t)=ϕ(t)∧⇔R˙(t)=ϕ(t)∧R(t)
Namely for any R(t)∈SO, its derivative is equal to left multiply a anti-symmetric matrix ϕ(t)∧
Then we do Taylor Expansion (1 level) near time t0=0 and get
R(t)=R(t0)+R˙(t0)(t−t0)
R(t)=I+ϕ(t0)∧(t)
and we have that R˙(t)=ϕ(t)∧R(t), where near t0 the ϕ(t) is always the same as ϕ(t0)≈ϕ0∧, with initial value problem R(0)=I.
This is a typical linear ODE with solution
R(t)=eϕ0∧t
Since ϕ∧ reflect the property of R(t), thus it’s in the R(t)'s tangent space near t
Operation Method
Here we introduce the Lie Brackets [,]:R3×R3→R3, where Φ:=ϕ∧ is the matrix form of the rotation vector ϕ, and ∨:SO(3)→R3 is the reverse process of (⋅)∧
[ϕ1,ϕ2]=(Φ1Φ2−Φ2Φ1)∨
In SO(3), the (Φ1Φ2−Φ2Φ1)∨=ϕ1×ϕ2, thus the lie operator is the same as cross product in SO(3) (note here Φ1ϕ2=ϕ1×ϕ2=(Φ1Φ2)∨)
Here are some other properties:
- [x,x]=0
- [x,[y,z]]+[y,[z,x]]+[z,[x,y]]=0
And the Lie’s definition for so is like so(3):={ϕ∈R3∣Φ=ϕ∧∈R3×3}
Lie definition for se(3)
Similarly as following:
se(3)={ξ:=[pθ]∈R6,ξ∧:=[ϕ∧0p0]∈R4×4}
where ∧:R6→R4×4