peer reviewedThis paper proposes an algorithm for the characterization of reachable sets of states for continuous-time piecewise affine systems. Given a model of the system and a bounded set of possible initial states, the algorithm employs an LMI approach to compute both upper and lower bounds on reachable regions. Rather than performing computations in the state-space, this method uses impact maps to find the reachable sets on the switching surfaces of the system. This tool can then be used to deduce safety and performance results about the system
We address input design for piecewise affine systems so as to satisfy a reachability specification, ...
Given an affine system on a full-dimensional polytope, the problem of reaching a particular facet of...
AbstractReachability analysis is one major approach for safety verification of continuous and hybrid...
This paper proposes an algorithm for the characterization of reachable sets of states for continuous...
This paper presents a new approach to the reachability problem for a class of hybrid systems called ...
International audienceWe consider the decidability of state-to-state reachability in linear time-inv...
Abstract—This paper presents new results that allow one to com-pute the set of states that can be ro...
We present a computationally attractive technique to study the reachability of rectangular regions b...
We consider the decidability of state-to-state reachability in linear time-invariant control systems...
Special Issue: IFAC World Congress 2008International audienceThis work is concerned with the algorit...
This article addresses finite-horizon robust control of a piecewise affine system affected by uncert...
International audienceThis paper presents an approach to overapproximate the reachable set of states...
. In this paper we discuss the problem of calculating the reachable states of a dynamical system def...
In this paper a problem related to reachability analysis of piecewise-affine hybrid systems is consi...
International audienceThis paper considers discrete-time, uncertain Piecewise Affine (PWA) systems a...
We address input design for piecewise affine systems so as to satisfy a reachability specification, ...
Given an affine system on a full-dimensional polytope, the problem of reaching a particular facet of...
AbstractReachability analysis is one major approach for safety verification of continuous and hybrid...
This paper proposes an algorithm for the characterization of reachable sets of states for continuous...
This paper presents a new approach to the reachability problem for a class of hybrid systems called ...
International audienceWe consider the decidability of state-to-state reachability in linear time-inv...
Abstract—This paper presents new results that allow one to com-pute the set of states that can be ro...
We present a computationally attractive technique to study the reachability of rectangular regions b...
We consider the decidability of state-to-state reachability in linear time-invariant control systems...
Special Issue: IFAC World Congress 2008International audienceThis work is concerned with the algorit...
This article addresses finite-horizon robust control of a piecewise affine system affected by uncert...
International audienceThis paper presents an approach to overapproximate the reachable set of states...
. In this paper we discuss the problem of calculating the reachable states of a dynamical system def...
In this paper a problem related to reachability analysis of piecewise-affine hybrid systems is consi...
International audienceThis paper considers discrete-time, uncertain Piecewise Affine (PWA) systems a...
We address input design for piecewise affine systems so as to satisfy a reachability specification, ...
Given an affine system on a full-dimensional polytope, the problem of reaching a particular facet of...
AbstractReachability analysis is one major approach for safety verification of continuous and hybrid...