A Survey of Distributed Optimization Methods for Multi-Robot Systems
read the original abstract
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.
This paper has not been read by Pith yet.
Forward citations
Cited by 7 Pith papers
-
Distributed Pose Graph Optimization via Continuous Riemannian Dynamics
Pose graph optimization is recast as damped Riemannian dynamics on Lie groups, enabling a fully distributed algorithm with a semi-implicit integrator that converges under both synchronous and asynchronous communication.
-
Adversary-Robust Learning from Fully Asynchronous Directional Derivative Estimates
FAR-SIGN achieves adversary-resilient fully asynchronous optimization via signed directional projections and two-timescale correction, with almost-sure convergence to stationary points at rates O(n^{-1/4+ε}) first-ord...
-
Multi-Agent Motion Planning for Simultaneous Arrival using Time-Reversed Search and Distributed Optimal Control
Backward time-reversed conflict-based search finds initial collision-free simultaneous-arrival trajectories for agents at rest, which are then refined via distributed nonlinear ADMM optimal control.
-
Flow-Opt: Scalable Centralized Multi-Robot Trajectory Optimization with Flow Matching and Differentiable Optimization
Flow-Opt combines a flow-matching DiT model with a custom differentiable safety filter and learned initialization to enable fast centralized trajectory optimization for tens of robots.
-
Decentralized Pose Graph Riemannian Optimization for Object-based Multi-Robot SLAM
Decentralized Riemannian optimization framework for object-based multi-robot pose graph optimization using consensus and approximate-Newton methods to reduce communication overhead while maintaining accuracy.
-
Semiglobal Input-Delay Tolerance Algorithm for Distributed Nonconvex Optimization of Networked Nonlinear Systems
Develops the SIDT algorithm that achieves practical semiglobal input-delay tolerant convergence for distributed nonconvex optimization in networked nonlinear systems by combining hierarchical design with input-to-stat...
-
Safe Decentralized Density Control of Multi-Robot Systems using PDE-Constrained Optimization with State Constraints
Decentralized density control for multi-robot systems using PDE-constrained optimization ensures global safety from local constraints with reduced computation and communication needs.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.