1 / 40

# Feasibility, uncertainty and interpolation - PowerPoint PPT Presentation

Feasibility, uncertainty and interpolation. J. A. Rossiter (Sheffield, UK). Overview. Predictive control (MPC) Interpolation instead of optimisation Invariant sets Combining invariant sets Illustrations Conclusions. BACKGROUND. Notation. Assume a state space model and constraints

I am the owner, or an agent authorized to act on behalf of the owner, of the copyrighted work described.

## PowerPoint Slideshow about ' Feasibility, uncertainty and interpolation' - ariana-snider

An Image/Link below is provided (as is) to download presentation

Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author.While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server.

- - - - - - - - - - - - - - - - - - - - - - - - - - E N D - - - - - - - - - - - - - - - - - - - - - - - - - -
Presentation Transcript

### Feasibility, uncertainty and interpolation

J. A. Rossiter (Sheffield, UK)

• Predictive control (MPC)

• Interpolation instead of optimisation

• Invariant sets

• Combining invariant sets

• Illustrations

• Conclusions.

IEEE Colloquium, April 4th 2005

IEEE Colloquium, April 4th 2005

• Assume a state space model and constraints

• Let the control law be

• Define the maximal admissible set (MAS), that is region within which constraints are met, as

IEEE Colloquium, April 4th 2005

IEEE Colloquium, April 4th 2005

• Minimise a performance index of the form

• Can write solutions as

IEEE Colloquium, April 4th 2005

IEEE Colloquium, April 4th 2005

• If terminal control is optimal, then the terminal region may be small.

• Need large d.o.f. to get large feasible region.

• Good performance

• If terminal control is detuned, terminal region may be large.

• Small d.o.f. to get large feasible region.

• Suboptimal performance.

IEEE Colloquium, April 4th 2005

IEEE Colloquium, April 4th 2005

Interpolation is known to:

• Allow efficient (often trivial) optimisations.

• Combine qualities of different strategies.

Interpolate between K1 and K2 where:

• K1 has optimal performance but possibly a small feasible region

• K2 has large feasible region.

IEEE Colloquium, April 4th 2005

IEEE Colloquium, April 4th 2005

A simple summary: split the state into 2 components and predict separately through the 2 closed-loop dynamics, then recombine.

Decomposition into x1 and x2 to ensure constraint satisfaction.

IEEE Colloquium, April 4th 2005

Find max. volume feasible invariant ellipsoid.

By necessity conservative in volume.

Can be computed easily, even with model uncertainty.

Generalised interpolation algorithm takes convex hull of several ellipsoids.

SDP solver required.

Polytopic invariant sets

Can use MAS – maximum possible feasible regions.

Easily computed for nominal case only.

Various interpolation algorithms for certain case.

Still limited to convex hull of underlying sets.

Optimisation requires QP or LP.

Feasible regions with Interpolation

IEEE Colloquium, April 4th 2005

IEEE Colloquium, April 4th 2005

IEEE Colloquium, April 4th 2005

Which is more efficient:

• A normal MPC algorithm with d.o.f.?

• An interpolation?

ONEDOF interpolations have only one d.o.f. but severely restricted feasibility.

General interpolation requires nx d.o.f. (nx the state dimension).

IEEE Colloquium, April 4th 2005

IEEE Colloquium, April 4th 2005

• Algorithms using MAS can only be applied to the nominal case.

• Easy to show that uncertainty can cause infeasibility and instability.

• Need modifications to cater for uncertainty.

Here we consider changes to cater for LPV systems.

IEEE Colloquium, April 4th 2005

IEEE Colloquium, April 4th 2005

Let constraints be

Then the MAS is given as

Where

for n large enough.

[Redundant rows can be removed in general.]

Polytopic invariant sets (MAS) for nominal systems

IEEE Colloquium, April 4th 2005

The computation of these is generally considered intractable.

Consider a closed-loop LPV system

Then computing all possible open-loop predictions.

Clearly, there is a combinatorial explosion in the number of terms.

Polytopic invariant sets for LPV systems

IEEE Colloquium, April 4th 2005

Specifically, remove redundant constraints from Mi before computing Mi+1.

This will slow the rate of growth and produce a tractable algorithm, if, the actual MAS is of reasonable complexity.

Polytopic invariant sets for LPV systems

IEEE Colloquium, April 4th 2005

Robust and nominal invariant sets al, ACC 2005]

IEEE Colloquium, April 4th 2005

Polytopic invariant sets and interpolation al, ACC 2005]

MUST USE ROBUST SETS TO ENSURE FEASIBILITY!

• We can simply use the ‘robust’ invariant sets in the algorithm developed for the nominal case.

• Proofs of recursive feasibility and convergence carry across easily if the cost is replaced by a suitable upper bound.

• (A quadratic stabilisability condition is required.)

IEEE Colloquium, April 4th 2005

Summary al, ACC 2005]

Polytopic invariant sets allow the use of interpolation with LPV systems and hence:

• Large feasible regions.

• Robustness.

• Small computational load.

BUT:

General interpolation still only applicable to convex hull of underlying regions. This could be too restrictive.

IEEE Colloquium, April 4th 2005

EXPLICIT OR IMPLICIT CONSTRAINT HANDLING al, ACC 2005]

IEEE Colloquium, April 4th 2005

Extending feasibility of interpolation methods al, ACC 2005]

General interpolation does implicit not explicit constraint handling.

So:

• membership of the set implies the trajectories are feasible.

• non-membership may not imply infeasibility.

Therefore, we know that feasibility may be extended beyond the convex hull in general, but how ?

IEEE Colloquium, April 4th 2005

With ellipsoidal invariant sets this is obvious. al, ACC 2005]

Constraints are converted into an LMI, with some conservatism because of:

Asymmetry

Conversion of linear inequalities to quadratic inequalities.

A trivial example of this might be

or

Implicit constraint handling

IEEE Colloquium, April 4th 2005

Conservatism with linear inequalities al, ACC 2005]

• Define the invariant sets associated to K1, K2,… to be

• Then, general interpolation first splits x into several components and uses the constraints

IEEE Colloquium, April 4th 2005

Conservatism with linear inequalities (b) al, ACC 2005]

• The constraint enforces feasibility.

• However, consider the following hypothetical illustration:

• This implies that

IEEE Colloquium, April 4th 2005

Remarks al, ACC 2005]

• The constraint

is necessary with ellipsoidal invariant sets as one can not check predictions explicitly against constraints.

• This is not the case with polytopic invariant sets.

• Hence we propose to relax this condition and hence increase feasible regions.

• Remove the two conditions

IEEE Colloquium, April 4th 2005

General interpolation can be composed as al, ACC 2005]

We propose to replace this as a single inequality:

NOTE: No longer any  variables!

Relaxed constraints

IEEE Colloquium, April 4th 2005

Structure of inequalities (nominal case) al, ACC 2005]

• Consider the predictions

• And hence the explicit constraints are

IEEE Colloquium, April 4th 2005

ILLUSTRATIONS al, ACC 2005]

IEEE Colloquium, April 4th 2005

Illustrations al, ACC 2005]

• There can be surprisingly large increases in feasibility.

• Probably because the directionality of trajectories for each controller are different.

IEEE Colloquium, April 4th 2005

Extensions to the LPV case al, ACC 2005]

• Unfortunately, explicit constraint handling requires a direct link between the prediction equations and the inequalities.

• However, the algorithm for finding polytopic invariant sets in the LPV case, relied, for efficiency, on removing redundant constraints from the predictions.

IEEE Colloquium, April 4th 2005

Extensions to the LPV case (b) al, ACC 2005]

• For the original GIMPC, sets S1, S2,.. could be described as efficiently as possible. There was no need for mutual consistency because constraint handling was implicit.

• Notably, all redundant inequalities could be eliminated.

• When doing explicit constraint handling, redundant constraints cannot be eliminated from Si, just in case the overall x(k+j) for that row is against a constraint!

IEEE Colloquium, April 4th 2005

• Algorithms can be written to formulate the inequalities, but suffer more from the combinatorial growth problems outlined earlier.

• Assuming the resulting sets are not too large, proofs of convergence and feasibility are straightforward.

IEEE Colloquium, April 4th 2005

Illustration of inequalities al, ACC 2005]

IEEE Colloquium, April 4th 2005

Conclusions al, ACC 2005]

• Interpolation is known to facilitate reductions in complexity at times, particular for low dimensional systems. However most work has focussed on the nominal case.

• Some earlier interpolation algorithms used implicit constraint handling to cater for uncertainty. This could lead to considerable conservatism.

• We have illustrated:

• How interpolation can be modified to overcome this conservatism and the associated issues (recently submitted).

• how polytopic robust MAS might be computed and used in MPC (to be published IFAC and ACC, 2005).

• how to use polytopic robust MAS with interpolation (recently submitted).

IEEE Colloquium, April 4th 2005