mlsanityData to 7 Oct 2026

A Survey of Distributed Optimization Methods for Multi-Robot Systems

arXiv 2103.12840 ↗First posted 23 Mar 2021cs.ROcited by 7

Not on the map. Why?

Abstract (arXiv)

Distributed optimization consists of multiple computation nodes working together to minimize a common objective function through local computation iterations and network-constrained communication steps. In the context of robotics, distributed optimization algorithms can enable multi-robot systems to accomplish tasks in the absence of centralized coordination. We present a general framework for applying distributed optimization as a module in a robotics pipeline. We survey several classes of distributed optimization algorithms and assess their practical suitability for multi-robot applications. We further compare the performance of different classes of algorithms in simulations for three prototypical multi-robot problem scenarios. The Consensus Alternating Direction Method of Multipliers (C-ADMM) emerges as a particularly attractive and versatile distributed optimization method for multi-robot systems.

Key facts. Cited by 7 papers in the map (data through 7 Oct 2026). First posted on arXiv 23 Mar 2021.

Builds on

No reference list yet.

Built on by

Cited by year (2026 to 7 Oct)

Citing papers per year: 2021: 1; 2022: 3; 2023: 0; 2024: 1; 2025: 1; 2026: 1.

7 papers.