Efficient Modification of the Upper Triangular Square Root Matrix on Variable Reordering

In probabilistic state inference, we seek to estimate the state of an (autonomous) agent from noisy observations. It can be shown that, under certain assumptions, finding the estimate is equivalent to solving a linear least squares problem. Solving such a problem is done by calculating the upper tri...

Ausführliche Beschreibung

Gespeichert in:

Bibliographische Detailangaben
Veröffentlicht in:	IEEE robotics and automation letters Jg. 6; H. 2; S. 675 - 682
Hauptverfasser:	Elimelech, Khen, Indelman, Vadim
Format:	Journal Article
Sprache:	Englisch
Veröffentlicht:	Piscataway IEEE 01.04.2021 The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Schlagworte:	Algorithms Autonomous agents Factorization Incremental least squares Least squares method Mathematical analysis Matrices (mathematics) Matrix decomposition Optimization parallel algorithms Parallel processing Permutations Probabilistic inference Probabilistic logic Robots Simultaneous localization and mapping SLAM Smoothing methods sparse systems Symmetric matrices
ISSN:	2377-3766, 2377-3766
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!

Schreiben Sie den ersten Kommentar!