Cooperative output regulation of heterogeneous multi-agent systems based on passivity

This paper investigates the problem of cooperative output regulation of heterogeneous linear multi-agent systems. A passive framework is presented for the stabilisation analysis of cooperative output regulation, which can overcome the difficulty caused by the fact that the global dynamics of heterogeneous multi-agent systems depends on the global communication structure. An adaptive distributed observer is proposed to estimate the state of the exosystem, and the proposed distributed observer is independent of any global information of the communication graph. Based on passivity design and adaptive distributed observer, both a distributed state feedback and a distributed output feedback protocol are designed for output synchronisation of heterogeneous multi-agent systems. The gain matrices of the distributed protocols and observers are obtained by a Riccati equation design approach. Furthermore, sufficient local conditions for solving the problem of cooperative output regulation of heterogeneous multi-agent systems are presented. Finally, numerical simulation results are given to illustrate the effectiveness of the proposed distributed control schemes.     

Distributed robust consensus control of multi-agent systems with heterogeneous matching uncertainties

This paper considers the distributed consensus problem of linear multi-agent systems subject to different matching uncertainties for both the cases without and with a leader of bounded unknown control input. Due to the existence of nonidentical uncertainties, the multi-agent systems discussed in this paper are essentially heterogeneous. For the case where the communication graph is undirected and connected, based on the local state information of neighboring agents, a fully distributed continuous adaptive consensus protocol is designed, under which the consensus error is uniformly ultimately bounded and exponentially converges to a small adjustable bounded set. For the case where there exists a leader whose control input is unknown and bounded, a distributed adaptive consensus protocol is proposed to ensure the boundedness of the consensus error. A sufficient condition for the existence of the proposed protocols is that each agent is stabilizable.     

Stability analysis for multi-agent systems using the incidence matrix: Quantized communication and formation control

The spectral properties of the incidence matrix of the communication graph are exploited to provide solutions to two multi-agent control problems. In particular, we consider the problem of state agreement with quantized communication and the problem of distance-based formation control. In both cases, stabilizing control laws are provided when the communication graph is a tree. It is shown how the relation between tree graphs and the null space of the corresponding incidence matrix encode fundamental properties for these two multi-agent control problems.     

Leader-following consensus for a class of second-order nonlinear multi-agent systems

This paper deals with the leader-following consensus problem for a class of multi-agent systems with nonlinear dynamics and directed communication topology. The control input of the leader agent is assumed to be unknown to all follower agents. A distributed adaptive nonlinear control law is constructed using the relative state information between neighboring agents, which achieves leader-following consensus for any directed communication graph that contains a spanning tree with the root node being the leader agent. Compared with previous results, the nonlinear functions are not required to satisfy the globally Lipschitz or Lipschitz-like condition and the adaptive consensus protocol is in a distributed fashion. A numerical example is given to verify our proposed protocol.     

Controllability of heterogeneous multi-agent systems under directed and weighted topology

This paper considers the controllability problem for both continuous- and discrete-time linear heterogeneous multi-agent systems with directed and weighted communication topology. First, two kinds of neighbour-based control protocols based on the distributed protocol of first-order and second-order multi-agent systems are proposed, under which it is shown that a heterogeneous multi-agent system is controllable if the underlying communication topology is controllable. Then, under special leader selection, the result shows that the controllability of a heterogeneous multi-agent system is solely decided by its communication topology graph. Furthermore, some necessary and/or sufficient conditions are derived for controllability of communication topology from algebraic and graphical perspectives. Finally, simulation examples are presented to demonstrate the effectiveness of the theoretical results.     

Leader-following control of multiple nonholonomic systems over directed communication graphs

This paper considers the leader-following control problem of multiple nonlinear systems with directed communication topology and a leader. If the state of each system is measurable, distributed state feedback controllers are proposed using neighbours’ state information with the aid of Lyapunov techniques and properties of Laplacian matrix for time-invariant communication graph and time-varying communication graph. It is shown that the state of each system exponentially converges to the state of a leader. If the state of each system is not measurable, distributed observer-based output feedback control laws are proposed. As an application of the proposed results, formation control of wheeled mobile robots is studied. The simulation results show the effectiveness of the proposed results.     

Bipartite tracking of homogeneous and heterogeneous linear multi-agent systems

In this paper, we consider bipartite tracking of linear multi-agent systems with a leader. Both homogeneous and heterogeneous systems are investigated. The communication between agents is modelled by a directed signed graph, where the negative (positive) edges represent the antagonistic (cooperative) interactions among agents. Linear Quadratic Regulator (LQR)-based approach is used to derive the distributed protocol for the follower agent to achieve bipartite tracking of the leader. It is shown that solving the bipartite tracking problem over the structurally balanced signed graph is equivalent to solving the cooperative tracking problem over a corresponding graph with nonnegative edge weights. This bridges the gap between the newly raised bipartite tracking problem and the well-studied cooperative tracking problem. Three novel control protocols are proposed for both cooperative and bipartite output tracking of heterogeneous linear multi-agent systems. Numerical examples are given to show the effectiveness of our control protocols.     

多智能体系统一致性问题的控制器与拓扑协同优化设计

本文考虑多智能体系统一致性问题的控制与拓扑协同优化设计.首先在给定的二次性能指标下,对多智能体系统的分布式一致性控制协议寻优,得到依赖于网络拓扑图拉普拉斯矩阵的最优控制器.其次,为进一步最大限度地减少拓扑之间的连边,又不降低多智能体系统的收敛速度,通过权衡系统的通信能量和控制能量,寻求网络拓扑的优化设计,给出了拓扑优化算法和多智能体系统特征值的优化方法.最后,仿真研究验证了在控制器优化的基础上进一步寻求拓扑优化,可大大提升系统的一致性性能.     

复杂无向网络连通性的一种高效判定算法

通信网络的拓扑结构连通性是多智能体系统一致性控制或编队控制等的理论前提.以往, 各种多智能体系统一致性控制或编队控制方面的文献仅侧重于控制协议、智能体动力学模型和控制律设计, 而缺乏对多智能体通信网络拓扑结构的连通性研究.网络连通性高效判定算法不仅是大规模多智能体系统一致性控制或编队控制的保证, 而且在图论、现代移动通信、计算机与交通等各种网络中有着重要和广泛的应用.针对复杂无向网络的连通性问题, 本文给出了一种新的高效判定算法、以及该算法的时间复杂度和空间复杂度的上界.该算法具有非常低的时间复杂度和空间复杂度, 且便于计算机实现, 因而具有重要的理论意义和广泛的实用价值.     

基于牵制控制的异质多智能体系统的群一致性研究

为了研究由线性的一阶智能体、二阶智能体和非线性的EL （Euler-Lagrange）结构智能体组成的异质多智能体系统的群一致性,并实现同一个子群中智能体状态趋于期望的状态,针对无向的固定拓扑情况,提出了基于牵制控制的分布式控制协议。并通过代数图论、李雅普诺夫函数和拉塞尔不变集原理证明了控制协议的可行性。数值仿真结果表明:在所提控制协议作用下能够实现包含非线性EL结构的异质多智能体系统的群一致性,与未引入牵制控制的群一致性算法相比各个子群能够趋于期望的状态。     

Distributed Self-triggered Control for Consensus of Multi-agent Systems

This paper studies the consensus problem of general linear multi-agent systems via self-triggered control. Two distributed self-triggered control schemes based on state feedback and output feedback are developed respectively. It is shown that under the proposed control protocols, consensus can be reached if the communication graph of the multi-agent system is connected. An example is presented to illustrate the effectiveness of the proposed control methods.      

Observer-based distributed adaptive iterative learning control for linear multi-agent systems

This paper investigates the consensus problem for linear multi-agent systems from the viewpoint of two-dimensional systems when the state information of each agent is not available. Observer-based fully distributed adaptive iterative learning protocol is designed in this paper. A local observer is designed for each agent and it is shown that without using any global information about the communication graph, all agents achieve consensus perfectly for all undirected connected communication graph when the number of iterations tends to infinity. The Lyapunov-like energy function is employed to facilitate the learning protocol design and property analysis. Finally, simulation example is given to illustrate the theoretical analysis.     

Distributed output regulation for linear multi-agent systems with communication delays

In this paper, a distributed output regulation approach is presented for the cooperative control of linear multi-agent systems in the presence of communication delays. Both dynamic state and output feedback control laws are designed for achieving the property of output regulation. Sufficient conditions for the existence of these control laws are provided in terms of linear matrix inequalities. Simulation results are given to support the efficiency of the proposed distributed output regulation approach.     

Distributed formation control of fractional-order multi-agent systems with relative damping and communication delay

The distributed formation control of fractional-order multi-agent systems is mainly studied under directed communication graphs in this paper. Firstly, a control law with relative damping and communication delay are proposed. Then, some sufficient conditions for achieving formation control are derived using matrix theory, graph theory and the frequency domain analysis method. Finally, based on the numerical method of predictor-corrector, several simulations are presented to illustrate the effectiveness of the obtained results.     

多智能体系统在分布式采样控制下的动力学行为

本文运用图论、矩阵分析和现代控制理论等工具, 研究信息网络传输下多智能体系统的协调控制和动力学行为. 假设每个智能体通过数字化网络传感器获得其邻近智能体的位置状态,而且多智能体系统采取分布式线性控制协议. 每个智能体被描述为一个简单的采样系统,多智能体系统转化为混合动力学系统. 研究结果表明,多智能体系统所呈现的渐近聚集、周期振荡和发散动力学行为不仅和网络结构的代数特征有关, 而且和每个智能体的动力学方程、采样周期有关. 本文给出了具体精确的代数判据. 仿真例子进一步验证了本文结果的有效性.     

Practical time-varying formation tracking for high-order nonlinear multi-agent systems based on the distributed extended state observer

Practical time-varying formation tracking analysis and design problems for high-order nonlinear multi-agent systems are investigated, where the time-varying formation tracking error is controlled within an arbitrarily small bound. The states of followers form a predefined time-varying formation while tracking the state of the leader with unknown control input. Besides, the dynamics of each agent has heterogeneous nonlinearity and disturbance. First, a distributed extended state observer is constructed to estimate the follower's nonlinearity and disturbance, and the leader's unknown control input simultaneously. A protocol based on the distributed extended state observer is proposed. Second, sufficient conditions for the multi-agent systems to achieve the practical time-varying formation tracking under the protocol are presented by using the Lyapunov stability theory. Third, an approach is derived to design the proposed protocol by solving a linear matrix inequality. Finally, numerical simulation results are given to illustrate the effectiveness of the theoretical results.     

Distributed Fault-Tolerant Containment Control for Nonlinear Multi-Agent Systems Under Directed Network Topology via Hierarchical Approach

This paper investigates the distributed fault-tolerant containment control (FTCC) problem of nonlinear multi-agent systems (MASs) under a directed network topology. The proposed control framework which is independent on the global information about the communication topology consists of two layers. Different from most existing distributed fault-tolerant control (FTC) protocols where the fault in one agent may propagate over network, the developed control method can eliminate the phenomenon of fault propagation. Based on the hierarchical control strategy, the FTCC problem with a directed graph can be simplified to the distributed containment control of the upper layer and the fault-tolerant tracking control of the lower layer. Finally, simulation results are given to demonstrate the effectiveness of the proposed control protocol.      

Average Convergence for Directed & Undirected Graphs in Distributed Systems

Consensus control of multi-agent systems is an innovative paradigm for the development of intelligent distributed systems. This has fascinated numerous scientific groups for their promising applications as they have the freedom to achieve their local and global goals and make their own decisions. Network communication topologies based on graph and matrix theory are widely used in a various real-time applications ranging from software agents to robotics. Therefore, while sustaining the significance of both directed and undirected graphs, this research emphases on the demonstration of a distributed average consensus algorithm. It uses the harmonic mean in the domain of multi-agent systems with directed and undirected graphs under static topologies based on a control input scheme. The proposed agreement protocol focuses on achieving a constant consensus on directional and undirected graphs using the exchange of information between neighbors to update their status values and to be able to calculate the total number of agents that contribute to the communication network at the same time. The proposed method is implemented for the identical networks that are considered under the directional and non-directional communication links. Two different scenarios are simulated and it is concluded that the undirected approach has an advantage over directed graph communication in terms of processing time and the total number of iterations required to achieve convergence. The same network parameters are introduced for both orientations of the communication graphs. In addition, the results of the simulation and the calculation of various matrices are provided at the end to validate the effectiveness of the proposed algorithm to achieve consensus.     

Consensus with a reference state for fractional-order multi-agent systems

This paper investigates consensus of fractional-order multi-agent systems (MASs) with a reference state. First, a consensus control law with a constant reference state is given using graph theory and stability analysis of fractional-order. Then, a general control law and a particular one for consensus of fractional-order MASs with a time-varying reference state are proposed. Next, the above control laws are extended to solve formation tracking problem. Finally, several simulations are presented to verify the effectiveness of the obtained results.     

Solving a modified consensus problem of linear multi-agent systems

A distributed protocol is proposed for a modified consensus problem of a network of agents that have the same continuous-time linear dynamics. Each agent estimates its own state using its output information and then sends the estimated state to its neighbor agents for the purpose of reaching a consensus. The modified consensus problem requires the group decision value to be a linear function of initial states and initial estimated states of all agents in the network, and the transformation matrix associated with this linear function not to be a zero matrix. It is proved that under the proposed control protocol, the modified consensus problem can be solved if and only if the system matrices of the agent’s dynamics are stabilizable and detectable, the input matrix is not a zero matrix, and the communication topology graph has a spanning tree. The proposed protocol can also be extended to multi-agent systems where agents are described by discrete-time linear dynamics. The corresponding necessary and sufficient conditions are provided as well.