The disturbance attenuation problem for a class of discretetime switched linear systems with exponential uncertainties via switched state feedback and switched dynamic output feedback is investigated, respectively. By using Taylor series approximation and convex polytope technique, exponentially uncertain discrete-time switched linear system is transformed into an equivalent switched polytopic ...

In this paper, new separated delay-dependent H2 performance criterion is derived for a class of discrete timedelay systems. When used in robust synthesis for real polytopic uncertainty, it can rule out the technical restriction of using a single Lyapunov function to some extent, and therefore, lead to potentially less conservative linear matrix inequality (LMI) characterizations. The results ar...

This paper studies robust local synchronization in multi-agent systems with time-varying parametric uncertainties constrained in a polytope. In contrast to existing methods with non-convex conditions via using quadratic Lyapunov function (QLF), a new criteria is proposed based on using homogeneous polynomial Lyapunov functions (HPLFs) where the original system is suitably approximated by an unc...

This paper presents applications of polytopic approximation methods for reachable set computation using dynamic optimization. The problem of computing exact reachable sets can be formulated in terms of a Hamilton-Jacobi partial differential equation (PDE). Numerical solutions which provide convergent approximations of this PDE have computational complexity which is exponential in the continuous...

This paper presents applications of polytopic approximation methods for reachable set computation using dynamic optimization. The problem of computing exact reachable sets can be formulated in terms of a Hamilton-Jacobi partial differential equation (PDE). Numerical solutions which provide convergent approximations of this PDE have computational complexity which is exponential in the continuous...

We consider face-to-face partitions of bounded polytopes into convex polytopes in d for arbitrary d 1 and examine their colourability. In particular, we prove that the chromatic number of any simplicial partition does not exceed d+1. Partitions of polyhedra in 3 into pentahedra and hexahedra are 5and 6-colourable, respectively. We show that the above numbers are attainable, i.e., in general, th...

In this brief, we present a data-driven framework for real-time estimation of reachable sets control systems where the plant is modeled using neural networks (NNs). We utilize running example quadrotor model that learned trajectory data via NNs. The NN offline can be excited online to obtain linear approximations reachability analysis. use dynamic mode decomposition (DMD)-based approach lifting...

This paper addresses the robust stability for a class of linear discrete-time stochastic systems with convex polytopic uncertainties. The system to be considered is subject to both interval time-varying delays and convex polytopic type uncertainties. Based on the augmented parameter-dependent Lyapunov-Krasovskii functional, new delay-dependent conditions for the robust stability are established...

Abstract: This paper presents a sliding mode output feedback control design methodology based on LMI’s under a polytopic perspective for a class of uncertain dynamical systems. Both matched and mismatched uncertainties are considered. The existence and reachability problems are formulated through a polytopic description and solved using LMI’s. The proposed controller is static in nature. The re...

This paper presents a novel design of Linear Parameter Varying (LPV) controller based-on the polytopic approach, for path-following system an automated vehicle. The implementation proposed steering is reduction initial 3D (3 Dimensional) polytope that, due to conservatism specific approach suffers from over-bounding. algorithm aims at tightening by reducing vertices and volume that includes par...