基于梯度估计的多智能体系统有限时间分布式优化

现有多智能体系统分布式优化算法大多具有渐近收敛速度,且要求系统的网络拓扑图为无向图或有向平衡图,在实际应用中具有一定的保守性.本文研究了具有强连通拓扑的多智能体系统有限时间分布式优化问题.首先,基于非光滑分析和Lyapunov稳定性理论设计了一个有限时间分布式梯度估计器.然后,基于该梯度估计器提出了一种适用于强连通有向图的有限时间分布式优化算法,实现了多智能体系统中智能体的状态在有限时间内一致收敛到全局最优状态值.与现有的有限时间分布式优化算法相比,新提出的有限时间优化算法适用于具有强连通拓扑的多智能体系统,放宽了系统对网络拓扑结构的要求.此外,本文基于Nussbaum函数方法对上述优化算法进行了拓展解决了含有未知高频增益符号的多智能体系统分布式优化问题.最后,通过仿真实例对提出的分布式优化算法的有效性进行了验证.     

A Framework for Coordinated Control of Multiagent Systems and Its Applications

In this paper, a framework is proposed for the distributed control and coordination of multiagent systems (MASs). In the proposed framework, the control of MASs is regarded as achieving decentralized control and coordination of agents. Each agent is modeled as a coordinated hybrid agent, which is composed of an intelligent coordination layer and a hybrid control layer. The intelligent coordination layer takes the coordination input, plant input, and workspace input. In the proposed framework, we describe the coordination mechanism in a domain-independent way, i.e., as simple abstract primitives in a coordination rule base for certain dependence relationships between the activities of different agents. The intelligent coordination layer deals with the planning, coordination, decision making, and computation of the agent. The hybrid control layer of the proposed framework takes the output of the intelligent coordination layer and generates discrete and continuous control signals to control the overall process. To verify the feasibility of the proposed framework, experiments for both heterogeneous and homogeneous MASs are implemented. The proposed framework is applied to a multicrane system, a multiple robot system, and a MAS consisting of an overhead crane, a mobile robot, and a robot manipulator. It is demonstrated that the proposed framework can model the three MASs. The agents in these systems are able to cooperate and coordinate to achieve a global goal. In addition, the stability of systems modeled using the proposed framework is also analyzed.     

联合连通拓扑下的二阶多自主体系统有限时间包容控制

针对具有多领航者的二阶网络化系统群集运动问题,提出了一种有限时间收敛的包容控制算法。在此基础上,运用现代控制理论、代数图论和矩阵论等分析工具对所提出的控制算法进行理论分析,得到了当通信拓扑为动态联合连通时,二阶网络化系统在有限时间内实现群集运动的收敛条件。通过此包容控制算法,使得系统在静态拓扑和联合连通条件下均在有限时间内收敛到目标区域内。最后,应用系统仿真验证了所得结论的正确性。     

Stable Flocking of Multiple Inertial Agents on Balanced Graphs

In this note, we consider the flocking of multiple agents which have significant inertias and evolve on a balanced information graph. Here, by flocking, we mean that all the agents move with a common velocity while keeping a certain desired internal group shape. We first show that flocking algorithms that neglect agents' inertial effect can cause unstable group behavior. To incorporate this inertial effect, we use the passive decomposition, which decomposes the closed-loop group dynamics into two decoupled systems: a shape system representing the internal group shape and a locked system describing the motion of the center-of-mass. Then, analyzing the locked and shape systems separately with the help of graph theory, we propose a provably stable flocking control law, which ensures that the internal group shape is exponentially stabilized to a desired one, while all the agents' velocities converge to the centroid velocity that is also shown to be time-invariant. This result still holds for slow-switching balanced information graphs. Simulation is performed to validate the theory.     

Adaptive Finite-time Consensus for Second-order Nonlinear Multi-agent Systems with Input Quantization

In this paper, the adaptive finite-time consensus (FTC) control problem of second-order nonlinear multi-agent systems (MASs) with input quantization and external disturbances is studied. With the help of finite time control technology, a novel distributed adaptive control protocol is constructed to achieve FTC performance for second-order nonlinear MASs by using the recursive method. The control input is quantized through a hysteresis quantizer, which reduces the communication rate of arbitrary two agents. The unknown functions are approximated by adopting the radial basis function neural networks. Under the consensus protocols and adaptive laws, it can be proved that velocity errors of arbitrary two agents reach a small region of zero in finite time as well as position errors. Finally, the effectiveness of the proposed method is illustrated via a simulation example.

     

基于事件驱动的多智能体有限时间分群一致控制

针对二阶线性多智能体系统的分群一致控制问题,考虑智能体通信拓扑同时包含协作和对抗关系,提出一种基于事件驱动控制的有限时间分布式领航跟随分群一致性算法,该算法可使多智能体系统在有限时间内实现分群一致,即各子组内的智能体实现状态一致,不同子组收敛至不同一致状态.采用事件驱动控制机制,设计事件驱动函数及事件触发条件,降低智能体控制器更新频率,减少系统能耗.基于代数图论和李雅普诺夫稳定性理论推导出系统的有限时间稳定性条件,通过巧妙构造Lyapunov函数,给出系统有限收敛时间的显式估计,同时证明在所提出的事件驱动机制下,每个智能体相邻触发时间间隔有严格的正下界,即避免了芝诺行为.仿真实验验证了所提出的有限时间事件驱动分群一致控制算法的有效性.     

Finite-time consensus algorithm for multi-agent systems with double-integrator dynamics

In this paper, we discuss the finite-time consensus problem for leaderless and leader–follower multi-agent systems with external disturbances. Based on the finite-time control technique, continuous distributed control algorithms are designed for these agents described by double integrators. Firstly, for the leaderless multi-agent systems, it is shown that the states of all agents can reach a consensus in finite time in the absence of disturbances. In the presence of disturbances, the steady-state errors of any two agents can reach a region in finite time. Secondly, for the leader–follower multi-agent systems, finite-time consensus algorithms are also designed based on distributed finite-time observers. Rigorous proof is given by using Lyapunov theory and graph theory. Finally, one example is employed to verify the efficiency of the proposed method.     

A distributed finite-time optimization algorithm for directed networks of continuous-time agents

This article proposes a new distributed finite-time optimization algorithm for agents under directed graphs. By employing the nonsmooth technique and graph theory, a distributed discontinuous algorithm for continuous-time agents subject to strongly convex local cost functions is first designed with a finite-time distributed estimator, where the gradients of the local cost functions are estimated in finite time. It is shown that for a strongly connected graph and arbitrary initial conditions, the proposed algorithms can achieve consensus, and the systems can converge to the optimal point in finite time. Then, a two-step approach is proposed to achieve finite-time optimization of high-order agents with disturbances under directed graphs. Finally, the validity of the proposed finite-time optimization algorithm is verified by two numerical examples.     

An overview on optimal flocking

The decentralized aggregate motion of many individual robots is known as robotic flocking. The study of robotic flocking has received considerable attention in the past twenty years. As we begin to deploy flocking control algorithms on physical multi-agent and swarm systems, there is an increasing necessity for rigorous promises on safety and performance. In this paper, we present an overview the literature focusing on optimization approaches to achieve flocking behavior that provide strong safety guarantees. We separate the literature into cluster and line flocking, and categorize cluster flocking with respect to the system-level objective, which may be realized by a reactive or planning control algorithm. We also categorize the line flocking literature by the energy-saving mechanism that is exploited by the agents. We present several approaches aimed at minimizing the communication and computational requirements in real systems via neighbor filtering and event-driven planning, and conclude with our perspective on the outlook and future research direction of optimal flocking as a field.     

A values‐driven self‐organization mechanism for automating multiagent coordination

In distributed and open environments, MASs (multiagent systems) generally have no mechanisms for prior coordination and self‐organization has been believed to be the necessary selection to achieve the coordination of agents. This paper first presents a values‐driven model for self‐organization in which the expected emergent properties of a system are specified as the social values while the social values are realized via implicitly inducing members to regulate their individual values and adjust their behaviors to fit the expectations of the system. Based on the values‐driven self‐organization, this paper proposes an automated coordination mechanism for decentralized MASs. In this mechanism, by indirectly changing the difficulties in acquiring resources (which may be delegated to some special agents since MASs generally do not have substantial bodies), MASs can lead agents to regulate their values to be consistent with the social values of MASs so that the coordination of MASs can spontaneously emerge from the local behaviors of agents. Finally, this paper implements a simulation traffic system using the coordination mechanism based on values‐driven self‐organization to validate the emergence of coordination among multiple agents.     

有限时间内的动车组群分布式协同巡航多智能体控制

本文研究了动车组群系统的移动闭塞协同巡航控制问题,通过设计有限时间分布式协同控制算法实现了多车高速协同巡航.算法取消了动车组中心控制单元,将单列动车组的每个动力单元视为一个智能体,不同动车组之间的智能体形成多智能体群系统.设计了动车组智能体有限时间分布式协同控制算法,该算法首先实现了单列动车组各个动力单元快速追踪到期望的速度,且保证车钩位移在安全范围内,其次该算法还能实现动车组群高速巡航等间距运行,提高了线路利用率的同时避免了碰撞.最后进行了理论分析,证明了算法的稳定性和有限时间收敛性,并提供了仿真结果验证了该算法的有效性.     

Hybrid consensus protocols: an impulsive dynamical system approach

In this article, we develop a novel hybrid control framework to address fast consensus seeking problems for multiagent dynamical systems. Specifically, we present hybrid distributed controller architectures for multiagent coordination to improve the transient performance of coordination tasks. The proposed controller architectures are predicated on some novel hybrid dynamic compensation structures involving the exchange of information between agents. A unique feature of the proposed framework is that the proposed controller architectures are hybrid and appear to achieve finite-time coordination, and hence significantly improve the transient performance of the closed-loop system. The overall closed-loop dynamics under any of these controller algorithms achieving consensus possesses discontinuous flows since the controller algorithms combine logical switchings with continuous dynamics, leading to impulsive differential equations. Several simulation results are provided to validate the proposed consensus protocols.     

基于连续时间的二阶多智能体分布式资源分配算法

针对二阶多智能体系统中的分布式资源分配问题, 本文设计两种连续时间算法. 基于KKT (Karush−Kuhn−Tucker, 卡罗需−库恩−塔克)优化条件, 第一种控制算法利用节点局部不等式及其梯度信息来约束节点状态. 与上述梯度方法不同, 第二种控制算法包括一致性梯度下降法和固定时间收敛映射算子, 其中固定时间收敛映射算子确保算法的节点状态在固定时间收敛到局部约束集, 一致性梯度下降法目的是确保节点迭代到资源分配问题最优解. 两种控制算法都对状态无初始值约束, 且控制参数都是常数. 利用凸优化理论和固定时间李雅普诺夫方法, 分别分析了上述控制策略在有向平衡网络条件下的渐近和指数收敛性. 最后通过数值仿真验证了所设计算法在一维和高维资源分配问题的有效性.     

A hybrid trust model using reinforcement learning and fuzzy logic

Multiagent systems (MASs) are increasingly popular for modeling distributed environments that are highly complex and dynamic, such as e‐commerce, smart buildings, and smart grids. Typically, agents assumed to be goal driven with limited abilities, which restrains them to working with other agents for accomplishing complex tasks. Trust is considered significant in MASs to make interactions effectively, especially when agents cannot assure that potential partners share the same core beliefs about the system or make accurate statements regarding their competencies and abilities. Due to the imprecise and dynamic nature of trust in MASs, we propose a hybrid trust model that uses fuzzy logic and Q‐learning for trust modeling. as an improvement over Q‐learning‐based trust evaluation. Q‐learning is used to estimate trust on the long term, fuzzy inferences are used to aggregate different trust factors, and suspension is used as a short‐term response to dynamic changes. The performance of the proposed model is evaluated using simulation. Simulation results indicate that the proposed model can help agents select trustworthy partners to interact with. It has a better performance compared to some of the popular trust models in the presence of misbehaving interaction partners.     

Finite-time consensus for multi-agent systems with globally bounded convergence time under directed communication graphs

In this paper, we study the finite-time consensus problems with globally bounded convergence time also known as fixed-time consensus problems for multi-agent systems subject to directed communication graphs. Two new distributed control strategies are proposed such that leaderless and leader-follower consensus are achieved with convergence time independent on the initial conditions of the agents. Fixed-time formation generation and formation tracking problems are also solved as the generalizations. Simulation examples are provided to demonstrate the performance of the new controllers.     

事件触发间歇通讯下多智能体系统的固定时间分布式优化

针对多智能体系统的分布式优化问题,提出一种新的事件触发非周期间歇通讯控制方法,并研究该控制方法下系统的固定时间收敛性.首先,考虑一类更一般的分布式优化问题,其优化目标是局部目标函数的凸组合.其次,为了减少控制过程中智能体之间的通讯花费,设计一种新的事件触发间歇控制协议.通过引入两个辅助动力系统,并运用固定时间稳定性理论、代数图论和不等式放缩技巧,证明智能体的状态在固定时间内达到一致并渐近收敛到优化问题的最优解.结合事件触发条件以及间歇控制机制,排除控制过程中的Zeno行为.最后,通过数值仿真验证所得结论的有效性.     

A recursive genetic framework for evolutionary decision-making in problems with high dynamism

Communication and coordination are the main cores for reaching a constructive agreement among multi-agent systems (MASs). Dividing the overall performance of MAS to individual agents may lead to group learning as opposed to individual learning, which is one of the weak points of MASs. This paper proposes a recursive genetic framework for solving problems with high dynamism. In this framework, a combination of genetic algorithm and multi-agent capabilities is utilised to accelerate team learning and accurate credit assignment. The argumentation feature is used to accomplish agent learning and the negotiation features of MASs are used to achieve a credit assignment. The proposed framework is quite general and its recursive hierarchical structure could be extended. We have dedicated one special controlling module for increasing convergence time. Due to the complexity of blackjack, we have applied it as a possible test bed to evaluate the system’s performance. The learning rate of agents is measured as well as their credit assignment. The analysis of the obtained results led us to believe that our robust framework with the proposed negotiation operator is a promising methodology to solve similar problems in other areas with high dynamism.     

On finite-time and fixed-time consensus algorithms for dynamic networks switching among disconnected digraphs

ABSTRACT

This paper aims to analyse the stability of a class of consensus algorithms with finite-time or fixed-time convergence for dynamic networks composed of agents with first-order dynamics. In particular, in the analysed class a single evaluation of a nonlinear function of the consensus error is performed per each node. The classical assumption of switching among connected graphs is dropped here, allowing to represent failures and intermittency in the communications between agents. Thus, conditions to guarantee finite and fixed-time convergence, even while switching among disconnected graphs, are provided. Moreover, the algorithms of the considered class are computationally simpler than previously proposed finite-time consensus algorithms for dynamic networks, which is an essential feature in scenarios with computationally limited nodes and energy efficiency requirements such as in sensor networks. Simulations illustrate the performance of the proposed consensus algorithms. In the presented scenarios, results show that the settling time of the considered algorithms grows slower than other consensus algorithms for dynamic networks as the number of nodes increases.     

Attitude‐synchronization flocking of multiple 3‐dimensional nonholonomic agents without position measurement

This paper studies the attitude‐synchronization flocking problem for multiple 3‐dimensional nonholonomic agents. By analyzing the nonlinearity of the nonholonomic model and invoking the neighbor‐based design principle, we develop a distributed linear control protocol with the local information from each agent and its neighbors in proximity, especially, no position measurement is employed. Based on max‐min and Lyapunov stability theory, the proposed distributed control protocol can ensure the 3 flocking rules and attitude synchronization meanwhile, if collision avoidance and communication connectivity are guaranteed at the initial time. Additionally, numerical simulations are provided to verify the theoretical results.     

Distributed Secondary Control and Optimal Power Sharing in Microgrids

We address the control problem of microgrids and present a fully distributed control system which consists of primary controller, secondary controller, and optimal active power sharing controller. Different from the existing control structure in microgrids, all these controllers are implemented as local controllers at each distributed generator. Thus, the requirement for a central controller is obviated. The performance analysis of the proposed control systems is provided, and the finite-time convergence properties for distributed secondary frequency and voltage controllers are achieved. Moreover, the distributed control system possesses the optimal active power sharing property. In the end, a microgrid test system is investigated to validate the effectiveness of the proposed control strategies.