有向切换拓扑下多智能体系统编队控制

针对多智能体系统编队形成过程中受lur'e型非线性项影响,并考虑降低系统通信要求,基于一致性理论,设计了分布式控制器,使得多智能体系统形成时变编队.利用Laplacian矩阵的特殊性质,对其进行分解,将多智能体系统的编队控制问题转化为低阶系统的稳定性问题.给出了切换拓扑的平均驻留时间概念,据此提供了一种设计分布式控制器...     

有向切换通信拓扑下多无人机分布式编队控制

本文对多无人机分布式时变编队控制问题进行了研究. 无人机之间的通信拓扑假定是有向和切换的. 基于 自身状态与邻居状态的相对局部信息构建了分布式编队控制器. 通过引入一个恰当的编队误差向量, 将有向切换 通信拓扑下的多无人机编队问题转化为一个切换系统的镇定问题. 基于Lyapunov稳定性分析方法得到了达成编队 的充分性条件. 仿真实验结果验证了结论的有效性.     

部分拓扑切换概率未知的移动传感网保性能一致性控制研究

本文研究了基于马尔科夫切换拓扑的移动传感网保性能一致性问题.网络拓扑切换由一般的马尔科夫链驱动,其初始和转移概率部分未知.切换拓扑集中的每个拓扑皆是带有树的有向拓扑图.借助定义包括接收、发送信息和控制输入的新的全局能耗函数,可以得到切换分布式一致性控制器集合.然后经过状态变换,一致性控制问题转化为减阶的马尔科夫跳跃系统的保性能问题.通过分析马尔科夫跳跃系统的稳定性,提出了可以同时计算次优的一致性控制器增益和次小能耗上界的算法.最后,通过数值仿真检验了控制器设计方法的性能.     

具有时延和切换拓扑的高阶离散时间多智能体系统鲁棒保性能一致性

研究存在参数不确定性的高阶离散时间多智能体系统在时延和联合连通切换通信拓扑条件下的鲁棒保性能一致性问题,给出一种线性一致性协议的设计方法.1）引入高阶离散时间不确定多智能体系统的鲁棒保性能一致性问题,定义基于智能体邻居状态误差和控制输入的保性能函数;2）通过构造合适的Lyapunov函数并利用离散时间系统稳定性理论,推导出一个使高阶离散时间不确定多智能体系统在该条件下获得保性能一致性的线性矩阵不等式（Linear matrix inequality,LMI）充分条件,并给出相应的保性能上界;3）以一致性序列的形式给出参数不确定条件下的高阶离散时间多智能体系统的一致性收敛结果;4）数值仿真验证了本文理论的正确性和有效性.     

移动机器人编队自修复的切换拓扑控制

针对机器人缺失后的移动机器人编队自修复问题, 构建了结合切换拓扑和交互动力模型的移动机器人编队模型, 通过分析机器人缺失后的拓扑变化情况, 提出了网络切换拓扑控制, 该算法利用递归实现自修复, 并且是收敛的. 通过设计相应的分布式算法, 本文将拓扑控制转化为基于局部交互的递归自修复个体控制, 证明了编队自修复个体控制的稳定性. 最后针对编队任务, 通过仿真验证了切换拓扑控制的有效性, 和其他方法比较具有低恢复时间和低功率消耗的优点.     

分布式离散多智能体系统在固定和切换拓扑下的编队控制

研究多智能体系统在分布式采样控制下固定拓扑和时变通信拓扑时的追踪和编队问题. 首先分析目标系统 在没有输入时的稳定性; 然后分别给出在固定和时变通信拓扑下使各智能体完成追踪和编队的控制协议, 并给出了系统稳定时采样间隔需满足条件的充分性和必要性证明; 最后通过仿真研究验证了所提出算法的有效性.

     

切换拓扑下测量受限多智能体系统一致性迭代学习控制

针对通信拓扑至少含有一个沿迭代轴的联合生成树且同时沿有限时间轴和无限迭代轴切换的情况,文本研究了存在测量受限的连续线性多智能体系统输出一致性迭代学习控制问题.首先,文章采用迭代学习控制方法设计了一种基于跟随者局部信息的分布式输出一致性协议.然后,给出了系统可解输出一致性问题的两个充分性条件,其中之一可使跟随者实时获取迭代学习增益,避免了全局信息对学习增益设计的影响,且保证了算法的分布式实现.接着,利用λ范数理论和圆盘定理严格证明了所设计算法的收敛性.最后,通过实例仿真验证了所得结论的有效性.     

一类线性切换广义系统的保性能控制

针对一类线性切换广义系统,研究了其在任意切换策略下的保性能控制问题。结合一个二次型性能指标,利用单Lyapunov函数方法和线性矩阵不等式(LMI)技术,给出了状态反馈保性能控制器存在的一个充分条件,使得相应的闭环切换广义系统保持正则、稳定和无脉冲,且闭环性能指标值不超过某个确定上界。并进一步将保性能控制器的设计问题转化为线性矩阵不等式的可行解问题,使得控制器的设计更加简便,易于操作。这个条件可以通过Matlab的LMI工具箱求解,适合在工程中应用。数值仿真例子说明了该方法的有效性。     

一类不确定切换模糊时滞系统的保性能控制

针对一类存在时滞的不确定切换模糊系统,研究系统的保性能控制问题.利用平行分布补偿算法(PDC)给出保性能控制器的设计方法,利用单Lyapunov函数方法和多Lyapunov函数方法,给出不确定切换模糊时滞系统保性能控制器存在的充分条件和切换律设计.使得闭环系统对所有允许的不确定,在所设计的控制器和切换律下实现保性能控制.仿真结果表明方法的有效性.     

不确定离散切换系统具有极点约束的保性能控制

对一类含有范数有界不确定性的离散切换系统和一个二次型性能指标,研究其具有闭环极点约束的鲁棒状态反馈保性能控制问题．利用二次Lyapunov函数方法和线性矩阵不等式技术,给出了鲁棒保性能控制器存在的一个充分条件,在所构造切换规则下,闭环系统二次D稳定,且满足给定的性能指标．在此基础上,将次优保性能控制器设计问题转化为一组线性矩阵不等式约束下的凸优化问题．数值例子说明了所提方法的有效性．     

Distributed admissible consensus control for singular swarm systems with switching topologies

The interaction topologies of swarm systems may be time varying due to the motions of agents or the failure of communication equipment. The current paper focuses on admissible consensus analysis and design problems for singular swarm systems with switching topologies. Admissible consensus analysis problems are converted into admissible ones of a reduced‐order switching subsystem by the state projection on the consensus subspace and the complement consensus subspace. Furthermore, an approach to determine the consensus function is proposed by the first equivalent form. Moreover, by the Riccati equation, admissible consensus design criteria are presented, which can guarantee the scalability of singular swarm systems because they are independent of the number of agents. Finally, numerical examples are presented to check the correctness of theoretical results. Copyright © 2014 John Wiley & Sons, Ltd.     

Intermittent observer-based consensus control for multi-agent systems with switching topologies

In this paper, we focus on the consensus problem for leaderless and leader–followers multi-agent systems with periodically intermittent control. The dynamics of each agent in the system is a linear system, and the interconnection topology among the agents is assumed to be switching. We assume that each agent can only share the outputs with its neighbours. Therefore, a class of distributed intermittent observer-based consensus protocols are proposed for each agent. First, in order to solve this problem, a parameter-dependent common Lyapunov function is constructed. Using this function, we prove that all agents can access a prescribed value, under the designed intermittent controller and observer, if there are suitable conditions on communication. Second, based on the investigation of the leader-following consensus problem, we design a new distributed intermittent observer-based protocol for each following agent. Finally, we provide an illustrative example to verify the effectiveness of the proposed approach.     

Time-varying formation control for unmanned aerial vehicles with switching interaction topologies

Time-varying formation control problems for unmanned aerial vehicle (UAV) swarm systems with switching interaction topologies are studied. Necessary and sufficient conditions for UAV swarm systems with switching interaction topologies to achieve predefined time-varying formations are proposed. Based on the common Lyapunov functional approach and algebraic Riccati equation technique, an approach to design the formation protocol is presented. An explicit expression of the formation reference function is derived to describe the macroscopic movement of the whole UAV formation. A quadrotor formation platform consisting of four quadrotors is introduced. Outdoor experiments are performed to demonstrate the effectiveness of the theoretical results.     

Formation control of singular multiagent systems with switching topologies

This paper is concerned with the time‐varying formation control problem for singular multiagent systems with switching topologies. First, in order to eliminate the pulse solution of singular systems and extend the formation function set, the distributed formation controller has been formulated based on the output information of the agents. Then, the explicit expression of formation position function is presented based on the impulse free and the equivalent transformation of singular multiagent systems. Next, the sufficient and necessary conditions of the feasibility of the formation function are provided. Moreover, the sufficient conditions of formation control of singular multiagent systems with switching topologies are presented and the algorithm is designed to solve the distributed controller. Finally, the validity of the proposed approaches is verified by numerical simulation in this paper.     

Group consensus control for heterogeneous multi-agent systems with fixed and switching topologies

In this paper, the group consensus problems of heterogeneous multi-agent systems with fixed and switching topologies are investigated. First, a class of distributed group consensus protocol is proposed for achieving the group consensus of heterogeneous multi-agent systems by using the neighbours’ information. Then, some corresponding sufficient conditions are obtained to guarantee the achievement of group consensus. Rigorous proofs are given by using graph theory, matrix theory and Lyapunov theory. Finally, numerical simulations are also given to verify the theoretical analysis.     

Time‐varying output formation control for linear multi‐agent systems with switching topologies

Time‐varying output formation control problems for linear multi‐agent systems with switching topologies are studied, where two types of switching topologies are considered: (1) the topology is undirected and jointly connected, and 2) each topology is directed and has a spanning tree. An output formation protocol under switching topologies is constructed using the outputs of neighboring agents via dynamic output feedback. Two algorithms are proposed to design the dynamic protocols under both jointly connected topologies and switching directed topologies. Time‐varying output formation feasibility conditions are given to describe the compatible relationship among the desired time‐varying output formation, the dynamics of each agent, and the switching topologies. The stability of the closed‐loop multi‐agent systems under the proposed two algorithms is investigated based on the common Lyapunov functional theory and the piecewise Lyapunov functional theory, respectively. In the case where the topologies are jointly connected, time‐varying output formation can be achieved for multi‐agent systems using the designed protocol if the given time‐varying output formation satisfies the feasible constraint. For the case where the switching topologies are directed and have a spanning tree, the time‐varying output formation can be realized if the output formation feasibility constraint is satisfied and the dwell time is larger than a positive threshold. Moreover, approaches to determine the output formation references are provided to describe the macroscopic movement of the time‐varying output formation. Finally, numerical simulation results are presented to demonstrate the effectiveness of the theoretical results. Copyright © 2016 John Wiley & Sons, Ltd.     

Distributed attitude synchronization control of multi-agent systems with switching topologies

This paper addresses the attitude synchronization problem in multi-agent systems with directed and switching interconnection topologies. Two cases for the synchronization problem are discussed under different assumptions about the measurable information. In the first case the agents can measure their rotations relative to a global reference coordinate frame, whilst in the second case they can only measure the relative rotations between each other. Two intuitive distributed control laws based on the axis–angle representations of the rotations are proposed for the two cases, respectively. The invariance of convex balls in SO(3)$SO\left(3\right)$ is guaranteed. Moreover, attitude synchronization is ensured under the well-known mild switching assumptions, the joint strong connection for the first case and joint quasi-strong connection for the second case. To show the effectiveness of the proposed control schemes, illustrative examples are provided.     

具有切换拓扑的多智能体系统协同控制的差分隐私保护

网络信息技术的不断发展与普及使得各类数据的发布采集变得方便与便捷, 但数据的直接发布势必会造成个网络信息的泄露和敏感信息的失密, 因此敏感信息的保护成为了各行各业关注的问题. 本文研究了基于固定拓扑和切换拓扑的多智能体系统协同控制的差分隐私保护问题, 将差分隐私算法与传统平均一致性算法结合, 提出了具有隐私保护的协同控制算法, 分析了隐私保护算法对分布式协同控制闭环系统稳定性的影响. 基于所提算法, 应用矩阵论和概率统计对隐私保护协同控制算法的收敛性和隐私性进行理论分析, 该算法可以保护智能个体的数据隐私, 同时可以使得系统运动实现均方一致. 在系统拓扑结构动态变化的情况下, 本文对该算法的收敛性和隐私性进行理论分析, 讨论了切换拓扑对隐私保护的影响. 最后的仿真示例验证了理论结果的正确性.