No full-text available
To read the full-text of this research,
you can request a copy directly from the authors.
Observer-Based Fixed-Time Leader-Following Consensus Control for MASs Subject to DoS attack
ResearchGate has not been able to resolve any citations for this publication.
Agents are intelligent entities that act flexibly and autonomously to make wise decisions based on their intelligence and experience. A multi-agent system (MAS) contains multiple intelligent interconnected collaborating agents for solving a problem beyond a single-agent ability. A smart grid combines advanced intelligence systems, control techniques, and sensing methods into an existing utility power network. For controlling
smart grids, various control systems with different architectures have already been developed. MASs based control of power system operations has been shown to overcome the limitations of time required for analysis, relaying and protection, transmission switching, communication protocols, and management of plant
control. These systems provide an alternative for the fast and accurate power networks control. This paper comprehensively overviews MASs used for the control of smart grids. This is intended to provide a wide spectrum on the status of smart grids, MAS-based control techniques and their implementation for the control of smart grids. Use of MASs to control various aspects of smart grids including management of energy, marketing energy, pricing, scheduling energy, reliability, the security of network, fault handling capability, communication between agents, SG-electrical vehicles, SG-building energy systems, and soft grids have been critically reviewed. More than a hundred publications
on the topic of MAS-based control of smart grids are critically examined, classified, and arranged for fast reference.
This paper studies the higher order finite-time consensus protocol for heterogeneous multi-agent systems (HMASs). By adding a power integrator method and using heterogeneous domination method, two kinds of consensus protocols are proposed with state feedback and output feedback, respectively. First, for the leaderless and leader-follower HMASs, the continuous finite-time consensus protocols are proposed. Then, by designing a finite-time observer, the output-feedback finite-time consensus protocol is developed. Finally, simulations are performed to illustrate the effectiveness of the theoretical results.
Dear Editor, This letter deals with fixed-time synchronization (Fd-TS) of complex networks (CNs) under aperiodically intermittent control (AIC) for the first time. The average control rate and a new Lyapunov function are proposed to overcome the difficulty of dealing with fixed-time stability/synchronization of CNs for AIC. Based on the Lyapunov and graph-theoretical methods, a Fd-TS criterion of CNs is given. Moreover, the method of this letter is also applicable to the study of finite-time synchronization of CNs for AIC. Finally, the theoretical results are applied to study the Fd-TS of oscillator systems, and simulation results are given to verify the effectiveness of the results.
This paper addresses the fixed-time synchronization (FXTS) problem of multilayer complex networks (MCNs) under denial-of-service (DoS) attacks. Generally, when a control strategy is introduced, it will be affected by DoS attacks. Considering the DoS attacks that occur in the control channel, the model of MCNs under DoS attacks is constructed. Using the average non-attack rate of intermittent attacks and the Lyapunov method, the fixed-time convergence theorem is given to achieve the FXTS of the MCNs. The results indicate that the settling time has a connection with the controller parameters and the attack parameters. Moreover, we find that the higher the average non-attack rate of the intermittent attacks, the shorter the settling time of FXTS. Besides, the energy consumption of the control strategy is estimated. Finally, the feasibility of the theoretical results is verified by Chua’s circuit in numerical simulations.
This paper investigates bipartite consensus of multi-agent systems under unknown false data injection attacks. Attacks are launched in the channels from the controller to the actuator. To compensate the impact of attacks, an extended observer including the absolute output information is firstly constructed, and then an observer-based event-triggered controller is designed to save resources. Moreover, an observer-based fully asynchronous event-triggered controller is proposed to further reduce the communication cost. Sufficient criteria are deduced to guarantee bipartite consensus and Zeno behavior is further ruled out. Finally, numerical examples are given to illustrate the effectiveness of the derived results.
This article proposes a resilient distributed Nash equilibrium (NE) seeking algorithm for noncooperative games with multiple double-integrator agents who suffer from false data injection (FDI) attacks. A malicious attacker injects false data into agents’ actuators and sensors so that agents’ strategies deviate from the NE of the game with the compromised control inputs and interactive information. First, the robustness of the seeking algorithm against the FDI attacks is analyzed. Then, to mitigate the effect of the attacks on agents’ strategies, the false data injected in the actuators and sensors are regarded as extended states which can be observed by extended state observers (ESOs). Thus, a resilient NE seeking algorithm is proposed based on ESOs. The resilient algorithm can drive the system to converge to the NE without requiring any information about the nature of the attacks. An explicit criterion is given to ensure the effectiveness of the designed algorithms. An example is given to illustrate the results.
Multiple extended target tracking (METT) is a common and challenging problem. Various solutions for METT have been proposed, however, most of them focus on the single-sensor or centralized multi-sensor scenarios. In this letter, we explore the multi-sensor METT problem in a distributed fusion framework. Specifically, there are two stages in the implementation process: 1) to perform a
Gamma Gaussian Inverse Wishart Cardinalized Probability Hypothesis Density
(GGIW-CPHD) filter for each sensor node, and 2) to perform a fusion by resorting to the so-called
Generalized Covariance Intersection
(GCI) fusion rule. In the fusion stage, we derive an approximate GGIW mixture form of the fused spatial density. Lastly, simulation experiments via a consensus sensor network are provided to verify the effectiveness of the proposed approach.
In this article, we investigate the distributed resilient control problem for a class of cyber-physical systems with communication delays under denial-of-service (DoS) attacks. In contrast to the previous DoS attacks results based on multiagent systems (MASs), a new distributed resilient control approach is proposed for more general heterogeneous linear MASs with nonuniform communication delays. Two types of sampled-based observers are, respectively, proposed. Namely, adaptive distributed observers are designed by introducing a buffer mechanism to eliminate the heterogeneous behavior caused by communication delays while adaptive distributed resilient observers are designed by introducing resilient mechanisms to resist the DoS attacks. Furthermore, a time-varying sampling period sequence is provided to prevent the attacker from identifying the sampling period of the system. Based on the developed resilient observers, a controller is developed. It is proved that the considered problem can be solved by the developed method. Finally, a numerical example is given to illustrate the effectiveness of the obtained result.
By using the terminal sliding-mode control (TSMC) and the pinning control methods, the fully distributed finite-time consensus problems are investigated for second-order multiagent systems (MASs) and multiquadcopter systems (MQSs) with directed topology. For the second-order MASs, a pinning control scheme is designed by analyzing the outdegree and indegree of nodes, and a TSMC protocol with the local information is proposed to achieve the finite-time consensus. Then, as an application of the MASs, the model of MQSs is constructed and its finite-time attitude consensus is discussed. Finally, the effectiveness of the proposed method is validated by two numerical examples.
In this paper, we respectively discuss the finite-time consensus (FTC) and finite-time
$H_{\infty}$
consensus (FTHC) problems for a kind of nonlinear multi-agent systems under directed topology. Firstly, with the help of some inequality techniques and the designed state feedback controller, a FTC criterion is presented for multi-agent system. In addition, two adaptive control strategies for ensuring the FTC of multi-agent system are also developed. Moreover, we further discuss the FTHC for multi-agent system with external disturbances, and some FTHC criteria are given by exploiting the designed state feedback controller and adaptive state feedback controllers. Finally, the effectiveness of these obtained results are verified by two numerical examples.
This paper develops a fully distributed framework to investigate the cooperative behavior of multiagent systems in the presence of distributed denial-of-service (DoS) attacks launched by multiple adversaries. In such an insecure network environment, two kinds of communication schemes, that is, sample-data and event-triggered communication schemes, are discussed. Then, a fully distributed control protocol with strong robustness and high scalability is well designed. This protocol guarantees asymptotic consensus against distributed DoS attacks. In this paper, "fully" emphasizes that the eigenvalue information of the Laplacian matrix is not required in the design of both the control protocol and event conditions. For the event-triggered case, two effective dynamical event-triggered schemes are proposed, which are independent of any global information. Such event-triggered schemes do not exhibit Zeno behavior even in the insecure environment. Finally, a simulation example is provided to verify the effectiveness of theoretical analysis.
This paper focuses on hierarchical fusion estimation for a multi-sensor networked system subject to transmission delays and packet dropouts. In the hierarchical fusion estimation, an asynchronous sampling scheme is utilized to reduce networked transmission burdens and communication energy. A hierarchical fusion estimation method is proposed to improve estimation performance with transmission delays and packet dropouts. A numerical example is shown to illustrate effectiveness of the developed techniques.
This paper deals with the consensus tracking problem for a multi-agent system with nonholonomic chained-form dynamics. A new distributed observer is first proposed for each follower to estimate the leader state and the leader input in a prescribed finite-time under both undirected and directed communication graphs. Then based on the observer and by adding a power integrator, a novel nonlinear protocol is designed such that the estimated leader state is tracked in a prescribed finite-time. Different from some existing finite-time consensus tracking approaches, an explicit bound without dependence on initial states is derived for the settling time. Therefore, in an unknown environment where initial conditions are unavailable, the proposed strategy is able to meet specific system requirements, e.g., a military target is tracked by a group of field robots in a prescribed time. Finally, numerical examples are given to demonstrate the effectiveness of the proposed protocol.
This paper investigates the event-based leader-following consensus problem for high-order nonlinear multiagent systems whose dynamics are in strict feedback forms and satisfy Lipschitz condition. By using self-triggered control scheme and dynamic output feedback control method in combination, a new class of distributed self-triggered consensus protocols is proposed based only on the relative output measurements of neighboring agents. It is noted that the proposed protocols only require the output information of neighboring agents to be shared and the designed self-triggered algorithm can avoid continuous communication among neighboring agents, thus the communication cost is reduced significantly. Sufficient conditions in terms of matrix inequalities are derived to guarantee the exponential leader-following consensus. The effectiveness of the theoretical results is illustrated through a simulation example.
In this paper, we discuss the finite-time consensus problem for leaderless and leader–follower multi-agent systems with external disturbances. Based on the finite-time control technique, continuous distributed control algorithms are designed for these agents described by double integrators. Firstly, for the leaderless multi-agent systems, it is shown that the states of all agents can reach a consensus in finite time in the absence of disturbances. In the presence of disturbances, the steady-state errors of any two agents can reach a region in finite time. Secondly, for the leader–follower multi-agent systems, finite-time consensus algorithms are also designed based on distributed finite-time observers. Rigorous proof is given by using Lyapunov theory and graph theory. Finally, one example is employed to verify the efficiency of the proposed method.
This paper investigates the finite-time distributed consensus problem for multi-agent systems using a binary consensus protocol and the pinning control scheme. Compared with other consensus algorithms which need the complete state or output information of neighbors, the proposed algorithm only requires sign information of the relative state measurements, that is, the differences between a node’s state and that of its neighbors. This corresponds to only requiring a single-bit quantization error relative to each neighbor. This signum protocol is realistic in terms of observed behavior in animal groups, where relative motion is determined not by full time-signal measurements, but by coarse estimates of relative heading differences between neighbors. The signum protocol does not require explicit measurement of time signals from neighbors, and hence has the potential to significantly reduce the requirements for both computation and sensing. Analysis of discontinuous dynamical systems is used, including the Filippov solutions and set-valued Lie derivative. Based on the second-order information on the evolution of Lyapunov functions, the conditions that guarantee the finite-time consensus for the systems are identified. Numerical examples are given to illustrate the theoretical results.
Resilient Nash equilibrium seeking in multi agent games under false data injection attacks
- X Cai
- F Xiao
- B Wei