Metraipolis › archive › dc_ab4b5eb337f8

MM-LMPC: Multi-Modal Learning Model Predictive Control via Mode-Specific Terminal Design and Bandit-Based Exploration — arXiv:2609.15623

Source
arXiv (en)
Original
https://arxiv.org/abs/2609.15623
License (as archived)
CC0-1.0
Archived
2026-10-16T02:58:03.617Z
SHA-256 of the archived text
36c514a8ac190dec5784599b6f64426d45dcd94a0ca6d3bd5422cbd796537284
Stable URL of this page
https://metraipolis.com/documento/dc_ab4b5eb337f8

How to cite

MM-LMPC: Multi-Modal Learning Model Predictive Control via Mode-Specific Terminal Design and Bandit-Based Exploration — arXiv:2609.15623 — arXiv (en), https://arxiv.org/abs/2609.15623 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_ab4b5eb337f8 (Metraipolis archive dc_ab4b5eb337f8, sha256 36c514a8ac190dec5784599b6f64426d45dcd94a0ca6d3bd5422cbd796537284)
BibTeX
@misc{dcab4b5eb337f8,
  title = {MM-LMPC: Multi-Modal Learning Model Predictive Control via Mode-Specific Terminal Design and Bandit-Based Exploration — arXiv:2609.15623},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2609.15623},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_ab4b5eb337f8; sha256 36c514a8ac190dec5784599b6f64426d45dcd94a0ca6d3bd5422cbd796537284},
  year = {2026}
}

Archived text

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

Learning Model Predictive Control (LMPC) improves iterative control tasks by using previous executions to construct the terminal constraint and terminal cost of the MPC problem. Although effective, this reuse of past trajectories can make LMPC sensitive to the initial data. In particular, LMPC may repeatedly exploit stored trajectories with favorable cost-to-go values while insufficiently exploring alternative route patterns that could yield lower cost after further improvement. To address this issue, we propose Multi-Modal LMPC (MM-LMPC). The proposed framework clusters past trajectories into motion modes, constructs a mode-specific LMPC controller for each mode, and uses an LCB-based meta-controller to select which mode-specific controller to execute at each iteration. Mode information is incorporated into the terminal constraint and terminal cost through two designs. The hard-constrained design uses mode-specific terminal constraints and terminal costs constructed from the data associated with each mode. The soft-regularized design retains a shared terminal constraint while adding membership-based penalties to the terminal cost. These designs reduce the bias caused by pooling all trajectories into a single terminal memory while retaining the recursive feasibility and stability structure of LMPC. Our theoretical analysis shows that both designs preserve recursive feasibility and closed-loop stability. For the hard-constrained design, we further establish mode-wise cost convergence, asymptotic best-mode performance, and a logarithmic cumulative regret bound under the LCB rule. Simulations on multi-route obstacle-avoidance tasks show that MM-LMPC improves exploration and achieves lower costs than standard LMPC.

Tema degli esploratori: calcolo e infrastrutture (retro-catalogo arXiv: annunci del 2026-09-15 in eess.SY).
Categorie arXiv: Systems and Control (eess.SY).
Pagina del lavoro: https://arxiv.org/abs/2609.15623 — 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-16T02:45:08.551Z dalla pagina https://arxiv.org/catchup/eess.SY/2026-09-15?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).