- Conference Paper
This article presents an approximation scheme for the infinite-dimensional linear programming formulation of discrete-time Markov control processes via a finite-dimensional convex program, when the dynamics are unknown and learned from data. We derive a probabilistic explicit error bound between the data-driven finite convex program and the original infinite linear program. We further discuss the sample complexity of the error bound which translates to the number of samples required for an a priori approximation accuracy. Our analysis sheds light on the impact of the choice of basis functions for approximating the true value function. Finally, the relevance of the method is illustrated on a truncated LQG problem. Show more
Book title2017 IEEE 56th Annual Conference on Decision and Control (CDC)
Pages / Article No.
Organisational unit03751 - Lygeros, John / Lygeros, John
MoreShow all metadata