201 research outputs found

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

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

    Bias estimation in sensor networks

    Get PDF
    This paper investigates the problem of estimating biases affecting relative state measurements in a sensor network. Each sensor measures the relative states of its neighbors and this measurement is corrupted by a constant bias. We analyse under what conditions on the network topology and the maximum number of biased sensors the biases can be correctly estimated. We show that for non-bipartite graphs the biases can always be determined even when all the sensors are corrupted, while for bipartite graphs more than half of the sensors should be unbiased to ensure the correctness of the bias estimation. If the biases are heterogeneous, then the number of unbiased sensors can be reduced to two. Based on these conditions, we propose some algorithms to estimate the biases.Comment: 12 pages, 8 figure

    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

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

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

    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

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

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

    A design method for distributed luenberger observers

    Get PDF
    The paper addresses the problem of designing distributed observers for discrete linear time-invariant (LTI) systems with distributed sensor nodes subjected to bounded measurement noise. A solution is proposed in terms of a distributed LTI Luenberger observer, thus departing from common linear time-varying solutions rooted in consensus-based distributed estimation techniques, and dispensing with the need for the exchange of covariance matrices. It is shown, under the conditions of collective observability, strong connectivity of the sensor communication network, and invertibility of the state transition matrix, that the resulting observer yields ultimate boundedness of the estimation error. A design example is given where the asymptotic performance of the proposed observer is shown to be similar to that obtained using a time-varying distributed Kalman filtering approach
    • …
    corecore