Offline Model Predictive Control Based on Weighted Projection over Polytopes
This work presents a novel offline model predictive control technique for tracking of constrained systems. The quadratic programming problem, commonly found in constrained control methods, is replaced by sequential offline set projections based on priority given to the decision variables. If a prefe...
Saved in:
| Main Author: | |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Wiley
2015-01-01
|
| Series: | Journal of Applied Mathematics |
| Online Access: | http://dx.doi.org/10.1155/2015/741348 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Summary: | This work presents a novel offline model predictive control technique for tracking of constrained systems. The quadratic programming problem, commonly found in constrained control methods, is replaced by sequential offline set projections based on priority given to the decision variables. If a preference is established in terms of which decision variables are more desirable, the optimization problem can be solved by sequentially choosing the most important variables and performing a membership test with the projection of the constraint closed set over the related dimensions. Thus, real-time optimization is replaced by offline projection operations and online one-dimensional membership tests. This concept of decision variable prioritization is then applied to a form of model predictive control: feasible target tracking. Three quadratic programming problems are replaced by the proposed method. In the first problem, attainable steady-state demands are computed based on the performance of the plant. The reachable target command is then filtered in terms of dynamic admissibility, creating feasible inputs to the plant. Finally, the control is computed considering the current state and disturbance vectors along with the feasible and attainable command. Simulations of the method executing a path-following task are presented, demonstrating its benefits with negligible online computational burden. |
|---|---|
| ISSN: | 1110-757X 1687-0042 |