Skip to content
Case report Open access

Distributed Model-Based Diffusion: Finite Horizon Contraction under Bounded Delay

Aug 2026 · 0 citations · 8 references
Computer Science

TL;DR

This paper analyzes Distributed Model-Based Diffusion: a sampling-based Model-Predictive Control method suitable for highly nonlinear, nonconvex, nonsmooth, multi-agent systems and proves contraction and robustness to latency for multi-agent, nonconvex problems, showing applicability to real-world constraints.

Abstract

Simultaneously optimizing the trajectories of multiple agents is a challenging problem plagued by nonlinearity, nonconvexity, and the curse of dimensionality. A collection of interacting aerial vehicles or self-driving cars in an intersection are examples of complex multi-agent systems that remain difficult to solve without many simplifying assumptions. The presence of communication latency between agents further increases the difficulty. In this paper, we analyze Distributed Model-Based Diffusion: a sampling-based Model-Predictive Control method suitable for highly nonlinear, nonconvex, nonsmooth, multi-agent systems. We prove contraction and robustness to latency for multi-agent, nonconvex problems, showing applicability to real-world constraints. We test the algorithm on a circleswap task, a cooperative medium-fidelity driving task, and in an aerial combat scenario. Despite the addition of latency, our algorithm improves circleswap makespan by 31% and increases aerial combat win rate by 25% compared to centralized Model-Based Diffusion.

Read PDF

Similar papers

2026

Distributed Predictive Control Under Noncooperative Game for Systems With Switching Topology

This paper is concerned with a distributed model predictive control (DMPC) problem for multi-agent systems (MASs) with noncooperative games under undirected switching topologies. With respect to parameter uncertainties of MASs and complicated information communication between neighbors under changing topologies, a dual...

Ling-Ling Zhang, Yan Song, Yuan Yuan · 0 citations
Conference Aug 2026

Assignment-Free Real-time Tracking Control for Large-Scale Multi-Agent Systems

This paper studies real time formation control for large scale multi agent systems (LMAS) with anonymous agents and finite time requirements. Instead of solving a centralized Hamilton Jacobi Bellman (HJB) problem or a coupled mean field game system, we design an assignment free controller directly at the distribution l...

Nishad Tasnim, Ze-Jian Zhou · 0 citations
Preprint Sep 2026

Entropy-Regularized Optimal Transport for Time-Varying Multi-Agent Coverage Control

This paper addresses time-varying coverage control for multi-agent systems, formulated as the tracking of an evolving target density via entropy-regularized semi-discrete optimal transport, and derives a feedback-feedforward controller that tracks the evolving first-order optimality conditions with exponential converge...

Italo Napolitano, M. di Bernardo · 2 citations
Preprint Sep 2026

Distributed Stochastic Approximation Algorithms and Heavy-Tailed Age of Information

Algorithms in multi-agent systems such as federated learning, mobile robotic swarming, and consensus control can be designed and analyzed as distributed stochastic approximation algorithms. Such algorithms involve information exchanges between agents for various computations. The freshness of the information can be qua...

Adrian Redder, Arunselvan Ramaswamy, Holger Karl · 0 citations
Preprint Sep 2026

Multi-Agent Event-Triggered LQG Control under Shared Communication Constraints

Numerical results show that the proposed model predictive control (MPC) scheduler achieves the best trade-off between control performance and communication cost, while the auction-based scheduler attains performance close to MPC with substantially lower computational complexity.

Z. Hashemi, Dipankar Maity · 0 citations
Sep 2026

Quantization observer-based bipartite fixed-time consensus for nonlinear heterogeneous multiagent systems via event-triggered control.

Numerical simulations demonstrate that the proposed scheme achieves bipartite fixed-time consensus within approximately 0.4 s under event-triggered communication (0.26 s without ETM), while the average communication saving rate is 44.67%, validating the effectiveness of the theoretical results.

Wei Zhang, Yi-Yue Zhang, Jun-Jian Huang et al. · 0 citations

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.