#### Filter Results:

- Full text PDF available (4)

#### Publication Year

2015

2017

- This year (2)
- Last 5 years (8)
- Last 10 years (8)

#### Publication Type

#### Co-author

#### Journals and Conferences

#### Key Phrases

Learn More

- Matthew Philippe, Ray Essick, Geir E. Dullerud, Raphaël M. Jungers
- Automatica
- 2016

We introduce a novel framework for the stability analysis of discrete-time linear switching systems with switching sequences constrained by an automaton. The key element of the framework is the algebraic concept ofmultinorm,which associates a different norm per node of the automaton, and allows to exactly characterize stability. Building upon this tool, we… (More)

- Matthew Philippe, Raphaël M. Jungers
- HSCC
- 2015

We study the boundedness of products of matrices associated with words in a regular language. This question naturally arises in the stability analysis of switching systems with constrained switching sequences.
Our main contribution is a sufficient condition for the boundedness of all the possible products of matrices that may occur in a marginally unstable… (More)

- Matthew Philippe, Gilles Millerioux, Raphaël M. Jungers
- ArXiv
- 2015

We study computational questions related with the stability of discrete-time linear switching systems with switching sequences constrained by an automaton. We first present a decidable sufficient condition for their boundedness when the maximal exponential growth rate equals one. The condition generalizes the notion of the irreducibility of a matrix set,… (More)

- Matthew Philippe, Raphaël M. Jungers
- ECC
- 2015

A Path-Complete Lyapunov Function is an algebraic criterion composed of a finite number of functions, called pieces, and a directed, labeled graph defining Lyapunov inequalities between these pieces. It provides a stability certificate for discrete-time arbitrary switching systems. In this paper, we prove that the satisfiability of such a criterion implies… (More)

We study the Lp induced gain of discretetime linear switching systems with graph-constrained switching sequences. We first prove that, for stable systems in a minimal realization, for every p ≥ 1, the Lp-gain is exactly characterized through switching storage functions. These functions are shown to be the pth power of a norm. In order to consider general… (More)

Our research tackles fundamental control problems on complex systems, known as cyber-physical systems, with a particular focus on the rich class known as switching systems. We show that using state-of the art optimization techniques, such as sum-of-squares programming, and taking into account the logical structure of the system, we may obtain powerful… (More)

- ‹
- 1
- ›