A Brief Tutorial on Consensus ADMM for Distributed Optimization with Applications in Robotics
Jushan Chen

TL;DR
This tutorial explains the Consensus ADMM algorithm for distributed optimization, emphasizing its derivation and application to multi-robot trajectory planning, providing insights into its theoretical foundations and practical use cases.
Contribution
It offers a clear derivation of Consensus ADMM and demonstrates its application in multi-robot trajectory optimization, bridging theory and practice.
Findings
Consensus ADMM effectively solves distributed trajectory optimization problems.
The tutorial clarifies the connection between Consensus ADMM and augmented Lagrangian methods.
Application results show improved coordination in multi-robot systems.
Abstract
This paper presents a tutorial on the Consensus Alternating Direction Method of Multipliers (Consensus ADMM) for distributed optimization, with a specific focus on applications in multi-robot systems. In this tutorial, we derive the consensus ADMM algorithm, highlighting its connections to the augmented Lagrangian and primal-dual methods. Finally, we apply Consensus ADMM to an example problem for trajectory optimization of a multi-agent system.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsOptimization and Search Problems · Modular Robots and Swarm Intelligence · Robotic Path Planning Algorithms
