This paper presents Dual Adaptive Neural Topology(Dual ANT),a distributed dual-network metaadaptive framework that enhances ant-colony-based multi-agent coordination with online introspection,adaptive parameter contro...This paper presents Dual Adaptive Neural Topology(Dual ANT),a distributed dual-network metaadaptive framework that enhances ant-colony-based multi-agent coordination with online introspection,adaptive parameter control,and privacy-preserving interactions.This approach improves standard Ant Colony Optimization(ACO)with two lightweight neural components:a forward network that estimates swarm efficiency in real time and an inverse network that converts these descriptors into parameter adaptations.To preserve the privacy of individual trajectories in shared pheromone maps,we introduce a locally differentially private pheromone update mechanism that adds calibrated noise to each agent’s pheromone deposit while preserving the efficacy of the global pheromone signal.The resulting systemenables agents to dynamically and autonomously adapt their coordination strategies under challenging and dynamic conditions,including varying obstacle layouts,uncertain target locations,and time-varying disturbances.Extensive simulations of large grid-based search tasks demonstrated that Dual ANT achieved faster convergence,higher robustness,and improved scalability compared to advanced baselines such asMulti-StrategyACO and Hierarchical ACO.The meta-adaptive feedback loop compensates for the performance degradation caused by privacy noise and prevents premature stagnation by triggering Levy flight exploration only when necessary.展开更多
Multi-agent reinforcement learning(MARL)has proven its effectiveness in cooperative multi-agent systems(MASs)but still faces issues on the curse of dimensionality and learning efficiency.The main difficulty is caused ...Multi-agent reinforcement learning(MARL)has proven its effectiveness in cooperative multi-agent systems(MASs)but still faces issues on the curse of dimensionality and learning efficiency.The main difficulty is caused by the strong inter-agent coupling nature embedded in an MARL problem,which is yet to be fully exploited in existing algorithms.In this work,we recognize a learning graph characterizing the dependence between individual rewards and individual policies.Then we propose a graph-based reward aggregation(GRA)method,which utilizes the inherent coupling relationship among agents to eliminate redundant information.Specifically,GRA passes information among cooperating agents through graph attention networks to obtain aggregated rewards that contribute to the fitting of the value function,making each agent learn a decentralized executable cooperation policy.In addition,we propose a variant of GRA,named GRA-decen,which achieves decentralized training and decentralized execution(DTDE)when each agent only has access to information of partial agents in the learning process.We conduct experiments in different environments and demonstrate the practicality and scalability of our algorithms.展开更多
With the advent of sixth-generation mobile communications(6G),space-air-ground integrated networks have become mainstream.This paper focuses on collaborative scheduling for mobile edge computing(MEC)under a three-tier...With the advent of sixth-generation mobile communications(6G),space-air-ground integrated networks have become mainstream.This paper focuses on collaborative scheduling for mobile edge computing(MEC)under a three-tier heterogeneous architecture composed of mobile devices,unmanned aerial vehicles(UAVs),and macro base stations(BSs).This scenario typically faces fast channel fading,dynamic computational loads,and energy constraints,whereas classical queuing-theoretic or convex-optimization approaches struggle to yield robust solutions in highly dynamic settings.To address this issue,we formulate a multi-agent Markov decision process(MDP)for an air-ground-fused MEC system,unify link selection,bandwidth/power allocation,and task offloading into a continuous action space and propose a joint scheduling strategy that is based on an improved MATD3 algorithm.The improvements include Alternating Layer Normalization(ALN)in the actor to suppress gradient variance,Residual Orthogonalization(RO)in the critic to reduce the correlation between the twin Q-value estimates,and a dynamic-temperature reward to enable adaptive trade-offs during training.On a multi-user,dual-link simulation platform,we conduct ablation and baseline comparisons.The results reveal that the proposed method has better convergence and stability.Compared with MADDPG,TD3,and DSAC,our algorithm achieves more robust performance across key metrics.展开更多
This paper addresses the consensus problem of nonlinear multi-agent systems subject to external disturbances and uncertainties under denial-ofservice(DoS)attacks.Firstly,an observer-based state feedback control method...This paper addresses the consensus problem of nonlinear multi-agent systems subject to external disturbances and uncertainties under denial-ofservice(DoS)attacks.Firstly,an observer-based state feedback control method is employed to achieve secure control by estimating the system's state in real time.Secondly,by combining a memory-based adaptive eventtriggered mechanism with neural networks,the paper aims to approximate the nonlinear terms in the networked system and efficiently conserve system resources.Finally,based on a two-degree-of-freedom model of a vehicle affected by crosswinds,this paper constructs a multi-unmanned ground vehicle(Multi-UGV)system to validate the effectiveness of the proposed method.Simulation results show that the proposed control strategy can effectively handle external disturbances such as crosswinds in practical applications,ensuring the stability and reliable operation of the Multi-UGV system.展开更多
Although quantum Bayesian networks provide a promising paradigm for multi-agent decision-making,their practical application faces two challenges in the noisy intermediate-scale quantum(NISQ)era.Limited qubit resources...Although quantum Bayesian networks provide a promising paradigm for multi-agent decision-making,their practical application faces two challenges in the noisy intermediate-scale quantum(NISQ)era.Limited qubit resources restrict direct application to large-scale inference tasks.Additionally,no quantum methods are currently available for multi-agent collaborative decision-making.To address these,we propose a hybrid quantum–classical multi-agent decision-making framework based on hierarchical Bayesian networks,comprising two novel methods.The first one is a hybrid quantum–classical inference method based on hierarchical Bayesian networks.It decomposes large-scale hierarchical Bayesian networks into modular subnetworks.The inference for each subnetwork can be performed on NISQ devices,and the intermediate results are converted into classical messages for cross-layer transmission.The second one is a multi-agent decision-making method using the variational quantum eigensolver(VQE)in the influence diagram.This method models the collaborative decision-making with the influence diagram and encodes the expected utility of diverse actions into a Hamiltonian and subsequently determines the intra-group optimal action efficiently.Experimental validation on the IonQ quantum simulator demonstrates that the hierarchical method outperforms the non-hierarchical method at the functional inference level,and the VQE method can obtain the optimal strategy exactly at the collaborative decision-making level.Our research not only extends the application of quantum computing to multi-agent decision-making but also provides a practical solution for the NISQ era.展开更多
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 eli...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.展开更多
This paper deals with the problem of designing robust sequential covariance intersection(SCI)fusion Kalman filter for the clustering multi-agent sensor network system with measurement delays and uncertain noise varian...This paper deals with the problem of designing robust sequential covariance intersection(SCI)fusion Kalman filter for the clustering multi-agent sensor network system with measurement delays and uncertain noise variances.The sensor network is partitioned into clusters by the nearest neighbor rule.Using the minimax robust estimation principle,based on the worst-case conservative sensor network system with conservative upper bounds of noise variances,and applying the unbiased linear minimum variance(ULMV)optimal estimation rule,we present the two-layer SCI fusion robust steady-state Kalman filter which can reduce communication and computation burdens and save energy sources,and guarantee that the actual filtering error variances have a less-conservative upper-bound.A Lyapunov equation method for robustness analysis is proposed,by which the robustness of the local and fused Kalman filters is proved.The concept of the robust accuracy is presented and the robust accuracy relations of the local and fused robust Kalman filters are proved.It is proved that the robust accuracy of the global SCI fuser is higher than those of the local SCI fusers and the robust accuracies of all SCI fusers are higher than that of each local robust Kalman filter.A simulation example for a tracking system verifies the robustness and robust accuracy relations.展开更多
Reinforcement Learning(RL)techniques are being studied to solve the Demand and Capacity Balancing(DCB)problems to fully exploit their computational performance.A locally gen-eralised Multi-Agent Reinforcement Learning...Reinforcement Learning(RL)techniques are being studied to solve the Demand and Capacity Balancing(DCB)problems to fully exploit their computational performance.A locally gen-eralised Multi-Agent Reinforcement Learning(MARL)for real-world DCB problems is proposed.The proposed method can deploy trained agents directly to unseen scenarios in a specific Air Traffic Flow Management(ATFM)region to quickly obtain a satisfactory solution.In this method,agents of all flights in a scenario form a multi-agent decision-making system based on partial observation.The trained agent with the customised neural network can be deployed directly on the corresponding flight,allowing it to solve the DCB problem jointly.A cooperation coefficient is introduced in the reward function,which is used to adjust the agent’s cooperation preference in a multi-agent system,thereby controlling the distribution of flight delay time allocation.A multi-iteration mechanism is designed for the DCB decision-making framework to deal with problems arising from non-stationarity in MARL and to ensure that all hotspots are eliminated.Experiments based on large-scale high-complexity real-world scenarios are conducted to verify the effectiveness and efficiency of the method.From a statis-tical point of view,it is proven that the proposed method is generalised within the scope of the flights and sectors of interest,and its optimisation performance outperforms the standard computer-assisted slot allocation and state-of-the-art RL-based DCB methods.The sensitivity analysis preliminarily reveals the effect of the cooperation coefficient on delay time allocation.展开更多
An intelligent manufacturing system is modeled currently from the viewpoint of manufacturing applications,and the network platform’s influence to manufacturing applications is not considered adequately.However any bo...An intelligent manufacturing system is modeled currently from the viewpoint of manufacturing applications,and the network platform’s influence to manufacturing applications is not considered adequately.However any bottleneck in service oriented architecture(SOA)for the manufacturing network can affect the agility of the IT environment.In this paper,to achieve a trade-off between manufacturing resources and network resources,the manufacturing network is modeled with multi-agent,in which two kinds of basic elements,the manufacturing application unit and the network carrier of manufacturing information,are presented.And their main characters are described by colored petri net.The manufacturing application model drives the network platform that inversely provides this application model technology supports.The proposed multi-agent system is demonstrated through an example integration scenario involving production plan,resources management and execution subsystems.And the result suggests that analyzing and designing the system architecture of networked manufacturing should give due attention to the operation system as well as manufacturing applications.展开更多
This paper studies consensus problems in weighted scale-free networks of asymmetrically coupled dynamical units, where the asymmetry in a given link is deter：mined by the relative degree of the involved nodes. It sho...This paper studies consensus problems in weighted scale-free networks of asymmetrically coupled dynamical units, where the asymmetry in a given link is deter：mined by the relative degree of the involved nodes. It shows that the asymmetry of interactions has a great effect on the consensus. Especially, when the interactions are dominant from higher- to lower-degree nodes, both the convergence speed and the robustness to communication delay are enhanced.展开更多
The multi-agent system is the optimal solution to complex intelligent problems. In accordance with the game theory, the concept of loyalty is introduced to analyze the relationship between agents' individual incom...The multi-agent system is the optimal solution to complex intelligent problems. In accordance with the game theory, the concept of loyalty is introduced to analyze the relationship between agents' individual income and global benefits and build the logical architecture of the multi-agent system. Besides, to verify the feasibility of the method, the cyclic neural network is optimized, the bi-directional coordination network is built as the training network for deep learning, and specific training scenes are simulated as the training background. After a certain number of training iterations, the model can learn simple strategies autonomously. Also,as the training time increases, the complexity of learning strategies rises gradually. Strategies such as obstacle avoidance, firepower distribution and collaborative cover are adopted to demonstrate the achievability of the model. The model is verified to be realizable by the examples of obstacle avoidance, fire distribution and cooperative cover. Under the same resource background, the model exhibits better convergence than other deep learning training networks, and it is not easy to fall into the local endless loop.Furthermore, the ability of the learning strategy is stronger than that of the training model based on rules, which is of great practical values.展开更多
This paper investigates the challenges associated with Unmanned Aerial Vehicle (UAV) collaborative search and target tracking in dynamic and unknown environments characterized by limited field of view. The primary obj...This paper investigates the challenges associated with Unmanned Aerial Vehicle (UAV) collaborative search and target tracking in dynamic and unknown environments characterized by limited field of view. The primary objective is to explore the unknown environments to locate and track targets effectively. To address this problem, we propose a novel Multi-Agent Reinforcement Learning (MARL) method based on Graph Neural Network (GNN). Firstly, a method is introduced for encoding continuous-space multi-UAV problem data into spatial graphs which establish essential relationships among agents, obstacles, and targets. Secondly, a Graph AttenTion network (GAT) model is presented, which focuses exclusively on adjacent nodes, learns attention weights adaptively and allows agents to better process information in dynamic environments. Reward functions are specifically designed to tackle exploration challenges in environments with sparse rewards. By introducing a framework that integrates centralized training and distributed execution, the advancement of models is facilitated. Simulation results show that the proposed method outperforms the existing MARL method in search rate and tracking performance with less collisions. The experiments show that the proposed method can be extended to applications with a larger number of agents, which provides a potential solution to the challenging problem of multi-UAV autonomous tracking in dynamic unknown environments.展开更多
In this paper,a resilient distributed control scheme against replay attacks for multi-agent networked systems subject to input and state constraints is proposed.The methodological starting point relies on a smart use ...In this paper,a resilient distributed control scheme against replay attacks for multi-agent networked systems subject to input and state constraints is proposed.The methodological starting point relies on a smart use of predictive arguments with a twofold aim:1)Promptly detect malicious agent behaviors affecting normal system operations;2)Apply specific control actions,based on predictive ideas,for mitigating as much as possible undesirable domino effects resulting from adversary operations.Specifically,the multi-agent system is topologically described by a leader-follower digraph characterized by a unique leader and set-theoretic receding horizon control ideas are exploited to develop a distributed algorithm capable to instantaneously recognize the attacked agent.Finally,numerical simulations are carried out to show benefits and effectiveness of the proposed approach.展开更多
This paper investigates the differentially private problem of the average consensus for a class of discrete-time multi-agent network systems(MANSs). Based on the MANSs,a new distributed differentially private consensu...This paper investigates the differentially private problem of the average consensus for a class of discrete-time multi-agent network systems(MANSs). Based on the MANSs,a new distributed differentially private consensus algorithm(DPCA) is developed. To avoid continuous communication between neighboring agents, a kind of intermittent communication strategy depending on an event-triggered function is established in our DPCA. Based on our algorithm, we carry out the detailed analysis including its convergence, its accuracy, its privacy and the trade-off between the accuracy and the privacy level, respectively. It is found that our algorithm preserves the privacy of initial states of all agents in the whole process of consensus computation. The trade-off motivates us to find the best achievable accuracy of our algorithm under the free parameters and the fixed privacy level. Finally, numerical experiment results testify the validity of our theoretical analysis.展开更多
In this paper, the finite-time consensus of a leader-following multi-agent network with non-identical nonlinear dynamics and time-varying topologies is investigated. All the agents, especially the leaders, have non-id...In this paper, the finite-time consensus of a leader-following multi-agent network with non-identical nonlinear dynamics and time-varying topologies is investigated. All the agents, especially the leaders, have non-identical and nonlinear dynamics. According to the algebraic graph theory, Lyapunov stability theory and Kronecker product, a control strategy strategy is established to guarantee the finite-time consensus of multi-agent network with multiple leaders. Furthermore, several numerical simulations illustrate the effectiveness and feasibility of the proposed method.展开更多
This paper investigates the distributed fault-tolerant containment control(FTCC)problem of nonlinear multi-agent systems(MASs)under a directed network topology.The proposed control framework which is independent on th...This paper investigates the distributed fault-tolerant containment control(FTCC)problem of nonlinear multi-agent systems(MASs)under a directed network topology.The proposed control framework which is independent on the global information about the communication topology consists of two layers.Different from most existing distributed fault-tolerant control(FTC)protocols where the fault in one agent may propagate over network,the developed control method can eliminate the phenomenon of fault propagation.Based on the hierarchical control strategy,the FTCC problem with a directed graph can be simplified to the distributed containment control of the upper layer and the fault-tolerant tracking control of the lower layer.Finally,simulation results are given to demonstrate the effectiveness of the proposed control protocol.展开更多
In this paper, the problems of target tracking and obstacle avoidance for multi-agent networks with input constraints are investigated. When there is a moving obstacle, the control objectives are to make the agents tr...In this paper, the problems of target tracking and obstacle avoidance for multi-agent networks with input constraints are investigated. When there is a moving obstacle, the control objectives are to make the agents track a moving target and to avoid collisions among agents. First, without considering the input constraints, a novel distributed controller can be obtained based on the potential function. Second, at each sampling time, the control algorithm is optimized. Furthermore, to solve the problem that agents cannot effectively avoid the obstacles in dynamic environment where the obstacles are moving, a new velocity repulsive potential is designed. One advantage of the designed control algorithm is that each agent only requires local knowledge of its neighboring agents. Finally, simulation results are provided to verify the effectiveness of the proposed approach.展开更多
Electric power is widely used as the main energy source of ship integrated power system(SIPS), which contains power network and electric power network. SIPS network reconfiguration is a non-linear large-scale problem....Electric power is widely used as the main energy source of ship integrated power system(SIPS), which contains power network and electric power network. SIPS network reconfiguration is a non-linear large-scale problem. The reconfiguration solution influences the safety and stable operation of the power system. According to the operational characteristics of SIPS, a simplified model of power network and a mathematical model for network reconfiguration are established. Based on these models, a multi-agent and ant colony optimization(MAACO) is proposed to solve the problem of network reconfiguration. The simulations are carried out to demonstrate that the optimization method can reconstruct the integrated power system network accurately and efficiently.展开更多
This paper is concerned with distributed containment maneuvering of second-order Multi-Input Multi-Output(MIMO)multi-agent systems with non-periodic communication and actuation.The agent is subject to unmatched nonlin...This paper is concerned with distributed containment maneuvering of second-order Multi-Input Multi-Output(MIMO)multi-agent systems with non-periodic communication and actuation.The agent is subject to unmatched nonlinear dynamics and external disturbances.Event-triggered containment maneuvering control methods is developed based on a modular design.Specifically,an estimator module is constructed based on neural networks and the nonperiodic obtained follower information through event-triggered communication.Next,a controller module is designed by using the identified information from the estimator module and a third-order linear tracking differentiator.An event-triggered mechanism is introduced for updating the actuator.Then,a path update law is designed based on the non-periodic leader information through event-triggered communication.The closed-loop system cascaded by the estimation subsystem and control subsystem is proved to be input-to-state stable,and Zeno behavior is excluded in the control process.The proposed method is capable of reducing the consumption of communication and actuation.A simulation example is provided to substantiate the effectiveness of the proposed event-triggered control method for distributed containment maneuvering of second-order MIMO multi-agent systems.展开更多
Inspired by the immune theory and multi-agent systems, an immune multi-agent active defense model for network intrusion is established. The concept of immune agent is introduced, and its running mechanism is establish...Inspired by the immune theory and multi-agent systems, an immune multi-agent active defense model for network intrusion is established. The concept of immune agent is introduced, and its running mechanism is established. The method, which uses antibody concentration to quantitatively describe the degree of intrusion danger, is presented. This model implements the multi-layer and distributed active defense mechanism for network intrusion. The experiment results show that this model is a good solution to the network security defense.展开更多
基金funded by the Deanship of Scientific Research at Northern Border University,Arar,Saudi Arabia,under project number NBU-FFR-2026-2441-02.
文摘This paper presents Dual Adaptive Neural Topology(Dual ANT),a distributed dual-network metaadaptive framework that enhances ant-colony-based multi-agent coordination with online introspection,adaptive parameter control,and privacy-preserving interactions.This approach improves standard Ant Colony Optimization(ACO)with two lightweight neural components:a forward network that estimates swarm efficiency in real time and an inverse network that converts these descriptors into parameter adaptations.To preserve the privacy of individual trajectories in shared pheromone maps,we introduce a locally differentially private pheromone update mechanism that adds calibrated noise to each agent’s pheromone deposit while preserving the efficacy of the global pheromone signal.The resulting systemenables agents to dynamically and autonomously adapt their coordination strategies under challenging and dynamic conditions,including varying obstacle layouts,uncertain target locations,and time-varying disturbances.Extensive simulations of large grid-based search tasks demonstrated that Dual ANT achieved faster convergence,higher robustness,and improved scalability compared to advanced baselines such asMulti-StrategyACO and Hierarchical ACO.The meta-adaptive feedback loop compensates for the performance degradation caused by privacy noise and prevents premature stagnation by triggering Levy flight exploration only when necessary.
基金supported in part by the National Natural Science Foundation of China(grants 62203073 and 62573068)the Natural Science Foundation of Chongqing,China(grant CSTB2022NSCQMSX0577)。
文摘Multi-agent reinforcement learning(MARL)has proven its effectiveness in cooperative multi-agent systems(MASs)but still faces issues on the curse of dimensionality and learning efficiency.The main difficulty is caused by the strong inter-agent coupling nature embedded in an MARL problem,which is yet to be fully exploited in existing algorithms.In this work,we recognize a learning graph characterizing the dependence between individual rewards and individual policies.Then we propose a graph-based reward aggregation(GRA)method,which utilizes the inherent coupling relationship among agents to eliminate redundant information.Specifically,GRA passes information among cooperating agents through graph attention networks to obtain aggregated rewards that contribute to the fitting of the value function,making each agent learn a decentralized executable cooperation policy.In addition,we propose a variant of GRA,named GRA-decen,which achieves decentralized training and decentralized execution(DTDE)when each agent only has access to information of partial agents in the learning process.We conduct experiments in different environments and demonstrate the practicality and scalability of our algorithms.
文摘With the advent of sixth-generation mobile communications(6G),space-air-ground integrated networks have become mainstream.This paper focuses on collaborative scheduling for mobile edge computing(MEC)under a three-tier heterogeneous architecture composed of mobile devices,unmanned aerial vehicles(UAVs),and macro base stations(BSs).This scenario typically faces fast channel fading,dynamic computational loads,and energy constraints,whereas classical queuing-theoretic or convex-optimization approaches struggle to yield robust solutions in highly dynamic settings.To address this issue,we formulate a multi-agent Markov decision process(MDP)for an air-ground-fused MEC system,unify link selection,bandwidth/power allocation,and task offloading into a continuous action space and propose a joint scheduling strategy that is based on an improved MATD3 algorithm.The improvements include Alternating Layer Normalization(ALN)in the actor to suppress gradient variance,Residual Orthogonalization(RO)in the critic to reduce the correlation between the twin Q-value estimates,and a dynamic-temperature reward to enable adaptive trade-offs during training.On a multi-user,dual-link simulation platform,we conduct ablation and baseline comparisons.The results reveal that the proposed method has better convergence and stability.Compared with MADDPG,TD3,and DSAC,our algorithm achieves more robust performance across key metrics.
基金The National Natural Science Foundation of China(W2431048)The Science and Technology Research Program of Chongqing Municipal Education Commission,China(KJZDK202300807)The Chongqing Natural Science Foundation,China(CSTB2024NSCQQCXMX0052).
文摘This paper addresses the consensus problem of nonlinear multi-agent systems subject to external disturbances and uncertainties under denial-ofservice(DoS)attacks.Firstly,an observer-based state feedback control method is employed to achieve secure control by estimating the system's state in real time.Secondly,by combining a memory-based adaptive eventtriggered mechanism with neural networks,the paper aims to approximate the nonlinear terms in the networked system and efficiently conserve system resources.Finally,based on a two-degree-of-freedom model of a vehicle affected by crosswinds,this paper constructs a multi-unmanned ground vehicle(Multi-UGV)system to validate the effectiveness of the proposed method.Simulation results show that the proposed control strategy can effectively handle external disturbances such as crosswinds in practical applications,ensuring the stability and reliable operation of the Multi-UGV system.
基金supported by the National Natural Science Foundation of China(Grant Nos.62473371 and 61673389)。
文摘Although quantum Bayesian networks provide a promising paradigm for multi-agent decision-making,their practical application faces two challenges in the noisy intermediate-scale quantum(NISQ)era.Limited qubit resources restrict direct application to large-scale inference tasks.Additionally,no quantum methods are currently available for multi-agent collaborative decision-making.To address these,we propose a hybrid quantum–classical multi-agent decision-making framework based on hierarchical Bayesian networks,comprising two novel methods.The first one is a hybrid quantum–classical inference method based on hierarchical Bayesian networks.It decomposes large-scale hierarchical Bayesian networks into modular subnetworks.The inference for each subnetwork can be performed on NISQ devices,and the intermediate results are converted into classical messages for cross-layer transmission.The second one is a multi-agent decision-making method using the variational quantum eigensolver(VQE)in the influence diagram.This method models the collaborative decision-making with the influence diagram and encodes the expected utility of diverse actions into a Hamiltonian and subsequently determines the intra-group optimal action efficiently.Experimental validation on the IonQ quantum simulator demonstrates that the hierarchical method outperforms the non-hierarchical method at the functional inference level,and the VQE method can obtain the optimal strategy exactly at the collaborative decision-making level.Our research not only extends the application of quantum computing to multi-agent decision-making but also provides a practical solution for the NISQ era.
基金the National Natural Science Foundation of China(62203356)Fundamental Research Funds for the Central Universities of China(31020210502002)。
文摘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.
基金Supported by National Natural Science Foundation of China(60874063)Innovation and Scientific Research Foundation of Graduate Student of Heilongjiang Province(YJSCX2012-263HLJ)
文摘This paper deals with the problem of designing robust sequential covariance intersection(SCI)fusion Kalman filter for the clustering multi-agent sensor network system with measurement delays and uncertain noise variances.The sensor network is partitioned into clusters by the nearest neighbor rule.Using the minimax robust estimation principle,based on the worst-case conservative sensor network system with conservative upper bounds of noise variances,and applying the unbiased linear minimum variance(ULMV)optimal estimation rule,we present the two-layer SCI fusion robust steady-state Kalman filter which can reduce communication and computation burdens and save energy sources,and guarantee that the actual filtering error variances have a less-conservative upper-bound.A Lyapunov equation method for robustness analysis is proposed,by which the robustness of the local and fused Kalman filters is proved.The concept of the robust accuracy is presented and the robust accuracy relations of the local and fused robust Kalman filters are proved.It is proved that the robust accuracy of the global SCI fuser is higher than those of the local SCI fusers and the robust accuracies of all SCI fusers are higher than that of each local robust Kalman filter.A simulation example for a tracking system verifies the robustness and robust accuracy relations.
基金co-funded by the National Natural Science Foundation of China(No.61903187)the National Key R&D Program of China(No.2021YFB1600500)+2 种基金the China Scholarship Council(No.202006830095)the Natural Science Foundation of Jiangsu Province(No.BK20190414)the Jiangsu Province Postgraduate Innovation Fund(No.KYCX20_0213).
文摘Reinforcement Learning(RL)techniques are being studied to solve the Demand and Capacity Balancing(DCB)problems to fully exploit their computational performance.A locally gen-eralised Multi-Agent Reinforcement Learning(MARL)for real-world DCB problems is proposed.The proposed method can deploy trained agents directly to unseen scenarios in a specific Air Traffic Flow Management(ATFM)region to quickly obtain a satisfactory solution.In this method,agents of all flights in a scenario form a multi-agent decision-making system based on partial observation.The trained agent with the customised neural network can be deployed directly on the corresponding flight,allowing it to solve the DCB problem jointly.A cooperation coefficient is introduced in the reward function,which is used to adjust the agent’s cooperation preference in a multi-agent system,thereby controlling the distribution of flight delay time allocation.A multi-iteration mechanism is designed for the DCB decision-making framework to deal with problems arising from non-stationarity in MARL and to ensure that all hotspots are eliminated.Experiments based on large-scale high-complexity real-world scenarios are conducted to verify the effectiveness and efficiency of the method.From a statis-tical point of view,it is proven that the proposed method is generalised within the scope of the flights and sectors of interest,and its optimisation performance outperforms the standard computer-assisted slot allocation and state-of-the-art RL-based DCB methods.The sensitivity analysis preliminarily reveals the effect of the cooperation coefficient on delay time allocation.
文摘An intelligent manufacturing system is modeled currently from the viewpoint of manufacturing applications,and the network platform’s influence to manufacturing applications is not considered adequately.However any bottleneck in service oriented architecture(SOA)for the manufacturing network can affect the agility of the IT environment.In this paper,to achieve a trade-off between manufacturing resources and network resources,the manufacturing network is modeled with multi-agent,in which two kinds of basic elements,the manufacturing application unit and the network carrier of manufacturing information,are presented.And their main characters are described by colored petri net.The manufacturing application model drives the network platform that inversely provides this application model technology supports.The proposed multi-agent system is demonstrated through an example integration scenario involving production plan,resources management and execution subsystems.And the result suggests that analyzing and designing the system architecture of networked manufacturing should give due attention to the operation system as well as manufacturing applications.
基金Project supported by the National Natural Science Foundation of China (Grant Nos 10775060 and 10805033)the Doctoral Education Foundation of National Education Committeethe Natural Science Foundation of Gansu Province
文摘This paper studies consensus problems in weighted scale-free networks of asymmetrically coupled dynamical units, where the asymmetry in a given link is deter：mined by the relative degree of the involved nodes. It shows that the asymmetry of interactions has a great effect on the consensus. Especially, when the interactions are dominant from higher- to lower-degree nodes, both the convergence speed and the robustness to communication delay are enhanced.
基金supported by the National Natural Science Foundation of China(61503407,61806219,61703426,61876189,61703412)the China Postdoctoral Science Foundation(2016 M602996)。
文摘The multi-agent system is the optimal solution to complex intelligent problems. In accordance with the game theory, the concept of loyalty is introduced to analyze the relationship between agents' individual income and global benefits and build the logical architecture of the multi-agent system. Besides, to verify the feasibility of the method, the cyclic neural network is optimized, the bi-directional coordination network is built as the training network for deep learning, and specific training scenes are simulated as the training background. After a certain number of training iterations, the model can learn simple strategies autonomously. Also,as the training time increases, the complexity of learning strategies rises gradually. Strategies such as obstacle avoidance, firepower distribution and collaborative cover are adopted to demonstrate the achievability of the model. The model is verified to be realizable by the examples of obstacle avoidance, fire distribution and cooperative cover. Under the same resource background, the model exhibits better convergence than other deep learning training networks, and it is not easy to fall into the local endless loop.Furthermore, the ability of the learning strategy is stronger than that of the training model based on rules, which is of great practical values.
基金supported by the National Natural Science Foundation of China(Nos.12272104,U22B2013).
文摘This paper investigates the challenges associated with Unmanned Aerial Vehicle (UAV) collaborative search and target tracking in dynamic and unknown environments characterized by limited field of view. The primary objective is to explore the unknown environments to locate and track targets effectively. To address this problem, we propose a novel Multi-Agent Reinforcement Learning (MARL) method based on Graph Neural Network (GNN). Firstly, a method is introduced for encoding continuous-space multi-UAV problem data into spatial graphs which establish essential relationships among agents, obstacles, and targets. Secondly, a Graph AttenTion network (GAT) model is presented, which focuses exclusively on adjacent nodes, learns attention weights adaptively and allows agents to better process information in dynamic environments. Reward functions are specifically designed to tackle exploration challenges in environments with sparse rewards. By introducing a framework that integrates centralized training and distributed execution, the advancement of models is facilitated. Simulation results show that the proposed method outperforms the existing MARL method in search rate and tracking performance with less collisions. The experiments show that the proposed method can be extended to applications with a larger number of agents, which provides a potential solution to the challenging problem of multi-UAV autonomous tracking in dynamic unknown environments.
文摘In this paper,a resilient distributed control scheme against replay attacks for multi-agent networked systems subject to input and state constraints is proposed.The methodological starting point relies on a smart use of predictive arguments with a twofold aim:1)Promptly detect malicious agent behaviors affecting normal system operations;2)Apply specific control actions,based on predictive ideas,for mitigating as much as possible undesirable domino effects resulting from adversary operations.Specifically,the multi-agent system is topologically described by a leader-follower digraph characterized by a unique leader and set-theoretic receding horizon control ideas are exploited to develop a distributed algorithm capable to instantaneously recognize the attacked agent.Finally,numerical simulations are carried out to show benefits and effectiveness of the proposed approach.
基金supported in part by the National Key Research and Development Program of China (2016YFB0800601)
文摘This paper investigates the differentially private problem of the average consensus for a class of discrete-time multi-agent network systems(MANSs). Based on the MANSs,a new distributed differentially private consensus algorithm(DPCA) is developed. To avoid continuous communication between neighboring agents, a kind of intermittent communication strategy depending on an event-triggered function is established in our DPCA. Based on our algorithm, we carry out the detailed analysis including its convergence, its accuracy, its privacy and the trade-off between the accuracy and the privacy level, respectively. It is found that our algorithm preserves the privacy of initial states of all agents in the whole process of consensus computation. The trade-off motivates us to find the best achievable accuracy of our algorithm under the free parameters and the fixed privacy level. Finally, numerical experiment results testify the validity of our theoretical analysis.
基金Supported by the National Natural Science Foundation of China(6147333861304164)
文摘In this paper, the finite-time consensus of a leader-following multi-agent network with non-identical nonlinear dynamics and time-varying topologies is investigated. All the agents, especially the leaders, have non-identical and nonlinear dynamics. According to the algebraic graph theory, Lyapunov stability theory and Kronecker product, a control strategy strategy is established to guarantee the finite-time consensus of multi-agent network with multiple leaders. Furthermore, several numerical simulations illustrate the effectiveness and feasibility of the proposed method.
基金supported in part by the National Natural Science Foundation of China(61873056,61621004,61420106016)the Fundamental Research Funds for the Central Universities in China(N2004001,N2004002,N182608004)the Research Fund of State Key Laboratory of Synthetical Automation for Process Industries in China(2013ZCX01)。
文摘This paper investigates the distributed fault-tolerant containment control(FTCC)problem of nonlinear multi-agent systems(MASs)under a directed network topology.The proposed control framework which is independent on the global information about the communication topology consists of two layers.Different from most existing distributed fault-tolerant control(FTC)protocols where the fault in one agent may propagate over network,the developed control method can eliminate the phenomenon of fault propagation.Based on the hierarchical control strategy,the FTCC problem with a directed graph can be simplified to the distributed containment control of the upper layer and the fault-tolerant tracking control of the lower layer.Finally,simulation results are given to demonstrate the effectiveness of the proposed control protocol.
基金supported by National Basic Research Program of China (973 Program) (No. 2010CB731800)Key Project of National Science Foundation of China (No. 60934003)+2 种基金National Nature Science Foundation of China (No. 61074065)Key Project for Natural Science Research of Hebei Education Department, PRC(No. ZD200908)Key Project for Shanghai Committee of Science and Technology (No. 08511501600)
文摘In this paper, the problems of target tracking and obstacle avoidance for multi-agent networks with input constraints are investigated. When there is a moving obstacle, the control objectives are to make the agents track a moving target and to avoid collisions among agents. First, without considering the input constraints, a novel distributed controller can be obtained based on the potential function. Second, at each sampling time, the control algorithm is optimized. Furthermore, to solve the problem that agents cannot effectively avoid the obstacles in dynamic environment where the obstacles are moving, a new velocity repulsive potential is designed. One advantage of the designed control algorithm is that each agent only requires local knowledge of its neighboring agents. Finally, simulation results are provided to verify the effectiveness of the proposed approach.
基金supported by the National Natural Science Foundation of China (4177402141974005)。
文摘Electric power is widely used as the main energy source of ship integrated power system(SIPS), which contains power network and electric power network. SIPS network reconfiguration is a non-linear large-scale problem. The reconfiguration solution influences the safety and stable operation of the power system. According to the operational characteristics of SIPS, a simplified model of power network and a mathematical model for network reconfiguration are established. Based on these models, a multi-agent and ant colony optimization(MAACO) is proposed to solve the problem of network reconfiguration. The simulations are carried out to demonstrate that the optimization method can reconstruct the integrated power system network accurately and efficiently.
基金supported in part by the National Natural Science Foundation of China(Nos.61673081,51979020,51909021,51939001)in part by Science and Technology Fund for Distinguished Young Scholars of Dalian(No.2018RJ08)+5 种基金in part by the Stable Supporting Fund of Science and Technology on Underwater Vehicle Technology(No.JCKYS2019604SXJQR-01)in part by the Supporting Program for High-level Talent in Transportation Department(No.2018-030)in part by the National Key Research and Development Program of China(No.2016YFC0301500)in part by the Fundamental Research Funds for the Central Universities(Nos.3132019319,3132020101,3132020102)in part by China Postdoctoral Science Foundation(No.2019M650086)the Training Program for Doctoral Innovative Talents of DLMU(No.CXXM2019BS001)。
文摘This paper is concerned with distributed containment maneuvering of second-order Multi-Input Multi-Output(MIMO)multi-agent systems with non-periodic communication and actuation.The agent is subject to unmatched nonlinear dynamics and external disturbances.Event-triggered containment maneuvering control methods is developed based on a modular design.Specifically,an estimator module is constructed based on neural networks and the nonperiodic obtained follower information through event-triggered communication.Next,a controller module is designed by using the identified information from the estimator module and a third-order linear tracking differentiator.An event-triggered mechanism is introduced for updating the actuator.Then,a path update law is designed based on the non-periodic leader information through event-triggered communication.The closed-loop system cascaded by the estimation subsystem and control subsystem is proved to be input-to-state stable,and Zeno behavior is excluded in the control process.The proposed method is capable of reducing the consumption of communication and actuation.A simulation example is provided to substantiate the effectiveness of the proposed event-triggered control method for distributed containment maneuvering of second-order MIMO multi-agent systems.
基金Supported by the National Natural Science Foundation of China (60373110, 60573130, 60502011)
文摘Inspired by the immune theory and multi-agent systems, an immune multi-agent active defense model for network intrusion is established. The concept of immune agent is introduced, and its running mechanism is established. The method, which uses antibody concentration to quantitatively describe the degree of intrusion danger, is presented. This model implements the multi-layer and distributed active defense mechanism for network intrusion. The experiment results show that this model is a good solution to the network security defense.
