A scenario approach to non-convex control design: Preliminary probabilistic guarantees

Sergio Grammatico, Xiaojing Zhang, Kostas Margellos, Paul Goulart, John Lygeros

Abstract

Randomized optimization is a recently established tool for control design with modulated robustness. While for uncertain convex programs there exist randomized approaches with efficient sampling, this is not the case for non-convex problems. Approaches based on statistical learning theory are applicable for a certain class of non-convex problems, but they usually are conservative in terms of performance and are computationally demanding. In this paper, we present a novel scenario approach for a wide class of random non-convex programs. We provide a sample complexity similar to the one for uncertain convex programs, but valid for all feasible solutions inside a set of a-priori chosen complexity. Our scenario approach applies to many non-convex control-design problems, for instance control synthesis based on uncertain bilinear matrix inequalities.
BibTeX
@inproceedings{grammatico2014scenario,
  author = {Sergio Grammatico and Xiaojing Zhang and Kostas Margellos and Paul Goulart and John Lygeros},
  title = {{A scenario approach to non-convex control design: Preliminary probabilistic guarantees}},
  booktitle = {ACC},
  year = {2014},
  doi = {10.1109/acc.2014.6859142},
}

Loading related content...

Figure