2017
DOI: 10.1631/fitee.1601358
|View full text |Cite
|
Sign up to set email alerts
|

A scheduling method based on a hybrid genetic particle swarm algorithm for multifunction phased array radar

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
15
0

Year Published

2018
2018
2020
2020

Publication Types

Select...
7

Relationship

0
7

Authors

Journals

citations
Cited by 21 publications
(18 citation statements)
references
References 14 publications
0
15
0
Order By: Relevance
“…The particle swarm algorithm simulates the foraging process of birds in nature. During the foraging process, the birds cooperate and exchange information to constantly move closer to the food area [13]. Abstract birds into particles and apply the process of bird foraging to engineering practice.…”
Section: A Particle Swarm Algorithmmentioning
confidence: 99%
See 1 more Smart Citation
“…The particle swarm algorithm simulates the foraging process of birds in nature. During the foraging process, the birds cooperate and exchange information to constantly move closer to the food area [13]. Abstract birds into particles and apply the process of bird foraging to engineering practice.…”
Section: A Particle Swarm Algorithmmentioning
confidence: 99%
“…Reference [12] studied the resource management problem of multiple-input and multiple-output (MIMO) radar for multitarget tracking and pointed out that the optimal sampling period, transmission power, and subarray selection are all resource allocations in the time domain, which reduces the number of variables for problem solving. Reference [13] is based on the pulse interleaving scheduling method by setting the objective function and constraint conditions, using a hybrid particle swarm genetic algorithm to solve the optimal scheduling plan and successfully transforms the radar scheduling problem into an optimization problem. To quantify the benefit value of the radar task at different start times, reference [14] designed a task scheduler based on the two-slope benefit function.…”
Section: Introductionmentioning
confidence: 99%
“…(i) The successful scheduling ratio (SSR), which is the ratio between the number of all successfully scheduled tasks N suc and that of all request tasks N total . The SSR [7,11,12,18,20,21,25,26] can be expressed as…”
Section: Heuristic Scheduling Algorithm 31 Performance Evaluation Mementioning
confidence: 99%
“…where min Δt SI (k) is the minimum time that the SI can be shortened when its time can accommodate all request tasks. It satisfies min Δt SI (k) = max{t SI min , ξ(k)} (27) when (26) gets the equal sign, adjust time of S(k ov ) and SI1 (and SI2) to their fit values. It is noticeable that when N = 2, time of SI1 should be prior shortened to min Δt SI (1).…”
Section: ξ(K) > T Simentioning
confidence: 99%
See 1 more Smart Citation