Symbolic control for underactuated differentially flat systems

In this paper we address the problem of generating input plans to steer complex dynamical systems in an obstaclefree environment. Plans considered admit a finite description length and are constructed by words on an alphabet of input symbols, which could be e.g. transmitted through a limited capacity channel to a remote system, where they can be decoded in suitable control actions. We show that, by suitable choice of the control encoding, finite plans can be efficiently built for a wide class of dynamical systems, computing arbitrarily close approximations of a desired equilibrium in polynomial time. Moreover, we illustrate by Simulations the power of the proposed method, solving the steering problem for an example in the class of underactuated systems, which have attracted wide attention in the recent literature.