6 papers
Value iteration with stopping criterion: finite iterations, stability, and near-optimality guarantees
Mathieu Granzotto, Romain Postoyan, Dragan NeÅ¡iÄ +2
Value iteration (VI) is a cornerstone of dynamic programming that allows computing near-optimal feedback laws for general plant dynamics and cost functions. In practice, however, i…
Stability criteria for singularly perturbed impulsive linear switched systems
Ihab Haidar, Yacine Chitour, Jamal Daafouz +2
We study a class of singularly perturbed impulsive linear switched systems exhibiting switching between slow and fast dynamics. To analyze their behavior, we construct auxiliary sw…
A Berger-Wang formula for impulsive switched systems
Yacine Chitour, Jamal Daafouz, Ihab Haidar +2
This paper addresses a class of impulsive systems defined by a mix of continuous-time and discrete-time switched linear dynamics. We first analyze a related class of weighted discr…
Discounted LQR: stabilizing (near-)optimal state-feedback laws
Jonathan de Brusse, Jamal Daafouz, Mathieu Granzotto +2
We study deterministic, discrete linear time-invariant systems with infinite-horizon discounted quadratic cost. It is well-known that standard stabilizability and detectability pro…
An optimistic planning algorithm for switched discrete-time LQR
Mathieu Granzotto, Romain Postoyan, Dragan NeÅ¡iÄ +2
We introduce TROOP, a tree-based Riccati optimistic online planner, that is designed to generate near-optimal control laws for discrete-time switched linear systems with switched q…
Discrete-Time Conewise Linear Systems with Finitely Many Switches
Jamal Daafouz, Jérôme Lohéac, Constantin MorÄrescu +1
We investigate discrete-time conewise linear systems (CLS) for which all the solutions exhibit a finite number of switches. By switches, we mean transitions of a solution from one…