Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
110 tokens/sec
GPT-4o
56 tokens/sec
Gemini 2.5 Pro Pro
44 tokens/sec
o3 Pro
6 tokens/sec
GPT-4.1 Pro
47 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

Reducing the Prediction Horizon in NMPC: An Algorithm Based Approach (1105.3267v1)

Published 17 May 2011 in math.OC, cs.SY, and math.NA

Abstract: In order to guarantee stability, known results for MPC without additional terminal costs or endpoint constraints often require rather large prediction horizons. Still, stable behavior of closed loop solutions can often be observed even for shorter horizons. Here, we make use of the recent observation that stability can be guaranteed for smaller prediction horizons via Lyapunov arguments if more than only the first control is implemented. Since such a procedure may be harmful in terms of robustness, we derive conditions which allow to increase the rate at which state measurements are used for feedback while maintaining stability and desired performance specifications. Our main contribution consists in developing two algorithms based on the deduced conditions and a corresponding stability theorem which ensures asymptotic stability for the MPC closed loop for significantly shorter prediction horizons.

User Edit Pencil Streamline Icon: https://streamlinehq.com
Authors (2)
  1. Jürgen Pannek (14 papers)
  2. Karl Worthmann (83 papers)
Citations (23)

Summary

We haven't generated a summary for this paper yet.