Phased Array Radar Task Scheduling Algorithm Based on Branch and Bound Method

doi:10.3969/j.issn.0372-2112.2019.06.018

您当前的位置：

首页 >

文章列表页 >

Phased Array Radar Task Scheduling Algorithm Based on Branch and Bound Method

更新时间：2025-07-02

- Phased Array Radar Task Scheduling Algorithm Based on Branch and Bound Method
- Acta Electronica Sinica Vol. 47, Issue 6, Pages: 1309-1315(2019)
- 作者机构：
  
  1. 空军预警学院,湖北,武汉,430019
  2. 95174部队,湖北,武汉,430000
  3. 空军预警学院,湖北,武汉,430019
  4. 95174部队,湖北,武汉,430000
- 作者简介：
- 基金信息：
  
  National Natural Science Foundation of China (No.61401504);China Postdoctoral Science Foundation (No.2014M562562)
- DOI：10.3969/j.issn.0372-2112.2019.06.018
  CLC： TN95
- Published：2019
- 稿件说明：
移动端阅览
Phased Array Radar Task Scheduling Algorithm Based on Branch and Bound Method[J]. Acta Electronica Sinica, 2019, 47(6): 1309-1315.
DOI：

Phased Array Radar Task Scheduling Algorithm Based on Branch and Bound Method[J]. Acta Electronica Sinica, 2019, 47(6): 1309-1315. DOI： 10.3969/j.issn.0372-2112.2019.06.018.

摘要

为解决相控阵雷达事件调度问题中调度成功率、时间偏移率与算法时效性三者之间的矛盾，本文提出一种基于分支定界法的调度算法；该算法首先在现有调度结果上调取所有可执行事件，即获得若干节点，多步递推后由多层节点形成若干条备选分支，扩大解空间范围，提高算法性能；然后通过删减操作删减掉收益较低分支，将解空间控制在一适当范围内，减小搜索盲目性，降低算法计算量.仿真实验表明，与基于综合优先级算法的调度结果相比，利用本文算法调度时调度成功率提升了52%；与基于时间指针算法的调度结果相比，本身算法时间偏移率降低了61%；与基于遗传算法的调度结果相比，本文算法调度耗时仅为前者1~2%.

Abstract

To solve the contradiction of the scheduling success rate (SSR)

the time shifting rate (TSR) and the algorithm timeliness in the task scheduling of phased array radar

this paper proposes a scheduling algorithm based on the branch and bound method (BBM).Firstly

this algorithm acquires all executable tasks from available scheduling results

i.e.

obtaining several nodes on multiple layers

and forms several optional branches with these nodes through multistep recursion.In this way

the range of solution space is extended

and the algorithm performance is improved.Then

this algorithm discards branches with low yield and keeps the solution space to a certain range

which improves the accuracy of the algorithm and reduces the calculation amount.The simulation experiment indicated that compared with the algorithm based on integrated priority The simulation experiment suggested that the proposed algorithm enjoyed a 52% increase in scheduling success rate(SSR) over the traditional integrated priority algorithm

experienced a 61% reduction in the time shifting rate(TSR) compared with the time pointer algorithm

and took only 1~2% of the time consumed by the genetic algorithm.

关键词

Keywords

references

Views

下载量

CSCD

Alert me when the article has been cited

提交

Tools

Publicity Resources

Genetic Algorithm Based MIMO Equalization Parameter Optimization Technology for Mode-Division Multiplexed System

An Absorbing Structure Covering the Whole UHF Band

A Consortium Blockchain Based Reliable Task Offloading Approach in Edge Computing

An Approach to Multi-Path Coverage Testing Based on Key Edge Probability and Path Layer Proximity

One Hybrid Strategy for Automatic Placement and Routing of QCA Circuit

Related Author

ZHAO Tian-feng

WEN Feng

FENG Bian-xia

WU Bao-jian

XU Bo

QIU Kun

WU Chang-ying

GAO Yang

Related Institution

Key Laboratory of Optical Fiber Sensing and Communication Networks, Ministry of Education, University of Electronics Science and Technology of China

School of Electronics and Information， Northwestern Polytechnical University

Key Laboratory for Novel Software Technology， Nanjing University

Guangdong Provincial Laboratory of Artificial Intelligence and Digital Economy

College of Big Data and Intelligent Engineering， Southwest Forestry University

⁰