Computing Controllable Sets of Hybrid Systems

摘要

In this paper we consider the controllability problem for hybrid systems, namely that of determining the set of states which can be driven into a given target set. We show that given a suitable definition of controllability, we can effectively compute arbitrarily accurate under-approximations to the controllable set using Turing machines. However, due to grazing or sliding along guard sets, we see that it may be able to demonstrate that an initial state can be controlled to the target set, without knowing any trajectory which solves the problem.