This paper is concerned with the problem of delay-dependent H <sub xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">infin</sub> control for linear discrete-time systems with time-varying delay. A new finite sum inequality is first established to derive a delay-dependent condition, under which the resulting closed-loop system is asymptotically stable (internally stable) with a prescribed H <sub xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">infin</sub> attenuation level via a memoryless state feedback. Then, an iterative algorithm involving convex optimization is proposed to obtain a suboptimal H <sub xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">infin</sub> controller. Finally, a numerical example is given to show the effectiveness of the proposed method
This article proposes a novel trust-based entropy filter in distributed form for state-saturated nonlinear systems with hybrid cyber-attacks, including denial-o
This chapter proposes a mixed self and event-triggered sampling scheme (MSE) for the execution of sampling in wireless networked control systems (WiNCSs) by striking a balance between self-triggered sampling (SET) and periodic event-triggered sampling (PET) to...
The synchronization control problem is investigated for a class of discrete-time dynamical networks with packet dropouts via a coding-decoding-based approach. The data is transmitted through digital communication channels and only the sequence of finite coded signals is sent to the controller. A series of mutually independent Bernoulli distributed random variables is utilized to model the packet dropout phenomenon occurring in the transmissions of coded signals. The purpose of the addressed synchronization control problem is to design a suitable coding-decoding procedure for each node, based on which an efficient decoder-based control protocol is developed to guarantee that the closed-loop network achieves the desired synchronization performance. By applying a modified uniform quantization approach and the Kronecker product technique, criteria for ensuring the detectability of the dynamical network are established by means of the size of the coding alphabet, the coding period and the probability information of packet dropouts. Subsequently, by resorting to the input-to-state stability theory, the desired controller parameter is obtained in terms of the solutions to a certain set of inequality constraints which can be solved effectively via available software packages. Finally, two simulation examples are provided to demonstrate the effectiveness of the obtained results.
This paper is concerned with the reliable filtering for discrete-time nonlinear systems with abnormal measurements and probabilistic distributed time-delays. Two binary stochastic sequences are employed to model stochastic occurring nonlinearities and probabilistic distributed time-delays, respectively. The considered abnormal measurements could be outliers or injected data resulting from cyber-attackers. A factitious saturation constraint on innovation is adopted to remove these abnormal measurements in the designed filter. By resorting to the stochastic analysis combined with Lyapunov stability theory, a sufficient condition is proposed to check whether or not the augmented system is bounded in mean square. Furthermore, the desired filter gain depends on the solution of a linear matrix inequality. Finally, an illustrative example is adopted to verify the effectiveness of the developed design scheme.
This chapter addresses the problem of distributed resilient finite-time control of multiple heterogeneous battery energy storage systems (BESSs) in a microgrid subject to denial of service (DoS) attacks. Notice that, DoSDenial of service (DoS) attacks may block...
This paper addresses network-based consensus problem of nonlinear multi-agent systems under Markovian switching topologies. Considering the effect of network-induced delay and Markovian switching topologies, a new network-based switching consensus control protocol is proposed, with which each agent can be remotely operated through a communication network. Under this protocol, the consensus problem is equivalently converted to the stability of a class of Markovian jump systems with a time-varying delay. Then, by employing Lyapunov-Krosovskii functional method and the weak infinitesimal operation, a new delay-dependent stability condition is derived to ensure that the consensus can be globally exponentially achieved in mean-square sense. Based on this condition, the switching consensus controller gains are obtained by solving a set of linear matrix inequalities. Finally, a numerical example is given to illustrate the effectiveness of the design method.
This technical note is concerned with stability of linear discrete-time systems with interval-like time-varying delays. Two new stability criteria are derived by constructing a new Lyapunov functional and utilizing two novel techniques for estimating the forward difference of the Lyapunov functional. The relationship between these stability criteria and some existing ones is established. Through the relationship, it is clear that these stability criteria are less conservative than some existing ones, which is confirmed by a numerical example.
Band selection, considered as an effective dimensionality reduction technique for hyperspectral imagery (HSI), has become a hot topic for decades. Although various clustering-based methods have been applied to band selection, only a few studies explored the hierarchical structure among different spectral bands. And with regard to conventional hierarchical clustering, implemented in an agglomerative manner, both efficiency and accuracy of band selection still remain to rise. Moreover, the noise sensitivity is a defect inherent in the procedure of clustering. To address these issues, we propose a divisive hierarchical clustering approach (DHCA) to hyperspectral band selection. Inspired by divisive analysis, DHCA is designed to obtain any number of band subsets, which captures the intrinsic hierarchy of hyperspectral bands simultaneously. By introducing the local density into average dissimilarity, it can suppress the outliers clustering separately. Also, given the order of the spectrum, channel interval makes the similarity more rational among bands. Finally, we select a representative band in each cluster from the information viewpoint to ensure the band subset with a high quality. Extensive experiments on three real public HSI datasets fully validate the superiority of the proposed method against state-of-the-art competitors.
We provide an introduction to the old-standing problem of isometric immersions. We combine a historical account of its multifaceted advances, which have fascinated geometers and analysts alike, with some of the applications in the mathematical physics and mathematical materials science, old and new.
This paper deals with the problem of odor source localization using multiple mobile robots. A distributed coordination control scheme is proposed by introducing a trajectory level into the original distributed architecture. In the trajectory level, a spiral model is designed and used to deal with a new robot position produced by cooperative search algorithms in order to generate a spiral trajectory that can describe position transition from the current position of the robot to the new position. The effectiveness of the distributed coordination control scheme is illustrated in the problem of odor source localization.
This paper proposes an event-based networked set-membership filtering method to detect islanding fault for distributed grid-connected solar photovoltaic generation systems. The method enables each set-membership filter to offer an ellipsoidal estimation set, which is used to judge whether or not the islanding fault happens. When islanding fault happens, the intersection of the ellipsoids is empty, and when islanding fault is free, the intersection of the ellipsoids is nonempty. In the filtering scheme, a novel event-triggered mechanism is proposed to reduce the transmission frequency for saving the communication resources. The condition of the existence of the set-membership algorithm is derived by a time-varying convex optimization approach. A simulation experiment and a comparative experiment are provided using Sim-Power-Systems implementation based on a 2-kW single-phase grid-connected power generation system to illustrate the effectiveness of the proposed method for the detection of the islanding fault and the reduction of the resource consumption, respectively.
Energy Internet is recognized as a new and advanced paradigm of smart grids, where energy collection devices, distributed energy storage devices, and various types of energy nodes are interconnected by applying advanced power electronics technology, information technology, and intelligent management technology. This emerging Energy Internet brings remarkable improvement for the society from various aspects with its advantages in high efficiency, strong flexibility, great scalability, and improved reliability. However, it in turn generates new challenges in architecture design, control operation, and energy management. As a result, how to deal with these challenges in Energy Internet still needs further investigation by applying advanced techniques, such as multiagent systems, artificial intelligence-based control, big data cloud computing and management, and so on.
This paper considers the robust stability problem of time-delay systems with block-diagonal uncertainty. A new 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 show the new criterion significantly improve the estimate of the stability limit over some existing results in the literature.