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.展开更多
The traffic equilibrium assignment problem under tradable credit scheme(TCS) in a bi-modal stochastic transportation network is investigated in this paper. To describe traveler’s risk-taking behaviors under uncertain...The traffic equilibrium assignment problem under tradable credit scheme(TCS) in a bi-modal stochastic transportation network is investigated in this paper. To describe traveler’s risk-taking behaviors under uncertainty, the cumulative prospect theory(CPT) is adopted. Travelers are assumed to choose the paths with the minimum perceived generalized path costs, consisting of time prospect value(PV) and monetary cost. At equilibrium with a given TCS, the endogenous reference points and credit price remain constant, and are consistent with the equilibrium flow pattern and the corresponding travel time distributions of road sub-network. To describe such an equilibrium state, the CPT-based stochastic user equilibrium(SUE) conditions can be formulated under TCS. An equivalent variational inequality(VI) model embedding a parameterized fixed point(FP) model is then established, with its properties analyzed theoretically. A heuristic solution algorithm is developed to solve the model, which contains two-layer iterations. The outer iteration is a bisection-based contraction method to find the equilibrium credit price, and the inner iteration is essentially the method of successive averages(MSA) to determine the corresponding CPT-based SUE network flow pattern. Numerical experiments are provided to validate the model and algorithm.展开更多
Electromagnetic detection satellite（EDS） is a type of Earth observation satellite（EOS）. Satellites observation and data down-link scheduling plays a significant role in improving the efficiency of satellite observ...Electromagnetic detection satellite（EDS） is a type of Earth observation satellite（EOS）. Satellites observation and data down-link scheduling plays a significant role in improving the efficiency of satellite observation systems. However, the current works mainly focus on the scheduling of imaging satellites, little work focuses on the scheduling of EDSes for its specific requirements.And current works mainly schedule satellite resources and data down-link resources separately, not considering them in a globally optimal perspective. The EDSes and data down-link resources are scheduled in an integrated process and the scheduling result is searched globally. Considering the specific constraints of EDS, a coordinate scheduling model for EDS observation tasks and data transmission jobs is established and an algorithm based on the genetic algorithm is proposed. Furthermore, the convergence of our algorithm is proved. To deal with some specific constraints, a solution repairing algorithm of polynomial computing time is designed. Finally, some experiments are conducted to validate the correctness and practicability of our scheduling algorithms.展开更多
基金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.
基金Project(BX20180268)supported by National Postdoctoral Program for Innovative Talent,ChinaProject(300102228101)supported by Fundamental Research Funds for the Central Universities of China+1 种基金Project(51578150)supported by the National Natural Science Foundation of ChinaProject(18YJCZH130)supported by the Humanities and Social Science Project of Chinese Ministry of Education
文摘The traffic equilibrium assignment problem under tradable credit scheme(TCS) in a bi-modal stochastic transportation network is investigated in this paper. To describe traveler’s risk-taking behaviors under uncertainty, the cumulative prospect theory(CPT) is adopted. Travelers are assumed to choose the paths with the minimum perceived generalized path costs, consisting of time prospect value(PV) and monetary cost. At equilibrium with a given TCS, the endogenous reference points and credit price remain constant, and are consistent with the equilibrium flow pattern and the corresponding travel time distributions of road sub-network. To describe such an equilibrium state, the CPT-based stochastic user equilibrium(SUE) conditions can be formulated under TCS. An equivalent variational inequality(VI) model embedding a parameterized fixed point(FP) model is then established, with its properties analyzed theoretically. A heuristic solution algorithm is developed to solve the model, which contains two-layer iterations. The outer iteration is a bisection-based contraction method to find the equilibrium credit price, and the inner iteration is essentially the method of successive averages(MSA) to determine the corresponding CPT-based SUE network flow pattern. Numerical experiments are provided to validate the model and algorithm.
基金supported by the National Natural Science Foundation of China(6110118461174159)
文摘Electromagnetic detection satellite（EDS） is a type of Earth observation satellite（EOS）. Satellites observation and data down-link scheduling plays a significant role in improving the efficiency of satellite observation systems. However, the current works mainly focus on the scheduling of imaging satellites, little work focuses on the scheduling of EDSes for its specific requirements.And current works mainly schedule satellite resources and data down-link resources separately, not considering them in a globally optimal perspective. The EDSes and data down-link resources are scheduled in an integrated process and the scheduling result is searched globally. Considering the specific constraints of EDS, a coordinate scheduling model for EDS observation tasks and data transmission jobs is established and an algorithm based on the genetic algorithm is proposed. Furthermore, the convergence of our algorithm is proved. To deal with some specific constraints, a solution repairing algorithm of polynomial computing time is designed. Finally, some experiments are conducted to validate the correctness and practicability of our scheduling algorithms.
