On relaxing the N-Reachability Implicit Requirement in NMPC Design
By: Mazen Alamir
Potential Business Impact:
Makes robots move safely even with short plans.
This paper proposes a proof of stability for Model Predictive Control formulations involving a prediction horizon that might be too short to meet the reachability condition generally invoked as a sufficient condition for closed-loop stability. This condition is replaced by a contraction condition on the stage cost. But unlike the contraction based existing formulations where the prediction horizon becomes a decision variable, the formulation proposed in this paper remains standard in that it uses constant and short prediction horizon. An illustrative example is provided to assess the relevance of the proposed formulation.
Similar Papers
Constraint Horizon in Model Predictive Control
Systems and Control
Makes robots safer by predicting problems.
Recursive feasibility for stochastic MPC and the rationale behind fixing flat tires
Optimization and Control
Keeps robots on track even with unexpected bumps.
Layered Nonlinear Model Predictive Control for Robust Stabilization of Hybrid Systems
Systems and Control
Makes robots walk and jump more smoothly.