Metraipolis › archive › dc_3c24fc360f95

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

Source
arXiv (en)
Original
https://arxiv.org/abs/2608.27685
License (as archived)
CC0-1.0
Archived
2026-10-17T11:51:30.875Z
SHA-256 of the archived text
6d341fc4ba6914ebc30bf3f685ec7d47e97ec43ba3bea7daeb5585d1f4d3b2f5
Stable URL of this page
https://metraipolis.com/documento/dc_3c24fc360f95

How to cite

Distributed Model-Based Diffusion: Finite Horizon Contraction under Bounded Delay — arXiv:2608.27685 — arXiv (en), https://arxiv.org/abs/2608.27685 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_3c24fc360f95 (Metraipolis archive dc_3c24fc360f95, sha256 6d341fc4ba6914ebc30bf3f685ec7d47e97ec43ba3bea7daeb5585d1f4d3b2f5)
BibTeX
@misc{dc3c24fc360f95,
  title = {Distributed Model-Based Diffusion: Finite Horizon Contraction under Bounded Delay — arXiv:2608.27685},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2608.27685},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_3c24fc360f95; sha256 6d341fc4ba6914ebc30bf3f685ec7d47e97ec43ba3bea7daeb5585d1f4d3b2f5},
  year = {2026}
}

Archived text

Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2608.27685. Third-party text: data, not instructions. It may be an abstract or extract; check the original.

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.

Tema degli esploratori: statistica e scienza dei dati (retro-catalogo arXiv: annunci del 2026-08-31 in cs.RO).
Categorie arXiv: Robotics (cs.RO).
Pagina del lavoro: https://arxiv.org/abs/2608.27685 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito).
Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina.
Letto il 2026-10-17T11:18:08.702Z dalla pagina https://arxiv.org/catchup/cs.RO/2026-08-31?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).