Papers › Incremental Proximal Multi-Forecast Model Predictive Control
Incremental Proximal Multi-Forecast Model Predictive Control
Xinyue Shen, Stephen Boyd
The archive published only this paper's code-link row. Authors, date and abstract are from arXiv's metadata (CC0), read from the Kaggle arXiv metadata snapshot of 2026-09-12 where its title matched the archive's; the title is the archive's.
Multi-forecast model predictive control (MF-MPC) is a control policy that creates a plan of actions over a horizon for each of a given set of forecasted scenarios or contingencies, with the constraint that the first action in all plans be the same. In this note we show how these coupled plans can be found by solving a sequence of single plans, using an incremental proximal method. We refer to this policy as incremental proximal model predictive control (IP-MPC). We have observed that even when the iterations in IP-MPC are not carried out to convergence, we obtain a policy that achieves much of the improvement of MF-MPC over single-forecast model predictive control (MPC).
Code
Repository list and official/mentioned flags are the archive's, frozen 2025-07-28. Reachability, where shown, is from one Syntology probe window (2026-09-16 to 2026-09-18); repositories not probed show nothing. GitHub stars are not tracked.
Code Syntology ran Syntology
Not run by Syntology. Nothing on this page verifies that the listed code works.
Results from the paper archive 2025-07-28
No leaderboard rows for this paper in the archive.
Report a problem or propose a change · a person checks every report against the paper or source before anything changes; decisions are listed on /corrections