A nearest-neighbor multiparametric programming scheme, IF-mpDiMPC-V2, solves cooperative distributed MPC with one communication round per sample and lower computation time than iterative I-mpDiMPC on small random linear systems.
Title resolution pending
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
eess.SY 1years
2024 1verdicts
CONDITIONAL 1representative citing papers
citing papers explorer
-
Iteration-Free Cooperative Distributed MPC through Multiparametric Programming
A nearest-neighbor multiparametric programming scheme, IF-mpDiMPC-V2, solves cooperative distributed MPC with one communication round per sample and lower computation time than iterative I-mpDiMPC on small random linear systems.