Factor graph optimization problems can be lifted via Shor's relaxation and Burer-Monteiro factorization to produce certifiable estimators that preserve the original factor graph connectivity and can be implemented with existing libraries.
Certifiably correct range-aided SLAM,
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.RO 1years
2026 1verdicts
CONDITIONAL 1representative citing papers
citing papers explorer
-
Certifiable Factor Graph Optimization
Factor graph optimization problems can be lifted via Shor's relaxation and Burer-Monteiro factorization to produce certifiable estimators that preserve the original factor graph connectivity and can be implemented with existing libraries.