Subscribe to the gold package and get unlimited access to Shamra Academy
Register a new userA Lyapunov-like Characterization of Predefined-Time Stability
206
0
0.0
(
0
)
Added by
Esteban Jim\\'enez-Rodr\\'iguez Mr
Publication date
2019
and research's language is
English
Authors
Esteban Jimenez-Rodriguez
Ask ChatGPT about the research
No Arabic abstract
This technical note studies Lyapunov-like conditions to ensure a class of dynamical systems to exhibit predefined-time stability. The origin of a dynamical system is predefined-time stable if it is fixed-time stable and an upper bound of the settling-time function can be arbitrarily chosen a priori through a suitable selection of the system parameters. We show that the studied Lyapunov-like conditions allow to demonstrate equivalence between previous Lyapunov theorems for predefined-time stability for autonomous systems. Moreover, the obtained Lyapunov-like theorem is extended for analyzing the property of predefined-time ultimate boundedness with predefined bound, which is useful when analyzing uncertain dynamical systems. Therefore, the proposed results constitute a general framework for analyzing predefined-time stability, and they also unify a broad class of systems which present the predefined-time stability property. On the other hand, the proposed framework is used to design robust controllers for affine control systems, which induce predefined-time stability (predefined-time ultimate boundedness of the solutions) w.r.t. to some desired manifold. A simulation example is presented to show the behavior of a developed controller, especially regarding the settling time estimation.
rate research
Read More
Finite-time stability of networked control systems under Denial of Service (DoS) attacks are investigated in this paper, where the communication between the plant and the controller is compromised at some time intervals. Toward this goal, first an event-triggered mechanism based on the variation rate of the Lyapunov function is proposed such that the closed-loop system remains finite-time stable (FTS) and at the same time, the amount data exchange in the network is reduced. Next, the vulnerability of the proposed event-triggered finite-time controller in the presence of DoS attacks are evaluated and sufficient conditions on the DoS duration and frequency are obtained to assure the finite-time stability of the closed-loop system in the presence of DoS attack where no assumption on the DoS attack in terms of following a certain probabilistic or a well-structured periodic model is considered. Finally, the efficiency of the proposed approach is demonstrated through a simulation study.
Stability and safety are two important aspects in safety-critical control of dynamical systems. It has been a well established fact in control theory that stability properties can be characterized by Lyapunov functions. Reachability properties can also be naturally captured by Lyapunov functions for finite-time stability. Motivated by safety-critical control applications, such as in autonomous systems and robotics, there has been a recent surge of interests in characterizing safety properties using barrier functions. Lyapunov and barrier functions conditions, however, are sometimes viewed as competing objectives. In this paper, we provide a unified theoretical treatment of Lyapunov and barrier functions in terms of converse theorems for stability properties with safety guarantees and reach-avoid-stay type specifications. We show that if a system (modeled as a perturbed dynamical system) possesses a stability with safety property, then there exists a smooth Lyapunov function to certify such a property. This Lyapunov function is shown to be defined on the entire set of initial conditions from which solutions satisfy this property. A similar but slightly weaker statement is made for reach-avoid-stay specifications. We show by a simple example that the latter statement cannot be strengthened without additional assumptions.
In this paper, a data-driven approach to characterize influence in a power network is presented. The characterization is based on the notion of information transfer in a dynamical system. In particular, we use the information transfer based definition of influence in a dynamical system and provide a data-driven approach to identify the influential state(s) and generators in a power network. Moreover, we show how the data-based information transfer measure can be used to characterize the type of instability of a power network and also identify the states causing the instability.
We introduce and discuss a new approach to the phase retrieval of fields radiated by continuous aperture sources having a circular support, which is of interest in many applications including the detection of shape deformations on reflector antennas. The approach is based on a decomposition of the actual 2-D problem into a number of 1-D phase retrieval problems along diameters and concentric rings of the visible part of the spectrum. In particular, the 1-D problems are effectively solved by using the spectral factorization method, while discrimination arguments at the crossing points allows to complete the retrieval of the 2-D complex field. The proposed procedure, which just requires a single set of far field amplitudes, takes advantage from up to now unexplored field properties and it is assessed in terms of reflector aperture fields.
In this paper we propose a novel method to establish stability and, in addition, convergence to a consensus state for a class of discrete-time Multi-Agent System (MAS) evolving according to nonlinear heterogeneous local interaction rules which is not based on Lyapunov function arguments. In particular, we focus on a class of discrete-time MASs whose global dynamics can be represented by sub-homogeneous and order-preserving nonlinear maps. This paper directly generalizes results for sub-homogeneous and order-preserving linear maps which are shown to be the counterpart to stochastic matrices thanks to nonlinear Perron-Frobenius theory. We provide sufficient conditions on the structure of local interaction rules among agents to establish convergence to a fixed point and study the consensus problem in this generalized framework as a particular case. Examples to show the effectiveness of the method are provided to corroborate the theoretical analysis.
Log in to be able to interact and post comments
comments
Fetching comments
Sign in to be able to follow your search criteria
