We propose a novel approach to Graduated Non-Convexity (GNC) and demonstrate its efficacy through its application in robust pose graph optimization, a key component in SLAM backends. Traditional GNC methods often rely on heuristic methods for GNC schedule, updating control parameter {\mu} for escalating the non-convexity. In contrast, our approach leverages the properties of convex functions and convex optimization to identify the boundary points beyond which convexity is no longer guaranteed, thereby eliminating redundant optimization steps in existing methodologies and enhancing both speed and robustness. We show that our method outperforms the state-of-the-art method in terms of speed and accuracy when used for robust back-end pose graph optimization via GNC. Our work builds upon and enhances the open-source riSAM framework. Our implementation can be accessed from: https://github.com/SNU-DLLAB/EGNC-PGO
@article{arxiv.2310.06765,
title = {Efficient Graduated Non-Convexity for Pose Graph Optimization},
author = {Wonseok Kang and Jaehyun Kim and Jiseong Chung and Seungwon Choi and Tae-wan Kim},
journal= {arXiv preprint arXiv:2310.06765},
year = {2023}
}