par Cotorruelo Jiménez, Andrés
;Kolmanovsky, Ilya I.V.;Garone, Emanuele 
Référence Automatica, 109783
Publication Publié, 2021-12-01


Référence Automatica, 109783
Publication Publié, 2021-12-01
Article révisé par les pairs
Résumé : | The P-difference between two sets A and B is the set of all points, C, such that the sum of B to any of the points in C is contained in A. Such a set difference plays an important role in robust model predictive control and set-theoretic control. In this paper, we show that an inner approximation of the P-difference between two sets described by collections of polynomial inequalities can be computed using Sums of Squares Programming. The effectiveness of the procedure is shown with some computational examples. |