Stability of uniformly bounded switched systems and Observability

This paper mainly deals with switched linear systems defined by a pair of Hurwitz matrices that share a common but not strict quadratic Lyapunov function. Its aim is to give sufficient conditions for such a system to be GUAS.We show that this property of being GUAS is equivalent to the uniform observability on $[0,+\infty)$ of a bilinear system defined on a subspace whose dimension is in most cases much smaller than the dimension of the switched system.Some sufficient conditions of uniform asymptotic stability are then deduced from the equivalence theorem, and illustrated by examples.The results are partially extended to nonlinear analytic systems

Robust output stabilization: improving performance via supervisory control

We analyze robust stability, in an input-output sense, of switched stable systems. The primary goal (and contribution) of this paper is to design switching strategies to guarantee that input-output stable systems remain so under switching. We propose two types of {\em supervisors}: dwell-time and hysteresis based. While our results are stated as tools of analysis they serve a clear purpose in design: to improve performance. In that respect, we illustrate the utility of our findings by concisely addressing a problem of observer design for Lur'e-type systems; in particular, we design a hybrid observer that ensures ``fast'' convergence with ``low'' overshoots. As a second application of our main results we use hybrid control in the context of synchronization of chaotic oscillators with the goal of reducing control effort; an originality of the hybrid control in this context with respect to other contributions in the area is that it exploits the structure and chaotic behavior (boundedness of solutions) of Lorenz oscillators.Comment: Short version submitted to IEEE TA

Singular Switched Systems in Discrete Time: Solvability, Observability, and Reachability Notions

Discrete-time singular (switched) systems, also known as(switched) difference-algebraic equations and discrete-time (switched)descriptor systems, have in general three solvability issues:inconsistent initial values, nonexistence ornonuniqueness of solutions, and noncausalities, which are generallynot desired in applications. To deal with those issues, newsolvability notions are proposed in the study, and the correspondingnecessary and sufficient conditions have been derived with the help of(strictly) index-1 notions. Furthermore, surrogate (switched)systems--ordinary (switched) systems that have equivalentbehavior--have also been established for solvable systems. Byutilizing those surrogate systems, fundamental analysis includingobservability, determinability, reachability, and controllability has also beencharacterized for singular linear (switched) systems. The solvabilitystudy has been extended to singular nonlinear (switched) systems, andmoreover, Lyapunov and incremental stability analyses have beenderived via single and switched Lyapunov function approaches

Symbolic models for nonlinear control systems without stability assumptions

Finite-state models of control systems were proposed by several researchers as a convenient mechanism to synthesize controllers enforcing complex specifications. Most techniques for the construction of such symbolic models have two main drawbacks: either they can only be applied to restrictive classes of systems, or they require the exact computation of reachable sets. In this paper, we propose a new abstraction technique that is applicable to any smooth control system as long as we are only interested in its behavior in a compact set. Moreover, the exact computation of reachable sets is not required. The effectiveness of the proposed results is illustrated by synthesizing a controller to steer a vehicle.Comment: 11 pages, 2 figures, journa