Online greedy identification of linear dynamical systems

This work addresses the problem of exploration in an unknown environment. For multi-input multi-output, linear time-invariant dynamical systems, we use an experimental design framework and introduce an online greedy policy where the control maximizes the information of the next step. We evaluate our approach experimentally and compare it with more elaborate gradient-based methods. In a setting with a limited number of observations, our algorithm has low complexity and shows competitive performances.