Answers are grounded in this paper and cite their sources.
It is customary to design a control 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 control system with compact constraints avoids a chosen unsafe set at a chosen final time [Formula: see text]. 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 discretization. We thus provide explicit, fine discretization estimates for various types of matrices underlying the control problem. Second, computations lead to roundoff errors, which are dealt with by means of interval arithmetic. The control of both error types then leads to rigorous, computer-assisted proofs of nonreachability 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.
No takes yet. Share an insight, caveat, or question.
Hasenohr et al. (2025) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: