基于Multi-Agent的无人机集群体系自主作战系统设计

针对无人集群自主作战体系设计中的关键问题,提出基于Multi-Agent的无人集群自主作战系统设计方法。建立无人集群各节点的Agent模型及其推演规则;对于仿真系统模块化和通用化的需求,设计系统互操作式接口和无人集群自主作战的交互关系;开展无人集群系统仿真推演验证。仿真结果表明,所提设计方案不仅能够有效开展并完成自主作战网络生成-集群演化-效能评估的全过程动态演示验证,而且能够通过重复随机试验进一步评估无人集群的协同作战效能,最后总结了集群协同作战的策略和经验。

Proto col Design for Output Consensus of Port-controlled Hamiltonian Multi-agent Systems

这份报纸调查控制港口的 Hamiltonian (PCH ) 多代理人系统的产量一致问题与修理并且切换的拓扑学。第一，一个分布式的组产量一致协议经由塑造方法全球性到达稳定性和组产量一致的能量被设计。第二，一个新分布式的控制协议被使用 PCH 系统的结构的性质建议。这个协议的优点是它能由构造一种虚拟邻居转变指导的图到未受指导的图。第三，一个控制协议被设计，扩大 LaSalle0s 不变性原则在联合连接的拓扑学条件下面为交换系统发展了让所有代理人当拓扑学正在切换时，到达输出一致。最后，有模拟的一些解说性的例子被提供表明在这份报纸设计的协议的有效性。

Secure Consensus Control for Multi-Agent Systems With Attacks and Communication Delays

This paper addresses the consensus problem for nonlinear multi-Agent systems suffering from attacks and communication delays. The network studied in this paper consists of two types of agents, namely, loyal agents and attack agents. The loyal agents update their states based on delayed state information exchanged with their neighbors. Meanwhile, the attack agents can strategically send messages with wrong values, or collude with other attack agents to disrupt the correct operation of the system. We design a novel delay robust secure consensus DRSC algorithm according to the neighboring nodes U2BC delayed information. Convergence analysis of the system under the protocol designed is provided by using Lyapunov-Krasovskii stability theory and Barbalat-like argument approach. Finally, an example and simulation results are presented to demonstrate the effectiveness of the algorithm. © 2014 Chinese Association of Automation.

Distributed Tracking Control of a Class of Multi-agent Systems in Non-affine Pure-feedback Form Under a Directed Topology

In this paper, we consider a consensus tracking problem of a class of networked multi-agent systems(MASs)in non-affine pure-feedback form under a directed topology. A distributed adaptive tracking consensus control scheme is constructed recursively by the backstepping method, graph theory,neural networks(NNs) and the dynamic surface control(DSC)approach. The key advantage of the proposed control strategy is that, by the DSC technique, it avoids "explosion of complexity"problem along with the increase of the degree of individual agents and thus the computational burden of the scheme can be drastically reduced. Moreover, there is no requirement for prior knowledge about system parameters of individual agents and uncertain dynamics by employing NNs approximation technology.We then further show that, in theory, the designed control policy guarantees the consensus errors to be cooperatively semi-globally uniformly ultimately bounded(CSUUB). Finally, two examples are presented to validate the effectiveness of the proposed control strategy.

Swarming behavior of multi-agent systems

We consider an anisotropic swarm model with an attraction/repulsion function and study its aggregation properties. It is shown that the swarm members will aggregate and eventually form a cohesive cluster of finite size around the swarm center in a finite time. Moreover, we extend our results to more general attraction/repulsion functions. Numerical simulations demonstrate that all agents will eventually enter into and remain in a bounded region around the swarm center which may exhibit complex spiral motion due to asymmetry of the coupling structure. The model in this paper is more general than isotropic swarms and our results provide further insight into the effect of the interaction pattern on individual motion in a swarm system.

LMI Consensus Condition for Discrete-time Multi-agent Systems

This paper examines a consensus problem in multiagent discrete-time systems, where each agent can exchange information only from its neighbor agents. A decentralized protocol is designed for each agent to steer all agents to the same vector. The design condition is expressed in the form of a linear matrix inequality. Finally, a simulation example is presented and a comparison is made to demonstrate the effectiveness of the developed methodology.

Hierarchical Distributed Control Design for Multi-agent Systems Using Approximate Simulation

在这份报纸，我们基于近似模拟为多代理人系统考虑一个层次控制图案。到还原剂复杂性，我们首先构造一个简单抽象系统指导代理人，然后，我们讨论在抽象系统和多重代理人之间的模拟关系。在这个抽象系统的帮助下，分布式的层次控制被建议完成一项协作任务。由普通 Lyapunov 功能的优点，我们与考虑到模拟功能交换多代理人拓扑学分析集体行为。

Finite-time consensus for leader-following multi-agent systems over switching network topologies

Finite-time consensus problem of the leader-following multi-agent system under switching network topologies is studied in this paper. Based on the graph theory, matrix theory, homogeneity with dilation, and LaSalle＇s invariance principle, the control protocol of each agent using local information is designed, and the detailed analysis of the leader- following finite-time consensus is provided. Some examples and simulation results are given to illustrate the effectiveness of the obtained theoretical results.

Cluster consensus of second-order multi-agent systems via pinning control

This paper investigates the cluster consensus problem for second-order multi-agent systems by applying the pinning control method to a small collection of the agents. Consensus is attained independently for different agent clusters according to the community structure generated by the group partition of the underlying graph and sufficient conditions for both cluster and general consensus are obtained by using results from algebraic graph theory and the LaSalle Invariance Principle. Finally, some simple simulations are presented to illustrate the technique.

Distributed Adaptive Cooperative Tracking of Uncertain Nonlinear Fractional-order Multi-agent Systems

In this paper, the leader-following tracking problem of fractional-order multi-agent systems is addressed. The dynamics of each agent may be heterogeneous and has unknown nonlinearities. By assumptions that the interaction topology is undirected and connected and the unknown nonlinear uncertain dynamics can be parameterized by a neural network, an adaptive learning law is proposed to deal with unknown nonlinear dynamics, based on which a kind of cooperative tracking protocols are constructed. The feedback gain matrix is obtained to solve an algebraic Riccati equation. To construct the fully distributed cooperative tracking protocols, the adaptive law is also adopted to adjust the coupling weight. With the developed control laws,we can prove that all signals in the closed-loop systems are guaranteed to be uniformly ultimately bounded. Finally, a simple simulation example is provided to illustrate the established result.

Distributed H_∞ control of multi-agent systems with directed networks

This paper studies the distributed H∞control problem of identical linear time invariant multi-agent systems subject to external disturbances. A directed graph containing a spanning tree is used to model the communication topology. Based on the relative states of the neighbor agents and a subset of absolute states of the agents, distributed static H∞controllers are proposed. The concept of an H∞performance region is extended to the directed graph situation. Then the results are used to solve the leader–follower H∞consensus problem. Sufficient conditions are proposed based on bounded real lemma and algebraic graph theory. The effectiveness of the theoretical results is illustrated via numerical simulations.

Fast consensus seeking for multi-agent systems

For multi-agent systems based on the local information,the agents automatically converge to a common consensus state and the convergence speed is determined by the algebraic connectivity of the communication network.To study fast consensus seeking problems of multi-agent systems in undirected networks,a consensus protocol is proposed which considers the average information of the agents＇ states in a certain time interval,and a consensus convergence criterion for the system is obtained.Based on the frequency-domain analysis and algebra graph theory,it is shown that if the time interval is chosen properly,then requiring the same maximum control effort the proposed protocol reaches consensus faster than the standard consensus protocol.Simulations are provided to demonstrate the effectiveness of these theoretical results.

Improvement for consensus performance of multi-agent systems based on delayed-state-derivative feedback

The delayed-state-derivative feedback （DSDF） is in- troduced into the existing consensus protocol to simultaneously improve the robustness to communication delay and accele- rate the convergence speed of achieving the consensus. The frequency-domain analysis, together with the algebra graph the- ory, is employed to derive the sufficient and necessary condition guaranteeing the average consensus. It is shown that introduc- ing the DSDF with the proper intensity in the existing consensus protocol can improve the robustness to communication delay. By analyzing the effect of DSDF on the closed-loop poles, this pa- per proves that for a supercritical-delay multi-agent system, this strategy can also accelerate the convergence speed of achieving the consensus with provided the proper intensity of the DSDE Simulations are provided to demonstrate the effectiveness of the theoretical results.

Guaranteed Cost Consensus for High-dimensional Multi-agent Systems With Time-varying Delays

Guaranteed cost consensus analysis and design problems for high-dimensional multi-agent systems with time varying delays are investigated. The idea of guaranteed cost con trol is introduced into consensus problems for high-dimensiona multi-agent systems with time-varying delays, where a cos function is defined based on state errors among neighboring agents and control inputs of all the agents. By the state space decomposition approach and the linear matrix inequality(LMI)sufficient conditions for guaranteed cost consensus and consensu alization are given. Moreover, a guaranteed cost upper bound o the cost function is determined. It should be mentioned that these LMI criteria are dependent on the change rate of time delays and the maximum time delay, the guaranteed cost upper bound is only dependent on the maximum time delay but independen of the Laplacian matrix. Finally, numerical simulations are given to demonstrate theoretical results.

Target Tracking and Obstacle Avoidance for Multi-agent Systems

This paper considers the problems of target tracking and obstacle avoidance for multi-agent systems. To solve the problem that multiple agents cannot effectively track the target while avoiding obstacle in dynamic environment, a novel control algorithm based on potential function and behavior rules is proposed. Meanwhile, the interactions among agents are also considered. According to the state whether an agent is within the area of its neighbors＇ influence, two kinds of potential functions are presented. Meanwhile, the distributed control input of each agent is determined by relative velocities as well as relative positions among agents, target and obstacle. The maximum linear speed of the agents is also discussed. Finally, simulation studies are given to demonstrate the performance of the proposed algorithm.

Multi-target pursuit formation of multi-agent systems

The main goal of this paper is to design a team of agents that can accomplish multi-target pursuit formation using a developed leader-follower strategy. It is supposed that every target can accept a certain number of agents. First, each agent can automatically choose its target based on the distance from the agent to the target and the number of agents accepted by the target. In view of the fact that all agents are randomly dispersed in the workplace at the initial time, we present a numbering strategy for them. During the movement of agents, not every agent can always obtain pertinent state information about the targets. So, a developed leader-follower strategy and a pursuit formation algorithm are proposed. Under the proposed method, agents with the same target can maintain a circle formation. Furthermore, it turns out that the pursuit formation algorithm for agents to the desired formation is convergent. Simulation studies are provided to illustrate the effectiveness of the proposed method.