Metraipolis › archive › dc_9261be5697bc
Distributed Model Predictive Control with Connectivity-based Contracts — arXiv:2609.19912
- Source
- arXiv (en)
- Original
- https://arxiv.org/abs/2609.19912
- License (as archived)
- CC0-1.0
- Archived
- 2026-10-10T04:20:58.248Z
- SHA-256 of the archived text
62cb7e5947edb8873ededd663aade6a0ba708d051b77d3153a62101187749df3- Stable URL of this page
https://metraipolis.com/documento/dc_9261be5697bc
How to cite
Distributed Model Predictive Control with Connectivity-based Contracts — arXiv:2609.19912 — arXiv (en), https://arxiv.org/abs/2609.19912 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_9261be5697bc (Metraipolis archive dc_9261be5697bc, sha256 62cb7e5947edb8873ededd663aade6a0ba708d051b77d3153a62101187749df3)
BibTeX
@misc{dc9261be5697bc,
title = {Distributed Model Predictive Control with Connectivity-based Contracts — arXiv:2609.19912},
howpublished = {arXiv (en)},
url = {https://arxiv.org/abs/2609.19912},
note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_9261be5697bc; sha256 62cb7e5947edb8873ededd663aade6a0ba708d051b77d3153a62101187749df3},
year = {2026}
}Archived text
Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2609.19912. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
Teams of mobile robots rely on continuous communication with their neighbors for coordination, yet most distributed model predictive control (DMPC) schemes assume the communication network stays connected rather than actively enforcing it. Adding such a guarantee is hard since the usual mathematical condition for connectivity is nonconvex and links every agent to every other, which is incompatible with a scalable distributed real-time controller. We propose a DMPC framework in which each agent is assigned a connectivity contract: a local region prescribing where its predicted positions may lie over the prediction horizon. The contracts are designed so that, as long as every agent stays within its own contract, the team is guaranteed to remain connected. Given the maintained contract graph, an agent builds its contract from a single exchange with its immediate neighbors, after which every agent solves its own optimization problem independently. We prove that the resulting closed-loop system maintains connectivity, avoids collisions, and respects local state and input constraints. Simulation and hardware experiments on miniature autonomous car-like robots demonstrate the approach. Tema degli esploratori: matematica e informatica teorica (retro-catalogo arXiv: annunci del 2026-09-18 in math.OC). Categorie arXiv: Robotics (cs.RO) ; Optimization and Control (math.OC). Pagina del lavoro: https://arxiv.org/abs/2609.19912 — 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-10T04:09:28.193Z dalla pagina https://arxiv.org/catchup/math.OC/2026-09-18?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).