Partial containment control over signed graphs

In this paper, we deal with the containment control problem in presence of antagonistic interactions. In particular, we focus on the cases in which it is not possible to contain the entire network due to a constrained number of control signals. In this scenario, we study the problem of selecting the nodes where control signals have to be injected to maximize the number of contained nodes. Leveraging graph condensations, we find a suboptimal and computationally efficient solution to this problem, which can be implemented by solving an integer linear problem. The effectiveness of the selection strategy is illustrated through representative simulations.Comment: 6 pages, 3 figures, accepted for presentation at the 2019 European Control Conference (ECC19), Naples, Ital

Safe consensus control of cooperative-competitive multi-agent systems via differential privacy

summary:This paper investigates a safe consensus problem for cooperative-competitive multi-agent systems using a differential privacy (DP) approach. Considering that the agents simultaneously interact cooperatively and competitively, we propose a novel DP bipartite consensus algorithm, which guarantees that the DP strategy only works on competitive pairs of agents. We then prove that the proposed algorithm can achieve the mean square bipartite consensus and $(p,r)$-accuracy. Furthermore, a differential privacy analysis is conducted, which shows that the performance of privacy protection is positively correlated with the number of neighbors. Thus, a practical method is established for the agents to select their own privacy levels. Finally, the simulation results are presented to demonstrate the validity of the proposed safe consensus algorithm

Data-based bipartite formation control for multi-agent systems with communication constraints

This article investigates data-driven distributed bipartite formation issues for discrete-time multi-agent systems with communication constraints. We propose a quantized data-driven distributed bipartite formation control approach based on the plant’s quantized and saturated information. Moreover, compared with existing results, we consider both the fixed and switching topologies of multi-agent systems with the cooperative-competitive interactions. We establish a time-varying linear data model for each agent by utilizing the dynamic linearization method. Then, using the incomplete input and output data of each agent and its neighbors, we construct the proposed quantized data-driven distributed bipartite formation control scheme without employing any dynamics information of multi-agent systems. We strictly prove the convergence of the proposed algorithm, where the proposed approach can ensure that the bipartite formation tracking errors converge to the origin, even though the communication topology of multi-agent systems is time-varying switching. Finally, simulation and hardware tests demonstrate the effectiveness of the proposed scheme

Bipartite containment of heterogeneous multi-agent systems under denial-of-service attacks: a historical information-based control scheme

A distributed control scheme based on historical information is designed to solve the problem of stable control of multi-agent systems under denial of service (DoS) attacks in this article. It achieves the control objective of bipartite output containment control, that is, the output states of the followers smoothly enter the target area. The control scheme updates the states of followers through historical information in the control protocol when agents are subjected to DoS attacks. A distributed state observer with a storage module is designed to efficiently estimate the state of followers and store the observed information as history information. The historical information of control protocol calls is not necessarily the real state information in the existence of DoS attacks. Consequently, a closed-loop feedback state compensator is designed. Then, the state compensator is converted from the time domain to the frequency domain for stability analysis using the Nyquist criterion. It is obtained that an upper bound on the amount of historical information can achieve the bipartite output trajectories containment of the controlled system. The output trajectories of the followers converge into two dynamic convex hulls, one of which is surrounded by multiple leaders, and the other is a convex hull with opposite signs of the leaders. Finally, a numerical simulation is used to verify the proposed control scheme, and the operability of the scheme is further demonstrated in a physical experiment

Bipartite Consensus for a Class of Nonlinear Multi-agent Systems Under Switching Topologies:A Disturbance Observer-Based Approach

This paper considers the leader-following bipartite consensus for a class of nonlinear multi-agent systems (MASs) subject to exogenous disturbances under directed fixed and switching topologies, respectively. Firstly, two new output feedback control protocols involving signs of link weights are introduced based on relative output measurements of neighboring agents. In order to estimate the disturbances produced by an exogenous system, a disturbance observer-based approach is developed. Then, sufficient conditions for leader-following bipartite consensus with directed fixed topologies are derived. Furthermore, by assuming that each switching topology contains a directed spanning tree, it is proved that the leader-following bipartite consensus can be realized with the designed output feedback control protocol if the dwell time is larger than a non-negative threshold. Finally, numerical simulations inspired by a real-world DC motors are provided to illustrate the effectiveness of the proposed controllers

Bipartite consensus of nonlinear agents in the presence of communication noise

In this paper, a Distributed Nonlinear Dynamic Inversion (DNDI)-based consensus protocol is designed to achieve the bipartite consensus of nonlinear agents over a signed graph. DNDI inherits the advantage of nonlinear dynamic inversion theory, and the application to the bipartite problem is a new idea. Moreover, communication noise is considered to make the scenario more realistic. The convergence study provides a solid theoretical base, and a realistic simulation study shows the effectiveness of the proposed protocol.Engineering and Physical Sciences Research Council (EPSRC): EP/R009953/

Distributed Model-Free Bipartite Consensus Tracking for Unknown Heterogeneous Multi-Agent Systems with Switching Topology

This paper proposes a distributed model-free adaptive bipartite consensus tracking (DMFABCT) scheme. The proposed scheme is independent of a precise mathematical model, but can achieve both bipartite time-invariant and time-varying trajectory tracking for unknown dynamic discrete-time heterogeneous multi-agent systems (MASs) with switching topology and coopetition networks. The main innovation of this algorithm is to estimate an equivalent dynamic linearization data model by the pseudo partial derivative (PPD) approach, where only the input–output (I/O) data of each agent is required, and the cooperative interactions among agents are investigated. The rigorous proof of the convergent property is given for DMFABCT, which reveals that the trajectories error can be reduced. Finally, three simulations results show that the novel DMFABCT scheme is effective and robust for unknown heterogeneous discrete-time MASs with switching topologies to complete bipartite consensus tracking tasks

Distributed Event-triggered Bipartite Consensus for Multi-agent Systems Against Injection Attacks

This paper studies fully distributed data-driven problems for nonlinear discrete-time multi-agent systems (MASs) with fixed and switching topologies preventing injection attacks. We first develop an enhanced compact form dynamic linearization model by applying the designed distributed bipartite combined measurement error function of the MASs. Then, a fully distributed event-triggered bipartite consensus (DETBC) framework is designed, where the dynamics information of MASs is no longer needed. Meanwhile, the restriction of the topology of the proposed DETBC method is further relieved. To prevent the MASs from injection attacks, neural network-based detection and compensation schemes are developed. Rigorous convergence proof is presented that the bipartite consensus error is ultimately boundedness. Finally, the effectiveness of the designed method is verified through simulations and experiment