相控陣雷達資源調度優(yōu)化算法的研究
發(fā)布時間：2018-09-11 19:07
【摘要】：相控陣雷達的陣列天線具有波束捷變能力,因此多功能相控陣雷達能快速交替進行搜索和跟蹤等操作。如何在時間資源、能量資源及計算機資源有限的前提下,合理的資源調度分配任務對優(yōu)化雷達的整體性能起到了至關重要的作用。在雷達資源調度前,需要先對任務進行優(yōu)先級分配。根據(jù)各個任務優(yōu)先級的先后次序進行調度的排序。在已有的優(yōu)先級排序算法中,只是針對每個任務的優(yōu)先級進行一次排序,這樣就會使很多優(yōu)先級比較低但是比較緊迫的駐留任務被丟棄,進而造成了調度任務成功數(shù)減少。針對此類問題,提出了二次優(yōu)先級分配算法,創(chuàng)新性地把二次優(yōu)先級分配用在調度模塊中。該算法不僅涉及到了任務的優(yōu)先級而且加入了截止期的因素,即利用優(yōu)先級、截止期相結合的思想,在一次分配的基礎上以整個調度間隔的幀周期對任務進行二次分配,可以在一個調度間隔內執(zhí)行更多的駐留任務。因此,降低了任務的丟失率以及提高了雷達的資源利用率。任務優(yōu)先級的綜合排序是為下一個的調度模塊進行準備。由于系統(tǒng)的資源有限,如何在有限的雷達系統(tǒng)資源下盡可能多的調度任務,資源調度算法擔任著重要角色。比較常見的一種方法是自適應脈沖交錯調度算法。該算法雖然在雷達資源利用率上得到了提高,但是通常只考慮了一些簡單的雷達資源約束,因此對雷達資源的利用不充分。針對此問題,提出了一種優(yōu)化的脈沖交錯調度算法。該算法引用時間指針遍歷等待期的駐留時間,在不影響前一個脈沖接收和發(fā)射的前提下,進行接收或發(fā)射其他的脈沖。通過為每個時間點選擇合適的任務進行仿真分析并與已有的算法進行對比,仿真結果表明,該算法從各項評估指標上體現(xiàn)了其優(yōu)化的調度性能,驗證了算法的有效性,特別是在調度越多的時候此算法的性能優(yōu)勢體現(xiàn)的越明顯,達到了高效調度的目的。最后綜合了前面的內容設計了一個雷達任務調度仿真系統(tǒng),并在MATLAB環(huán)境下實現(xiàn)了該仿真系統(tǒng)。本文的仿真系統(tǒng)目的是實現(xiàn)基于二次優(yōu)先級分配和優(yōu)化的脈沖交錯調度算法的圖形化界面及更直接地驗證該算法的有效性和優(yōu)化性。在該界面上,可以根據(jù)不同的需求設置搜索參數(shù)、跟蹤參數(shù)及目標參數(shù)等。通過界面上的仿真Button實現(xiàn)一鍵仿真并且給出仿真結果。
[Abstract]:The array antenna of phased array radar has beam-agile capability, so multi-function phased array radar can perform searching and tracking operations alternately. On the premise of limited time, energy and computer resources, reasonable resource allocation plays an important role in optimizing the overall performance of radar. It is necessary to assign priority to the task before the radar resource scheduling. Scheduling is arranged according to the priority of each task. Among the existing priority sorting algorithms, the priority of each task is only sorted once, which results in a lot of lower priority but more urgent resident tasks being discarded, thus reducing the number of successful scheduling tasks. In order to solve this problem, a quadratic priority allocation algorithm is proposed, and the quadratic priority allocation is innovatively used in the scheduling module. The algorithm not only involves the priority of tasks, but also adds the factors of deadline, that is, using the idea of combining priority and deadline, the task is assigned twice on the basis of one assignment and the frame period of the whole scheduling interval. More resident tasks can be performed within a scheduling interval. Therefore, the mission loss rate is reduced and the radar resource utilization is improved. The comprehensive sorting of task priorities is prepared for the next scheduling module. Due to the limited resources of the system, the resource scheduling algorithm plays an important role in how to schedule as many tasks as possible under the limited radar system resources. One of the most common methods is the adaptive pulse interleaving scheduling algorithm. Although the efficiency of radar resources is improved, the algorithm usually only considers some simple constraints of radar resources, so the utilization of radar resources is not sufficient. To solve this problem, an optimized pulse interleaving scheduling algorithm is proposed. The algorithm uses the time pointer to traverse the resident time of the waiting period and receives or transmits other pulses without affecting the reception and transmission of the previous pulse. By selecting the appropriate task for each time point and comparing it with the existing algorithms, the simulation results show that the algorithm embodies its optimal scheduling performance from each evaluation index, and verifies the effectiveness of the algorithm. Especially when the scheduling is more, the performance advantage of this algorithm is more obvious, which achieves the purpose of efficient scheduling. Finally, a radar task scheduling simulation system is designed by synthesizing the previous contents, and the simulation system is implemented in MATLAB environment. The purpose of the simulation system in this paper is to realize the graphical interface of pulse interleaving scheduling algorithm based on quadratic priority allocation and optimization and to verify the validity and optimization of the algorithm more directly. In this interface, search parameters, tracking parameters and target parameters can be set according to different requirements. The one-button simulation is realized by the simulation Button on the interface and the simulation results are given.
【學位授予單位】：電子科技大學
【學位級別】：碩士
【學位授予年份】：2017
【分類號】：TN958.92
本文編號：2237607
[Abstract]:The array antenna of phased array radar has beam-agile capability, so multi-function phased array radar can perform searching and tracking operations alternately. On the premise of limited time, energy and computer resources, reasonable resource allocation plays an important role in optimizing the overall performance of radar. It is necessary to assign priority to the task before the radar resource scheduling. Scheduling is arranged according to the priority of each task. Among the existing priority sorting algorithms, the priority of each task is only sorted once, which results in a lot of lower priority but more urgent resident tasks being discarded, thus reducing the number of successful scheduling tasks. In order to solve this problem, a quadratic priority allocation algorithm is proposed, and the quadratic priority allocation is innovatively used in the scheduling module. The algorithm not only involves the priority of tasks, but also adds the factors of deadline, that is, using the idea of combining priority and deadline, the task is assigned twice on the basis of one assignment and the frame period of the whole scheduling interval. More resident tasks can be performed within a scheduling interval. Therefore, the mission loss rate is reduced and the radar resource utilization is improved. The comprehensive sorting of task priorities is prepared for the next scheduling module. Due to the limited resources of the system, the resource scheduling algorithm plays an important role in how to schedule as many tasks as possible under the limited radar system resources. One of the most common methods is the adaptive pulse interleaving scheduling algorithm. Although the efficiency of radar resources is improved, the algorithm usually only considers some simple constraints of radar resources, so the utilization of radar resources is not sufficient. To solve this problem, an optimized pulse interleaving scheduling algorithm is proposed. The algorithm uses the time pointer to traverse the resident time of the waiting period and receives or transmits other pulses without affecting the reception and transmission of the previous pulse. By selecting the appropriate task for each time point and comparing it with the existing algorithms, the simulation results show that the algorithm embodies its optimal scheduling performance from each evaluation index, and verifies the effectiveness of the algorithm. Especially when the scheduling is more, the performance advantage of this algorithm is more obvious, which achieves the purpose of efficient scheduling. Finally, a radar task scheduling simulation system is designed by synthesizing the previous contents, and the simulation system is implemented in MATLAB environment. The purpose of the simulation system in this paper is to realize the graphical interface of pulse interleaving scheduling algorithm based on quadratic priority allocation and optimization and to verify the validity and optimization of the algorithm more directly. In this interface, search parameters, tracking parameters and target parameters can be set according to different requirements. The one-button simulation is realized by the simulation Button on the interface and the simulation results are given.
【學位授予單位】：電子科技大學
【學位級別】：碩士
【學位授予年份】：2017
【分類號】：TN958.92
【參考文獻】
相關期刊論文 前10條
1 潘偉;;自適應遺傳算法在相控陣雷達最優(yōu)化調度中的應用[J];電子信息對抗技術;2014年01期
2 鄭世友;鄭瑤;;基于任務綜合規(guī)劃的相控陣自適應調度方法[J];計算機仿真;2013年07期
3 王瑞雪;司書賓;張守華;;基于貝葉斯網絡的模糊語言多屬性決策模型[J];機械科學與技術;2012年03期
4 李春芳;趙虹;巴宏欣;方正;楊波;;基于多屬性分類決策的空中目標威脅評估模型[J];指揮信息系統(tǒng)與技術;2011年06期
5 張華睿;楊宏文;胡衛(wèi)東;郁文賢;;警戒雷達與跟蹤雷達的目標指示交接方法[J];現(xiàn)代雷達;2011年09期
6 秦亞萍;王建;張玉喜;;一種相控陣雷達自適應數(shù)據(jù)率目標跟蹤算法[J];雷達與對抗;2011年01期
7 唐婷;何子述;程婷;;一種基于模板法的自適應雷達駐留調度算法[J];信號處理;2010年07期
8 趙鋒;畢莉;楊建華;肖順平;;反導跟蹤雷達最優(yōu)搜索時序研究[J];現(xiàn)代雷達;2009年09期
9 程婷;何子述;李會勇;;一種數(shù)字陣列雷達自適應波束駐留調度算法[J];電子學報;2009年09期
10 稅薇;葛艷;韓玉;;基于貝葉斯網絡的火力威脅等級評估算法[J];系統(tǒng)仿真學報;2009年15期
相關碩士學位論文 前4條
1 趙霜葉;雷達資源管理及其在射頻隱身中的應用研究[D];電子科技大學;2015年
2 謝瀟瀟;相控陣雷達任務多維管理關鍵技術研究[D];電子科技大學;2013年
3 陳大偉;相控陣雷達自適應調度算法研究[D];電子科技大學;2011年
4 曾光;多功能相控陣雷達自適應調度算法研究及應用[D];國防科學技術大學;2003年
，本文編號：2237607
本文鏈接：http://sikaile.net/kejilunwen/xinxigongchenglunwen/2237607.html
