Time Distributed Optimization for Model Predictive Control: Stability, Robustness, and Constraint Satisfaction
Not on the map. Why?
Abstract (arXiv)
Time distributed optimization is an implementation strategy that can significantly reduce the computational burden of model predictive control by exploiting its robustness to incomplete optimization. When using this strategy, optimization iterations are distributed over time by maintaining a running solution estimate for the optimal control problem and updating it at each sampling instant. The resulting controller can be viewed as a dynamic compensator which is placed in closed-loop with the plant. This paper presents a general systems theoretic analysis framework for time distributed optimization. The coupled plant-optimizer system is analyzed using input-to-state stability concepts and sufficient conditions for stability and constraint satisfaction are derived. When applied to time distributed sequential quadratic programming, the framework significantly extends the existing theoretical analysis for the real-time iteration scheme. Numerical simulations are presented that demonstrate the effectiveness of the scheme.
Key facts. Cited by 1 paper in the map (data through 7 Oct 2026). First posted on arXiv 6 Mar 2019.
Builds on
No reference list yet.
Built on by
Citing papers per year: 2024: 1.
1 paper.
- 2024Towards a Systems Theory of Algorithmscited by 7
- 2024Towards a Systems Theory of Algorithms25 Jan 2024