26 research outputs found

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

    Get PDF
    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

    Data Driven Distributed Bipartite Consensus Tracking for Nonlinear Multiagent Systems via Iterative Learning Control

    Get PDF
    This article explores a data-driven distributed bipartite consensus tracking (DBCT) problem for discrete-time multi-agent systems (MASs) with coopetition networks under repeatable operations. To solve this problem, a time-varying linearization model along the iteration axis is first established by using the measurement input and output (I/O) data of agents. Then a data-driven distributed bipartite consensus iterative learning control (DBCILC) algorithm is proposed considering both fixed and switching topologies. Compared with existing bipartite consensus, the main characteristic is to construct the proposed control protocol without requiring any explicit or implicit information of MASs’ mathematical model. The difference from existing iterative learning control (ILC) approaches is that both the cooperative interactions and antagonistic interactions, and time-varying switching topologies are considered. Furthermore, through rigorous theoretical analysis, the proposed DBCILC approach can guarantee the bipartite consensus reducing tracking errors in the limited iteration steps. Moreover, although not all agents can receive information from the virtual leader directly, the proposed distributed scheme can maintain the performance and reduce the costs of communication. The results of three examples further illustrate the correctness, effectiveness, and applicability of the proposed algorithm

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

    Get PDF
    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)(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

    Bipartite consensus of nonlinear agents in the presence of communication noise

    Get PDF
    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/

    Event-Triggered Distributed Data-Driven Iterative Learning Bipartite Formation Control for Unknown Nonlinear Multiagent Systems

    Get PDF
    In this study, we investigate the event-triggering time-varying trajectory bipartite formation tracking problem for a class of unknown nonaffine nonlinear discrete-time multiagent systems (MASs). We first obtain an equivalent linear data model with a dynamic parameter of each agent by employing the pseudo-partial-derivative technique. Then, we propose an event-triggered distributed model-free adaptive iterative learning bipartite formation control scheme by using the input/output data of MASs without employing either the plant structure or any knowledge of the dynamics. To improve the flexibility and network communication resource utilization, we construct an observer-based event-triggering mechanism with a dead-zone operator. Furthermore, we rigorously prove the convergence of the proposed algorithm, where each agent’s time-varying trajectory bipartite formation tracking error is reduced to a small range around zero. Finally, four simulation studies further validate the designed control approach’s effectiveness, demonstrating that the proposed scheme is also suitable for the homogeneous MASs to achieve time-varying trajectory bipartite formation tracking

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

    Get PDF
    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

    High-Order Leader-Follower Tracking Control under Limited Information Availability

    Full text link
    Limited information availability represents a fundamental challenge for control of multi-agent systems, since an agent often lacks sensing capabilities to measure certain states of its own and can exchange data only with its neighbors. The challenge becomes even greater when agents are governed by high-order dynamics. The present work is motivated to conduct control design for linear and nonlinear high-order leader-follower multi-agent systems in a context where only the first state of an agent is measured. To address this open challenge, we develop novel distributed observers to enable followers to reconstruct unmeasured or unknown quantities about themselves and the leader and on such a basis, build observer-based tracking control approaches. We analyze the convergence properties of the proposed approaches and validate their performance through simulation
    corecore