3 citations · 5 across the 18 of their papers we have counts for
4 papers · 1 filter
Complexity of the LTI system trajectory boundedness problem
Guillaume O. Berger, Raphaël M. Jungers
We study the algorithmic complexity of the problem of deciding whether a Linear Time Invariant dynamical system with rational coefficients has bounded trajectories. Despite its ubi…
Bounds on set exit times of affine systems, using Linear Matrix Inequalities
Guillaume O. Berger, Maben Rabi
Efficient computation of trajectories of switched affine systems becomes possible, if for any such hybrid system, we can manage to efficiently compute the sequence of switching tim…
Data-driven control of switched linear systems with probabilistic stability guarantees
Zheming Wang, Guillaume O. Berger, Raphaël M. Jungers
This paper tackles state feedback control of switched linear systems under arbitrary switching. We propose a data-driven control framework that allows to compute a stabilizing stat…
Chance-constrained quasi-convex optimization with application to data-driven switched systems control
Guillaume O. Berger, Raphaël M. Jungers, Zheming Wang
We study quasi-convex optimization problems, where only a subset of the constraints can be sampled, and yet one would like a probabilistic guarantee on the obtained solution with r…