A Decentralized Event-Based Approach for Robust Model Predictive Control

Journal Article (2020)
Author(s)

Arman Sharifi Kolarijani (TU Delft - Mechanical Engineering)

Sander Christian Bregman (TU Delft - Mechanical Engineering)

Peyman Mohajerin Esfahani (TU Delft - Mechanical Engineering)

Tamas Keviczky (TU Delft - Mechanical Engineering)

Research Group
Team Tamas Keviczky
DOI related publication
https://doi.org/10.1109/TAC.2019.2945285 Final published version
More Info
expand_more
Publication Year
2020
Language
English
Research Group
Team Tamas Keviczky
Bibliographical Note
Green Open Access added to TU Delft Institutional Repository 'You share, we take care!' - Taverne project https://www.openaccess.nl/en/you-share-we-take-care Otherwise as indicated in the copyright section: the publisher is the copyright holder of this work and the author uses the Dutch legislation to make this work public.
Journal title
IEEE Transactions on Automatic Control
Issue number
8
Volume number
65
Pages (from-to)
3517-3529
Page Views
300
Collections
Institutional Repository
Reuse Rights

Other than for strictly personal use, it is not permitted to download, forward or distribute the text or part of it, without the consent of the author(s) and/or copyright holder(s), unless the work is under an open content license such as Creative Commons.

Abstract

In this paper, we propose an event-based sampling policy to implement a constraint-tightening, robust MPC method. The proposed policy enjoys a computationally tractable design and is applicable to perturbed, linear time-invariant systems with polytopic constraints. In particular, the triggering mechanism is suitable for plants with no centralized sensory node as the triggering mechanism can be evaluated locally at each individual sensor. From a geometrical viewpoint, the mechanism is a sequence of hyperrectangles surrounding the optimal state trajectory such that robust recursive feasibility and robust stability are guaranteed. The design of the triggering mechanism is cast as a constrained parametric-in-set optimization problem with the volume of the set as the objective function. Reparameterized in terms of the set vertices, we show that the problem admits a finite tractable convex program reformulation and a linear program relaxation. Several numerical examples are presented to demonstrate the effectiveness and limitations of the theoretical results.

Files

A_Decentralized_Event_Based_Ap... (pdf)
(pdf | 1.01 Mb)
- Embargo expired in 02-04-2020
License info not available