DisCo: Distributed Contact-Rich Trajectory Optimization for Forceful Multi-Robot Collaboration
Ola Shorinwa, Matthew Devlin, Elliot W. Hawkes, Mac Schwager

TL;DR
DisCo is a distributed contact-implicit trajectory optimization algorithm enabling multi-robot collaboration in contact-rich tasks, improving efficiency and privacy by decentralizing computation and communication.
Contribution
We introduce DisCo, a novel distributed algorithm based on ADMM for contact-rich multi-robot trajectory optimization, enhancing scalability and privacy compared to centralized methods.
Findings
Achieves 3x higher success rates in simulations
Operates 2.5x to 5x faster than centralized approaches
Successfully demonstrated on hardware with modular robots
Abstract
We present DisCo, a distributed algorithm for contact-rich, multi-robot tasks. DisCo is a distributed contact-implicit trajectory optimization algorithm, which allows a group of robots to optimize a time sequence of forces to objects and to their environment to accomplish tasks such as collaborative manipulation, robot team sports, and modular robot locomotion. We build our algorithm on a variant of the Alternating Direction Method of Multipliers (ADMM), where each robot computes its own contact forces and contact-switching events from a smaller single-robot, contact-implicit trajectory optimization problem, while cooperating with other robots through dual variables, enforcing constraints between robots. Each robot iterates between solving its local problem, and communicating over a wireless mesh network to enforce these consistency constraints with its neighbors, ultimately converging…
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
TopicsRobot Manipulation and Learning · Manufacturing Process and Optimization · Robotic Path Planning Algorithms
