Owing to their global search capabilities and gradient-free operation,metaheuristic algorithms are widely applied to a wide range of optimization problems.However,their computational demands become prohibitive when ta...Owing to their global search capabilities and gradient-free operation,metaheuristic algorithms are widely applied to a wide range of optimization problems.However,their computational demands become prohibitive when tackling high-dimensional optimization challenges.To effectively address these challenges,this study introduces cooperative metaheuristics integrating dynamic dimension reduction(DR).Building upon particle swarm optimization(PSO)and differential evolution(DE),the proposed cooperative methods C-PSO and C-DE are developed.In the proposed methods,the modified principal components analysis(PCA)is utilized to reduce the dimension of design variables,thereby decreasing computational costs.The dynamic DR strategy implements periodic execution of modified PCA after a fixed number of iterations,resulting in the important dimensions being dynamically identified.Compared with the static one,the dynamic DR strategy can achieve precise identification of important dimensions,thereby enabling accelerated convergence toward optimal solutions.Furthermore,the influence of cumulative contribution rate thresholds on optimization problems with different dimensions is investigated.Metaheuristic algorithms(PSO,DE)and cooperative metaheuristics(C-PSO,C-DE)are examined by 15 benchmark functions and two engineering design problems(speed reducer and composite pressure vessel).Comparative results demonstrate that the cooperative methods achieve significantly superior performance compared to standard methods in both solution accuracy and computational efficiency.Compared to standard metaheuristic algorithms,cooperative metaheuristics achieve a reduction in computational cost of at least 40%.The cooperative metaheuristics can be effectively used to tackle both high-dimensional unconstrained and constrained optimization problems.展开更多
In recent years,unmanned aerial vehicles(UAVs)cooperative path planning is attracting more and more research attention.For the multi-UAV cooperative path planning problem,the path planning problem in three-dimensional...In recent years,unmanned aerial vehicles(UAVs)cooperative path planning is attracting more and more research attention.For the multi-UAV cooperative path planning problem,the path planning problem in three-dimensional(3D)environment is transformed into an optimization problem by introducing the fitness function and constraints such as minimizing path length,maintaining a low and stable flight altitude,and avoiding threat zones.A multi-strategy hybrid grey wolf optimization(MSHGWO)algorithm is proposed to address this problem.Firstly,a chaotic Cubic mapping is introduced to initialize the grey wolf positions to make its initial position distribution more uniform.Secondly,an adaptive adjustment weight factor is designed,which can adjust the movement weight based on the rate of fitness value decrease within a unit Euclidean distance,thereby improving the quality of the population.Finally,an elite opposition-based learning strategy is introduced to improve the population diversity so that the population jumps out of the local optimum.Simulation results indicate that the MSHGWO is capable of generating constraint-compliant paths for each UAV in complex 3D environments.Furthermore,the MSHGWO outperforms other algorithms in terms of convergence speed and solution quality.Meanwhile,flight experiments were conducted to validate the path planning capability of MSHGWO in real-world obstacle environments,further demonstrating the feasibility of the proposed multi-UAV cooperative path planning approach.展开更多
Multi-agent systems can solve scientific issues related to complex systems that are difficult or impossible for a single agent to solve through mutual collaboration and cooperation optimization.In a multi-agent system...Multi-agent systems can solve scientific issues related to complex systems that are difficult or impossible for a single agent to solve through mutual collaboration and cooperation optimization.In a multi-agent system,agents with a certain degree of autonomy generate complex interactions due to the correlation and coordination,which is manifested as cooperative/competitive behavior.This survey focuses on multi-agent cooperative optimization and cooperative/non-cooperative games.Starting from cooperative optimization,the studies on distributed optimization and federated optimization are summarized.The survey mainly focuses on distributed online optimization and its application in privacy protection,and overviews federated optimization from the perspective of privacy protection me-chanisms.Then,cooperative games and non-cooperative games are introduced to expand the cooperative optimization problems from two aspects of minimizing global costs and minimizing individual costs,respectively.Multi-agent cooperative and non-cooperative behaviors are modeled by games from both static and dynamic aspects,according to whether each player can make decisions based on the information of other players.Finally,future directions for cooperative optimization,cooperative/non-cooperative games,and their applications are discussed.展开更多
For multi-vehicle networks,Cooperative Positioning(CP)technique has become a promising way to enhance vehicle positioning accuracy.Especially,the CP performance could be further improved by introducing Sensor-Rich Veh...For multi-vehicle networks,Cooperative Positioning(CP)technique has become a promising way to enhance vehicle positioning accuracy.Especially,the CP performance could be further improved by introducing Sensor-Rich Vehicles(SRVs)into CP networks,which is called SRV-aided CP.However,the CP system may split into several sub-clusters that cannot be connected with each other in dense urban environments,in which the sub-clusters with few SRVs will suffer from degradation of CP performance.Since Unmanned Aerial Vehicles(UAVs)have been widely used to aid vehicular communications,we intend to utilize UAVs to assist sub-clusters in CP.In this paper,a UAV-aided CP network is constructed to fully utilize information from SRVs.First,the inter-node connection structure among the UAV and vehicles is designed to share available information from SRVs.After that,the clustering optimization strategy is proposed,in which the UAV cooperates with the high-precision sub-cluster to obtain available information from SRVs,and then broadcasts this positioning-related information to other low-precision sub-clusters.Finally,the Locally-Centralized Factor Graph Optimization(LC-FGO)algorithm is designed to fuse positioning information from cooperators.Simulation results indicate that the positioning accuracy of the CP system could be improved by fully utilizing positioning-related information from SRVs.展开更多
In the RSSI-based positioning algorithm,regarding the problem of a great conflict between precision and cost,a low-power and low-cost synergic localization algorithm is proposed,where effective methods are adopted in ...In the RSSI-based positioning algorithm,regarding the problem of a great conflict between precision and cost,a low-power and low-cost synergic localization algorithm is proposed,where effective methods are adopted in each phase of the localization process and fully use the detective information in the network to improve the positioning precision and robustness.In the ranging period,the power attenuation factor is obtained through the wireless channel modeling,and the RSSI value is transformed into distance.In the positioning period,the preferred reference nodes are used to calculate coordinates.In the position optimization period,Taylor expansion and least-squared iterative update algorithms are used to further improve the location precision.In the positioning,the notion of cooperative localization is introduced,in which the located node satisfying certain demands will be upgraded to a reference node so that it can participate in the positioning of other nodes,and improve the coverage and positioning precision.The results show that on the same network conditions,the proposed algorithm in this paper is similar to the Taylor series expansion algorithm based on the actual coordinates,but much higher than the basic least square algorithm,and the positioning precision is improved rapidly with the reduce of the range error.展开更多
The cooperative control and stability analysis problems for the multi-agent system with sampled com- munication are investigated. Distributed state feedback controllers are adopted for the cooperation of networked age...The cooperative control and stability analysis problems for the multi-agent system with sampled com- munication are investigated. Distributed state feedback controllers are adopted for the cooperation of networked agents. A theorem in the form of linear matrix inequalities（LMI） is derived to analyze the system stability. An- other theorem in the form of optimization problem subject to LMI constraints is proposed to design the controller, and then the algorithm is presented. The simulation results verify the validity and the effectiveness of the pro- posed approach.展开更多
With the new characteristics of global cooperation in supply chains being synthetically considered,a hybrid model to the cooperative negotiation process for the order distribution in supply chain is mainly studied.Aft...With the new characteristics of global cooperation in supply chains being synthetically considered,a hybrid model to the cooperative negotiation process for the order distribution in supply chain is mainly studied.After reviewing and analyzing some main domestic and overseas processes in cooperative negotiation modeling in supply chain,some problems are subsequently pointed out.For example,the traditional simple multi-agent system(MAS)frameworks which have some limitations,are not suitable for solving modeling complex systems.To solve these problems,thinking with the aid of the multi-agent structure and complex system modeling,the manufacturing supply chain is taken as an example,and a time Petri net production model is adopted to decompose the materials.And then a cooperative negotiation model for the order distribution in supply chain is constructed based on combining multi-agent techniques with time Petri net modeling.The simulation results reveal that the above model helps solve the problems of cooperative negotiation in supply chains.展开更多
Cooperative multi-UAV search requires jointly optimizing wide-area coverage,rapid target discovery,and endurance under sensing and motion constraints.Resolving this coupling enables scalable coordination with high dat...Cooperative multi-UAV search requires jointly optimizing wide-area coverage,rapid target discovery,and endurance under sensing and motion constraints.Resolving this coupling enables scalable coordination with high data efficiency and mission reliability.We formulate this problem as a discounted Markov decision process on an occupancy grid with a cellwise Bayesian belief update,yielding a Markov state that couples agent poses with a probabilistic target field.On this belief–MDP we introduce a segment-conditioned latent-intent framework,in which a discrete intent head selects a latent skill every K steps and an intra-segment GRU policy generates per-step control conditioned on the fixed intent;both components are trained end-to-end with proximal updates under a centralized critic.On the 50×50 grid,coverage and discovery convergence times are reduced by up to 48%and 40%relative to a flat actor-critic benchmark,and the aggregated convergence metric improves by about 12%compared with a stateof-the-art hierarchical method.Qualitative analyses further reveal stable spatial sectorization,low path overlap,and fuel-aware patrolling,indicating that segment-conditioned latent intents provide an effective and scalable mechanism for coordinated multi-UAV search.展开更多
Robust cooperative unmanned aerial vehicle(UAV)formation in complex 3D environments is hampered by reward sparsity and inefficient collaboration.To address this,we propose context-aware relational agent learning(CORAL...Robust cooperative unmanned aerial vehicle(UAV)formation in complex 3D environments is hampered by reward sparsity and inefficient collaboration.To address this,we propose context-aware relational agent learning(CORAL),a novel multi-agent deep reinforcement learning framework.CORAL synergistically integrates two modules:(1)a novelty-based intrinsic reward module to drive efficient exploration and(2)an explicit relational learning module that allows agents to predict peer intentions and enhance coordination.Built on a multi-agent Actor-Critic architecture,CORAL enables agents to balance self-interest with group objectives.Comprehensive evaluations in a high-fidelity simulation show that our method significantly outperforms state-of-theart baselines like multi-agent deep deterministic policy gradient(MADDPG)and monotonic value function factorisation for deep multi-agent reinforcement learning(QMIX)in path planning efficiency,collision avoidance,and scalability.展开更多
In this paper,the distributed optimal formation control problem of heterogeneous Euler–Lagrange multi-agent systems with generic formation constraints and inequality constraints is investigated.Based on the primal–d...In this paper,the distributed optimal formation control problem of heterogeneous Euler–Lagrange multi-agent systems with generic formation constraints and inequality constraints is investigated.Based on the primal–dual dynamics and the adaptive control technique,a distributed optimal formation controller consists of a velocity reference signal generator and a velocity tracking controller is proposed.By using the optimality condition,the relationship between the equilibrium point of the closed-loop system and the optimal solution of the optimization problem is established.Then,by utilizing Lyapunov stability analysis,it is rigorously proved that the optimal formation is reached with the proposed controller.Lastly,simulation examples are provided to substantiate the theoretical results.展开更多
Optimization design of hydraulic manifold blocks (HMB) is studied as acomplex solid spatial layout problem. Based on comprehensive research into structure features anddesign rules of HMB, an optimal mathematical model...Optimization design of hydraulic manifold blocks (HMB) is studied as acomplex solid spatial layout problem. Based on comprehensive research into structure features anddesign rules of HMB, an optimal mathematical model for this problem is presented. Usinghuman-computer cooperative genetic algorithm (GA) and its hybrid optitation strategies, integratedlayout and connection design schemes of HMB can be automatically optimized. An example is given totestify it.展开更多
The application of multiple UAVs in complicated tasks has been widely explored in recent years.Due to the advantages of flexibility,cheapness and consistence,the performance of heterogeneous multi-UAVs with proper coo...The application of multiple UAVs in complicated tasks has been widely explored in recent years.Due to the advantages of flexibility,cheapness and consistence,the performance of heterogeneous multi-UAVs with proper cooperative task allocation is superior to over the single UAV.Accordingly,several constraints should be satisfied to realize the efficient cooperation,such as special time-window,variant equipment,specified execution sequence.Hence,a proper task allocation in UAVs is the crucial point for the final success.The task allocation problem of the heterogeneous UAVs can be formulated as a multi-objective optimization problem coupled with the UAV dynamics.To this end,a multi-layer encoding strategy and a constraint scheduling method are designed to handle the critical logical and physical constraints.In addition,four optimization objectives:completion time,target reward,UAV damage,and total range,are introduced to evaluate various allocation plans.Subsequently,to efficiently solve the multi-objective optimization problem,an improved multi-objective quantum-behaved particle swarm optimization(IMOQPSO)algorithm is proposed.During this algorithm,a modified solution evaluation method is designed to guide algorithmic evolution;both the convergence and distribution of particles are considered comprehensively;and boundary solutions which may produce some special allocation plans are preserved.Moreover,adaptive parameter control and mixed update mechanism are also introduced in this algorithm.Finally,both the proposed model and algorithm are verified by simulation experiments.展开更多
Target distribution in cooperative combat is a difficult and emphases. We build up the optimization model according to the rule of fire distribution. We have researched on the optimization model with BOA. The BOA can ...Target distribution in cooperative combat is a difficult and emphases. We build up the optimization model according to the rule of fire distribution. We have researched on the optimization model with BOA. The BOA can estimate the joint probability distribution of the variables with Bayesian network, and the new candidate solutions also can be generated by the joint distribution. The simulation example verified that the method could be used to solve the complex question, the operation was quickly and the solution was best.展开更多
Multi-Target Tracking Guidance(MTTG)in unknown environments has great potential values in applications for Unmanned Aerial Vehicle(UAV)swarms.Although Multi-Agent Deep Reinforcement Learning(MADRL)is a promising techn...Multi-Target Tracking Guidance(MTTG)in unknown environments has great potential values in applications for Unmanned Aerial Vehicle(UAV)swarms.Although Multi-Agent Deep Reinforcement Learning(MADRL)is a promising technique for learning cooperation,most of the existing methods cannot scale well to decentralized UAV swarms due to their computational complexity or global information requirement.This paper proposes a decentralized MADRL method using the maximum reciprocal reward to learn cooperative tracking policies for UAV swarms.This method reshapes each UAV’s reward with a regularization term that is defined as the dot product of the reward vector of all neighbor UAVs and the corresponding dependency vector between the UAV and the neighbors.And the dependence between UAVs can be directly captured by the Pointwise Mutual Information(PMI)neural network without complicated aggregation statistics.Then,the experience sharing Reciprocal Reward Multi-Agent Actor-Critic(MAAC-R)algorithm is proposed to learn the cooperative sharing policy for all homogeneous UAVs.Experiments demonstrate that the proposed algorithm can improve the UAVs’cooperation more effectively than the baseline algorithms,and can stimulate a rich form of cooperative tracking behaviors of UAV swarms.Besides,the learned policy can better scale to other scenarios with more UAVs and targets.展开更多
The coordinated optimization problem of the electricity-gas-heat integrated energy system(IES)has the characteristics of strong coupling,non-convexity,and nonlinearity.The centralized optimization method has a high co...The coordinated optimization problem of the electricity-gas-heat integrated energy system(IES)has the characteristics of strong coupling,non-convexity,and nonlinearity.The centralized optimization method has a high cost of communication and complex modeling.Meanwhile,the traditional numerical iterative solution cannot deal with uncertainty and solution efficiency,which is difficult to apply online.For the coordinated optimization problem of the electricity-gas-heat IES in this study,we constructed a model for the distributed IES with a dynamic distribution factor and transformed the centralized optimization problem into a distributed optimization problem in the multi-agent reinforcement learning environment using multi-agent deep deterministic policy gradient.Introducing the dynamic distribution factor allows the system to consider the impact of changes in real-time supply and demand on system optimization,dynamically coordinating different energy sources for complementary utilization and effectively improving the system economy.Compared with centralized optimization,the distributed model with multiple decision centers can achieve similar results while easing the pressure on system communication.The proposed method considers the dual uncertainty of renewable energy and load in the training.Compared with the traditional iterative solution method,it can better cope with uncertainty and realize real-time decision making of the system,which is conducive to the online application.Finally,we verify the effectiveness of the proposed method using an example of an IES coupled with three energy hub agents.展开更多
To solve the problem of multi-target hunting by an unmanned surface vehicle(USV)fleet,a hunting algorithm based on multi-agent reinforcement learning is proposed.Firstly,the hunting environment and kinematic model wit...To solve the problem of multi-target hunting by an unmanned surface vehicle(USV)fleet,a hunting algorithm based on multi-agent reinforcement learning is proposed.Firstly,the hunting environment and kinematic model without boundary constraints are built,and the criteria for successful target capture are given.Then,the cooperative hunting problem of a USV fleet is modeled as a decentralized partially observable Markov decision process(Dec-POMDP),and a distributed partially observable multitarget hunting Proximal Policy Optimization(DPOMH-PPO)algorithm applicable to USVs is proposed.In addition,an observation model,a reward function and the action space applicable to multi-target hunting tasks are designed.To deal with the dynamic change of observational feature dimension input by partially observable systems,a feature embedding block is proposed.By combining the two feature compression methods of column-wise max pooling(CMP)and column-wise average-pooling(CAP),observational feature encoding is established.Finally,the centralized training and decentralized execution framework is adopted to complete the training of hunting strategy.Each USV in the fleet shares the same policy and perform actions independently.Simulation experiments have verified the effectiveness of the DPOMH-PPO algorithm in the test scenarios with different numbers of USVs.Moreover,the advantages of the proposed model are comprehensively analyzed from the aspects of algorithm performance,migration effect in task scenarios and self-organization capability after being damaged,the potential deployment and application of DPOMH-PPO in the real environment is verified.展开更多
An ant colony optimization with artificial potential field(ACOAPF)algorithm is proposed to solve the cooperative search mission planning problem of unmanned aerial vehicle(UAV)swarm.This algorithm adopts a distributed...An ant colony optimization with artificial potential field(ACOAPF)algorithm is proposed to solve the cooperative search mission planning problem of unmanned aerial vehicle(UAV)swarm.This algorithm adopts a distributed architecture where each UAV is considered as an ant and makes decision autonomously.At each decision step,the ants choose the next gird according to the state transition rule and update its own artificial potential field and pheromone map based on the current search results.Through iterations of this process,the cooperative search of UAV swarm for mission area is realized.The state transition rule is divided into two types.If the artificial potential force is larger than a threshold,the deterministic transition rule is adopted,otherwise a heuristic transition rule is used.The deterministic transition rule can ensure UAVs to avoid the threat or approach the target quickly.And the heuristics transition rule considering the pheromone and heuristic information ensures the continuous search of area with the goal of covering more unknown area and finding more targets.Finally,simulations are carried out to verify the effectiveness of the proposed ACOAPF algorithm for cooperative search mission of UAV swarm.展开更多
Cooperative path planning is an important area in fixed-wing UAV swarm.However,avoiding multiple timevarying obstacles and avoiding local optimum are two challenges for existing approaches in a dynamic environment.Fir...Cooperative path planning is an important area in fixed-wing UAV swarm.However,avoiding multiple timevarying obstacles and avoiding local optimum are two challenges for existing approaches in a dynamic environment.Firstly,a normalized artificial potential field optimization is proposed by reconstructing a novel function with anisotropy in each dimension,which can make the flight speed of a fixed UAV swarm independent of the repulsive/attractive gain coefficient and avoid trapping into local optimization and local oscillation.Then,taking into account minimum velocity and turning angular velocity of fixed-wing UAV swarm,a strategy of decomposing target vector to avoid moving obstacles and pop-up threats is proposed.Finally,several simulations are carried out to illustrate superiority and effectiveness.展开更多
In this paper,a cooperative localization algorithm for autonomous underwater vehicles(AUVs)is proposed.A"parallel"model is adopted to describe the cooperative localization problem instead of the traditional&...In this paper,a cooperative localization algorithm for autonomous underwater vehicles(AUVs)is proposed.A"parallel"model is adopted to describe the cooperative localization problem instead of the traditional"leader-follower"model,and a linear programming associated with convex optimization method is used to deal with the problem.After an unknown-but-bounded model for sensor noise is assumed,bearing and range measurements can be modeled as linear constraints on the configuration space of the AUVs.Merging these constraints induces a convex polyhedron representing the set of all configurations consistent with the sensor measurements.Estimates for the uncertainty in the position of a single AUV or the relative positions of two or more nodes can then be obtained by projecting this polyhedron onto appropriate subspaces of the configuration space.Two different optimization algorithms are given to recover the uncertainty region according to the number of the AUVs.Simulation results are presented for a typical localization example of the AUV formation.The results show that our positioning method offers a good localization accuracy,although a small number of low-cost sensors are needed for each vehicle,and this validates that it is an economical and practical positioning approach compared with the traditional approach.展开更多
In this paper,we consider distributed convex optimization problems on multi-agent networks.We develop and analyze the distributed gradient method which allows each agent to compute its dynamic stepsize by utilizing th...In this paper,we consider distributed convex optimization problems on multi-agent networks.We develop and analyze the distributed gradient method which allows each agent to compute its dynamic stepsize by utilizing the time-varying estimate of the local function value at the global optimal solution.Our approach can be applied to both synchronous and asynchronous communication protocols.Specifically,we propose the distributed subgradient with uncoordinated dynamic stepsizes(DS-UD)algorithm for synchronous protocol and the AsynDGD algorithm for asynchronous protocol.Theoretical analysis shows that the proposed algorithms guarantee that all agents reach a consensus on the solution to the multi-agent optimization problem.Moreover,the proposed approach with dynamic stepsizes eliminates the requirement of diminishing stepsize in existing works.Numerical examples of distributed estimation in sensor networks are provided to illustrate the effectiveness of the proposed approach.展开更多
基金funded by National Natural Science Foundation of China(Nos.12402142,11832013 and 11572134)Natural Science Foundation of Hubei Province(No.2024AFB235)+1 种基金Hubei Provincial Department of Education Science and Technology Research Project(No.Q20221714)the Opening Foundation of Hubei Key Laboratory of Digital Textile Equipment(Nos.DTL2023019 and DTL2022012).
文摘Owing to their global search capabilities and gradient-free operation,metaheuristic algorithms are widely applied to a wide range of optimization problems.However,their computational demands become prohibitive when tackling high-dimensional optimization challenges.To effectively address these challenges,this study introduces cooperative metaheuristics integrating dynamic dimension reduction(DR).Building upon particle swarm optimization(PSO)and differential evolution(DE),the proposed cooperative methods C-PSO and C-DE are developed.In the proposed methods,the modified principal components analysis(PCA)is utilized to reduce the dimension of design variables,thereby decreasing computational costs.The dynamic DR strategy implements periodic execution of modified PCA after a fixed number of iterations,resulting in the important dimensions being dynamically identified.Compared with the static one,the dynamic DR strategy can achieve precise identification of important dimensions,thereby enabling accelerated convergence toward optimal solutions.Furthermore,the influence of cumulative contribution rate thresholds on optimization problems with different dimensions is investigated.Metaheuristic algorithms(PSO,DE)and cooperative metaheuristics(C-PSO,C-DE)are examined by 15 benchmark functions and two engineering design problems(speed reducer and composite pressure vessel).Comparative results demonstrate that the cooperative methods achieve significantly superior performance compared to standard methods in both solution accuracy and computational efficiency.Compared to standard metaheuristic algorithms,cooperative metaheuristics achieve a reduction in computational cost of at least 40%.The cooperative metaheuristics can be effectively used to tackle both high-dimensional unconstrained and constrained optimization problems.
文摘In recent years,unmanned aerial vehicles(UAVs)cooperative path planning is attracting more and more research attention.For the multi-UAV cooperative path planning problem,the path planning problem in three-dimensional(3D)environment is transformed into an optimization problem by introducing the fitness function and constraints such as minimizing path length,maintaining a low and stable flight altitude,and avoiding threat zones.A multi-strategy hybrid grey wolf optimization(MSHGWO)algorithm is proposed to address this problem.Firstly,a chaotic Cubic mapping is introduced to initialize the grey wolf positions to make its initial position distribution more uniform.Secondly,an adaptive adjustment weight factor is designed,which can adjust the movement weight based on the rate of fitness value decrease within a unit Euclidean distance,thereby improving the quality of the population.Finally,an elite opposition-based learning strategy is introduced to improve the population diversity so that the population jumps out of the local optimum.Simulation results indicate that the MSHGWO is capable of generating constraint-compliant paths for each UAV in complex 3D environments.Furthermore,the MSHGWO outperforms other algorithms in terms of convergence speed and solution quality.Meanwhile,flight experiments were conducted to validate the path planning capability of MSHGWO in real-world obstacle environments,further demonstrating the feasibility of the proposed multi-UAV cooperative path planning approach.
基金supported in part by the National Natural Science Foundation of China(Basic Science Center Program:61988101)the Sino-German Center for Research Promotion(M-0066)+2 种基金the International(Regional)Cooperation and Exchange Project(61720106008)the Programme of Introducing Talents of Discipline to Universities(the 111 Project)(B17017)the Program of Shanghai Academic Research Leader(20XD1401300).
文摘Multi-agent systems can solve scientific issues related to complex systems that are difficult or impossible for a single agent to solve through mutual collaboration and cooperation optimization.In a multi-agent system,agents with a certain degree of autonomy generate complex interactions due to the correlation and coordination,which is manifested as cooperative/competitive behavior.This survey focuses on multi-agent cooperative optimization and cooperative/non-cooperative games.Starting from cooperative optimization,the studies on distributed optimization and federated optimization are summarized.The survey mainly focuses on distributed online optimization and its application in privacy protection,and overviews federated optimization from the perspective of privacy protection me-chanisms.Then,cooperative games and non-cooperative games are introduced to expand the cooperative optimization problems from two aspects of minimizing global costs and minimizing individual costs,respectively.Multi-agent cooperative and non-cooperative behaviors are modeled by games from both static and dynamic aspects,according to whether each player can make decisions based on the information of other players.Finally,future directions for cooperative optimization,cooperative/non-cooperative games,and their applications are discussed.
基金supported by the National Natural Science Foundation of China(No.62271399)the National Key Research and Development Program of China(No.2022YFB1807102)。
文摘For multi-vehicle networks,Cooperative Positioning(CP)technique has become a promising way to enhance vehicle positioning accuracy.Especially,the CP performance could be further improved by introducing Sensor-Rich Vehicles(SRVs)into CP networks,which is called SRV-aided CP.However,the CP system may split into several sub-clusters that cannot be connected with each other in dense urban environments,in which the sub-clusters with few SRVs will suffer from degradation of CP performance.Since Unmanned Aerial Vehicles(UAVs)have been widely used to aid vehicular communications,we intend to utilize UAVs to assist sub-clusters in CP.In this paper,a UAV-aided CP network is constructed to fully utilize information from SRVs.First,the inter-node connection structure among the UAV and vehicles is designed to share available information from SRVs.After that,the clustering optimization strategy is proposed,in which the UAV cooperates with the high-precision sub-cluster to obtain available information from SRVs,and then broadcasts this positioning-related information to other low-precision sub-clusters.Finally,the Locally-Centralized Factor Graph Optimization(LC-FGO)algorithm is designed to fuse positioning information from cooperators.Simulation results indicate that the positioning accuracy of the CP system could be improved by fully utilizing positioning-related information from SRVs.
基金National Natural Science Foundation of China,grant number 62205120,funded this research.
文摘In the RSSI-based positioning algorithm,regarding the problem of a great conflict between precision and cost,a low-power and low-cost synergic localization algorithm is proposed,where effective methods are adopted in each phase of the localization process and fully use the detective information in the network to improve the positioning precision and robustness.In the ranging period,the power attenuation factor is obtained through the wireless channel modeling,and the RSSI value is transformed into distance.In the positioning period,the preferred reference nodes are used to calculate coordinates.In the position optimization period,Taylor expansion and least-squared iterative update algorithms are used to further improve the location precision.In the positioning,the notion of cooperative localization is introduced,in which the located node satisfying certain demands will be upgraded to a reference node so that it can participate in the positioning of other nodes,and improve the coverage and positioning precision.The results show that on the same network conditions,the proposed algorithm in this paper is similar to the Taylor series expansion algorithm based on the actual coordinates,but much higher than the basic least square algorithm,and the positioning precision is improved rapidly with the reduce of the range error.
基金Supported by the National Natural Science Foundation of China(91016017)the National Aviation Found of China(20115868009)~~
文摘The cooperative control and stability analysis problems for the multi-agent system with sampled com- munication are investigated. Distributed state feedback controllers are adopted for the cooperation of networked agents. A theorem in the form of linear matrix inequalities（LMI） is derived to analyze the system stability. An- other theorem in the form of optimization problem subject to LMI constraints is proposed to design the controller, and then the algorithm is presented. The simulation results verify the validity and the effectiveness of the pro- posed approach.
基金The National Natural Science Foundation of China(No.70401013)the National Key Technology R&D Program of China during the 11th Five-Year Plan Period(No.2006BAH02A06)
文摘With the new characteristics of global cooperation in supply chains being synthetically considered,a hybrid model to the cooperative negotiation process for the order distribution in supply chain is mainly studied.After reviewing and analyzing some main domestic and overseas processes in cooperative negotiation modeling in supply chain,some problems are subsequently pointed out.For example,the traditional simple multi-agent system(MAS)frameworks which have some limitations,are not suitable for solving modeling complex systems.To solve these problems,thinking with the aid of the multi-agent structure and complex system modeling,the manufacturing supply chain is taken as an example,and a time Petri net production model is adopted to decompose the materials.And then a cooperative negotiation model for the order distribution in supply chain is constructed based on combining multi-agent techniques with time Petri net modeling.The simulation results reveal that the above model helps solve the problems of cooperative negotiation in supply chains.
文摘Cooperative multi-UAV search requires jointly optimizing wide-area coverage,rapid target discovery,and endurance under sensing and motion constraints.Resolving this coupling enables scalable coordination with high data efficiency and mission reliability.We formulate this problem as a discounted Markov decision process on an occupancy grid with a cellwise Bayesian belief update,yielding a Markov state that couples agent poses with a probabilistic target field.On this belief–MDP we introduce a segment-conditioned latent-intent framework,in which a discrete intent head selects a latent skill every K steps and an intra-segment GRU policy generates per-step control conditioned on the fixed intent;both components are trained end-to-end with proximal updates under a centralized critic.On the 50×50 grid,coverage and discovery convergence times are reduced by up to 48%and 40%relative to a flat actor-critic benchmark,and the aggregated convergence metric improves by about 12%compared with a stateof-the-art hierarchical method.Qualitative analyses further reveal stable spatial sectorization,low path overlap,and fuel-aware patrolling,indicating that segment-conditioned latent intents provide an effective and scalable mechanism for coordinated multi-UAV search.
基金supported by the STI 2030 Major Projects(No.2022ZD0208804)the National Natural Science Foundation of China(No.62473017)。
文摘Robust cooperative unmanned aerial vehicle(UAV)formation in complex 3D environments is hampered by reward sparsity and inefficient collaboration.To address this,we propose context-aware relational agent learning(CORAL),a novel multi-agent deep reinforcement learning framework.CORAL synergistically integrates two modules:(1)a novelty-based intrinsic reward module to drive efficient exploration and(2)an explicit relational learning module that allows agents to predict peer intentions and enhance coordination.Built on a multi-agent Actor-Critic architecture,CORAL enables agents to balance self-interest with group objectives.Comprehensive evaluations in a high-fidelity simulation show that our method significantly outperforms state-of-theart baselines like multi-agent deep deterministic policy gradient(MADDPG)and monotonic value function factorisation for deep multi-agent reinforcement learning(QMIX)in path planning efficiency,collision avoidance,and scalability.
基金supported in part by the National Key Research and Development Program of China under Grant 2022YFB3303900in part by the National Natural Science Foundation of China under Grants 62103277 and 62025305。
文摘In this paper,the distributed optimal formation control problem of heterogeneous Euler–Lagrange multi-agent systems with generic formation constraints and inequality constraints is investigated.Based on the primal–dual dynamics and the adaptive control technique,a distributed optimal formation controller consists of a velocity reference signal generator and a velocity tracking controller is proposed.By using the optimality condition,the relationship between the equilibrium point of the closed-loop system and the optimal solution of the optimization problem is established.Then,by utilizing Lyapunov stability analysis,it is rigorously proved that the optimal formation is reached with the proposed controller.Lastly,simulation examples are provided to substantiate the theoretical results.
基金This project is supported by Provincial ScienceTechnology Foundation of Liaoning (No. 20022132)
文摘Optimization design of hydraulic manifold blocks (HMB) is studied as acomplex solid spatial layout problem. Based on comprehensive research into structure features anddesign rules of HMB, an optimal mathematical model for this problem is presented. Usinghuman-computer cooperative genetic algorithm (GA) and its hybrid optitation strategies, integratedlayout and connection design schemes of HMB can be automatically optimized. An example is given totestify it.
基金Project(61801495)supported by the National Natural Science Foundation of China
文摘The application of multiple UAVs in complicated tasks has been widely explored in recent years.Due to the advantages of flexibility,cheapness and consistence,the performance of heterogeneous multi-UAVs with proper cooperative task allocation is superior to over the single UAV.Accordingly,several constraints should be satisfied to realize the efficient cooperation,such as special time-window,variant equipment,specified execution sequence.Hence,a proper task allocation in UAVs is the crucial point for the final success.The task allocation problem of the heterogeneous UAVs can be formulated as a multi-objective optimization problem coupled with the UAV dynamics.To this end,a multi-layer encoding strategy and a constraint scheduling method are designed to handle the critical logical and physical constraints.In addition,four optimization objectives:completion time,target reward,UAV damage,and total range,are introduced to evaluate various allocation plans.Subsequently,to efficiently solve the multi-objective optimization problem,an improved multi-objective quantum-behaved particle swarm optimization(IMOQPSO)algorithm is proposed.During this algorithm,a modified solution evaluation method is designed to guide algorithmic evolution;both the convergence and distribution of particles are considered comprehensively;and boundary solutions which may produce some special allocation plans are preserved.Moreover,adaptive parameter control and mixed update mechanism are also introduced in this algorithm.Finally,both the proposed model and algorithm are verified by simulation experiments.
基金This project was supported by the Fund of College Doctor Degree (20020699009)
文摘Target distribution in cooperative combat is a difficult and emphases. We build up the optimization model according to the rule of fire distribution. We have researched on the optimization model with BOA. The BOA can estimate the joint probability distribution of the variables with Bayesian network, and the new candidate solutions also can be generated by the joint distribution. The simulation example verified that the method could be used to solve the complex question, the operation was quickly and the solution was best.
基金funded by the Science and Technology Innovation 2030-Key Project of“New Generation Artificial Intelligence”,China(No.2020AAA0108200)the National Natural Science Foundation of China(No.61906209)。
文摘Multi-Target Tracking Guidance(MTTG)in unknown environments has great potential values in applications for Unmanned Aerial Vehicle(UAV)swarms.Although Multi-Agent Deep Reinforcement Learning(MADRL)is a promising technique for learning cooperation,most of the existing methods cannot scale well to decentralized UAV swarms due to their computational complexity or global information requirement.This paper proposes a decentralized MADRL method using the maximum reciprocal reward to learn cooperative tracking policies for UAV swarms.This method reshapes each UAV’s reward with a regularization term that is defined as the dot product of the reward vector of all neighbor UAVs and the corresponding dependency vector between the UAV and the neighbors.And the dependence between UAVs can be directly captured by the Pointwise Mutual Information(PMI)neural network without complicated aggregation statistics.Then,the experience sharing Reciprocal Reward Multi-Agent Actor-Critic(MAAC-R)algorithm is proposed to learn the cooperative sharing policy for all homogeneous UAVs.Experiments demonstrate that the proposed algorithm can improve the UAVs’cooperation more effectively than the baseline algorithms,and can stimulate a rich form of cooperative tracking behaviors of UAV swarms.Besides,the learned policy can better scale to other scenarios with more UAVs and targets.
基金supported by The National Key R&D Program of China(2020YFB0905900):Research on artificial intelligence application of power internet of things.
文摘The coordinated optimization problem of the electricity-gas-heat integrated energy system(IES)has the characteristics of strong coupling,non-convexity,and nonlinearity.The centralized optimization method has a high cost of communication and complex modeling.Meanwhile,the traditional numerical iterative solution cannot deal with uncertainty and solution efficiency,which is difficult to apply online.For the coordinated optimization problem of the electricity-gas-heat IES in this study,we constructed a model for the distributed IES with a dynamic distribution factor and transformed the centralized optimization problem into a distributed optimization problem in the multi-agent reinforcement learning environment using multi-agent deep deterministic policy gradient.Introducing the dynamic distribution factor allows the system to consider the impact of changes in real-time supply and demand on system optimization,dynamically coordinating different energy sources for complementary utilization and effectively improving the system economy.Compared with centralized optimization,the distributed model with multiple decision centers can achieve similar results while easing the pressure on system communication.The proposed method considers the dual uncertainty of renewable energy and load in the training.Compared with the traditional iterative solution method,it can better cope with uncertainty and realize real-time decision making of the system,which is conducive to the online application.Finally,we verify the effectiveness of the proposed method using an example of an IES coupled with three energy hub agents.
基金financial support from National Natural Science Foundation of China(Grant No.61601491)Natural Science Foundation of Hubei Province,China(Grant No.2018CFC865)Military Research Project of China(-Grant No.YJ2020B117)。
文摘To solve the problem of multi-target hunting by an unmanned surface vehicle(USV)fleet,a hunting algorithm based on multi-agent reinforcement learning is proposed.Firstly,the hunting environment and kinematic model without boundary constraints are built,and the criteria for successful target capture are given.Then,the cooperative hunting problem of a USV fleet is modeled as a decentralized partially observable Markov decision process(Dec-POMDP),and a distributed partially observable multitarget hunting Proximal Policy Optimization(DPOMH-PPO)algorithm applicable to USVs is proposed.In addition,an observation model,a reward function and the action space applicable to multi-target hunting tasks are designed.To deal with the dynamic change of observational feature dimension input by partially observable systems,a feature embedding block is proposed.By combining the two feature compression methods of column-wise max pooling(CMP)and column-wise average-pooling(CAP),observational feature encoding is established.Finally,the centralized training and decentralized execution framework is adopted to complete the training of hunting strategy.Each USV in the fleet shares the same policy and perform actions independently.Simulation experiments have verified the effectiveness of the DPOMH-PPO algorithm in the test scenarios with different numbers of USVs.Moreover,the advantages of the proposed model are comprehensively analyzed from the aspects of algorithm performance,migration effect in task scenarios and self-organization capability after being damaged,the potential deployment and application of DPOMH-PPO in the real environment is verified.
基金supported by the National Natural Science Foundation of China (Nos.61973158, 61673209)the Aeronautical Science Foundation (No.2016ZA52009)
文摘An ant colony optimization with artificial potential field(ACOAPF)algorithm is proposed to solve the cooperative search mission planning problem of unmanned aerial vehicle(UAV)swarm.This algorithm adopts a distributed architecture where each UAV is considered as an ant and makes decision autonomously.At each decision step,the ants choose the next gird according to the state transition rule and update its own artificial potential field and pheromone map based on the current search results.Through iterations of this process,the cooperative search of UAV swarm for mission area is realized.The state transition rule is divided into two types.If the artificial potential force is larger than a threshold,the deterministic transition rule is adopted,otherwise a heuristic transition rule is used.The deterministic transition rule can ensure UAVs to avoid the threat or approach the target quickly.And the heuristics transition rule considering the pheromone and heuristic information ensures the continuous search of area with the goal of covering more unknown area and finding more targets.Finally,simulations are carried out to verify the effectiveness of the proposed ACOAPF algorithm for cooperative search mission of UAV swarm.
文摘Cooperative path planning is an important area in fixed-wing UAV swarm.However,avoiding multiple timevarying obstacles and avoiding local optimum are two challenges for existing approaches in a dynamic environment.Firstly,a normalized artificial potential field optimization is proposed by reconstructing a novel function with anisotropy in each dimension,which can make the flight speed of a fixed UAV swarm independent of the repulsive/attractive gain coefficient and avoid trapping into local optimization and local oscillation.Then,taking into account minimum velocity and turning angular velocity of fixed-wing UAV swarm,a strategy of decomposing target vector to avoid moving obstacles and pop-up threats is proposed.Finally,several simulations are carried out to illustrate superiority and effectiveness.
基金Supported by National High Technology Research and Development Program of China(863 Program)(2007AA809502C)National Natural Science Foundation of China(50979093)Program for New Century Excellent Talents in University(NCET-06-0877)
文摘In this paper,a cooperative localization algorithm for autonomous underwater vehicles(AUVs)is proposed.A"parallel"model is adopted to describe the cooperative localization problem instead of the traditional"leader-follower"model,and a linear programming associated with convex optimization method is used to deal with the problem.After an unknown-but-bounded model for sensor noise is assumed,bearing and range measurements can be modeled as linear constraints on the configuration space of the AUVs.Merging these constraints induces a convex polyhedron representing the set of all configurations consistent with the sensor measurements.Estimates for the uncertainty in the position of a single AUV or the relative positions of two or more nodes can then be obtained by projecting this polyhedron onto appropriate subspaces of the configuration space.Two different optimization algorithms are given to recover the uncertainty region according to the number of the AUVs.Simulation results are presented for a typical localization example of the AUV formation.The results show that our positioning method offers a good localization accuracy,although a small number of low-cost sensors are needed for each vehicle,and this validates that it is an economical and practical positioning approach compared with the traditional approach.
基金supported by the Key Research and Development Project in Guangdong Province(2020B0101050001)the National Science Foundation of China(61973214,61590924,61963030)the Natural Science Foundation of Shanghai(19ZR1476200)。
文摘In this paper,we consider distributed convex optimization problems on multi-agent networks.We develop and analyze the distributed gradient method which allows each agent to compute its dynamic stepsize by utilizing the time-varying estimate of the local function value at the global optimal solution.Our approach can be applied to both synchronous and asynchronous communication protocols.Specifically,we propose the distributed subgradient with uncoordinated dynamic stepsizes(DS-UD)algorithm for synchronous protocol and the AsynDGD algorithm for asynchronous protocol.Theoretical analysis shows that the proposed algorithms guarantee that all agents reach a consensus on the solution to the multi-agent optimization problem.Moreover,the proposed approach with dynamic stepsizes eliminates the requirement of diminishing stepsize in existing works.Numerical examples of distributed estimation in sensor networks are provided to illustrate the effectiveness of the proposed approach.
