A scheduling algorithm for phased array radar based on adaptive time window

Duan, Yi; Tan, Xiao; Qu, Zhiguo; Wang, Jin; Peng, Xiangyu

doi:10.1109/itoec.2017.8122491

Cited by 5 publications

(3 citation statements)

References 4 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…where P j is the task type, t aj is the task request time [12], the time by which a task requests the radar to schedule, ∆t j is the sample interval between two tasks [12], t dwj is the task dwell time [13], and t wj is the time window [14][15][16]. It is the range of time during which the actual execution time of the radar task can move back and forth relative to the expected execution time.…”

Section: Radar Task and Comprehensive Priority Planningmentioning

confidence: 99%

A Task Scheduling Algorithm for Phased-Array Radar Based on Dynamic Three-Way Decision

Tian

Chen

et al. 2019

Sensors

View full text Add to dashboard Cite

The time resource management of phased-array radars is the key to fulfilling their performance, such as how phased-array radar can efficiently and reasonably schedule tasks under limited resources. Therefore, this paper proposes a task scheduling algorithm for phased-array radar based on dynamic three-way decision. The algorithm introduces three-way decision into the scheduling algorithm and divides the target into three threat areas according to the threat degree (i.e., threat area, nonthreat area, and potential threat area). Different threat domains are assigned different weights and combine the working mode and the task deadline to carry out comprehensive priority planning, so that the radar can reasonably allocate time according to the difference of the target threat level and the threat area in the tracking stage. In addition, an improved adaptive threshold algorithm is proposed to obtain a dynamic three-way decision to achieve the adaptation of the algorithm. A set of performance indicators have been defined to evaluate the algorithm. The relevant experiments have demonstrated that the proposed algorithm can effectively improve the processing capability of phased-array radars when dealing with high-threat targets.

show abstract

Section: Radar Task and Comprehensive Priority Planningmentioning

confidence: 99%

A Task Scheduling Algorithm for Phased-Array Radar Based on Dynamic Three-Way Decision

Tian

Chen

et al. 2019

Sensors

View full text Add to dashboard Cite

show abstract

“…The TSR is calculated by

f_{i}^{o} = \frac{(||, normalΔ T^{i})}{T_{normalW}^{i}},

where

normalΔ T^{i}

is the time shifting of i th task,

T_{normalW}^{i}

is the size of the task's time window [11]. It can be calculated according to the motion state of target and the size of tracking gate.…”

Section: Time Shifting Ratementioning

confidence: 99%

Index for task scheduling in phased array radar

Duan¹,

Tan²,

Qu³

et al. 2019

J. eng.

Self Cite

View full text Add to dashboard Cite

“…They later solved the problem of optimal sensor coordination and tracking allocation so that multiple shipboard radars could integrate so to expand their search area and the number of tracking targets [18]. Regarding the radar scheduling using the concept of time windows, Chaolong et al [19], Jang and Choi [20], Duan et al [21], and Qiang et al [22] introduced time window into the multi function phased array radar’s task scheduling problems.…”

Section: Introductionmentioning

confidence: 99%

Optimal Target Assignment with Seamless Handovers for Networked Radars

Kim

Cho

Lee

et al. 2019

Sensors

View full text Add to dashboard Cite

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.

show abstract

A scheduling algorithm for phased array radar based on adaptive time window

Cited by 5 publications

References 4 publications

A Task Scheduling Algorithm for Phased-Array Radar Based on Dynamic Three-Way Decision

A Task Scheduling Algorithm for Phased-Array Radar Based on Dynamic Three-Way Decision

Index for task scheduling in phased array radar

Optimal Target Assignment with Seamless Handovers for Networked Radars

Contact Info

Product

Resources

About