基于Multi-agents的智能变电站警报处理及故障诊断系统

针对传统变电站故障诊断的不足,在智能变电站架构的基础上,提出了基于multi-agents的智能变电站警报处理及故障诊断系统。根据智能变电站的体系结构、信息流和数据流特点,设计了警报处理、输变电设备诊断等主要功能模块,以此满足变电站事故分析各层次的功能需求。就警报处理和输变电设备故障诊断系统中各个agent及agent之间的协作机制等方面做了详细论述,实际变电站故障案例证明了该警报处理和输变电诊断模型的可行性和有效性。

基于Multi-Agents分布式医学诊断系统研究

医学诊断系统是一个新兴的复杂的应用系统,人工智能技术,计算机协作支持技术及高速通信网络体系结构的发展促进了计算机支持的诊断系统的发展.当前医学诊断系统的难点在于如何利用网络这个资源分布平台来获取所需要的数据及在数据不完整状态进行推理求解,而这些问题的解决在于能够有一种机制使得能在一个标准的应用系统结构中准确的表示并获取信息及集成各种医学资源使之相互协作.本文描述了一种利用多智能体(Multi-agents system,MAS)体系结构和中间件(middleware)技术如公共请求代理结构(Common Object Request Broker Architecture,CORBA)进行设计的分布式医学诊断系统.该系统能集成多种医学资源和医学应用实体并且能实现参与诊断的医学实体之间的协作,以减少由于信息缺乏而带来的诊断偏差.另外本文还将一种实验室开发的模糊最小最大神经网络(Fuzzy Min—Max Neural Network,FMMNN)的模糊规则提取方法应用于该系统以证实该分布式诊断系统的优越性.

基于multi-agents的网络防卫体系中预警定位系统的研究与实现

传统的网络安全措施,如加密认证、防火墙和入侵检测系统等,虽然在保护信息的保密性、完整性、可用性和控制访问方面有一定的效果,但在协同和预警方面依然存在不足。文章提出了1个基于multi-agents的网络安全防卫系统,该系统由协同预警定位系统、协同审计系统、安全隔离系统、事故恢复系统等多个模块构成,模块之间由多个多级分层agents来负责通信任务。系统控制中心的agent server负责控制和协调整个安全体系,制定全网统一的安全控制策略。在该系统中,整个网络被划分成不同级别的分区,建立不同级别的协同预警定位系统,各分区既相互协作,又能够独立自治,通过协作的方式共同维护着整个网络的安全。在IPv6环境下测试的结果表明,该系统可以高效进行预警,IDS的捕获率约为95%、漏报率小于6%、误报率小于7%。

基于Multi-Agents的多媒体信息检索引擎探讨

在介绍了数字图书馆等概念的基础上 ,简要地介绍了基于Multi Agents (MAS)的多媒体信息检索引擎在数字图书馆中的应用 ,并结合当前的研究状况 ,描述了基于MAS的多媒体信息检索引擎应用的光明未来。

基于Multi-agents系统的黑启动决策方法

在黑启动过程中,建立相应的发电机、母线及线路开关等分层主体,进行相互通信与协调控制,实时监测电力系统的状态变化,并采用Petri net算法进行优化建模,从而提出相应的故障恢复方案或是大停电状态下的黑启动方案。

Maintaining Complex Formations and Avoiding Obstacles for Multi-Agents

This paper researches some problems in complex formation for multi-agents,in which two matrices are proposed to record the formation.The pattern matrix is used to describe the pattern of the formation;meanwhile,the location matrix is used to record the location of each agent.Thus,all desired positions of each agent will be obtained by geometrical relationship on the basis of two matrices above.In addition a self-adaptation flocking algorithm is proposed to control all agents to form a desired formation and avoid obstacles.The main idea is as follows:agents will form a desired formation through the method of formation control when far away from obstacles;otherwise,agents will freely fly to pass through the area of obstacles.In the simulation,three scenarios are designed to verify the effectiveness of our method.The results show that our method also can be applied in three dimensions.All agents will form a stable formation and keep the same velocity at last.

Distributed Consensus of High-Order Multi-Agents with Nonlinear Dynamics

This paper deals with the distributed consensus problem of high-order multi-agent systems with nonlinear dynamics subject to external disturbances. The network topology is assumed to be a fixed undirected graph. Some sufficient conditions are derived, under which the consensus can be achieved with a prescribed norm bound. It is shown that the parameter matrix in the consensus algorithm can be designed by solving two linear matrix inequalities (LMIs). In particular, if the nonzero eigenvalues of the laplacian matrix ac-cording to the network topology are identical, the parameter matrix in the consensus algorithm can be de-signed by solving one LMI. A numerical example is given to illustrate the proposed results.

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

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

UAV-Assisted Dynamic Avatar Task Migration for Vehicular Metaverse Services: A Multi-Agent Deep Reinforcement Learning Approach

Avatars, as promising digital representations and service assistants of users in Metaverses, can enable drivers and passengers to immerse themselves in 3D virtual services and spaces of UAV-assisted vehicular Metaverses. However, avatar tasks include a multitude of human-to-avatar and avatar-to-avatar interactive applications, e.g., augmented reality navigation,which consumes intensive computing resources. It is inefficient and impractical for vehicles to process avatar tasks locally. Fortunately, migrating avatar tasks to the nearest roadside units(RSU)or unmanned aerial vehicles(UAV) for execution is a promising solution to decrease computation overhead and reduce task processing latency, while the high mobility of vehicles brings challenges for vehicles to independently perform avatar migration decisions depending on current and future vehicle status. To address these challenges, in this paper, we propose a novel avatar task migration system based on multi-agent deep reinforcement learning(MADRL) to execute immersive vehicular avatar tasks dynamically. Specifically, we first formulate the problem of avatar task migration from vehicles to RSUs/UAVs as a partially observable Markov decision process that can be solved by MADRL algorithms. We then design the multi-agent proximal policy optimization(MAPPO) approach as the MADRL algorithm for the avatar task migration problem. To overcome slow convergence resulting from the curse of dimensionality and non-stationary issues caused by shared parameters in MAPPO, we further propose a transformer-based MAPPO approach via sequential decision-making models for the efficient representation of relationships among agents. Finally, to motivate terrestrial or non-terrestrial edge servers(e.g., RSUs or UAVs) to share computation resources and ensure traceability of the sharing records, we apply smart contracts and blockchain technologies to achieve secure sharing management. Numerical results demonstrate that the proposed approach outperforms the MAPPO approach by around 2% and effectively reduces approximately 20% of the latency of avatar task execution in UAV-assisted vehicular Metaverses.

Dynamic event-triggered bipartite consensus for uncertain high-order nonlinearmulti-agentsystems

In this paper,the bipartite consensus problem is studied for a class of uncertain high-order nonlinear multi-agent systems.A signed digraph is presented to describe the collaborative and competitive interactions among agents.For each agent with lower triangular structure,a time-varying gain compensator is first designed by relative output information of neighboring agents.Subsequently,a distributed controller with dynamic event-triggered mechanism is proposed to drive the bipartite consensus error to zero.It is worth noting that an internal dynamic variable is introduced in triggering function,which plays an essential role in excluding the Zeno behavior and reducing energy consumption.Furthermore,the dynamic event-triggered control protocol is developed for upper triangular multi-agent systems to realize the bipartite consensus without Zeno behavior.Finally,simulation examples are provided to illustrate the effectiveness of the presented results.

Designing Proportional-Integral Consensus Protocols for Second-Order Multi-Agent Systems Using Delayed and Memorized State Information

This paper is concerned with consensus of a secondorder linear time-invariant multi-agent system in the situation that there exists a communication delay among the agents in the network.A proportional-integral consensus protocol is designed by using delayed and memorized state information.Under the proportional-integral consensus protocol,the consensus problem of the multi-agent system is transformed into the problem of asymptotic stability of the corresponding linear time-invariant time-delay system.Note that the location of the eigenvalues of the corresponding characteristic function of the linear time-invariant time-delay system not only determines the stability of the system,but also plays a critical role in the dynamic performance of the system.In this paper,based on recent results on the distribution of roots of quasi-polynomials,several necessary conditions for Hurwitz stability for a class of quasi-polynomials are first derived.Then allowable regions of consensus protocol parameters are estimated.Some necessary and sufficient conditions for determining effective protocol parameters are provided.The designed protocol can achieve consensus and improve the dynamic performance of the second-order multi-agent system.Moreover,the effects of delays on consensus of systems of harmonic oscillators/double integrators under proportional-integral consensus protocols are investigated.Furthermore,some results on proportional-integral consensus are derived for a class of high-order linear time-invariant multi-agent systems.

Finite-time Prescribed Performance Time-Varying Formation Control for Second-Order Multi-Agent Systems With Non-Strict Feedback Based on a Neural Network Observer

This paper studies the problem of time-varying formation control with finite-time prescribed performance for nonstrict feedback second-order multi-agent systems with unmeasured states and unknown nonlinearities.To eliminate nonlinearities,neural networks are applied to approximate the inherent dynamics of the system.In addition,due to the limitations of the actual working conditions,each follower agent can only obtain the locally measurable partial state information of the leader agent.To address this problem,a neural network state observer based on the leader state information is designed.Then,a finite-time prescribed performance adaptive output feedback control strategy is proposed by restricting the sliding mode surface to a prescribed region,which ensures that the closed-loop system has practical finite-time stability and that formation errors of the multi-agent systems converge to the prescribed performance bound in finite time.Finally,a numerical simulation is provided to demonstrate the practicality and effectiveness of the developed algorithm.

Hyperbolic Tangent Function-Based Protocols for Global/Semi-Global Finite-Time Consensus of Multi-Agent Systems

This paper investigates the problem of global/semi-global finite-time consensus for integrator-type multi-agent sys-tems.New hyperbolic tangent function-based protocols are pro-posed to achieve global and semi-global finite-time consensus for both single-integrator and double-integrator multi-agent systems with leaderless undirected and leader-following directed commu-nication topologies.These new protocols not only provide an explicit upper-bound estimate for the settling time,but also have a user-prescribed bounded control level.In addition,compared to some existing results based on the saturation function,the pro-posed approach considerably simplifies the protocol design and the stability analysis.Illustrative examples and an application demonstrate the effectiveness of the proposed protocols.

Targeted multi-agent communication algorithm based on state control

As an important mechanism in multi-agent interaction,communication can make agents form complex team relationships rather than constitute a simple set of multiple independent agents.However,the existing communication schemes can bring much timing redundancy and irrelevant messages,which seriously affects their practical application.To solve this problem,this paper proposes a targeted multiagent communication algorithm based on state control(SCTC).The SCTC uses a gating mechanism based on state control to reduce the timing redundancy of communication between agents and determines the interaction relationship between agents and the importance weight of a communication message through a series connection of hard-and self-attention mechanisms,realizing targeted communication message processing.In addition,by minimizing the difference between the fusion message generated from a real communication message of each agent and a fusion message generated from the buffered message,the correctness of the final action choice of the agent is ensured.Our evaluation using a challenging set of Star Craft II benchmarks indicates that the SCTC can significantly improve the learning performance and reduce the communication overhead between agents,thus ensuring better cooperation between agents.

An Improved Bounded Conflict-Based Search for Multi-AGV Pathfinding in Automated Container Terminals

As the number of automated guided vehicles(AGVs)within automated container terminals(ACT)continues to rise,conflicts have becomemore frequent.Addressing point and edge conflicts ofAGVs,amulti-AGVconflict-free path planning model has been formulated to minimize the total path length of AGVs between shore bridges and yards.For larger terminalmaps and complex environments,the grid method is employed to model AGVs’road networks.An improved bounded conflict-based search(IBCBS)algorithmtailored to ACT is proposed,leveraging the binary tree principle to resolve conflicts and employing focal search to expand the search range.Comparative experiments involving 60 AGVs indicate a reduction in computing time by 37.397%to 64.06%while maintaining the over cost within 1.019%.Numerical experiments validate the proposed algorithm’s efficacy in enhancing efficiency and ensuring solution quality.

Computation Tree Logic Model Checking of Multi-Agent Systems Based on Fuzzy Epistemic Interpreted Systems

Model checking is an automated formal verification method to verify whether epistemic multi-agent systems adhere to property specifications.Although there is an extensive literature on qualitative properties such as safety and liveness,there is still a lack of quantitative and uncertain property verifications for these systems.In uncertain environments,agents must make judicious decisions based on subjective epistemic.To verify epistemic and measurable properties in multi-agent systems,this paper extends fuzzy computation tree logic by introducing epistemic modalities and proposing a new Fuzzy Computation Tree Logic of Knowledge(FCTLK).We represent fuzzy multi-agent systems as distributed knowledge bases with fuzzy epistemic interpreted systems.In addition,we provide a transformation algorithm from fuzzy epistemic interpreted systems to fuzzy Kripke structures,as well as transformation rules from FCTLK formulas to Fuzzy Computation Tree Logic(FCTL)formulas.Accordingly,we transform the FCTLK model checking problem into the FCTL model checking.This enables the verification of FCTLK formulas by using the fuzzy model checking algorithm of FCTL without additional computational overheads.Finally,we present correctness proofs and complexity analyses of the proposed algorithms.Additionally,we further illustrate the practical application of our approach through an example of a train control system.

Performance Evaluation ofMulti-Agent Reinforcement Learning Algorithms

Multi-Agent Reinforcement Learning(MARL)has proven to be successful in cooperative assignments.MARL is used to investigate how autonomous agents with the same interests can connect and act in one team.MARL cooperation scenarios are explored in recreational cooperative augmented reality environments,as well as realworld scenarios in robotics.In this paper,we explore the realm of MARL and its potential applications in cooperative assignments.Our focus is on developing a multi-agent system that can collaborate to attack or defend against enemies and achieve victory withminimal damage.To accomplish this,we utilize the StarCraftMulti-Agent Challenge(SMAC)environment and train four MARL algorithms:Q-learning with Mixtures of Experts(QMIX),Value-DecompositionNetwork(VDN),Multi-agent Proximal PolicyOptimizer(MAPPO),andMulti-Agent Actor Attention Critic(MAA2C).These algorithms allow multiple agents to cooperate in a specific scenario to achieve the targeted mission.Our results show that the QMIX algorithm outperforms the other three algorithms in the attacking scenario,while the VDN algorithm achieves the best results in the defending scenario.Specifically,the VDNalgorithmreaches the highest value of battle wonmean and the lowest value of dead alliesmean.Our research demonstrates the potential forMARL algorithms to be used in real-world applications,such as controllingmultiple robots to provide helpful services or coordinating teams of agents to accomplish tasks that would be impossible for a human to do.The SMAC environment provides a unique opportunity to test and evaluate MARL algorithms in a challenging and dynamic environment,and our results show that these algorithms can be used to achieve victory with minimal damage.

Multi-agents modelling of EV purchase willingness based on questionnaires

Traditional experimental economics methods often consume enormous resources of qualified human participants,and the inconsistence of a participant’s decisions among repeated trials prevents investigation from sensitivity analyses.The problem can be solved if computer agents are capable of generating similar behaviors as the given participants in experiments.An experimental economics based analysis method is presented to extract deep information from questionnaire data and emulate any number of participants.Taking the customers’willingness to purchase electric vehicles(EVs)as an example,multi-layer correlation information is extracted from a limited number of questionnaires.Multiagents mimicking the inquired potential customers are modelled through matching the probabilistic distributions of their willingness embedded in the questionnaires.The authenticity of both the model and the algorithmis validated by comparing the agent-based Monte Carlo simulation results with the questionnaire-based deduction results.With the aid of agent models,the effects of minority agents with specific preferences on the results are also discussed.

基于Multi-Agent在炉渣厂生产中的应用研究

随着社会的发展和科技的进步,炉渣已经成为现今较为重要的生产原料。为了进一步提高炉渣的利用率,对炉渣生产车间的调度问题的研究成为当前主要的研究方向,同时也存在着重要的理论和价值。基于上述背景,在文章中使用了Multi-Agent系统,深入地研究了炉渣生产中的作业车间调度问题,并首次对Multi-Agent系统及其在生产车间调度中的使用状况做出了简要介绍,还首次提出了一种采用Multi-Agent系统黑板模型的炉渣生产车间调度方法,并定义了生产车间的管理Agent、工作单元管理Agent、任务管理Agent、事件Agent等的生产车间调度系统模式,并给出了通过黑板模型进行的作业车间调度管理框架,为提高炉渣厂的竞争力提供理论依据。

An Optimal Control-Based Distributed Reinforcement Learning Framework for A Class of Non-Convex Objective Functionals of the Multi-Agent Network

This paper studies a novel distributed optimization problem that aims to minimize the sum of the non-convex objective functionals of the multi-agent network under privacy protection, which means that the local objective of each agent is unknown to others. The above problem involves complexity simultaneously in the time and space aspects. Yet existing works about distributed optimization mainly consider privacy protection in the space aspect where the decision variable is a vector with finite dimensions. In contrast, when the time aspect is considered in this paper, the decision variable is a continuous function concerning time. Hence, the minimization of the overall functional belongs to the calculus of variations. Traditional works usually aim to seek the optimal decision function. Due to privacy protection and non-convexity, the Euler-Lagrange equation of the proposed problem is a complicated partial differential equation.Hence, we seek the optimal decision derivative function rather than the decision function. This manner can be regarded as seeking the control input for an optimal control problem, for which we propose a centralized reinforcement learning(RL) framework. In the space aspect, we further present a distributed reinforcement learning framework to deal with the impact of privacy protection. Finally, rigorous theoretical analysis and simulation validate the effectiveness of our framework.