368 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

    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/

    Consensus tracking of nonlinear agents using distributed nonlinear dynamic inversion with switching leader-follower connection

    Get PDF
    In this paper, a consensus tracking protocol for nonlinear agents is presented, which is based on the Nonlinear Dynamic Inversion (NDI) technique. Implementation of such a technique is new in the context of the consensus tracking problem. The tracking capability of nonlinear dynamic inversion (NDI) is exploited for a leader-follower multi-agent scenario. We have provided all the mathematical details to establish its theoretical foundation. Additionally, a convergence study is provided to show the efficiency of the proposed controller. The performance of the proposed controller is evaluated in the presence of both (a) random switching topology among the agents and (b) random switching of leader–follower connections, which is realistic and not reported in the literature. The follower agents track various trajectories generated by a dynamic leader, which describes the tracking capability of the proposed controller. The results obtained from the simulation study show how efficiently this controller can handle the switching topology and switching leader-follower connections.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

    A Survey on Aerial Swarm Robotics

    Get PDF
    The use of aerial swarms to solve real-world problems has been increasing steadily, accompanied by falling prices and improving performance of communication, sensing, and processing hardware. The commoditization of hardware has reduced unit costs, thereby lowering the barriers to entry to the field of aerial swarm robotics. A key enabling technology for swarms is the family of algorithms that allow the individual members of the swarm to communicate and allocate tasks amongst themselves, plan their trajectories, and coordinate their flight in such a way that the overall objectives of the swarm are achieved efficiently. These algorithms, often organized in a hierarchical fashion, endow the swarm with autonomy at every level, and the role of a human operator can be reduced, in principle, to interactions at a higher level without direct intervention. This technology depends on the clever and innovative application of theoretical tools from control and estimation. This paper reviews the state of the art of these theoretical tools, specifically focusing on how they have been developed for, and applied to, aerial swarms. Aerial swarms differ from swarms of ground-based vehicles in two respects: they operate in a three-dimensional space and the dynamics of individual vehicles adds an extra layer of complexity. We review dynamic modeling and conditions for stability and controllability that are essential in order to achieve cooperative flight and distributed sensing. The main sections of this paper focus on major results covering trajectory generation, task allocation, adversarial control, distributed sensing, monitoring, and mapping. Wherever possible, we indicate how the physics and subsystem technologies of aerial robots are brought to bear on these individual areas

    Multi-agent Systems with Compasses

    Full text link
    This paper investigates agreement protocols over cooperative and cooperative--antagonistic multi-agent networks with coupled continuous-time nonlinear dynamics. To guarantee convergence for such systems, it is common in the literature to assume that the vector field of each agent is pointing inside the convex hull formed by the states of the agent and its neighbors, given that the relative states between each agent and its neighbors are available. This convexity condition is relaxed in this paper, as we show that it is enough that the vector field belongs to a strict tangent cone based on a local supporting hyperrectangle. The new condition has the natural physical interpretation of requiring shared reference directions in addition to the available local relative states. Such shared reference directions can be further interpreted as if each agent holds a magnetic compass indicating the orientations of a global frame. It is proven that the cooperative multi-agent system achieves exponential state agreement if and only if the time-varying interaction graph is uniformly jointly quasi-strongly connected. Cooperative--antagonistic multi-agent systems are also considered. For these systems, the relation has a negative sign for arcs corresponding to antagonistic interactions. State agreement may not be achieved, but instead it is shown that all the agents' states asymptotically converge, and their limits agree componentwise in absolute values if and in general only if the time-varying interaction graph is uniformly jointly strongly connected.Comment: SIAM Journal on Control and Optimization, In pres
    • …
    corecore