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

Learning-based Robust Bipartite Consensus Control for a Class of Multiagent Systems

This paper studies the robust bipartite consensus problems for heterogeneous nonlinear nonaffine discrete-time multi-agent systems (MASs) with fixed and switching topologies against data dropout and unknown disturbances. At first, the controlled system's virtual linear data model is developed by employing the pseudo partial derivative technique, and a distributed combined measurement error function is established utilizing a signed graph theory. Then, an input gain compensation scheme is formulated to mitigate the effects of data dropout in both feedback and forward channels. Moreover, a data-driven learning-based robust bipartite consensus control (LRBCC) scheme based on a radial basis function neural network observer is proposed to estimate the unknown disturbance, using the online input/output data without requiring any information on the mathematical dynamics. The stability analysis of the proposed LRBCC approach is given. Simulation and hardware testing also illustrate the correctness and effectiveness of the designed method

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

Opinion Dynamics in Social Networks with Hostile Camps: Consensus vs. Polarization

Most of the distributed protocols for multi-agent consensus assume that the agents are mutually cooperative and "trustful," and so the couplings among the agents bring the values of their states closer. Opinion dynamics in social groups, however, require beyond these conventional models due to ubiquitous competition and distrust between some pairs of agents, which are usually characterized by repulsive couplings and may lead to clustering of the opinions. A simple yet insightful model of opinion dynamics with both attractive and repulsive couplings was proposed recently by C. Altafini, who examined first-order consensus algorithms over static signed graphs. This protocol establishes modulus consensus, where the opinions become the same in modulus but may differ in signs. In this paper, we extend the modulus consensus model to the case where the network topology is an arbitrary time-varying signed graph and prove reaching modulus consensus under mild sufficient conditions of uniform connectivity of the graph. For cut-balanced graphs, not only sufficient, but also necessary conditions for modulus consensus are given.Comment: scheduled for publication in IEEE Transactions on Automatic Control, 2016, vol. 61, no. 7 (accepted in August 2015

Opinion Behavior Analysis in Social Networks Under the Influence of Coopetitive Media

Both interpersonal communication and media contact are important information sources and play a significant role in shaping public opinions of large populations. In this paper, we investigate how the opinion-forming process evolves over social networks under the media influence. In addition to being affected by the opinions of their connected peers, the media cooperate and/or compete mutually with each other. Networks with mixed cooperative and competitive interactions are said to be coopetitive . In this endeavor, a novel mathematical model of opinion dynamics is introduced, which captures the information diffusion process under consideration, makes use of the community-based network structure, and takes into account personalized biases among individuals in social networks. By employing port-Hamiltonian system theory to analyze the modeled opinion dynamics, we predict how public opinions evolve in the long run through social entities and find applications in political strategy science. A key technical observation is that as a result of the port-Hamiltonian formulation, the mathematical passivity property of individuals’ self-dynamics facilitates the convergence analysis of opinion evolution. We explain how to steer public opinions towards consensus, polarity, or neutrality, and investigate how an autocratic media coalition might emerge regardless of public views. We also assess the role of interpersonal communication and media exposure, which in itself is an essential topic in mathematical sociology