Differential Inequalities in Multi-Agent Coordination and Opinion Dynamics Modeling

Distributed algorithms of multi-agent coordination have attracted substantial attention from the research community; the simplest and most thoroughly studied of them are consensus protocols in the form of differential or difference equations over general time-varying weighted graphs. These graphs are usually characterized algebraically by their associated Laplacian matrices. Network algorithms with similar algebraic graph theoretic structures, called being of Laplacian-type in this paper, also arise in other related multi-agent control problems, such as aggregation and containment control, target surrounding, distributed optimization and modeling of opinion evolution in social groups. In spite of their similarities, each of such algorithms has often been studied using separate mathematical techniques. In this paper, a novel approach is offered, allowing a unified and elegant way to examine many Laplacian-type algorithms for multi-agent coordination. This approach is based on the analysis of some differential or difference inequalities that have to be satisfied by the some "outputs" of the agents (e.g. the distances to the desired set in aggregation problems). Although such inequalities may have many unbounded solutions, under natural graphic connectivity conditions all their bounded solutions converge (and even reach consensus), entailing the convergence of the corresponding distributed algorithms. In the theory of differential equations the absence of bounded non-convergent solutions is referred to as the equation's dichotomy. In this paper, we establish the dichotomy criteria of Laplacian-type differential and difference inequalities and show that these criteria enable one to extend a number of recent results, concerned with Laplacian-type algorithms for multi-agent coordination and modeling opinion formation in social groups.Comment: accepted to Automatic

Consensus Control for a Class of Linear Multiagent Systems using a Distributed Integral Sliding Mode Strategy

In this paper, a consensus framework is proposed for a class of linear multiagent systems subject to matched and unmatched uncertainties in an undirected topology. A linear coordinate transformation is derived so that the consensus protocol design can be conveniently performed. The distributed consensus protocol is developed by using an integral sliding mode strategy. Consensus is achieved asymptotically and all subsystem states are bounded. By using an integral sliding mode control, the subsystems lie on the sliding surface from the initial time, which avoids any sensitivity to uncertainties during the reaching phase. By use of an appropriate projection matrix, the size of the equivalent control required to maintain sliding is reduced which reduces the conservatism of the design. MATLAB simulations validate the effectiveness and superiority of the proposed method

Active-passive dynamic consensus filters: Theory and applications

”This dissertation presents a new method for distributively sensing dynamic environments utilizing integral action based system theoretic distributed information fusion methods. Specifically, the main contribution is a new class of dynamic consensus filters, termed active-passive dynamic consensus filters, in which agents are considered to be active, if they are able to sense an exogenous quantity of interest and are considered to be passive, otherwise, where the objective is to drive the states of all agents to the convex hull spanned by the exogenous inputs sensed by active agents. Additionally, we generalize these results to allow agents to locally set their value-of-information, characterizing an agents ability to sense a local quantity of interest, which may change with respect to time. The presented active-passive dynamic consensus filters utilize equations of motion in order to diffuse information across the network, requiring continuous information exchange and requiring agents to exchange their measurement and integral action states. Additionally, agents are assumed to be modeled as having single integrator dynamics. Motivated from this standpoint, we utilize the ideas and results from event-triggering control theory to develop a network of agents which only share their measurement state information as required based on errors exceeding a user-defined threshold. We also develop a static output-feedback controller which drives the outputs of a network of agents with general linear time-invariant dynamics to the average of a set of applied exogenous inputs. Finally, we also present a system state emulator based adaptive controller to guarantee that agents will reach a consensus even in the presence of input disturbances. For each proposed active-passive dynamic consensus filter, a rigorous analysis of the closed-loop system dynamics is performed to demonstrate stability. Finally, numerical examples and experimental studies are included to demonstrate the efficacy of the proposed information fusion filters”--Abstract, page iv

Adaptive fuzzy prescribed-time connectivity-preserving consensus of stochastic nonstrict-feedback switched multiagent systems

An adaptive fuzzy prescribed-time connectivity-preserving consensus protocol is designed for a class of stochastic nonstrict-feedback multiagent systems, in which periodic disturbances, switched nonlinearities, input saturation, and limited communication ranges are taken into consideration simultaneously. The connectivity, determined by the limited communication ranges and initial positions of agents, is preserved by incorporating an error transformation. Further, a common Lyapunov function is considered to deal with the switching modes. By combining a reduced fuzzy logic system with Fourier series expansion, a novel approximator is constructed to deal with periodically disturbed nonlinearities and to surmount the difficulty brought by the nonstrict-feedback structure. More importantly, distinctly from the existing finite/fixed-time control strategies where the settling time is heavily dependent on the accurate value of the initial states and control parameters, the settling time of the proposed prescribed-time consensus is completely independent of the initialization and control parameters and can be given a priori only according to actual demands. Based on the Lyapunov stability theory, the designed controller ensures that the connectivity-preserving consensus is achieved in prescribed time and all the signals remain bounded in probability. To the end, the feasibility of the proposed consensus protocol is demonstrated by simulation

Iterative learning control for multi-agent systems with impulsive consensus tracking

In this paper, we adopt D-type and PD-type learning laws with the initial state of iteration to achieve uniform tracking problem of multi-agent systems subjected to impulsive input. For the multi-agent system with impulse, we show that all agents are driven to achieve a given asymptotical consensus as the iteration number increases via the proposed learning laws if the virtual leader has a path to any follower agent. Finally, an example is illustrated to verify the effectiveness by tracking a continuous or piecewise continuous desired trajectory

Distributed Optimal State Consensus for Multiple Circuit Systems with Disturbance Rejection

This paper investigates the distributed optimal state consensus problem for an electronic system with a group of circuit units, where the dynamics of each unit is modeled by a Chua's circuit in the presence of disturbance generated by an external system. By means of the internal model approach and feedback control, a compensator-based continuous-time algorithm is proposed to minimize the sum of all cost functions associated with each individual unit in a cooperative manner. Supported by convex analysis, graph theory and Lyapunov theory, it is proved that the proposed algorithm is exponentially convergent. Compared with the centralized algorithms, the proposed protocol possesses remarkable superiority in improving scalability and reliability of multiple circuit systems. Moreover, we also study the distributed uncertain optimal state consensus problem and a linear regret bound is obtained in this case. Finally, a state synchronization example is provided to validate the effectiveness of the proposed algorithms

Stability of a class of multi-agent tracking systems with unstable subsystems

In this work, we pre-deploy a large number of smart agents to monitor an area of interest. This area could be divided into many Voronoi cells by using the knowledge of Voronoi diagram and every Voronoi site agent is responsible for monitoring and tracking the target in its cell. Then, a cooperative relay tracking strategy is proposed such that during the tracking process, when a target enters a new Voronoi cell, this event triggers the switching of both tracking agents and communication topology. This is significantly different from the traditional switching topologies. In addition, during the tracking process, the topology and tracking agents switch, which may lead the tracking system to be stable or unstable. The system switches either among consecutive stable subsystems and consecutive unstable subsystems or between stable and unstable subsystems. The objective of this paper is to design a tracking strategy guaranteeing overall successful tracking despite the existence of unstable subsystems. We also address extended discussions on the case where the dynamics of agents are subject to disturbances and the disturbance attenuation level is achieved. Finally, the proposed tracking strategy is verified by a set of simulations