Computer-assisted proof of non-reachability for linear systems in finite dimension
Abstract
It is customary to design a controlled system in such a way that, whatever the chosen control satisfying the constraints, the system does not enter so-called unsafe regions. This work introduces a general computer-assisted methodology to prove that a given linear finite-dimensional control systems with compact constraints avoids a chosen unsafe set. Relying on support hyperplanes, we devise a functional such that the property of interest is equivalent to finding a point at which the functional is negative. Actually evaluating the functional first requires time-discretisation. We thus provide explicit, fine discretisation estimates for various types of matrices underlying the controlled problem. Second, computations lead to roundoff errors, which are dealt with by means of interval arithmetic. The control of both error types then lead to rigorous, computer-assisted proofs of non-reachability of the unsafe set. We illustrate the applicability and flexibility of our method in different contexts featuring various control constraints, unsafe sets, types of matrices and problem dimensions.
Type
Publication
SICON

Authors
Christophe Zhang
(he/him)
researcher
I am currently in secondment at Inria Paris, as a researcher in the CAGE team. I work on control, stabilization and optimal control problems in infinite dimension (PDEs and evolution equation), with a particular focus on constrained control.
I have also dabbled in data-driven modelling and control, in particular methods involving the Koopman operator.
More recently, I have taken an interest in reachability analysis. I co-supervised the PhD thesis of Ivan Hasenohr with Camille Pouchol and Yannick Privat, during which we developed computer-assisted proofs of reachability and non-reachability.