Spectral Graph Theoretic Methods for Enhancing Network Robustness in Robot Localization
<|reference_start|>Spectral Graph Theoretic Methods for Enhancing Network Robustness in Robot Localization: This paper addresses the optimization of edge-weighted networks by maximizing algebraic connectivity to enhance network robustness. Motivated by the need for precise robot position estimation in cooperative localization and pose-graph sparsification in Simultaneous Localization and Mapping (SLAM), the algebraic connectivity maximization problem is formulated as a Mixed Integer Semi-Definite Program (MISDP), which is NP-hard. Leveraging spectral graph theoretic methods, specifically Cheeger's inequality, this work introduces novel "Cheeger cuts" to strengthen and efficiently solve medium-scale MISDPs. Further, a new Mixed Integer Linear Program (MILP) is developed for efficiently computing Cheeger cuts, implemented within an outer-approximation algorithm for solving the MISDP. A greedy k-opt heuristic is also presented, producing high-quality solutions that serve as valid lower bounds for Cheeger cuts. Comprehensive numerical analyses demonstrate the efficacy of strengthened cuts via substantial improvements in run times on synthetic and realistic robot localization datasets.<|reference_end|>
@article{somisetty2024spectral,
    title={Spectral Graph Theoretic Methods for Enhancing Network Robustness in
  Robot Localization},
    author={Neelkamal Somisetty, Harsha Nagarajan, Swaroop Darbha},
    journal={arXiv preprint arXiv:2409.15506},
    year={2024},
    number={LA-UR-24-30124},
    archivePrefix={arXiv},
    eprint={2409.15506},
    primaryClass={eess.SY cs.SY math.OC math.SP}
}