The content focuses on designing edge-weighted networks to maximize algebraic connectivity, crucial for applications like cooperative vehicle localization. It introduces formulations as MISDP and MILP, upper-bounding algorithms, and a degree-constrained lower bounding formulation. A maximum cost heuristic is proposed for efficient solutions. Computational results show the effectiveness of the algorithms in optimizing network design.
Іншою мовою
із вихідного контенту
arxiv.org
Ключові висновки, отримані з
by Neelkamal So... о arxiv.org 03-20-2024
https://arxiv.org/pdf/2304.08571.pdfГлибші Запити