离散多智能体切换系统的二阶分组一致性研究

针对随机切换拓扑下离散多智能体系统的二阶分组一致性问题进行了研究。 设计了一种新颖的分组一致性协议,该协议不依赖于保守的假设条件,能全面反映系统中智能体在分组内与分组间的相互影响。引入马尔科夫链来模拟系统的随机拓扑变化, 基于矩阵理论和图论得到了在马尔科夫切换拓扑条件下,应用新协议使系统达到分组一致的充分条件。 在证明过程的结尾部分,使用线性不等式 (LMI) 工具给出了获取协议中控制参数的算法。最后,通过数字仿真实例证明了理论结果的有效性。     

H ∞ consensus control of multi-agent systems with switching topology: a dynamic output feedback protocol

This article is devoted to the consensus control for switching networks of multiple agents with linear coupling dynamics and subject to external disturbances, which is transformed into an H _∞ control problem by defining an appropriate controlled output. On this basis, a distributed dynamic output feedback protocol is proposed with an undetermined system matrix, and a condition in terms of linear matrix inequalities (LMIs) is derived to ensure consensus of the multi-agent system with a prescribed H _∞ level. Furthermore, system matrix of the protocol is designed by solving two LMIs. A numerical example is included to illustrate the effectiveness of the proposed consensus protocol.     

Fixed‐time sliding mode cooperative control for multiagent networks via event‐triggered strategy

In this article, the problem of event‐triggered‐based fixed‐time sliding mode cooperative control is addressed for a class of leader‐follower multiagent networks with bounded perturbation. First, a terminal integral sliding mode manifold with fast convergent speed is designed. Then, a distributed consensus tracking control strategy based on event‐triggered and sliding mode control is developed that guarantees the multiagent networks achieve consensus within a fixed time which is independent of initial states of agents in comparison with the finite‐time convergence. Furthermore, the update frequency of control law can be considerably reduced and Zeno behavior can be removed by utilizing the proposed event‐triggered control algorithm. Simulation examples are used to show the effectiveness of the new control protocol.     

Consensus problem of high‐order multi‐agent systems with external disturbances: An H∞ analysis approach

This paper is devoted to the output consensus problem of directed networks of multiple high‐order agents with external disturbances, and proposes a distributed protocol using the neighbors' measured outputs. By defining an appropriate controlled output and conducting a model transformation in two steps, consensus performance analysis of the multi‐agent system under the proposed protocol is transformed into a normal H_∞ problem. Then using H_∞ theory of linear systems, conditions are derived to ensure the consensus performance with a prescribed H_∞ index for networks with fixed and switching topologies, respectively. A numerical example of the formation control application is included to validate the theoretical results. Copyright © 2009 John Wiley & Sons, Ltd.     

Adaptive consensus protocol for networks of multiple agents with nonlinear dynamics using neural networks

In this paper, an adaptive protocol is proposed to solve the consensus problem of multi‐agent systems with high‐order nonlinear dynamics by using neural networks (NNs) to approximate the unknown nonlinear system functions. It is derived that all agents achieve consensus if the undirected interaction graph is connected, and the transient performance of the multi‐agent system is also investigated. It shows that the adaptive protocol and the consensus analysis can be easily extended to switching networks by the existing LaSalle's Invariance Principle of switched systems. A numerical simulation illustrates the effectiveness of the proposed consensus protocol. Copyright © 2011 John Wiley and Sons Asia Pte Ltd and Chinese Automatic Control Society     

Distributed adaptive consensus protocol with decaying gains

This article brings a distributed adaptive protocol for consensus and synchronization in multiagent systems on directed communication networks. Agents are modeled as general linear time‐invariant systems. The proposed protocol introduces a novel adaptation scheme allowing control coupling gains to decay to their reference values. This approach improves upon existing adaptive consensus protocols which may result in overly large or even unbounded coupling gains. The protocol design in this article does not rely on any centralized information; hence it is distributed. Nevertheless, the price to pay for this is the need to estimate those reference values. Convergence of the overall network dynamics is guaranteed for correctly estimated references; otherwise, the trajectory of the system is only uniformly ultimately bounded. Two estimation algorithms are proposed: one based on the interval‐halving method and the other based on a distributed estimation of Laplacian eigenvalues. Numerical simulations validate the proposed approach.     

Non-linear protocols for optimal distributed consensus in networks of dynamic agents

We consider stationary consensus protocols for networks of dynamic agents with fixed topologies. At each time instant, each agent knows only its and its neighbors’ state, but must reach consensus on a group decision value that is function of all the agents’ initial state. We show that the agents can reach consensus if the value of such a function is time-invariant when computed over the agents’ state trajectories. We use this basic result to introduce a non-linear protocol design rule allowing consensus on a quite general set of values. Such a set includes, e.g., any generalized mean of order p of the agents’ initial states. As a second contribution we show that our protocol design is the solution of individual optimizations performed by the agents. This notion suggests a game theoretic interpretation of consensus problems as mechanism design problems. Under this perspective a supervisor entails the agents to reach a consensus by imposing individual objectives. We prove that such objectives can be chosen so that rational agents have a unique optimal protocol, and asymptotically reach consensus on a desired group decision value. We use a Lyapunov approach to prove that the asymptotical consensus can be reached when the communication links between nearby agents define a time-invariant undirected network. Finally we perform a simulation study concerning the vertical alignment maneuver of a team of unmanned air vehicles.     

Distributed Average Consensus in Multi-agent Networks with Limited Bandwidth and Time-delays

This paper studies the distributed average consensus problem of multi-agent digital networks with time-delays. For the network, each agent can only exchange symbolic data with its neighbours. We provide a distributed average consensus protocol which uses the quantized and time-delay information. We consider two types of dynamic encoders/decoders in our protocol. One uses inverse proportion function as scaling function, while the other uses exponential function as scaling function. All agents can reach average consensus asymptotically with our protocol. Furthermore, we show that the average consensus protocol is robust to finite symmetric time-delays, but is sensitive to asymmetric time-delays that will destroy the average consensus of the networks. Finally, simulations are presented to illustrate validity of our theoretical results.      

Consensus of multi-agent systems based on sampled-data control

This article studies the consensus problem in directed networks, assuming that each agent is with double-integrator dynamics and only obtains the measurements of its positions relative to its neighbours at sampling instants. We propose a protocol based on sampled-data control and derive an equivalent characterisation of the solvability of the consensus problem under this protocol. In virtue of this equivalent characterisation, we further consider two cases: fixed topology and switching topology. For the first case, we present a set of sampling periods and feedback coefficients which ensure that the protocol can solve a consensus problem. For the second case, we derive sufficient conditions for the protocol to solve a consensus problem under arbitrary switching signals and under a class of switching signals, respectively. Finally, simulations are provided to illustrate the effectiveness of the theoretical results.     

基于nRF2401软件跳频协议的设计与实现

为解决射频收发器NRF2401在ISM频段内同频干扰,提高无线通信系统的通信质量和可靠性,提出了一种软件自适应跳频扩频协议。该协议充分利用nRF2401射频芯片多频点特性,使用软件程序设计将125个间隔为1 MHz的频道分成低、中、高三个频段,在无线信道受阻或同频干扰时,依据"低频-中频-高频"的循环顺序进行频道跳变。实验结果表明,工程机械仪表无线显示系统采用这种软件扩频协议设计,可以有效避免同频干扰和多点传输干扰,提高系统传输可靠性。