-
Notifications
You must be signed in to change notification settings - Fork 3
Expand file tree
/
Copy pathspecial_euclidean_group_RAT_ext.jl
More file actions
451 lines (425 loc) · 15.7 KB
/
Copy pathspecial_euclidean_group_RAT_ext.jl
File metadata and controls
451 lines (425 loc) · 15.7 KB
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
# disable affine check
LieGroups._check_matrix_affine(::ArrayPartition, ::Int; kwargs...) = nothing
#
# Action
#
# (a) SE(n) on R^n
# Euclidean was imported to LieGroups, so we can access it from there.
function LieGroups.apply!(
::GroupAction{LeftMultiplicationGroupAction, <:LieGroups.LeftSpecialEuclideanGroup, <:LieGroups.Euclidean}, q, g::ArrayPartition, p
)
mul!(q, g.x[1], p)
q .+= g.x[2]
return q
end
function LieGroups.apply!(
::GroupAction{LieGroups.LeftMultiplicationGroupAction, <:LieGroups.RightSpecialEuclideanGroup, <:LieGroups.Euclidean}, q, g::ArrayPartition, p
)
mul!(q, g.x[2], p)
q .+= g.x[1]
return q
end
function LieGroups.diff_apply!(
::GroupAction{LieGroups.LeftMultiplicationGroupAction, <:LieGroups.LeftSpecialEuclideanGroup, <:LieGroups.Euclidean},
Y, g::ArrayPartition, p, X
)
mul!(Y, g.x[1], X)
return Y
end
function LieGroups.diff_apply!(
::GroupAction{LieGroups.LeftMultiplicationGroupAction, <:LieGroups.RightSpecialEuclideanGroup, <:LieGroups.Euclidean},
Y, g::ArrayPartition, p, X
)
mul!(Y, g.x[2], X)
return Y
end
#
# Conversions
#
Base.convert(::Type{<:ArrayPartition}, g::SpecialEuclideanProductPoint) = g.value
function Base.convert(::Type{SpecialEuclideanProductPoint}, p::ArrayPartition)
return SpecialEuclideanProductPoint(p)
end
Base.convert(::Type{<:ArrayPartition}, X::SpecialEuclideanProductTangentVector) = X.value
function Base.convert(::Type{SpecialEuclideanProductTangentVector}, X::ArrayPartition)
return SpecialEuclideanProductTangentVector(X)
end
# convert between both representations
function Base.convert(
::Type{AbstractMatrix}, g::SpecialEuclideanProductPoint{<:ArrayPartition{T}}
) where {T}
v = g.value.x
n = size(v[1])[1]
A = zeros(T, n + 1, n + 1)
A[(n + 1), (n + 1)] = one(T)
# We do not know whether g.value ir (R,t) or (t,R) so we have to depend on sizes
s = size(v[1])
if length(s) == 2 # (R,t)
A[1:n, 1:n] .= v[1]
A[1:n, n + 1] .= v[2]
else # format (t,R)
A[1:n, 1:n] .= v[2]
A[1:n, n + 1] .= v[1]
end
return A
end
function Base.convert(::Type{<:SpecialEuclideanProductPoint}, g::AbstractMatrix)
return SpecialEuclideanProductPoint(
convert(ArrayPartition, SpecialEuclideanMatrixPoint(g))
)
end
function Base.convert(::Type{<:SpecialEuclideanProductTangentVector}, X::AbstractMatrix)
return SpecialEuclideanProductTangentVector(
convert(ArrayPartition, SpecialEuclideanMatrixTangentVector(X))
)
end
function Base.convert(
::Type{<:ArrayPartition}, g::SpecialEuclideanMatrixPoint{<:AbstractMatrix}
)
A = g.value
n = size(A)[1] - 1
return ArrayPartition(A[1:n, 1:n], A[1:n, (n + 1)])
end
function Base.convert(
::Type{AbstractMatrix}, X::SpecialEuclideanProductTangentVector{<:ArrayPartition{T}}
) where {T}
n = size(X.value.x[1])[1]
A = zeros(T, n + 1, n + 1)
A[n + 1, n + 1] = 0.0
# We do not know whether g.value is (R,t) or (t,R) so we have to depend on sizes
s = size(X.value.x[1])
if length(s) == 2 # (R,t)
A[1:n, 1:n] .= X.value.x[1]
A[1:n, n + 1] .= X.value.x[2]
else # format (t,R)
A[1:n, 1:n] .= X.value.x[2]
A[1:n, n + 1] .= X.value.x[1]
end
return A
end
function Base.convert(::Type{SpecialEuclideanMatrixTangentVector}, g::ArrayPartition)
return SpecialEuclideanMatrixTangentVector(
convert(AbstractMatrix, SpecialEuclideanProductTangentVector(g))
)
end
function Base.convert(::Type{SpecialEuclideanMatrixPoint}, g::ArrayPartition)
return SpecialEuclideanMatrixPoint(
convert(AbstractMatrix, SpecialEuclideanProductPoint(g))
)
end
# convert between both representation explicitly
# the inverse is again not unique since both (R,t) and (t,R) are possible results.
function Base.convert(
::Type{<:SpecialEuclideanMatrixPoint}, g::SpecialEuclideanProductPoint{<:ArrayPartition}
)
return SpecialEuclideanMatrixPoint(convert(AbstractMatrix, g))
end
function Base.convert(
::Type{SpecialEuclideanProductPoint}, g::SpecialEuclideanMatrixPoint{<:AbstractMatrix}
)
return SpecialEuclideanProductPoint(convert(ArrayPartition, g))
end
function Base.convert(
::Type{SpecialEuclideanMatrixTangentVector},
g::SpecialEuclideanProductTangentVector{<:ArrayPartition},
)
return SpecialEuclideanMatrixTangentVector(convert(AbstractMatrix, g))
end
function Base.convert(
::Type{<:ArrayPartition}, g::SpecialEuclideanMatrixTangentVector{<:AbstractMatrix}
)
A = g.value
n = size(A)[1] - 1
return ArrayPartition(A[1:n, 1:n], A[1:n, (n + 1)])
end
function Base.convert(
::Type{<:SpecialEuclideanProductTangentVector},
g::SpecialEuclideanMatrixTangentVector{<:AbstractMatrix},
)
return SpecialEuclideanProductTangentVector(convert(ArrayPartition, g))
end
#
# Functions specialised from the interface
#
function ManifoldsBase.exp!(
G::SpecialEuclideanGroup{<:ManifoldsBase.TypeParameter{Tuple{2}}},
g::ArrayPartition,
X::ArrayPartition,
)
# This is up to the dispatch types a nearly copy of the matrix case,
# but we can skip to initialise the constant areas
LieGroups._exp_SE2!(G, g, X)
return g
end
function ManifoldsBase.exp!(
G::SpecialEuclideanGroup{<:ManifoldsBase.TypeParameter{Tuple{3}}},
g::ArrayPartition,
X::ArrayPartition,
)
# This is up to the dispatch types a nearly copy of the matrix case, since
# but we can skip to initialise the constant areas
LieGroups._exp_SE3!(G, g, X)
return g
end
function Base.getindex(
g::ArrayPartition,
G::SpecialEuclideanGroup,
s::Union{Symbol, Int},
)
return submanifold_component(G, g, s)
end
function Base.getindex(
g::ArrayPartition,
G::SpecialEuclideanGroup,
::Colon,
)
return submanifold_components(G, g)
end
function Base.getindex(
g::ArrayPartition,
𝔤::LieAlgebra{ℝ, <:LieGroups.SpecialEuclideanGroupOperation, <:SpecialEuclideanGroup},
s::Union{Symbol, Int},
)
return submanifold_component(𝔤, g, s)
end
function Base.getindex(
g::ArrayPartition,
𝔤::LieAlgebra{ℝ, <:LieGroups.SpecialEuclideanGroupOperation, <:SpecialEuclideanGroup},
::Colon,
)
return submanifold_components(𝔤, g)
end
function LieGroups.identity_element(
G::SpecialEuclideanGroup, ::Type{<:SpecialEuclideanProductPoint{A}}
) where {A <: ArrayPartition}
return SpecialEuclideanProductPoint(identity_element(G, A))
end
function LieGroups.identity_element!(G::LieGroups.SpecialEuclideanGroup, g::ArrayPartition)
SOn, Tn = LieGroups._SOn_and_Tn(G)
identity_element!(SOn, ManifoldsBase.submanifold_component(G, g, :Rotation))
identity_element!(Tn, ManifoldsBase.submanifold_component(G, g, :Translation))
return g
end
function LieGroups._inv!(G::SpecialEuclideanGroup, h::ArrayPartition, g::ArrayPartition)
LieGroups._inv_SE!(G, h, g)
return h
end
function ManifoldsBase.log!(
G::SpecialEuclideanGroup{ManifoldsBase.TypeParameter{Tuple{2}}},
X::ArrayPartition,
g::ArrayPartition,
)
LieGroups._log_SE2!(G, X, g)
return X
end
function ManifoldsBase.log!(
G::SpecialEuclideanGroup{ManifoldsBase.TypeParameter{Tuple{3}}},
X::ArrayPartition,
g::ArrayPartition,
)
LieGroups._log_SE3!(G, X, g)
return X
end
function LieGroups.jacobian_exp!(
G::SpecialEuclideanGroup{<:ManifoldsBase.TypeParameter{Tuple{2}}},
J::AbstractMatrix,
X::ArrayPartition,
::DefaultLieAlgebraOrthogonalBasis,
)
return LieGroups._jacobian_exp_SE2!(G, J, X)
end
function LieGroups.jacobian_exp!(
G::SpecialEuclideanGroup{<:ManifoldsBase.TypeParameter{Tuple{3}}},
J::AbstractMatrix,
X::ArrayPartition,
::DefaultLieAlgebraOrthogonalBasis,
)
return LieGroups._jacobian_exp_SE3!(G, J, X)
end
function LieGroups.jacobian_exp!(
G::SpecialEuclideanGroup,
J::AbstractMatrix,
X::SpecialEuclideanProductTangentVector,
B::DefaultLieAlgebraOrthogonalBasis,
)
return LieGroups.jacobian_exp!(G, J, ManifoldsBase.internal_value(X), B)
end
function LinearAlgebra.norm(
𝔤::LieAlgebra{
ℝ, <:LieGroups.SpecialEuclideanGroupOperation, <:LieGroups.SpecialEuclideanGroup,
},
X::ArrayPartition,
)
G = LieGroups.base_lie_group(𝔤)
SOn, Tn = LieGroups._SOn_and_Tn(G)
n1 = LinearAlgebra.norm(
LieGroups.LieAlgebra(SOn), ManifoldsBase.submanifold_component(𝔤, X, :Rotation)
)
n2 = LinearAlgebra.norm(
LieGroups.LieAlgebra(Tn), ManifoldsBase.submanifold_component(𝔤, X, :Translation)
)
return LinearAlgebra.norm([n1, n2])
end
_doc_lie_bracket_SEn_RAT = """
lie_bracket(𝔰𝔢::LieAlgebra{ℝ, SpecialEuclideanGroupOperation, SpecialEuclideanGroup}, X::ArrayPartition, Y::ArrayPartition)
lie_bracket!(𝔰𝔢::LieAlgebra{ℝ, SpecialEuclideanGroupOperation, SpecialEuclideanGroup}, Z::ArrayPartition, X::ArrayPartition, Y::ArrayPartition)
Calculate the Lie bracket between elements `X` and `Y` of the Lie algebra of the [`SpecialEuclideanGroup`](@ref).
For the representation as a matrix and a vector, cf. [`SpecialEuclideanProductTangentVector`](@ref) or a `ArrayPartition`
every Lie algebra element is represented as a pair ``X = (X_{$(LieGroups._tex(:text, "R"))}, X_$(LieGroups._tex(:text, "t")))``
or a rotation matrix and a translation vector, respectively.
Then the formula for the Lie bracket is given by
```math
[X, Y] = [(X_{$(LieGroups._tex(:text, "R"))}, X_{$(LieGroups._tex(:text, "t"))}), (Y_{$(LieGroups._tex(:text, "R"))}, Y_{$(LieGroups._tex(:text, "t"))})]
= (X_{$(LieGroups._tex(:text, "R"))} * Y_{$(LieGroups._tex(:text, "R"))} - Y_{$(LieGroups._tex(:text, "R"))} * X_{$(LieGroups._tex(:text, "R"))}, X_{$(LieGroups._tex(:text, "R"))} * Y_{$(LieGroups._tex(:text, "t"))} - Y_{$(LieGroups._tex(:text, "R"))} * X_{$(LieGroups._tex(:text, "t"))}),
```
where for the right semidirect product variant, the order of the pair is switched.
"""
"$(_doc_lie_bracket_SEn_RAT)"
LieGroups.lie_bracket(
𝔤::LieGroups.LieAlgebra{
ℝ, <:LieGroups.SpecialEuclideanGroupOperation, <:LieGroups.SpecialEuclideanGroup,
},
X::Union{<:ArrayPartition, <:SpecialEuclideanProductTangentVector},
Y::Union{<:ArrayPartition, <:SpecialEuclideanProductTangentVector},
)
"$(_doc_lie_bracket_SEn_RAT)"
function LieGroups.lie_bracket!(
𝔤::LieGroups.LieAlgebra{
ℝ, <:LieGroups.SpecialEuclideanGroupOperation, <:LieGroups.SpecialEuclideanGroup,
},
Z::Union{<:ArrayPartition, <:SpecialEuclideanProductTangentVector},
X::Union{<:ArrayPartition, <:SpecialEuclideanProductTangentVector},
Y::Union{<:ArrayPartition, <:SpecialEuclideanProductTangentVector},
)
G = LieGroups.base_lie_group(𝔤)
SOn, _ = LieGroups._SOn_and_Tn(G)
X_t = submanifold_component(LieAlgebra(G), X, Val(:Translation))
X_R = submanifold_component(LieAlgebra(G), X, Val(:Rotation))
Y_t = submanifold_component(LieAlgebra(G), Y, Val(:Translation))
Y_R = submanifold_component(LieAlgebra(G), Y, Val(:Rotation))
Z_t = submanifold_component(LieAlgebra(G), Z, Val(:Translation))
Z_R = submanifold_component(LieAlgebra(G), Z, Val(:Rotation))
LieGroups.lie_bracket!(LieAlgebra(SOn), Z_R, X_R, Y_R)
Z_t .= X_R * Y_t .- Y_R * X_t
return Z
end
function ManifoldsBase.submanifold_component(
G::LieGroups.LeftSpecialEuclideanGroup,
g::Union{ArrayPartition, SpecialEuclideanProductPoint},
::Val{:Rotation},
)
return ManifoldsBase.submanifold_component(
base_manifold(G), ManifoldsBase.internal_value(g), Val(1)
)
end
function ManifoldsBase.submanifold_component(
G::LieGroups.LeftSpecialEuclideanGroup,
g::Union{ArrayPartition, SpecialEuclideanProductPoint},
::Val{:Translation},
)
return ManifoldsBase.submanifold_component(
base_manifold(G), ManifoldsBase.internal_value(g), Val(2)
)
end
function ManifoldsBase.submanifold_component(
𝔤::LieGroups.LieAlgebra{
ℝ,
<:LieGroups.LeftSpecialEuclideanGroupOperation,
<:LieGroups.LeftSpecialEuclideanGroup,
},
X::Union{ArrayPartition, SpecialEuclideanProductTangentVector},
::Val{:Rotation},
)
return ManifoldsBase.submanifold_component(
base_manifold(𝔤), ManifoldsBase.internal_value(X), Val(1)
)
end
function ManifoldsBase.submanifold_component(
𝔤::LieGroups.LieAlgebra{
ℝ,
<:LieGroups.LeftSpecialEuclideanGroupOperation,
<:LieGroups.LeftSpecialEuclideanGroup,
},
X::Union{ArrayPartition, SpecialEuclideanProductTangentVector},
::Val{:Translation},
)
return ManifoldsBase.submanifold_component(
base_manifold(𝔤), ManifoldsBase.internal_value(X), Val(2)
)
end
Base.@propagate_inbounds function ManifoldsBase.submanifold_component(
G::LieGroups.RightSpecialEuclideanGroup,
g::Union{ArrayPartition, SpecialEuclideanProductPoint},
::Val{:Rotation},
)
return ManifoldsBase.submanifold_component(
base_manifold(G), ManifoldsBase.internal_value(g), Val(2)
)
end
Base.@propagate_inbounds function ManifoldsBase.submanifold_component(
G::LieGroups.RightSpecialEuclideanGroup,
g::Union{ArrayPartition, SpecialEuclideanProductPoint},
::Val{:Translation},
)
return ManifoldsBase.submanifold_component(
base_manifold(G), ManifoldsBase.internal_value(g), Val(1)
)
end
Base.@propagate_inbounds function ManifoldsBase.submanifold_component(
𝔤::LieGroups.LieAlgebra{
ℝ,
<:LieGroups.RightSpecialEuclideanGroupOperation,
<:LieGroups.RightSpecialEuclideanGroup,
},
X::Union{ArrayPartition, SpecialEuclideanProductTangentVector},
::Val{:Rotation},
)
return ManifoldsBase.submanifold_component(
base_manifold(𝔤), ManifoldsBase.internal_value(X), Val(2)
)
end
Base.@propagate_inbounds function ManifoldsBase.submanifold_component(
𝔤::LieGroups.LieAlgebra{
ℝ,
<:LieGroups.RightSpecialEuclideanGroupOperation,
<:LieGroups.RightSpecialEuclideanGroup,
},
X::Union{ArrayPartition, SpecialEuclideanProductTangentVector},
::Val{:Translation},
)
return ManifoldsBase.submanifold_component(
base_manifold(𝔤), ManifoldsBase.internal_value(X), Val(1)
)
end
function ManifoldsBase.zero_vector(
𝔤::LieAlgebra{
ManifoldsBase.ℝ,
<:LieGroups.LeftSpecialEuclideanGroupOperation,
<:LieGroups.LeftSpecialEuclideanGroup,
},
::Type{<:ArrayPartition{T}},
) where {T}
G = 𝔤.manifold
n = ManifoldsBase.get_parameter(G.manifold[1].size)[1]
return ArrayPartition(zeros(T, n, n), zeros(T, n))
end
function ManifoldsBase.zero_vector(
𝔤::LieAlgebra{
𝔽,
<:LieGroups.RightSpecialEuclideanGroupOperation,
<:LieGroups.RightSpecialEuclideanGroup,
},
::Type{<:ArrayPartition{T}},
) where {𝔽, T}
G = 𝔤.manifold
n = ManifoldsBase.get_parameter(G.manifold[1].size)[1]
return ArrayPartition(zeros(T, n), zeros(T, n, n))
end
function ManifoldsBase.zero_vector(
𝔤::LieAlgebra{
𝔽, <:LieGroups.SpecialEuclideanGroupOperation, <:LieGroups.SpecialEuclideanGroup,
},
::Type{LieGroups.SpecialEuclideanProductTangentVector{AP}},
) where {𝔽, AP <: ArrayPartition}
return SpecialEuclideanProductTangentVector(zero_vector(𝔤, AP))
end