Optimal Target Assignment with Seamless Handovers for Networked Radars

Abstract

This paper proposes a binary linear programming formulation for multiple target assignment of a radar network and demonstrates its applicability to obtain optimal solutions using an off-the-shelf mixed-integer linear programming solver. The goal of radar resource scheduling in this paper is to assign the maximum number of targets by handing over targets between networked radar systems to overcome physical limitations such as the detection range and simultaneous tracking capability of each radar. To achieve this, time windows are generated considering the relation between each radar and target considering incoming target information. Numerical experiments using a local-scale simulation were performed to verify the functionality of the formulation and a sensitivity analysis was conducted to identify the trend of the results with respect to several parameters. Additional experiments performed for a large-scale (battlefield) scenario confirmed that the proposed formulation is valid and applicable for hundreds of targets and corresponding radar network systems composed of five distributed radars. The performance of the scheduling solutions using the proposed formulation was better than that of the general greedy algorithm as a heuristic approach in terms of objective value as well as the number of handovers.

Efficient Radar-Target Assignment in Low Probability of Intercept Radar Networks: A Machine-Learning Approach

“…It is worth noting that optimizing the RTA in the general case, where multiple radars can be assigned to each target in a multi-target environment, is fundamental and essential, as highlighted in previous studies [11], [12], [13], [14], [15], [16], [17], [18], [19], [20], [23].…”

“…Reference [16] proposed a heuristic algorithm to solve the MRMTA problem considering the LPI as the objective function and detection probability as the quality-of-service constraint. Reference [17] proposed a binary linear programming method to solve a linearized RTA problem. The proposed method had obvious performance advantages in terms of the number of RTAs and radar switches.…”

“…LPI radars are designed to search or track targets while remaining hidden from the enemy's equipment, and this property can be adapted to distributed radar networks that are netted together [9], [10], [11], [12], [13], [14]. In such networks, fusing radar decisions and applying location diversity can improve the LPI property [15], [16], [17], [18]. Efficient radar-target assignment (RTA) is crucial for multi-radar multi-target networks to maintain the LPI property while preserving constraints on detection performance, complexity, and power budgets [19], [20].…”

Reliable Task Planning of Networked Devices as a Multi-Objective Problem Using NSGA-II and Reinforcement Learning

“…Target tracking and detection by a single radar is challenging [1,2]. If radars with different advantages are networked to work collaboratively, the target tracking and detection capability of the system can be significantly improved, thanks to performance advantages in systems, polarization modes, and frequency of different radars [3][4][5].…”

A search method for a hypersonic gliding vehicle based on early warning information guidance

“…To the best of our limited knowledge, many scholars have researched the detection of HGV and the optimisation of radar resources, but these studies mainly focus on the HGV trajectory tracking and prediction [3,4], radar task scheduling [5] and radar target allocation [6,7]. There are few studies on the optimisation of radar search parameters.…”