Deep-Unfolded Coordination

Published June 19, 2026 · Category: Robotics

Overview

arXiv:2606.19920v1 Announce Type: new Abstract: Distributed optimization is a highly scalable and structurally transparent technique to solve multi-agent robotics problems; however, such methods often suffer from the need for highly-specialized, problem-specific hyperparameter tunings. In this work, we propose Deep Coordinator, a deep-unfolding framework that learns to dynamically adjust the hyperparameters of ADMM-DDP, a popular distributed solver for robotics tasks, at solve-time in response to optimizer performance. Our architecture consists of unrolling a fixed number of ADMM-DDP iterations into a neural network with learnable functions between layers mapping the optimizer state to the next hyperparameters. To the best of our knowledge, Deep Coordinator is the first deep-unfolding framework to adapt the penalty parameters of a non-convex optimizer at solve-time; we show that the mainstream supervised approach can yield degenerate solutions when training such models, and propose an unsupervised learning scheme. On simulations with fleets of cars and quadrotors, Deep Coordinator produces trajectories of comparable quality 6.18-9.44x faster than conventional solvers. Furthermore, Deep Coordinator retains its performance benefits when deployed to systems up to 8x larger than trained on.

Source

Originally published at arxiv.org.

Related Articles

• pdSTL: Probabilistic Differentiable Signal Temporal Logic for Stochastic Systems
• Fail-RAG : A Retrieval Augmented Generation Informed Framework for Robot Failure Identification
• CTS-MoE: Implicit Terrain Adaptation via Mixture-of-Experts for Perceptive Locomotion