Pith. sign in

REVIEW

Active exploration in adaptive model predictive control

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2003.14120 v2 pith:QNL6GZUU submitted 2020-03-31 eess.SY cs.SYmath.OC

classification eess.SYcs.SYmath.OC
keywords algorithmcontroladaptiveuncertaintyactivedualexplorationidentification
verification ladder T0 review T1 audit T2 compute T3 formal

Signed reviews

No signed human review yet.

0 comments
read the original abstract

A dual adaptive model predictive control (MPC) algorithm is presented for linear, time-invariant systems subject to bounded disturbances and parametric uncertainty in the state-space matrices. Online set-membership identification is performed to reduce the uncertainty and thus control affects both the informativity of identification and the system's performance. The main contribution of the paper is to include this dual effect in the MPC optimization problem using a predicted worst-case cost in the objective function. This allows the controller to perform active exploration, that is, the control input reduces the uncertainty in the regions of the parameter space that have most influence on the performance. Additionally, the MPC algorithm ensures robust constraint satisfaction of state and input constraints. Advantages of the proposed algorithm are shown by comparing it to a passive adaptive MPC algorithm from the literature.

Discussion (0). Continue with ORCID to comment.

Pith tools