A Non-myopic and Fast Resource Scheduling Algorithm for Multi-target Tracking of Space-based Radar Considering Optimal Integrated Performance
Appropriate and effective resource scheduling is the key to achieving the best performance for a space-based radar.Considering the resource scheduling problem of multi-target tracking in a space-based radar system,we establish a cost function that considers target threat,tracking accuracy,and Low Probability of Interception(LPI).Considering target uncertainty and constraints of the space-based platform and long-term expected cost,we establish a resource scheduling model based on the Partially Observable Markov Decision Process(POMDP)with multiple constraints.To transform and decompose the resource scheduling problem of multi-target tracking with multiple constraints into multiple unconstrained sub-problems,we use the Lagrangian relaxation method.To deal with the curse of dimensionality caused by the continuous state space,continuous action space and continuous observation space,we use the online POMDP algorithm based on the Monte Carlo Tree Search(MCTS)and partially observable Monte Carlo planning with observation widening algorithm.Finally,a non-myopic and fast resource scheduling algorithm with comprehensive performance indices for multi-target tracking in a space-based radar system is proposed.Simulation results show that the proposed algorithm,when compared with the existing scheduling algorithms,allocates resources more appropriately and shows better performance.
Space-based radarResource schedulingMulti-target trackingPartially observable Markov decision processMonte Carlo Tree Search(MCTS)
万方数据
维普
