Lagrangian Duality in Complex Pose Graph Optimization
Pose Graph Optimization (PGO) is the problem of estimating a set of poses from pairwise relative measurements. PGO is a nonconvex problem, and currently no known technique can guarantee the efficient computation of a global optimal solution. In this paper
- PDF / 888,428 Bytes
- 46 Pages / 439.36 x 666.15 pts Page_size
- 95 Downloads / 221 Views
Abstract Pose Graph Optimization (PGO) is the problem of estimating a set of poses from pairwise relative measurements. PGO is a nonconvex problem, and currently no known technique can guarantee the efficient computation of a global optimal solution. In this paper, we show that Lagrangian duality allows computing a globally optimal solution, under certain conditions that are satisfied in many practical cases. Our first contribution is to frame the PGO problem in the complex domain. This makes analysis easier and allows drawing connections with the recent literature on unit gain graphs. Exploiting this connection we prove nontrival results about the spectrum of the matrix underlying the problem. The second contribution is to formulate and analyze the properties of the Lagrangian dual problem in the complex domain. The dual problem is a semidefinite program (SDP). Our analysis shows that the duality gap is connected to the number of eigenvalues of the penalized pose graph matrix, which arises from the solution of the SDP. We prove that if this matrix has a single eigenvalue in zero, then (1) the duality gap is zero, (2) the primal PGO problem has a unique solution, and (3) the primal solution can be computed by scaling an eigenvector of the penalized pose graph matrix. The third contribution is algorithmic: we exploit the dual problem and propose an algorithm that computes a guaranteed optimal solution for PGO when the penalized pose graph matrix satisfies the Single Zero Eigenvalue Property (SZEP). We also propose a variant that deals with the case in which the SZEP is not satisfied. This variant, while possibly suboptimal, provides a very good estimate for PGO in practice. The fourth contribution is a numerical analysis. Empirical evidence shows that in the vast majority of cases (100 % of the tests under noise regimes of practical robotics
G.C. Calafiore Politecnico di Torino, Torino, Italy e-mail: [email protected] L. Carlone () Massachusetts Institute of Technology, Cambridge, MA, USA e-mail: [email protected] F. Dellaert Georgia Institute of Technology, Atlanta, GA, USA e-mail: [email protected] © Springer International Publishing Switzerland 2016 B. Goldengorin (ed.), Optimization and Its Applications in Control and Data Sciences, Springer Optimization and Its Applications 115, DOI 10.1007/978-3-319-42056-1_5
139
140
G.C. Calafiore et al.
applications) the penalized pose graph matrix does satisfy the SZEP, hence our approach allows computing the global optimal solution. Finally, we report simple counterexamples in which the duality gap is nonzero, and discuss open problems. Keywords Maximum likelihood estimation • Mobile robots • Motion estimation • Position measurement • Rotation measurement • Simultaneous localization and mapping • Duality
1 Introduction Pose graph optimization (PGO) consists in the estimation of the poses (positions and orientations) of a mobile robot, from relative pose measurements. The problem can be formulated as the minimization of a nonconvex cost, and can be co
Data Loading...
