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.展开更多
To investigate the leader-following formation control, in this paper we present the design problem of control protocols and distributed observers under which the agents can achieve and maintain the desired formation f...To investigate the leader-following formation control, in this paper we present the design problem of control protocols and distributed observers under which the agents can achieve and maintain the desired formation from any initial states, while the velocity converges to that of the virtual leader whose velocity cannot be measured by agents in real time. The two cases of switching topologies without communication delay and fixed topology with time-varying communication delay are both considered for multi-agent networks. By using the Lyapunov stability theory, the issue of stability is analysed for multi-agent systems with switching topologies. Then, by considering the time-varying communication delay, the sufficient condition is proposed for the multi-agent systems with fixed topology. Finally, two numerical examples are given to illustrate the effectiveness of the proposed leader-following formation control protocols.展开更多
This paper investigates the consensus disturbance rejection problem among multiple high-order agents with directed graphs.Based on disturbance observers,distributed consensus disturbance rejection protocols are constr...This paper investigates the consensus disturbance rejection problem among multiple high-order agents with directed graphs.Based on disturbance observers,distributed consensus disturbance rejection protocols are constructed in leaderless and leader-follower consensus setups.Different from the previous related papers,the consensus protocols in this paper are developed in a fully distributed fashion,relying on only the state information of each agent and its neighbors.Sufficient conditions are provided to guarantee that the asymptotic stability of high-order multi-agent systems can be reached with matched disturbances.展开更多
In this paper the pinning consensus of multi-agent networks with arbitrary topology is investigated. Based on the properties of M-matrix, some criteria of pinning consensus are established for the continuous multi-age...In this paper the pinning consensus of multi-agent networks with arbitrary topology is investigated. Based on the properties of M-matrix, some criteria of pinning consensus are established for the continuous multi-agent network and the results show that the pinning consensus of the dynamical system depends on the smallest real part of the eigenvalue of the matrix which is composed of the Laplacian matrix of the multi-agent network and the pinning control gains. Meanwhile, the relevant work for the discrete-time system is studied and the corresponding criterion is also obtained. Particularly, the fundamental problem of pinning consensus, that is, what kind of node should be pinned, is investigated and the positive answers to this question are presented. Finally, the correctness of our theoretical findings is demonstrated by some numerical simulated examples.展开更多
This paper considers the formation tracking problem under a rigidity framework, where the target formation is specified as a minimally and infinitesimally rigid formation and the desired velocity of the group is avail...This paper considers the formation tracking problem under a rigidity framework, where the target formation is specified as a minimally and infinitesimally rigid formation and the desired velocity of the group is available to only a subset of the agents. The following two cases are considered： the desired velocity is constant, and the desired velocity is timevarying. In the first case, a distributed linear estimator is constructed for each agent to estimate the desired velocity. The velocity estimation and a formation acquisition term are employed to design the control inputs for the agents, where the rigidity matrix plays a central role. In the second case, a distributed non-smooth estimator is constructed to estimate the time-varying velocity, which is shown to converge in a finite time. Theoretical analysis shows that the formation tracking problem can be solved under the proposed control algorithms and estimators. Simulation results are also provided to show the validity of the derived results.展开更多
The bipartite containment control problem for heterogeneous nonlinear multi-agent systems(HNMASs)within multi-group networks under signed digraphs is investigated,where the first-order and second-order nonlinear dynam...The bipartite containment control problem for heterogeneous nonlinear multi-agent systems(HNMASs)within multi-group networks under signed digraphs is investigated,where the first-order and second-order nonlinear dynamic agents belong to distinct groups.Interactions are cooperative-antagonistic within each group and sign-in-degree balanced across the inter-groups.Firstly,a state feedback control protocol is designed to ensure that the trajectories of followers in diverse groups can converge to distinct convex hulls formed by their corresponding leaders,respectively.As an extension,the bipartite control problem with time-variant formation for the multi-agent system(MAS)is also considered,and a corresponding control protocol with formation compensation vectors is given.Finally,in view of Lyapunov stability theory and matrix inequality,the sufficient conditions for realizing the bipartite containment control are obtained,and several simulations are provided to verify the validity of the above methods.展开更多
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.展开更多
Multi-agent systems often require good interoperability in the process of completing their assigned tasks.This paper first models the static structure and dynamic behavior of multiagent systems based on layered weight...Multi-agent systems often require good interoperability in the process of completing their assigned tasks.This paper first models the static structure and dynamic behavior of multiagent systems based on layered weighted scale-free community network and susceptible-infected-recovered(SIR)model.To solve the problem of difficulty in describing the changes in the structure and collaboration mode of the system under external factors,a two-dimensional Monte Carlo method and an improved dynamic Bayesian network are used to simulate the impact of external environmental factors on multi-agent systems.A collaborative information flow path optimization algorithm for agents under environmental factors is designed based on the Dijkstra algorithm.A method for evaluating system interoperability is designed based on simulation experiments,providing reference for the construction planning and optimization of organizational application of the system.Finally,the feasibility of the method is verified through case studies.展开更多
In the islanded operation of distribution networks,due to the mismatch of line impedance at the inverter output,conventional droop control leads to inaccurate power sharing according to capacity,resulting in voltage a...In the islanded operation of distribution networks,due to the mismatch of line impedance at the inverter output,conventional droop control leads to inaccurate power sharing according to capacity,resulting in voltage and frequency fluctuations under minor external disturbances.To address this issue,this paper introduces an enhanced scheme for power sharing and voltage-frequency control.First,to solve the power distribution problem,we propose an adaptive virtual impedance control based on multi-agent consensus,which allows for precise active and reactive power allocation without requiring feeder impedance knowledge.Moreover,a novel consensus-based voltage and frequency control is proposed to correct the voltage deviation inherent in droop control and virtual impedance methods.This strategy maintains voltage and frequency stability even during communication disruptions and enhances system robustness.Additionally,a small-signal model is established for system stability analysis,and the control parameters are optimized.Simulation results validate the effectiveness of the proposed control scheme.展开更多
This paper presents a novel approach to dynamic pricing and distributed energy management in virtual power plant(VPP)networks using multi-agent reinforcement learning(MARL).As the energy landscape evolves towards grea...This paper presents a novel approach to dynamic pricing and distributed energy management in virtual power plant(VPP)networks using multi-agent reinforcement learning(MARL).As the energy landscape evolves towards greater decentralization and renewable integration,traditional optimization methods struggle to address the inherent complexities and uncertainties.Our proposed MARL framework enables adaptive,decentralized decision-making for both the distribution system operator and individual VPPs,optimizing economic efficiency while maintaining grid stability.We formulate the problem as a Markov decision process and develop a custom MARL algorithm that leverages actor-critic architectures and experience replay.Extensive simulations across diverse scenarios demonstrate that our approach consistently outperforms baseline methods,including Stackelberg game models and model predictive control,achieving an 18.73%reduction in costs and a 22.46%increase in VPP profits.The MARL framework shows particular strength in scenarios with high renewable energy penetration,where it improves system performance by 11.95%compared with traditional methods.Furthermore,our approach demonstrates superior adaptability to unexpected events and mis-predictions,highlighting its potential for real-world implementation.展开更多
This paper studies the problem of jamming decision-making for dynamic multiple communication links in wireless communication networks(WCNs).We propose a novel jamming channel allocation and power decision-making(JCAPD...This paper studies the problem of jamming decision-making for dynamic multiple communication links in wireless communication networks(WCNs).We propose a novel jamming channel allocation and power decision-making(JCAPD)approach based on multi-agent deep reinforcement learning(MADRL).In high-dynamic and multi-target aviation communication environments,the rapid changes in channels make it difficult for sensors to accurately capture instantaneous channel state information.This poses a challenge to make centralized jamming decisions with single-agent deep reinforcement learning(DRL)approaches.In response,we design a distributed multi-agent decision architecture(DMADA).We formulate multi-jammer resource allocation as a multiagent Markov decision process(MDP)and propose a fingerprint-based double deep Q-Network(FBDDQN)algorithm for solving it.Each jammer functions as an agent that interacts with the environment in this framework.Through the design of a reasonable reward and training mechanism,our approach enables jammers to achieve distributed cooperation,significantly improving the jamming success rate while considering jamming power cost,and reducing the transmission rate of links.Our experimental results show the FBDDQN algorithm is superior to the baseline methods.展开更多
Unmanned Aerial Vehicles(UAVs)have demonstrated significant potential as Aerial Base Stations(A-BSs)for providing data services to Ground Users(GUs),attributed to their flexibility,cost-effectiveness,and high likeliho...Unmanned Aerial Vehicles(UAVs)have demonstrated significant potential as Aerial Base Stations(A-BSs)for providing data services to Ground Users(GUs),attributed to their flexibility,cost-effectiveness,and high likelihood of establishing line-of-sight links.In this article,we formulate the joint power and trajectory optimization problem for a multi-UAV assisted wireless network with no-fly zones constrained,aiming at maximizing the Accumulated Service Data(ASD)of UAVs and minimizing the Average End Age of Information(AEAoI)of GUs.Specifically,this paper proposes the Multi-Agent worst-case Soft Actor Critic(MA-wcSAC)algorithm with a distributional safety-critic.The simulation results demonstrate that,compared to the Multi-Agent Soft Actor Critic(MA-SAC)algorithm,the proposed algorithm exhibits comparable data service performance while reducing security risks by at least 30%at different risk levels.展开更多
Dear Editor,This letter is concerned with the problem of time-varying formation tracking for heterogeneous multi-agent systems(MASs) under directed switching networks. For this purpose, our first step is to present so...Dear Editor,This letter is concerned with the problem of time-varying formation tracking for heterogeneous multi-agent systems(MASs) under directed switching networks. For this purpose, our first step is to present some sufficient conditions for the exponential stability of a particular category of switched systems.展开更多
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.展开更多
Optimizing routing and resource allocation in decentralized unmanned aerial vehicle(UAV)networks remains challenging due to interference and rapidly changing topologies.The authors introduce a novel framework combinin...Optimizing routing and resource allocation in decentralized unmanned aerial vehicle(UAV)networks remains challenging due to interference and rapidly changing topologies.The authors introduce a novel framework combining double deep Q-networks(DDQNs)and graph neural networks(GNNs)for joint routing and resource allocation.The framework uses GNNs to model the network topology and DDQNs to adaptively control routing and resource allocation,addressing interference and improving network performance.Simulation results show that the proposed approach outperforms traditional methods such as Closest-to-Destination(c2Dst),Max-SINR(mSINR),and Multi-Layer Perceptron(MLP)-based models,achieving approximately 23.5% improvement in throughput,50% increase in connection probability,and 17.6% reduction in number of hops,demonstrating its effectiveness in dynamic UAV networks.展开更多
Distributed Denial of Service(DDoS)attacks are one of the severe threats to network infrastructure,sometimes bypassing traditional diagnosis algorithms because of their evolving complexity.PresentMachine Learning(ML)t...Distributed Denial of Service(DDoS)attacks are one of the severe threats to network infrastructure,sometimes bypassing traditional diagnosis algorithms because of their evolving complexity.PresentMachine Learning(ML)techniques for DDoS attack diagnosis normally apply network traffic statistical features such as packet sizes and inter-arrival times.However,such techniques sometimes fail to capture complicated relations among various traffic flows.In this paper,we present a new multi-scale ensemble strategy given the Graph Neural Networks(GNNs)for improving DDoS detection.Our technique divides traffic into macro-and micro-level elements,letting various GNN models to get the two corase-scale anomalies and subtle,stealthy attack models.Through modeling network traffic as graph-structured data,GNNs efficiently learn intricate relations among network entities.The proposed ensemble learning algorithm combines the results of several GNNs to improve generalization,robustness,and scalability.Extensive experiments on three benchmark datasets—UNSW-NB15,CICIDS2017,and CICDDoS2019—show that our approach outperforms traditional machine learning and deep learning models in detecting both high-rate and low-rate(stealthy)DDoS attacks,with significant improvements in accuracy and recall.These findings demonstrate the suggested method’s applicability and robustness for real-world implementation in contexts where several DDoS patterns coexist.展开更多
Identifying the community structure of complex networks is crucial to extracting insights and understanding network properties.Although several community detection methods have been proposed,many are unsuitable for so...Identifying the community structure of complex networks is crucial to extracting insights and understanding network properties.Although several community detection methods have been proposed,many are unsuitable for social networks due to significant limitations.Specifically,most approaches depend mainly on user-user structural links while overlooking service-centric,semantic,and multi-attribute drivers of community formation,and they also lack flexible filtering mechanisms for large-scale,service-oriented settings.Our proposed approach,called community discovery-based service(CDBS),leverages user profiles and their interactions with consulted web services.The method introduces a novel similarity measure,global similarity interaction profile(GSIP),which goes beyond typical similarity measures by unifying user and service profiles for all attributes types into a coherent representation,thereby clarifying its novelty and contribution.It applies multiple filtering criteria related to user attributes,accessed services,and interaction patterns.Experimental comparisons against Louvain,Hierarchical Agglomerative Clustering,Label Propagation and Infomap show that CDBS reveals the higher performance as it achieves 0.74 modularity,0.13 conductance,0.77 coverage,and significantly fast response time of 9.8 s,even with 10,000 users and 400 services.Moreover,community discoverybased service consistently detects a larger number of communities with distinct topics of interest,underscoring its capacity to generate detailed and efficient structures in complex networks.These results confirm both the efficiency and effectiveness of the proposed method.Beyond controlled evaluation,communities discovery based service is applicable to targeted recommendations,group-oriented marketing,access control,and service personalization,where communities are shaped not only by user links but also by service engagement.展开更多
In this paper,we propose a new privacy-aware transmission scheduling algorithm for 6G ad hoc networks.This system enables end nodes to select the optimum time and scheme to transmit private data safely.In 6G dynamic h...In this paper,we propose a new privacy-aware transmission scheduling algorithm for 6G ad hoc networks.This system enables end nodes to select the optimum time and scheme to transmit private data safely.In 6G dynamic heterogeneous infrastructures,unstable links and non-uniform hardware capabilities create critical issues regarding security and privacy.Traditional protocols are often too computationally heavy to allow 6G services to achieve their expected Quality-of-Service(QoS).As the transport network is built of ad hoc nodes,there is no guarantee about their trustworthiness or behavior,and transversal functionalities are delegated to the extreme nodes.However,while security can be guaranteed in extreme-to-extreme solutions,privacy cannot,as all intermediate nodes still have to handle the data packets they are transporting.Besides,traditional schemes for private anonymous ad hoc communications are vulnerable against modern intelligent attacks based on learning models.The proposed scheme fulfills this gap.Findings show the probability of a successful intelligent attack reduces by up to 65%compared to ad hoc networks with no privacy protection strategy when used the proposed technology.While congestion probability can remain below 0.001%,as required in 6G services.展开更多
The advent of sixth-generation(6G)networks introduces unprecedented challenges in achieving seamless connectivity,ultra-low latency,and efficient resource management in highly dynamic environments.Although fifth-gener...The advent of sixth-generation(6G)networks introduces unprecedented challenges in achieving seamless connectivity,ultra-low latency,and efficient resource management in highly dynamic environments.Although fifth-generation(5G)networks transformed mobile broadband and machine-type communications at massive scales,their properties of scaling,interference management,and latency remain a limitation in dense high mobility settings.To overcome these limitations,artificial intelligence(AI)and unmanned aerial vehicles(UAVs)have emerged as potential solutions to develop versatile,dynamic,and energy-efficient communication systems.The study proposes an AI-based UAV architecture that utilizes cooperative reinforcement learning(CoRL)to manage an autonomous network.The UAVs collaborate by sharing local observations and real-time state exchanges to optimize user connectivity,movement directions,allocate power,and resource distribution.Unlike conventional centralized or autonomous methods,CoRL involves joint state sharing and conflict-sensitive reward shaping,which ensures fair coverage,less interference,and enhanced adaptability in a dynamic urban environment.Simulations conducted in smart city scenarios with 10 UAVs and 50 ground users demonstrate that the proposed CoRL-based UAV system increases user coverage by up to 10%,achieves convergence 40%faster,and reduces latency and energy consumption by 30%compared with centralized and decentralized baselines.Furthermore,the distributed nature of the algorithm ensures scalability and flexibility,making it well-suited for future large-scale 6G deployments.The results highlighted that AI-enabled UAV systems enhance connectivity,support ultra-reliable low-latency communications(URLLC),and improve 6G network efficiency.Future work will extend the framework with adaptive modulation,beamforming-aware positioning,and real-world testbed deployment.展开更多
基金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.
基金Project supported by the National Natural Science Foundation for Distinguished Young Scholars of China (Grant No. 60525303)the National Natural Science Foundation of China (Grant No. 60704009)+1 种基金the Key Project for Natural Science Research of the Hebei Educational Department (Grant No. ZD200908)the Doctorial Fund of Yanshan University (Grant No. B203)
文摘To investigate the leader-following formation control, in this paper we present the design problem of control protocols and distributed observers under which the agents can achieve and maintain the desired formation from any initial states, while the velocity converges to that of the virtual leader whose velocity cannot be measured by agents in real time. The two cases of switching topologies without communication delay and fixed topology with time-varying communication delay are both considered for multi-agent networks. By using the Lyapunov stability theory, the issue of stability is analysed for multi-agent systems with switching topologies. Then, by considering the time-varying communication delay, the sufficient condition is proposed for the multi-agent systems with fixed topology. Finally, two numerical examples are given to illustrate the effectiveness of the proposed leader-following formation control protocols.
基金supported by the National Natural Science Foundation of China (Nos. U1713223 and 61876187)by the Beijing Nova Program (No. 2018047)by the Joint Fund of Ministry of Education of China for Equipment Preresearch
文摘This paper investigates the consensus disturbance rejection problem among multiple high-order agents with directed graphs.Based on disturbance observers,distributed consensus disturbance rejection protocols are constructed in leaderless and leader-follower consensus setups.Different from the previous related papers,the consensus protocols in this paper are developed in a fully distributed fashion,relying on only the state information of each agent and its neighbors.Sufficient conditions are provided to guarantee that the asymptotic stability of high-order multi-agent systems can be reached with matched disturbances.
基金supported by the National Natural Science Foundation of China (Grant Nos. 60973114 and 61170249)the Natural Science Foundation of Chongqing Science and Technology Commission, China (Grant Nos. 2009BA2024, cstc2011jjA40045, and cstc2013jcyjA0906)the State Key Laboratory of Power Transmission Equipment & System Security and New Technology, Chongqing University, China (Grant No. 2007DA10512711206)
文摘In this paper the pinning consensus of multi-agent networks with arbitrary topology is investigated. Based on the properties of M-matrix, some criteria of pinning consensus are established for the continuous multi-agent network and the results show that the pinning consensus of the dynamical system depends on the smallest real part of the eigenvalue of the matrix which is composed of the Laplacian matrix of the multi-agent network and the pinning control gains. Meanwhile, the relevant work for the discrete-time system is studied and the corresponding criterion is also obtained. Particularly, the fundamental problem of pinning consensus, that is, what kind of node should be pinned, is investigated and the positive answers to this question are presented. Finally, the correctness of our theoretical findings is demonstrated by some numerical simulated examples.
基金Project supported by the National Natural Science Foundation of China(Grant No.61473240)
文摘This paper considers the formation tracking problem under a rigidity framework, where the target formation is specified as a minimally and infinitesimally rigid formation and the desired velocity of the group is available to only a subset of the agents. The following two cases are considered： the desired velocity is constant, and the desired velocity is timevarying. In the first case, a distributed linear estimator is constructed for each agent to estimate the desired velocity. The velocity estimation and a formation acquisition term are employed to design the control inputs for the agents, where the rigidity matrix plays a central role. In the second case, a distributed non-smooth estimator is constructed to estimate the time-varying velocity, which is shown to converge in a finite time. Theoretical analysis shows that the formation tracking problem can be solved under the proposed control algorithms and estimators. Simulation results are also provided to show the validity of the derived results.
基金National Natural Science Foundation of China(No.12071370)。
文摘The bipartite containment control problem for heterogeneous nonlinear multi-agent systems(HNMASs)within multi-group networks under signed digraphs is investigated,where the first-order and second-order nonlinear dynamic agents belong to distinct groups.Interactions are cooperative-antagonistic within each group and sign-in-degree balanced across the inter-groups.Firstly,a state feedback control protocol is designed to ensure that the trajectories of followers in diverse groups can converge to distinct convex hulls formed by their corresponding leaders,respectively.As an extension,the bipartite control problem with time-variant formation for the multi-agent system(MAS)is also considered,and a corresponding control protocol with formation compensation vectors is given.Finally,in view of Lyapunov stability theory and matrix inequality,the sufficient conditions for realizing the bipartite containment control are obtained,and several simulations are provided to verify the validity of the above methods.
基金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.
基金supported by the Key R&D Projects in Jiangsu Province(BE2021729)the Key Primary Research Project of Primary Strengthening Program(KYZYJKKCJC23001).
文摘Multi-agent systems often require good interoperability in the process of completing their assigned tasks.This paper first models the static structure and dynamic behavior of multiagent systems based on layered weighted scale-free community network and susceptible-infected-recovered(SIR)model.To solve the problem of difficulty in describing the changes in the structure and collaboration mode of the system under external factors,a two-dimensional Monte Carlo method and an improved dynamic Bayesian network are used to simulate the impact of external environmental factors on multi-agent systems.A collaborative information flow path optimization algorithm for agents under environmental factors is designed based on the Dijkstra algorithm.A method for evaluating system interoperability is designed based on simulation experiments,providing reference for the construction planning and optimization of organizational application of the system.Finally,the feasibility of the method is verified through case studies.
基金supported by the National Natural Science Foundation of China(52007009)Natural Science Foundation of Excellent Youth Project of Hunan Province of China(2023JJ20039)Science and Technology Projects of State Grid Hunan Provincial Electric Power Co.,Ltd.(5216A522001K,SGHNDK00PWJS2310173).
文摘In the islanded operation of distribution networks,due to the mismatch of line impedance at the inverter output,conventional droop control leads to inaccurate power sharing according to capacity,resulting in voltage and frequency fluctuations under minor external disturbances.To address this issue,this paper introduces an enhanced scheme for power sharing and voltage-frequency control.First,to solve the power distribution problem,we propose an adaptive virtual impedance control based on multi-agent consensus,which allows for precise active and reactive power allocation without requiring feeder impedance knowledge.Moreover,a novel consensus-based voltage and frequency control is proposed to correct the voltage deviation inherent in droop control and virtual impedance methods.This strategy maintains voltage and frequency stability even during communication disruptions and enhances system robustness.Additionally,a small-signal model is established for system stability analysis,and the control parameters are optimized.Simulation results validate the effectiveness of the proposed control scheme.
基金supported by the Science and Technology Project of State Grid Sichuan Electric Power Company Chengdu Power Supply Company under Grant No.521904240005.
文摘This paper presents a novel approach to dynamic pricing and distributed energy management in virtual power plant(VPP)networks using multi-agent reinforcement learning(MARL).As the energy landscape evolves towards greater decentralization and renewable integration,traditional optimization methods struggle to address the inherent complexities and uncertainties.Our proposed MARL framework enables adaptive,decentralized decision-making for both the distribution system operator and individual VPPs,optimizing economic efficiency while maintaining grid stability.We formulate the problem as a Markov decision process and develop a custom MARL algorithm that leverages actor-critic architectures and experience replay.Extensive simulations across diverse scenarios demonstrate that our approach consistently outperforms baseline methods,including Stackelberg game models and model predictive control,achieving an 18.73%reduction in costs and a 22.46%increase in VPP profits.The MARL framework shows particular strength in scenarios with high renewable energy penetration,where it improves system performance by 11.95%compared with traditional methods.Furthermore,our approach demonstrates superior adaptability to unexpected events and mis-predictions,highlighting its potential for real-world implementation.
基金supported in part by the National Natural Science Foundation of China(No.61906156).
文摘This paper studies the problem of jamming decision-making for dynamic multiple communication links in wireless communication networks(WCNs).We propose a novel jamming channel allocation and power decision-making(JCAPD)approach based on multi-agent deep reinforcement learning(MADRL).In high-dynamic and multi-target aviation communication environments,the rapid changes in channels make it difficult for sensors to accurately capture instantaneous channel state information.This poses a challenge to make centralized jamming decisions with single-agent deep reinforcement learning(DRL)approaches.In response,we design a distributed multi-agent decision architecture(DMADA).We formulate multi-jammer resource allocation as a multiagent Markov decision process(MDP)and propose a fingerprint-based double deep Q-Network(FBDDQN)algorithm for solving it.Each jammer functions as an agent that interacts with the environment in this framework.Through the design of a reasonable reward and training mechanism,our approach enables jammers to achieve distributed cooperation,significantly improving the jamming success rate while considering jamming power cost,and reducing the transmission rate of links.Our experimental results show the FBDDQN algorithm is superior to the baseline methods.
基金supported in part by the National Natural Science Foundation of China(Nos.62371369 and 62376204)the National Key R&D Program of China(No.2022YFC3301300).
文摘Unmanned Aerial Vehicles(UAVs)have demonstrated significant potential as Aerial Base Stations(A-BSs)for providing data services to Ground Users(GUs),attributed to their flexibility,cost-effectiveness,and high likelihood of establishing line-of-sight links.In this article,we formulate the joint power and trajectory optimization problem for a multi-UAV assisted wireless network with no-fly zones constrained,aiming at maximizing the Accumulated Service Data(ASD)of UAVs and minimizing the Average End Age of Information(AEAoI)of GUs.Specifically,this paper proposes the Multi-Agent worst-case Soft Actor Critic(MA-wcSAC)algorithm with a distributional safety-critic.The simulation results demonstrate that,compared to the Multi-Agent Soft Actor Critic(MA-SAC)algorithm,the proposed algorithm exhibits comparable data service performance while reducing security risks by at least 30%at different risk levels.
基金supported in part by the National Natural Science Foundation of China(62273255,62350003,62088101)the Shanghai Science and Technology Cooperation Project(22510712000,21550760900)+1 种基金the Shanghai Municipal Science and Technology Major Project(2021SHZDZX0100)the Fundamental Research Funds for the Central Universities
文摘Dear Editor,This letter is concerned with the problem of time-varying formation tracking for heterogeneous multi-agent systems(MASs) under directed switching networks. For this purpose, our first step is to present some sufficient conditions for the exponential stability of a particular category of switched systems.
文摘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.
文摘Optimizing routing and resource allocation in decentralized unmanned aerial vehicle(UAV)networks remains challenging due to interference and rapidly changing topologies.The authors introduce a novel framework combining double deep Q-networks(DDQNs)and graph neural networks(GNNs)for joint routing and resource allocation.The framework uses GNNs to model the network topology and DDQNs to adaptively control routing and resource allocation,addressing interference and improving network performance.Simulation results show that the proposed approach outperforms traditional methods such as Closest-to-Destination(c2Dst),Max-SINR(mSINR),and Multi-Layer Perceptron(MLP)-based models,achieving approximately 23.5% improvement in throughput,50% increase in connection probability,and 17.6% reduction in number of hops,demonstrating its effectiveness in dynamic UAV networks.
文摘Distributed Denial of Service(DDoS)attacks are one of the severe threats to network infrastructure,sometimes bypassing traditional diagnosis algorithms because of their evolving complexity.PresentMachine Learning(ML)techniques for DDoS attack diagnosis normally apply network traffic statistical features such as packet sizes and inter-arrival times.However,such techniques sometimes fail to capture complicated relations among various traffic flows.In this paper,we present a new multi-scale ensemble strategy given the Graph Neural Networks(GNNs)for improving DDoS detection.Our technique divides traffic into macro-and micro-level elements,letting various GNN models to get the two corase-scale anomalies and subtle,stealthy attack models.Through modeling network traffic as graph-structured data,GNNs efficiently learn intricate relations among network entities.The proposed ensemble learning algorithm combines the results of several GNNs to improve generalization,robustness,and scalability.Extensive experiments on three benchmark datasets—UNSW-NB15,CICIDS2017,and CICDDoS2019—show that our approach outperforms traditional machine learning and deep learning models in detecting both high-rate and low-rate(stealthy)DDoS attacks,with significant improvements in accuracy and recall.These findings demonstrate the suggested method’s applicability and robustness for real-world implementation in contexts where several DDoS patterns coexist.
文摘Identifying the community structure of complex networks is crucial to extracting insights and understanding network properties.Although several community detection methods have been proposed,many are unsuitable for social networks due to significant limitations.Specifically,most approaches depend mainly on user-user structural links while overlooking service-centric,semantic,and multi-attribute drivers of community formation,and they also lack flexible filtering mechanisms for large-scale,service-oriented settings.Our proposed approach,called community discovery-based service(CDBS),leverages user profiles and their interactions with consulted web services.The method introduces a novel similarity measure,global similarity interaction profile(GSIP),which goes beyond typical similarity measures by unifying user and service profiles for all attributes types into a coherent representation,thereby clarifying its novelty and contribution.It applies multiple filtering criteria related to user attributes,accessed services,and interaction patterns.Experimental comparisons against Louvain,Hierarchical Agglomerative Clustering,Label Propagation and Infomap show that CDBS reveals the higher performance as it achieves 0.74 modularity,0.13 conductance,0.77 coverage,and significantly fast response time of 9.8 s,even with 10,000 users and 400 services.Moreover,community discoverybased service consistently detects a larger number of communities with distinct topics of interest,underscoring its capacity to generate detailed and efficient structures in complex networks.These results confirm both the efficiency and effectiveness of the proposed method.Beyond controlled evaluation,communities discovery based service is applicable to targeted recommendations,group-oriented marketing,access control,and service personalization,where communities are shaped not only by user links but also by service engagement.
基金funding from the European Commission by the Ruralities project(grant agreement no.101060876).
文摘In this paper,we propose a new privacy-aware transmission scheduling algorithm for 6G ad hoc networks.This system enables end nodes to select the optimum time and scheme to transmit private data safely.In 6G dynamic heterogeneous infrastructures,unstable links and non-uniform hardware capabilities create critical issues regarding security and privacy.Traditional protocols are often too computationally heavy to allow 6G services to achieve their expected Quality-of-Service(QoS).As the transport network is built of ad hoc nodes,there is no guarantee about their trustworthiness or behavior,and transversal functionalities are delegated to the extreme nodes.However,while security can be guaranteed in extreme-to-extreme solutions,privacy cannot,as all intermediate nodes still have to handle the data packets they are transporting.Besides,traditional schemes for private anonymous ad hoc communications are vulnerable against modern intelligent attacks based on learning models.The proposed scheme fulfills this gap.Findings show the probability of a successful intelligent attack reduces by up to 65%compared to ad hoc networks with no privacy protection strategy when used the proposed technology.While congestion probability can remain below 0.001%,as required in 6G services.
基金supported by the National Research Foundation of Korea(NRF)grant funded by the Korea government(MSIT)(RS-2025-00559546)supported by the IITP(Institute of Information&Coummunications Technology Planning&Evaluation)-ITRC(Information Technology Research Center)grant funded by the Korea government(Ministry of Science and ICT)(IITP-2025-RS-2023-00259004).
文摘The advent of sixth-generation(6G)networks introduces unprecedented challenges in achieving seamless connectivity,ultra-low latency,and efficient resource management in highly dynamic environments.Although fifth-generation(5G)networks transformed mobile broadband and machine-type communications at massive scales,their properties of scaling,interference management,and latency remain a limitation in dense high mobility settings.To overcome these limitations,artificial intelligence(AI)and unmanned aerial vehicles(UAVs)have emerged as potential solutions to develop versatile,dynamic,and energy-efficient communication systems.The study proposes an AI-based UAV architecture that utilizes cooperative reinforcement learning(CoRL)to manage an autonomous network.The UAVs collaborate by sharing local observations and real-time state exchanges to optimize user connectivity,movement directions,allocate power,and resource distribution.Unlike conventional centralized or autonomous methods,CoRL involves joint state sharing and conflict-sensitive reward shaping,which ensures fair coverage,less interference,and enhanced adaptability in a dynamic urban environment.Simulations conducted in smart city scenarios with 10 UAVs and 50 ground users demonstrate that the proposed CoRL-based UAV system increases user coverage by up to 10%,achieves convergence 40%faster,and reduces latency and energy consumption by 30%compared with centralized and decentralized baselines.Furthermore,the distributed nature of the algorithm ensures scalability and flexibility,making it well-suited for future large-scale 6G deployments.The results highlighted that AI-enabled UAV systems enhance connectivity,support ultra-reliable low-latency communications(URLLC),and improve 6G network efficiency.Future work will extend the framework with adaptive modulation,beamforming-aware positioning,and real-world testbed deployment.
