Welcome to Acta Armamentarii ! Today is Share:

Acta Armamentarii ›› 2021, Vol. 42 ›› Issue (5): 997-1003.doi: 10.3969/j.issn.1000-1093.2021.05.012

• Paper • Previous Articles     Next Articles

Knapsack Problem-based Algorithm for Time Resource Management of Multiple Phased Array Radars for Multiple Targets Tracking

DING Haiting, ZHOU Lin, DIAO Weifeng   

  1. (Nanjing Research Institute of Electronics Technology, Nanjing 210039, Jiangsu, China)
  • Online:2021-06-12

Abstract: A knapsack problem-based algorithm for time resource management of multiple phased array radars for multiple targets tracking is proposed for target grouping and time planning. When the time resource is limited, the target grouping and time planning can be realized jointly. The segmented pulse repetition period and fuzzy logic priority method are used to obtain the time resource and priority used for tracking the target from the priori information of target, and construct the time resource management model. The time planning and target grouping are considered jointly based on the knapsack problems, the sum of the tracking target priorities is used as the objective function of the algorithm, and the time resource model is solved through the idea of dynamic planning. Simulated results show that the knapsack problem-based algorithm effectively improve its hit value ratios. The problem of multiple phased array radars tracking multiple targets is solved from the perspective of the knapsack problems, which can track more targets in limited time and ensure the tracking of important targets at the same time.

Key words: multiplephasedarrayradars, targettracking, timeresource, knapsackproblem, dynamicplanning

CLC Number: