Stability Problem Of Time-delay Systems Research Articles

Network-based practical set consensus of multi-agent systems subject to input saturation

This paper is concerned with the network-based practical set consensus problem of multi-agent systems subject to input saturation constraints. Considering network-induced delays, data quantization and aperiodic sampling intervals, a network-based framework which allows each agent to be remotely controlled over the communication network is established. Under this framework, a new network-based consensus protocol with input saturation constraints is proposed. With this protocol, the consensus problem can be transformed into the stabilization problem of time-delay systems with bounded perturbations. By using the Lyapunov–Krasovskii approach, a stability condition guaranteeing that the error system can exponentially converge to a bounded set is derived, where the region of initial conditions can be estimated by considering the effect of the first delay interval. Based on this stability condition, the network-based consensus controller gain matrix can be obtained. An optimization algorithm is introduced for simultaneously designing the consensus controller gain and estimating the region of attraction as small as possible and the region of initial conditions as large as possible. A numerical example is given to illustrate the efficiency of all the results derived in this paper.

Stability criteria for linear time-delay systems with multiple passive uncertainties

This paper investigates the robust stability problem of time-delay systems with multiple passive uncertainties. A stability criterion is derived using the refined discretized Lyapunov functional method. The criterion is written in the form of a linear matrix inequality. Numerical examples are presented to illustrate the effectiveness of the method.

A further refinement of discretized Lyapunov functional method for the stability of time-delay systems

The discretized Lyapunov functional method for the stability problem of time-delay systems is further refined using a combination of integral inequality and variable elimination technique. As a result, the computational requirement is further reduced for the same discretization mesh. For systems without uncertainty, the convergence to the analytical solution is greatly accelerated. For uncertain systems, the new method is much less conservative. Numerical examples are presented to illustrate the effectiveness of the method.