Metraipolis › archive › dc_bae44c02ed98

Safety-Filtered Distributed Koopman-MPC — arXiv:2609.27463

Source
arXiv (en)
Original
https://arxiv.org/abs/2609.27463
License (as archived)
CC0-1.0
Archived
2026-10-08T12:53:34.370Z
SHA-256 of the archived text
019c42e9690c2d9fc1bb92216f8514913f57e12c4db252e7471a5656df6cf384
Stable URL of this page
https://metraipolis.com/documento/dc_bae44c02ed98

How to cite

Safety-Filtered Distributed Koopman-MPC — arXiv:2609.27463 — arXiv (en), https://arxiv.org/abs/2609.27463 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_bae44c02ed98 (Metraipolis archive dc_bae44c02ed98, sha256 019c42e9690c2d9fc1bb92216f8514913f57e12c4db252e7471a5656df6cf384)
BibTeX
@misc{dcbae44c02ed98,
  title = {Safety-Filtered Distributed Koopman-MPC — arXiv:2609.27463},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2609.27463},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_bae44c02ed98; sha256 019c42e9690c2d9fc1bb92216f8514913f57e12c4db252e7471a5656df6cf384},
  year = {2026}
}

Archived text

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

Distributed model predictive control (DMPC) often constructs both predictions and collision constraints from neighbor trajectories, so packet loss can remove both. We separate these roles: received trajectories drive Koopman-MPC, while local sensing and shelf geometry define a hard-constrained quadratic program (QP) that projects the applied input. Its radial demand is the least constant acceleration that keeps a supporting-plane clearance nonnegative throughout one zero-order-hold interval. Complementary pair rows recover the coupled demand without exchanging safety decisions. We give an intersample separation theorem under bounded snapshot and directional plant errors, an exact max-min test for simultaneous local feasibility, and a sensing-radius condition for switching interaction graphs. Anticipatory high-order rows may be relaxed for performance, but the finite-hold rows contain no safety slack. Matched eight-robot warehouse simulations use a frozen Koopman model, nonlinear drift, bounded inputs and speed, shelf constraints, a 120 ms control period, and packet dropout. The full controller is collision-free in 20/20 matched trials and reaches 160/160 robot goals; predictive Koopman-MPC without the final projection is collision-free in 1/20 trials. All 38,400 full-method hard-row sets pass the online feasibility test, and every local QP solves. Five-stream fleet sweeps are collision-free and hard-row feasible through 16 robots; the 20-robot boundary fails only after the online margin turns negative, while the reconstructed per-agent critical path remains below the sampling period. Bounded-sensing and differential-drive tests provide additional deployment stress.

Tema degli esploratori: statistica e scienza dei dati (retro-catalogo arXiv: annunci del 2026-09-24 in cs.RO).
Categorie arXiv: Robotics (cs.RO) ; Systems and Control (eess.SY).
Pagina del lavoro: https://arxiv.org/abs/2609.27463 — 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-08T12:21:19.475Z dalla pagina https://arxiv.org/catchup/cs.RO/2026-09-24?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).