复杂分数阶多自主体系统的运动一致性

复杂环境中,许多自然现象的动力学特性不能应用整数阶方程描述,而只能用分数阶（非整数阶）动力学的智能个体合作行为来解释. 本文假设多自主体 系统存在个体差异,采用不同的分数阶动力学特性组成复杂分数混合阶微分方程. 应用分数阶系统的Laplace变换和频域理论,研究了有向网络拓扑下,时延分数混合阶多自主体系统的运动一致性. 由于整数阶系统是分数阶系统的特殊情况,本文的结论可以推广到整数阶与分数阶混合的多自主体系统中. 最后,应用仿真实例对本文结论进行了验证.     

分数阶奇异系统的Lie对称性与守恒量

对称性与守恒量可以简化动力学问题从而进一步求出力学系统的精确解,这样更加有利于研究动力学行为.分数阶模型相比于整数阶模型,能够描述复杂系统的动力学过程,因此在分数阶模型下研究对称性与守恒量是不可或缺的.首先介绍两个分数阶奇异系统,一个系统包含混合整数和Caputo分数阶导数,另一个系统仅含Caputo分数阶导数.由两个分数阶奇异系统分别给出两个分数阶固有约束,并给出对应的分数阶约束Hamilton方程.然后,基于微分方程在无限小变换下的不变性,给出了分数阶约束Hamilton方程Lie对称性的定义,导出了相应的确定方程,限制方程和附加限制方程.第三,建立并证明了两个分数阶约束Hamilton系统的Lie对称性定理,得到了相应的分数阶约束Hamilton系统的Lie守恒量.在特定条件下,本文所得结果可以退化为整数阶约束Hamilton系统的Lie守恒量.最后通过两个算例来说明此结果的应用.     

具有通信时延和输入时延的1阶多自主体系统的一致性问题

研究了同时具有时变通信时延和定常输入时延的1阶多自主体系统的一致性问题.假设多自主体系统的连接拓扑中各节点的输出度相等,采用变量代换将原多自主体系统的一致性问题转化为降阶系统的渐近稳定性问题.根据李亚普诺夫渐近稳定性定理以及线性矩阵不等式法,在通信时延导数信息已知和未知的情况下,分别得到了多自主体系统在静态和连通拓扑结构下渐近一致的充分条件,且该条件与通信时延和输入时延都相关.仿真结果验证了结论的有效性.     

多自由度拟不可积哈密顿系统的随机分数阶最优控制

推广了适用于分数阶系统控制的随机分数阶最优控制策略,提出了高斯白噪声激励下多自由度拟不可积哈密顿系统以响应最小化为目标的随机分数阶最优控制策略.首先,应用拟不可积哈密顿系统随机平均法,将受控系统简化为关于能量的部分平均伊藤方程.然后,将控制性能指标中关于控制力的部分表示为分数阶形式,结合随机动态规划原理,建立并求解部分平均系统的无界遍历控制的随机动态规划方程,获得了随机分数阶最优控制律.最后,采用一个算例验证了随机分数阶控制策略的控制效果和控制效率.研究表明,随机分数阶最优控制策略对传统的整数阶随机动力学系统同样适用,能比传统的整数阶控制策略取得更好的控制效果.另外,随着激励强度增加,整数阶控制策略的控制效率显著降低;而分数阶控制策略的控制效率虽比整数阶控制策略的控制效率略低,但随着激励强度的增加,分数阶控制策略的控制效率缓慢上升并趋于平稳,可以有效地缓解控制效率与控制效果之间的矛盾.     

分数阶时滞非线性多智能体系统的自适应控制

针对分数阶多智能体系统中存在时滞和非线性特性, 时滞往往会引起控制系统的性能下降甚至出现系统 不稳定等问题, 提出了一种含时滞非线性的分数阶多智能体系统自适应控制方法. 对于多智能体系统的控制协议, 设计了基于领导者和相邻智能体状态信息的自适应控制协议, 减小了过大常数控制增益带来的能源浪费. 对于一 致性, 利用图论基础、分数阶Halanay不等式稳定性定理、Kronecker积和Schur补引理, 获得了分数阶时滞非线性多 智能体系统的LMI一致性条件. 仿真结果验证了本文算法的正确性和有效性. 由于整数阶系统是分数阶系统的特殊 形式, 本文结论可以直接推广到整数阶多智能体系统中.     

离散时间系统的多智能体的一致性

动态多智能体系统的一致性是复杂动力学系统中很有现实意义的问题.假设智能体连接网络拓扑是无向,固定和连通的,而且个体之间信息传递存在通信时延,分析了一个动态移动多智能体离散时间系统.应用广义Nyquist判据研究具有通信时延的多智能体离散时间系统,得到了保证系统达到一致的充分条件.最后应用计算机仿真验证了该结论的有效性.

     

分数阶系统的分数阶PID控制器设计

对于一些复杂的实际系统,用分数阶微积分方程建模要比整数阶模型更简洁准确.分数阶微积分也为描述动态过程提供了一个很好的工具.对于分数阶模型需要提出相应的分数阶控制器来提高控制效果.本文针对分数阶受控对象,提出了一种分数阶PID控制器的设计方法.并用具体实例演示了对于分数阶系统模型,采用分数阶控制器比采用古典的PID控制器取得更好的效果.     

离散时间系统的多智能体的一致性

动态多智能体系统的一致性是复杂动力学系统中很有现实意义的问题.假设智能体连接网络拓扑是无向、固定和连通的,而且个体之间信息传递存在通信时廷,分析了一个动态移动多智能体离散时间系统.应用广义Nyquist判据研究具有通信时延的多智能体离散时间系统,得到了保证系统达到一致的充分条件.最后应用计算机仿真验证了该结论的有效性.     

一类分数阶四维混沌系统及其投影同步

提出了一个新的四维自治类新混沌系统.首先在整数阶下分析了该系统的基本动力学特性.并利用数值仿真、功率谱分析了当参数固定时,分数阶新混沌系统随微分算子阶数变化时的动力学特性.研究表明:当微分算子阶数为0.85时,分数阶新系统随参数变化经短暂混沌和边界转折点分叉而进入混沌.针对一类结构部分未知分数阶混沌系统,基于Cheby...     

具有领航者的时延多智能体系统的群集运动

计算机技术、网络技术和通信技术的飞速发展,推动着无人驾驶飞行器的编队控制、传感器网络的分布控制、卫星的姿态控制等多智能体系统的建模与应用的逐步深入,也吸引了越来越多的研究者致力于多智能体系统的动态编队控制的研究.研究了具有不同的通信时延和不同的输入时延的移动多智能体算法的群集运动.假设多智能体系统由n个智能体和1个Leader组成,网络连接拓扑是静态有向连通图,智能体Leader为拓扑图的全局可达节点.应用频率域的广义Nyquist判据分析了具有不同的通信时延和不同的输入时延的移动多智能体算法,应用Greshgorin圆盘定理和曲线的曲率理论研究了具有领航者的多智能体算法的群集运动,得到保证系统一致性的收敛条件.该一致性条件是一个应用节点局部信息的分散式条件,只与输入时延有关,而与通信时延无关.最后,通过计算机仿真验证了本文结论的有效性.     

Fractional discrete-time consensus models for single- and double-summator dynamics

The leader–following consensus problem of fractional-order multi-agent discrete-time systems is considered. In the systems, interactions between opinions are defined like in Krause and Cucker–Smale models but the memory is included by taking the fractional-order discrete-time operator on the left-hand side of the nonlinear systems. In this paper, we investigate fractional-order models of opinions for the single- and double-summator dynamics of discrete-time by analytical methods as well as by computer simulations. The necessary and sufficient conditions for the leader–following consensus are formulated by proposing a consensus control law for tracking the virtual leader.     

Consensus of networked multi-agent systems with communication delays based on the networked predictive control scheme

The consensus problem of discrete-time networked multi-agent systems (NMASs) with a communication delay is investigated in this article, where the dynamics of agents described by discrete-time linear time-invariant systems can be either uniform or non-uniform. For the NMASs with a directed topology and constant delay, a novel protocol based on the networked predictive control scheme is proposed to compensate for communication delay actively. Using algebraic graph theories and matrix theories, necessary and/or sufficient conditions of achieving consensus are obtained, which indicates that, under the proposed protocol, the consensus is independent of the network delay and only dominated by agents' dynamics and communication topology. Meanwhile, the protocol design and consensus analysis are also presented in the case of no network delay. Simulation results are further presented to demonstrate the effectiveness of theoretical results.     

Containment Control of Fractional Order Multi-Agent Systems With Time Delays

In complex environments, many distributed multiagent systems are described with the fractional-order dynamics. In this paper, containment control of fractional-order multiagent systems with multiple leader agents are studied. Firstly, the collaborative control of fractional-order multi-agent systems (FOMAS) with multiple leaders is analyzed in a directed network without delays. Then, by using Laplace transform and frequency domain theorem, containment consensus of networked FOMAS with time delays is investigated in an undirected network, and a critical value of delays is obtained to ensure the containment consensus of FOMAS. Finally, numerical simulations are shown to verify the results.      

Consensus Seeking for Discrete-time Multi-agent Systems with Communication Delay

This paper studies the consensus problem for discrete-time multi-agent systems of first-order in the presence of constant communication delay. Provided that the agent dynamics is unstable and the network topology is undirected, effects of two kinds of communication delays on consensus are investigated. When the relative information is affected by delay, we show that the effect of delay can be alleviated by using the historical input information in the protocol design. On the other hand, if the communication delay only influences the actually transmitted information, sufficient condition admitting any large yet bounded delay for consensus is obtained, and the delay in this case is allowed to be unknown and time-varying. Finally, simulation results are provided to demonstrate the effectiveness of the theoretical results.      

\begin{document}$H_\infty$\end{document} Consensus Control of Discrete-Time Multi-Agent Systems Under Network Imperfections and External Disturbance

This paper presents a distributed control protocol for consensus control of multi-agent systems (MASs) under external disturbances and network imperfections, including communication delay and random packet dropout. To comply with the discrete nature of networked systems, in contrast to most of the existing work for MASs under network imperfections, the agents are modeled by discrete-time dynamics. The communication network is considered to be undirected, its delay is considered to be time-varying but bounded, and its packet dropout is modeled by a Bernoulli distributed white sequence. Sufficient conditions in terms of linear matrix inequalities (LMIs) for asymptotic mean-square consensus stability are derived under network imperfections without considering external disturbances. A desired disturbance attenuation level in the presence of both external disturbances and network imperfections is also provided. A simulation example is given to verify the effectiveness of the proposed approach in coping with network imperfection and disturbances.      

Modified leader-following consensus of time-delay multi-agent systems via sampled control and smart leader

In this paper, the consensus problems of multiple agents with continuous-time single-integrator dynamics are studied, where each agent can obtain the position data of its neighboring agents at discrete-time points by using the periodic sampling technology and zero-order hold circuit. The smart leader is introduced, which can adjust the interaction strength between itself and the target point according to the state errors between itself and its neighboring followers. The modified leader-following consensus problem is defined as the leader-following consensus problem when the smart leader is adopted. Different leader-following consensus protocols are obtained for the multi-agent systems with or without sampling delays. The theoretical results, which are analysed with Lyapunov stability theory, can decrease the tracking error of the system, especially for the multi-agent systems with disturbance generated by actuator faults. Some simulation examples and real experiments are presented for illustration.     

A new framework for consensus for discrete-time directed networks of multi-agents with distributed delays

In this article, the distributed consensus problem is considered for discrete-time delayed networks of dynamic agents with fixed topologies, where the networks under investigation are directed and the time delays involved are distributed time delays including a single or multiple time delay(s) as special cases. By using the invariance principle of delay difference systems, a new unified framework is established to deal with the consensus for the discrete-time delayed multi-agent system. It is shown that the addressed discrete-time network with arbitrary distributed time delays reaches consensus provided that it is strongly connected. A numerical example is presented to illustrate the proposed methods.     

Controllability of discrete-time multi-agent systems with directed topology and input delay

This paper investigates the controllability of first-order and second-order discrete-time multi-agent systems with directed topology and input delay. The problem is studied in the leader–follower framework where a number of agents are selected to be leaders and serve as control inputs to all other agents. Sufficient and necessary conditions are derived for the controllability of first-order discrete-time multi-agent systems. With sampling period and feedback gain satisfying certain conditions, it is proved under three different protocols that the controllability of second-order discrete-time multi-agent systems is equivalent to that of a pair of submatrices of Laplacian matrix. In addition, the controllability of both first-order and second-order discrete-time multi-agent systems with input delay is shown, through some transformations, to be equivalent to that of the transformed non-delayed systems. Finally, some simulation examples are given to illustrate the theoretical results.     

Constrained consensus of discrete-time multi-agent systems with time delay

In this paper, we consider the consensus conditions for discrete-time multi-agent systems with communication delay between agents, subject to that each agent's state is constrained to lie in a given convex set. And we will present some consensus conditions for unconstrained multi-agent systems with time delay.