6,515 research outputs found

    Resilient Cluster Consensus of Multiagent Systems

    Get PDF
    We investigate the problems of resilient cluster consensus in directed networks under three types of multiagent dynamics, namely, continuous-time multiagent systems, discrete-time multiagent systems, and switched multiagent systems composed of both continuous-time and discrete-time components. Resilient cluster censoring strategies are proposed to ensure cluster consensus against locally bounded Byzantine nodes in a purely distributed manner, where neither the number/identity of Byzantine nodes nor the division of clusters is assumed. We do not require complicated algebraic conditions or any balance conditions over intercluster structures, distinguishing the current work from previous results on cluster consensus problems besides a fortiori the attack-tolerant feature. Sufficient conditions are established in all the three scenarios based on the graph robustness. Furthermore, we solve the heterogenous cluster robustness problems and resilient scaled cluster consensus problems as extensions. The theoretical results are illustrated through numerical examples including the Santa Fe collaboration network

    Finite-Time Resilient Formation Control with Bounded Inputs

    Full text link
    In this paper we consider the problem of a multi-agent system achieving a formation in the presence of misbehaving or adversarial agents. We introduce a novel continuous time resilient controller to guarantee that normally behaving agents can converge to a formation with respect to a set of leaders. The controller employs a norm-based filtering mechanism, and unlike most prior algorithms, also incorporates input bounds. In addition, the controller is shown to guarantee convergence in finite time. A sufficient condition for the controller to guarantee convergence is shown to be a graph theoretical structure which we denote as Resilient Directed Acyclic Graph (RDAG). Further, we employ our filtering mechanism on a discrete time system which is shown to have exponential convergence. Our results are demonstrated through simulations

    A resilient continuous-time consensus method using a switching topology

    Get PDF
    DynamiCITY ( NORTE-01-0145-FEDER-000073 ), funded by NORTE2020/PORTUGAL2020 , through the European Regional Development Fund . Publisher Copyright: © 2022 The Author(s)This paper addresses the design problem of a resilient consensus algorithm for agents with continuous-time dynamics. The main proposal is that by incorporating a switching mechanism selecting the network topology to avoid malicious nodes from communicating, the remaining nodes will converge to a value closer to the original steady-state without the attacker being present. The switching occurs at discrete-time steps where each node evaluates the reputation score of the neighbors and deactivates/ignores edges in the network. We explore the proposed method with illustrative examples ranging from static topologies to dynamic ones, considering directed and undirected graphs, presenting several attacking scenarios that are successfully mitigated with our method. Finally, we compare the best undetectable attacking strategy and the commonly used approach named MSR, highlighting the advantages of our method.publishersversionpublishe

    On the Control of Microgrids Against Cyber-Attacks: A Review of Methods and Applications

    Get PDF
    Nowadays, the use of renewable generations, energy storage systems (ESSs) and microgrids (MGs) has been developed due to better controllability of distributed energy resources (DERs) as well as their cost-effective and emission-aware operation. The development of MGs as well as the use of hierarchical control has led to data transmission in the communication platform. As a result, the expansion of communication infrastructure has made MGs as cyber-physical systems (CPSs) vulnerable to cyber-attacks (CAs). Accordingly, prevention, detection and isolation of CAs during proper control of MGs is essential. In this paper, a comprehensive review on the control strategies of microgrids against CAs and its defense mechanisms has been done. The general structure of the paper is as follows: firstly, MGs operational conditions, i.e., the secure or insecure mode of the physical and cyber layers are investigated and the appropriate control to return to a safer mode are presented. Then, the common MGs communication system is described which is generally used for multi-agent systems (MASs). Also, classification of CAs in MGs has been reviewed. Afterwards, a comprehensive survey of available researches in the field of prevention, detection and isolation of CA and MG control against CA are summarized. Finally, future trends in this context are clarified

    A Survey of Resilient Coordination for Cyber-Physical Systems Against Malicious Attacks

    Full text link
    Cyber-physical systems (CPSs) facilitate the integration of physical entities and cyber infrastructures through the utilization of pervasive computational resources and communication units, leading to improved efficiency, automation, and practical viability in both academia and industry. Due to its openness and distributed characteristics, a critical issue prevalent in CPSs is to guarantee resilience in presence of malicious attacks. This paper conducts a comprehensive survey of recent advances on resilient coordination for CPSs. Different from existing survey papers, we focus on the node injection attack and propose a novel taxonomy according to the multi-layered framework of CPS. Furthermore, miscellaneous resilient coordination problems are discussed in this survey. Specifically, some preliminaries and the fundamental problem settings are given at the beginning. Subsequently, based on a multi-layered framework of CPSs, promising results of resilient consensus are classified and reviewed from three perspectives: physical structure, communication mechanism, and network topology. Next, two typical application scenarios, i.e., multi-robot systems and smart grids are exemplified to extend resilient consensus to other coordination tasks. Particularly, we examine resilient containment and resilient distributed optimization problems, both of which demonstrate the applicability of resilient coordination approaches. Finally, potential avenues are highlighted for future research.Comment: 35 pages, 7 figures, 5 table
    corecore