2018 IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS) 2018
DOI: 10.1109/iros.2018.8594068
|View full text |Cite
|
Sign up to set email alerts
|

Invariant smoothing on Lie Groups

Abstract: In this paper we propose a (non-linear) smoothing algorithm for group-affine observation systems, a recently introduced class of estimation problems on Lie groups that bear a particular structure. As most non-linear smoothing methods, the proposed algorithm is based on a maximum a posteriori estimator, determined by optimization. But owing to the specific properties of the considered class of problems, the involved linearizations are proved to have a form of independence with respect to the current estimates, … Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1
1

Citation Types

0
16
0

Year Published

2019
2019
2023
2023

Publication Types

Select...
4
3

Relationship

2
5

Authors

Journals

citations
Cited by 24 publications
(16 citation statements)
references
References 33 publications
0
16
0
Order By: Relevance
“…Future work includes developing an invariant smoother based on this filter. This would utilize the framework developed by Chauchat et al (2018) to potentially improve IMU preintegration (Eckenhoff et al, 2018; Forster et al, 2017; Lupton and Sukkarieh, 2012) as well as contact preintegration (Hartley et al, 2018a) to perform SLAM. One interesting extension would be online estimation of kinematic parameters, which may help remove biases in the forward kinematic measurements.…”
Section: Discussionmentioning
confidence: 99%
“…Future work includes developing an invariant smoother based on this filter. This would utilize the framework developed by Chauchat et al (2018) to potentially improve IMU preintegration (Eckenhoff et al, 2018; Forster et al, 2017; Lupton and Sukkarieh, 2012) as well as contact preintegration (Hartley et al, 2018a) to perform SLAM. One interesting extension would be online estimation of kinematic parameters, which may help remove biases in the forward kinematic measurements.…”
Section: Discussionmentioning
confidence: 99%
“…After solving (8)-(9), the linearization point is updated as χ (1) = χ (0) + δ χ * and serves as a new linearization point until convergence. Remark 1: This easily generalises for smoothing onmanifold, see for instance [9], [24], [18], by simply changing the prior factor and update definitions, and adapting the jacobians accordingly. To save space, we omit it herein.…”
Section: Resolution Of the Nonlinear Optimization Problemmentioning
confidence: 99%
“…We see at each step the algorithm is faced with the resolution of the linearized optimization problem (8)- (9). This is a standard least squares problem, and the solution comes in closed form.…”
Section: E Resolution Of the Linearized Optimization Problemmentioning
confidence: 99%
See 2 more Smart Citations