The multi-target assignment(MTA)problem,a crucial challenge in command control,mission planning,and a fundamental research focus in military operations,has garnered significant attention over the years.Extensively stu...The multi-target assignment(MTA)problem,a crucial challenge in command control,mission planning,and a fundamental research focus in military operations,has garnered significant attention over the years.Extensively studied across various domains such as land,sea,air,space,and electronics,the MTA problem has led to the emergence of numerous models and algorithms.To delve deeper into this field,this paper starts by conducting a bibliometric analysis on 463 Scopus database papers using CiteSpace software.The analysis includes examining keyword clustering,co-occurrence,and burst,with visual representations of the results.Following this,the paper provides an overview of current classification and modeling techniques for addressing the MTA problem,distinguishing between static multi-target assignment(SMTA)and dynamic multi-target assignment(DMTA).Subsequently,existing solution algorithms for the MTA problem are reviewed,generally falling into three categories:exact algorithms,heuristic algorithms,and machine learning algorithms.Finally,a development framework is proposed based on the"HIGH"model(high-speed,integrated,great,harmonious)to guide future research and intelligent weapon system development concerning the MTA problem.This framework emphasizes application scenarios,modeling mechanisms,solution algorithms,and system efficiency to offer a roadmap for future exploration in this area.展开更多
Compared with single-domain unmanned swarms,cross-domain unmanned swarms continue to face new challenges in terms of platform performance and constraints.In this paper,a joint unmanned swarm target assignment and miss...Compared with single-domain unmanned swarms,cross-domain unmanned swarms continue to face new challenges in terms of platform performance and constraints.In this paper,a joint unmanned swarm target assignment and mission trajectory planning method is proposed to meet the requirements of cross-domain unmanned swarm mission planning.Firstly,the different performances of cross-domain heterogeneous platforms and mission requirements of targets are characterised by using a collection of operational resources.Secondly,an algorithmic framework for joint target assignment and mission trajectory planning is proposed,in which the initial planning of the trajectory is performed in the target assignment phase,while the trajectory is further optimised afterwards.Next,the estimation of the distribution algorithms is combined with the genetic algorithm to solve the objective function.Finally,the algorithm is numerically simulated by specific cases.Simulation results indicate that the proposed algorithm can perform effective task assignment and trajectory planning for cross-domain unmanned swarms.Furthermore,the solution performance of the hybrid estimation of distribution algorithm(EDA)-genetic algorithm(GA)algorithm is better than that of GA and EDA.展开更多
As a crucial process in the coordinated strikes of unmanned aerial vehicles(UAVs), weapon-target assignment is vital for optimizing the allocation of available weapons and effectively exploiting the capabilities of UA...As a crucial process in the coordinated strikes of unmanned aerial vehicles(UAVs), weapon-target assignment is vital for optimizing the allocation of available weapons and effectively exploiting the capabilities of UAVs. Existing weapon-target assignment methods primarily focus on macro cluster constraints while neglecting individual strategy updates. This paper proposes a novel weapon-target assignment method for UAVs based on the multi-strategy threshold public goods game(PGG). By analyzing the concept mapping between weapon-target assignment for UAVs and multi-strategy threshold PGG, a weapon-target assignment model for UAVs based on the multi-strategy threshold PGG is established, which is adaptively complemented by the diverse cooperation-defection strategy library and the utility function based on the threshold mechanism. Additionally, a multi-chain Markov is formulated to quantitatively describe the stochastic evolutionary dynamics, whose evolutionary stable distribution is theoretically derived through the development of a strategy update rule based on preference-based aspiration dynamic. Numerical simulation results validate the feasibility and effectiveness of the proposed method, and the impacts of selection intensity, preference degree and threshold on the evolutionary stable distribution are analyzed. Comparative simulations show that the proposed method outperforms GWO, DE, and NSGA-II, achieving 17.18% higher expected utility than NSGA-II and reducing evolutionary stable times by 25% in large-scale scenario.展开更多
The formation control of multiple unmanned aerial vehicles(multi-UAVs)has always been a research hotspot.Based on the straight line trajectory,a multi-UAVs target point assignment algorithm based on the assignment pro...The formation control of multiple unmanned aerial vehicles(multi-UAVs)has always been a research hotspot.Based on the straight line trajectory,a multi-UAVs target point assignment algorithm based on the assignment probability is proposed to achieve the shortest overall formation path of multi-UAVs with low complexity and reduce the energy consumption.In order to avoid the collision between UAVs in the formation process,the concept of safety ball is introduced,and the collision detection based on continuous motion of two time slots and the lane occupation detection after motion is proposed to avoid collision between UAVs.Based on the idea of game theory,a method of UAV motion form setting based on the maximization of interests is proposed,including the maximization of self-interest and the maximization of formation interest is proposed,so that multi-UAVs can complete the formation task quickly and reasonably with the linear trajectory assigned in advance.Finally,through simulation verification,the multi-UAVs target assignment algorithm based on the assignment probability proposed in this paper can effectively reduce the total path length,and the UAV motion selection method based on the maximization interests can effectively complete the task formation.展开更多
多智能体信息融合(multi-agent information fusion,MAIF)系统主要面向多个智能体之间的信息融合、调节、交流和矛盾处理。研究针对数据高度冲突条件下的D-S证据理论失效问题,提出一种将重构的基本概率分配和信念熵相结合的多智能体系...多智能体信息融合(multi-agent information fusion,MAIF)系统主要面向多个智能体之间的信息融合、调节、交流和矛盾处理。研究针对数据高度冲突条件下的D-S证据理论失效问题,提出一种将重构的基本概率分配和信念熵相结合的多智能体系统冲突数据融合方法。该方法使用重构的基本概率分配和信念熵修正证据的可靠性,获得更合理的证据,使用Dempster组合规则将证据进行融合得到结果,在2个实验中均得到了超过90%的置信度。实验表明了该方法的有效性,提高了MAIF系统辨识过程的精度。展开更多
为了解决仅依靠星间链路的自主运行导航星座缺乏时空基准的问题,北斗卫星导航系统引入地面锚固站,与空间卫星共同构成可自主运行的星地/星间一体化网络。在星间链路体制、可见性、载荷数量约束下,建立北斗系统星地/星间链路网络一体化...为了解决仅依靠星间链路的自主运行导航星座缺乏时空基准的问题,北斗卫星导航系统引入地面锚固站,与空间卫星共同构成可自主运行的星地/星间一体化网络。在星间链路体制、可见性、载荷数量约束下,建立北斗系统星地/星间链路网络一体化规划模型,提出基于网络分层的层间链路规划算法,以及基于模拟退火算法的测距链路位置精度衰减因子(position dilution of precision, PDOP)和网络连通度多目标优化算法。根据规划仿真结果,锚固站可以最少链路跳数实现向空间卫星的信息分发;卫星测距链路PDOP均小于1.4,且接近其参考下限;星地/星间一体化网络连通度优于3。结果表明,一体化规划算法能够满足锚固站向卫星的信息快速分发、网络空间基准维持的测距以及网络稳健性等性能需求。展开更多
基金the financial support provided by the National Natural Science Foundation of China(NSFC)(Grant No.62173274)the National Key R&D Program of China(Grant No.2019YFA0405300)+4 种基金the Natural Science Foundation of Hunan Province of China(Grant No.2021JJ10045)the Practice and Innovation Funds for Graduate Students of Northwestern Polytechnical University(Grant No.PF2023046)the Open Research Subject of State Key Laboratory of Intelligent Game(Grant No.ZBKF-24-01)the Postdoctoral Fellowship Program of CPSF(No.GZB20240989)the China Postdoctoral Science Foundation(Grant No.2024M754304)。
文摘The multi-target assignment(MTA)problem,a crucial challenge in command control,mission planning,and a fundamental research focus in military operations,has garnered significant attention over the years.Extensively studied across various domains such as land,sea,air,space,and electronics,the MTA problem has led to the emergence of numerous models and algorithms.To delve deeper into this field,this paper starts by conducting a bibliometric analysis on 463 Scopus database papers using CiteSpace software.The analysis includes examining keyword clustering,co-occurrence,and burst,with visual representations of the results.Following this,the paper provides an overview of current classification and modeling techniques for addressing the MTA problem,distinguishing between static multi-target assignment(SMTA)and dynamic multi-target assignment(DMTA).Subsequently,existing solution algorithms for the MTA problem are reviewed,generally falling into three categories:exact algorithms,heuristic algorithms,and machine learning algorithms.Finally,a development framework is proposed based on the"HIGH"model(high-speed,integrated,great,harmonious)to guide future research and intelligent weapon system development concerning the MTA problem.This framework emphasizes application scenarios,modeling mechanisms,solution algorithms,and system efficiency to offer a roadmap for future exploration in this area.
文摘Compared with single-domain unmanned swarms,cross-domain unmanned swarms continue to face new challenges in terms of platform performance and constraints.In this paper,a joint unmanned swarm target assignment and mission trajectory planning method is proposed to meet the requirements of cross-domain unmanned swarm mission planning.Firstly,the different performances of cross-domain heterogeneous platforms and mission requirements of targets are characterised by using a collection of operational resources.Secondly,an algorithmic framework for joint target assignment and mission trajectory planning is proposed,in which the initial planning of the trajectory is performed in the target assignment phase,while the trajectory is further optimised afterwards.Next,the estimation of the distribution algorithms is combined with the genetic algorithm to solve the objective function.Finally,the algorithm is numerically simulated by specific cases.Simulation results indicate that the proposed algorithm can perform effective task assignment and trajectory planning for cross-domain unmanned swarms.Furthermore,the solution performance of the hybrid estimation of distribution algorithm(EDA)-genetic algorithm(GA)algorithm is better than that of GA and EDA.
基金supported by the National Natural Science Foundation of China (No. 62073267)。
文摘As a crucial process in the coordinated strikes of unmanned aerial vehicles(UAVs), weapon-target assignment is vital for optimizing the allocation of available weapons and effectively exploiting the capabilities of UAVs. Existing weapon-target assignment methods primarily focus on macro cluster constraints while neglecting individual strategy updates. This paper proposes a novel weapon-target assignment method for UAVs based on the multi-strategy threshold public goods game(PGG). By analyzing the concept mapping between weapon-target assignment for UAVs and multi-strategy threshold PGG, a weapon-target assignment model for UAVs based on the multi-strategy threshold PGG is established, which is adaptively complemented by the diverse cooperation-defection strategy library and the utility function based on the threshold mechanism. Additionally, a multi-chain Markov is formulated to quantitatively describe the stochastic evolutionary dynamics, whose evolutionary stable distribution is theoretically derived through the development of a strategy update rule based on preference-based aspiration dynamic. Numerical simulation results validate the feasibility and effectiveness of the proposed method, and the impacts of selection intensity, preference degree and threshold on the evolutionary stable distribution are analyzed. Comparative simulations show that the proposed method outperforms GWO, DE, and NSGA-II, achieving 17.18% higher expected utility than NSGA-II and reducing evolutionary stable times by 25% in large-scale scenario.
基金supported by the Basic Scientific Research Business Expenses of Central Universities(3072022QBZ0806)。
文摘The formation control of multiple unmanned aerial vehicles(multi-UAVs)has always been a research hotspot.Based on the straight line trajectory,a multi-UAVs target point assignment algorithm based on the assignment probability is proposed to achieve the shortest overall formation path of multi-UAVs with low complexity and reduce the energy consumption.In order to avoid the collision between UAVs in the formation process,the concept of safety ball is introduced,and the collision detection based on continuous motion of two time slots and the lane occupation detection after motion is proposed to avoid collision between UAVs.Based on the idea of game theory,a method of UAV motion form setting based on the maximization of interests is proposed,including the maximization of self-interest and the maximization of formation interest is proposed,so that multi-UAVs can complete the formation task quickly and reasonably with the linear trajectory assigned in advance.Finally,through simulation verification,the multi-UAVs target assignment algorithm based on the assignment probability proposed in this paper can effectively reduce the total path length,and the UAV motion selection method based on the maximization interests can effectively complete the task formation.
文摘多智能体信息融合(multi-agent information fusion,MAIF)系统主要面向多个智能体之间的信息融合、调节、交流和矛盾处理。研究针对数据高度冲突条件下的D-S证据理论失效问题,提出一种将重构的基本概率分配和信念熵相结合的多智能体系统冲突数据融合方法。该方法使用重构的基本概率分配和信念熵修正证据的可靠性,获得更合理的证据,使用Dempster组合规则将证据进行融合得到结果,在2个实验中均得到了超过90%的置信度。实验表明了该方法的有效性,提高了MAIF系统辨识过程的精度。
文摘为了解决仅依靠星间链路的自主运行导航星座缺乏时空基准的问题,北斗卫星导航系统引入地面锚固站,与空间卫星共同构成可自主运行的星地/星间一体化网络。在星间链路体制、可见性、载荷数量约束下,建立北斗系统星地/星间链路网络一体化规划模型,提出基于网络分层的层间链路规划算法,以及基于模拟退火算法的测距链路位置精度衰减因子(position dilution of precision, PDOP)和网络连通度多目标优化算法。根据规划仿真结果,锚固站可以最少链路跳数实现向空间卫星的信息分发;卫星测距链路PDOP均小于1.4,且接近其参考下限;星地/星间一体化网络连通度优于3。结果表明,一体化规划算法能够满足锚固站向卫星的信息快速分发、网络空间基准维持的测距以及网络稳健性等性能需求。
