Consensus of single integrator multi-agent systems with directed topology and communication delays

In this paper, a distributed control scheme has been developed for consensus of single integrator multi-agent systems with directed fixed communication topology for arbitrarily large constant, time-varying or distributed communication delays. It is proved that the closed loop control system can reach consensus with an exponential convergence rate if and only if the topology is quasi-strongly connected. Simulation results are also provided to demonstrate the effectiveness of the proposed controller.     

Bipartite consensus for nonlinear time-delay multiagent systems via time-varying gain control method

The bipartite consensus problem is addressed for a class of nonlinear time-delay multiagent systems in this paper. Therein, the uncertain nonlinear dynamics of all agents satisfy a Lipschitz growth condition with unknown constants, and part of the state information cannot be measured. In this case, a time-varying gain compensator is constructed, which only utilizes the output information of the follower and its neighbors. Subsequently, a distributed output feedback control protocol is proposed on the basis of the compensator. According to Lyapunov stability theory, it is proved that the bipartite consensus can be guaranteed by means of the designed control protocol. Different from the existing literature, this paper studies the leader–follower consensus problem under a weaker connectivity condition, i.e., the signed directed graph is structurally balanced and contains a directed spanning tree. Two simulation examples are carried out to show the feasibility of the proposed control strategy     

Distributed output feedback stationary consensus of multi-vehicle systems in unknown environments

In the traditional distributed consensus of multi-vehicle systems, vehicles agree on velocity and position using limited information exchange in their local neighborhoods. Recently, distributed leaderless stationary consensus has been proposed in which vehicles agree on a position and come to a stop. The proposed stationary consensus schemes are based on all vehicles'' access to their own absolute velocity measurements, and they do not guarantee this collective behavior in the presence of disturbances that persistently excite vehicles'' dynamics. On the other hand, traditional distributed disturbance rejection leaderless consensus algorithms may result in an uncontrolled increase in the speed of multi-vehicle system. In this paper, we propose a dynamic relative-output feedback leaderless stationary algorithm in which only a few vehicles have access to their absolute measurements. We systematically design the distributed algorithm by transforming this problem into a static feedback robust control design challenge for the low-order modified model of vehicles with fictitious modeling uncertainties. We further propose dynamic leader-follower stationary consensus algorithms for multi-vehicle systems with a static leader, and find closed-form solutions for the consensus gains based on design matrices and communication graph topology. Finally, we verify the feasibility of these ideas through simulation studies.     

Consensus controller for multi-UAV navigation

In this paper, we design consensus algorithms for multiple unmanned aerial vehicles (UAV). We mainly focus on the control design in the face of measurement noise and propose a position consensus controller based on the sliding mode control by using the distributed UAV information. Within the framework of Lyapunov theory, it is shown that all signals in the closed-loop multi-UAV systems are stabilized by the proposed algorithm, while consensus errors are uniformly ultimately bounded. Moreover, for each local UAV, we propose a mechanism to define the trustworthiness, based on which the edge weights are tuned to eliminate negative influence from stubborn agents or agents exposed to extremely noisy measurement. Finally, we develop software for a nano UAV platform, based on which we implement our algorithms to address measurement noises in UAV flight tests. The experimental results validate the effectiveness of the proposed algorithms.     

执行器故障的多模型自适应重构控制

In this paper, an active fault tolerant control strategy is developed to compensate for the effect of actuator fault in the presence of non-measurable rate on the actuator second-order dynamics. The proposed control scheme is a combination between multiple model and adaptive reconfiguration control. By means of the designed method, the system output can track that of the reference model asymptotically, and the simulation results have illustrated the effectiveness of the proposed algorithms.     

Asymptotic optimality for consensus-type stochastic approximation algorithms using iterate averaging

This paper introduces a post-iteration averaging algorithm to achieve asymptotic optimality in convergence rates of stochastic approximation algorithms for consensus control with structural constraints. The algorithm involves two stages. The first stage is a coarse approximation obtained using a sequence of large stepsizes. Then, the second stage provides a refinement by averaging the iterates from the first stage. We show that the new algorithm is asymptotically efficient and gives the optimal convergence rates in the sense of the best scaling factor and ’smallest’ possible asymptotic variance.     

Efficient Parallel Algorithms for Some Graph Theory Problems

In this paper,a sequential algorithm computing the aww vertex pair distance matrix D and the path matrix Pis given.On a PRAM EREW model with p,1≤p≤n^2,processors,a parallel version of the sequential algorithm is shown.This method can also be used to get a parallel algorithm to compute transitive closure array A^* of an undirected graph.The time complexity of the parallel algorithm is O(n^3/p).If D,P and A^* are known,it is shown that the problems to find all connected components,to compute the diameter of an undirected graph,to determine the center of a directed graph and to search for a directed cycle with the minimum(maximum)length in a directed graph can all be solved in O(n^2/p logp)time.     

Adaptive-backstepping force/motion control for mobile-manipulator robot based on fuzzy CMAC neural networks

In this paper, an adaptive backstepping fuzzy cerebellar-model-articulation-control neural-networks control （ABFCNC） system for motion/force control of the mobile-manipulator robot （MMR） is proposed. By applying the ABFCNC in the tracking-position controller, the unknown dynamics and parameter variation problems of the MMR control system are relaxed. In addition, an adaptive robust compensator is proposed to eliminate uncertainties that consist of approximation errors, uncertain disturbances. Based on the tracking position-ABFCNC design, an adaptive robust control strategy is also developed for the nonholonomicconstraint force of the MMR. The design of adaptive-online learning algorithms is obtained by using the Lyapunov stability theorem. Therefore, the proposed method proves that it not only can guarantee the stability and robustness but also the tracking performances of the MMR control system. The effectiveness and robustness of the proposed control system are verified by comparative simulation results.     

Recursive Approximation of Complex Behaviours With IoT-Data Imperfections

This paper presents an approach to recursively estimate the simplest linear model that approximates the time-varying local behaviors from imperfect(noisy and incomplete) measurements in the internet of things(IoT) based distributed decision-making problems. We first show that the problem of finding the lowest order model for a multi-input single-output system is a cardinality(l0) optimization problem, known to be NP-hard.To solve the problem a simpler approach is proposed which uses the recently developed atomic norm concept and the modified Frank-Wolfe(mFW) algorithm is introduced. Further, the paper computes the minimum data-rate required for computing the models with imperfect measurements. The proposed approach is illustrated on a building heating, ventilation, and air-conditioning(HVAC) control system that aims at optimizing energy consumption in commercial buildings using IoT devices in a distributed manner. The HVAC control application requires recursive thermal dynamical model updates due to frequently changing conditions and non-linear dynamics. We show that the method proposed in this paper can approximate such complex dynamics on single-board computers interfaced to sensors using unreliable communication channels. Real-time experiments on HVAC systems and simulation studies are used to illustrate the proposed method.     

A unified approach to output synchronization of heterogeneous multi-agent systems via L2-gain design

In this paper, a unified design procedure is given for output synchronization of heterogeneous multi-agent systems (MAS) on communication graph topologies, using relative output measurements from neighbors. Three different control protocols, namely, full-state feedback, static output-feedback, and dynamic output-feedback, are designed for output synchronization. It is seen that a unified design procedure for heterogeneous MAS can be given by formulation and solution of a suitable local $\mathcal{L}{_2}$-gain design problem. Sufficient conditions are developed in terms of stabilizing the local agents'' dynamics, satisfying a certain small-gain criterion, and solving the output regulator equations. Local design procedures are presented for each agent to guarantee that these sufficient conditions are satisfied. The proposed control protocols require only one copy of the leader''s dynamics in the compensator, regardless of the dimensions of the outputs. This results in lower-dimensional compensators for systems with high-order outputs, compared to the $p$-copy internal model approach. All three proposed control protocols are verified using numerical simulations.     

On Consensus Algorithms for Double-Integrator Dynamics

This note considers consensus algorithms for double-integrator dynamics. We propose and analyze consensus algorithms for double-integrator dynamics in four cases: 1) with a bounded control input, 2) without relative velocity measurements, 3) with a group reference velocity available to each team member, and 4) with a bounded control input when a group reference state is available to only a subset of the team. We show that consensus is reached asymptotically for the first two cases if the undirected interaction graph is connected. We further show that consensus is reached asymptotically for the third case if the directed interaction graph has a directed spanning tree and the gain for velocity matching with the group reference velocity is above a certain bound. We also show that consensus is reached asymptotically for the fourth case if and only if the group reference state flows directly or indirectly to all of the vehicles in the team.      

Error-transformation-based consensus algorithms of multi-agent systems: connectivity-preserving approach

This paper investigates distributed connectivity-preserving consensus problems of networked multi-agent systems with limited communication ranges. Compared with existing literature, a main contribution of this paper is to present a new nonlinear transformation approach of consensus errors for preserving the initial interaction patterns of multi-agent systems. Both the consensus and the connectivity preservation can be achieved by using one transformed error function. Based on the proposed nonlinear error transformation, we derive distributed connectivity-preserving consensus algorithms for single-integrator dynamics, double-integrator dynamics and second-order nonlinear systems. The asymptotic stability of consensus errors and the connectivity preservation among agents are established through Lyapunov stability analysis.     

Leaderless consensus for the fractional-order nonlinear multi-agent systems under directed interaction topology

Leaderless consensus for the fractional-order nonlinear multi-agent systems is investigated in this paper. At the first part, a control protocol is proposed to achieve leaderless consensus for the nonlinear single-integrator multi-agent systems. At the second part, based on sliding mode estimator, a control protocol is given to solve leaderless consensus for the the nonlinear single-integrator multi-agent systems. It shows that the control protocol can improve the systems’ convergence speed. At the third part, a control protocol is designed to accomplish leaderless consensus for the nonlinear double-integrator multi-agent systems. To judge the systems’ stability in this paper, two classic continuous Lyapunov candidate functions are chosen. Finally, several worked out examples under directed interaction topology are given to prove above results.     

多智能体沿多条给定路径编队运动的有向协同控制

研究了在有向通信连接下二阶积分器描述的多智能体沿多条给定路径编队运动的控制器设计及其稳定性分析问题. 智能体的动态和指定路径都是在固定直角坐标系下描述的. 通过引入路径函数来设计路径跟踪控制, 根据路径函数与弧长的关系来设计编队控制律, 使得多智能体沿期望路径的位置和速度在规定队形下达到一致. 利用图论证明, 当通信拓扑对应的有向图具有全局可达点时, 设计的编队控制系统是渐近稳定的. 本文设计的有向协同控制律可以应用于区域的信息优化采集.     

Sampled-data discrete-time coordination algorithms for double-integrator dynamics under dynamic directed interaction

In this article, we study two sampled-data-based discrete-time coordination algorithms for multi-vehicle systems with double-integrator dynamics under dynamic directed interaction. For both algorithms, we derive sufficient conditions on the interaction graph, the damping gain and the sampling period to guarantee coordination by using the property of infinity products of stochastic matrices. When the conditions on the damping gain and the sampling period are satisfied, the first algorithm guarantees coordination on positions with a zero final velocity if the interaction graph has a directed spanning tree jointly while the second algorithm guarantees coordination on positions with a constant final velocity if the interaction graph has a directed spanning tree at each time interval. Simulation results are presented to show the effectiveness of the theoretical results.     

Distributed containment control for Lagrangian networks with parametric uncertainties under a directed graph

In this paper, we study the distributed containment control problem for networked Lagrangian systems with multiple dynamic leaders in the presence of parametric uncertainties under a directed graph that characterizes the interaction among the leaders and the followers. We propose a distributed adaptive control algorithm combined with distributed sliding-mode estimators. A necessary and sufficient condition on the directed graph is presented such that all followers converge to the dynamic convex hull spanned by the dynamic leaders asymptotically. As a byproduct, we show a necessary and sufficient condition on leaderless consensus for networked Lagrangian systems under a directed graph. Numerical simulation results are given to show the effectiveness of the proposed control algorithms.     

Rigid formation control of double-integrator systems

In this paper, we study rigid formation control systems modelled by double integrators. Two kinds of double-integrator formation systems are considered, namely formation stabilisation systems and flocking control systems. Novel observations on the measurement requirement, the null space and eigenvalues of the system Jacobian matrix will be provided, which reveal important properties of system dynamics and the associated convergence results. We also establish some new links between single-integrator formation systems and double-integrator formation systems via a parameterised Hamiltonian system, which, in addition, provide novel stability criteria for different equilibria in double-integrator formation systems by using available results in single-integrator formation systems.     

Finite-time consensus for multi-agent networks with unknown inherent nonlinear dynamics

The objective of this paper is to analyze the finite-time convergence of a nonlinear but continuous consensus algorithm for multi-agent networks with unknown inherent nonlinear dynamics. Due to the existence of the unknown inherent nonlinear dynamics, the stability analysis and the finite-time convergence analysis are more challenging than those under the well-studied consensus algorithms for known linear systems. For this purpose, we propose a novel comparison based tool. By using this tool, it is shown that the proposed nonlinear consensus algorithm can guarantee finite-time convergence if the directed switching interaction graph has a directed spanning tree at each time interval. Specifically, the finite-time convergence is shown by comparing the closed-loop system under the proposed consensus algorithm with some well-designed closed-loop system whose stability properties are easier to obtain. Moreover, the stability and the finite-time convergence of the closed-loop system using the proposed consensus algorithm under a (general) directed switching interaction graph can even be guaranteed by the stability and the finite-time convergence of some well-designed nonlinear closed-loop system under some special directed switching interaction graph. This provides a stimulating example for the potential applications of the proposed comparison based tool in the stability analysis of linear/nonlinear closed-loop systems by making use of known results in linear/nonlinear systems.     

多智能体系统离散时间一致性问题中的参数设计

研究二阶多智能体系统在固定、有向通信拓扑条件下的离散时间一致性问题.针对每个智能体,采用基于速度、位置的分布式控制协议,分析速度、位置增益系数以及采样周期等参数对系统一致性的影响.结果表明,要实现二阶多智能体系统的一致性控制,在保持个体之间通信拓扑有生成树的同时,控制协议中的各个参数还必须满足一定的约束条件.系统拉普拉斯矩阵的特征值和采样周期对系统能否实现渐近一致起到了关键的作用.最后,给出一致性控制中参数设计的一种可行方法,并通过仿真对理论分析的正确性进行验证.     

带强连通分支的多智能体系统可控包含控制

研究有强连通子图拓扑结构的有向多智能体系统领导者选择及可控包含控制问题.根据网络拓扑结构,智能体被分为两类:单元智能体和一般智能体.首先设计强连通子图中个体组成的单元智能体的一致性协议实现各个单元的一致;后由单元智能体和一般智能体构成新的拓扑结构,结合复杂网络可控性理论与二分图最大匹配算法确定满足网络可控的最少领导者集合,并为所有智能个体设计相应的控制协议,驱使跟随者渐近收敛到多个领导者组成的动态凸包中,从而实现网络的可控包含控制.仿真结果验证了理论分析的正确性.