This work addresses the problem of exploration in an unknown environment. For linear dynamical systems, we use an experimental design framework and introduce an online greedy policy where the control maximizes the information of the next step. In a setting with a limited number of experimental trials, our algorithm has low complexity and shows experimentally competitive performances compared to more elaborate gradient-based methods.
@article{arxiv.2204.06375,
title = {Online greedy identification of linear dynamical systems},
author = {Matthieu Blanke and Marc Lelarge},
journal= {arXiv preprint arXiv:2204.06375},
year = {2023}
}