{"title":"基于优先级的 MPAR 搜索、跟踪和通信调度方案","authors":"Augusto Aubry;Antonio De Maio;Luca Pallotta","doi":"10.1109/TRS.2024.3394896","DOIUrl":null,"url":null,"abstract":"The modern battlefield scenario is strongly influenced by the innovative capabilities of multifunction phased array radars (MPARs), which can perform a plethora of sensing and communication (COM) activities sequentially or in parallel. In fact, the MPAR can functionally cluster its phased array into bespoke subapertures implementing different tasks. Accordingly, a portion of the other available resources, e.g., bandwidth, power-aperture product (PAP), and time, is also assigned to each subaperture, and the grand challenge is the definition of strategies for optimal scheduling of the tasks to be executed. In this respect, a rule-based algorithm for task scheduling is proposed in this article. In a nutshell, in each time window, the procedure first allocates the radar tasks (viz., volume search, cued search, update, and confirmation tracking) and then utilizes the COM looks to fill the empty intraslot time left by the radar tasks. When there are two concurrent looks, the allocation is performed according to their priorities. Moreover, if the bandwidth and PAP are sufficient, some of them can be also scheduled in parallel. Interesting results in terms of bandwidth and time occupancy efficiency are observed from simulations conducted in challenging scenarios comprising also multiple maneuvering targets.","PeriodicalId":100645,"journal":{"name":"IEEE Transactions on Radar Systems","volume":"2 ","pages":"471-481"},"PeriodicalIF":0.0000,"publicationDate":"2024-04-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=10510313","citationCount":"0","resultStr":"{\"title\":\"A Priority-Based Scheduling Scheme for Search, Track, and Communications in MPARs\",\"authors\":\"Augusto Aubry;Antonio De Maio;Luca Pallotta\",\"doi\":\"10.1109/TRS.2024.3394896\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"The modern battlefield scenario is strongly influenced by the innovative capabilities of multifunction phased array radars (MPARs), which can perform a plethora of sensing and communication (COM) activities sequentially or in parallel. In fact, the MPAR can functionally cluster its phased array into bespoke subapertures implementing different tasks. Accordingly, a portion of the other available resources, e.g., bandwidth, power-aperture product (PAP), and time, is also assigned to each subaperture, and the grand challenge is the definition of strategies for optimal scheduling of the tasks to be executed. In this respect, a rule-based algorithm for task scheduling is proposed in this article. In a nutshell, in each time window, the procedure first allocates the radar tasks (viz., volume search, cued search, update, and confirmation tracking) and then utilizes the COM looks to fill the empty intraslot time left by the radar tasks. When there are two concurrent looks, the allocation is performed according to their priorities. Moreover, if the bandwidth and PAP are sufficient, some of them can be also scheduled in parallel. Interesting results in terms of bandwidth and time occupancy efficiency are observed from simulations conducted in challenging scenarios comprising also multiple maneuvering targets.\",\"PeriodicalId\":100645,\"journal\":{\"name\":\"IEEE Transactions on Radar Systems\",\"volume\":\"2 \",\"pages\":\"471-481\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2024-04-29\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"https://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=10510313\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"IEEE Transactions on Radar Systems\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://ieeexplore.ieee.org/document/10510313/\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"IEEE Transactions on Radar Systems","FirstCategoryId":"1085","ListUrlMain":"https://ieeexplore.ieee.org/document/10510313/","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0
摘要
多功能相控阵雷达(MPAR)的创新能力对现代战场场景产生了重大影响,它可以连续或并行地执行大量传感和通信(COM)活动。事实上,MPAR 可以在功能上将其相控阵集群为执行不同任务的定制子孔径。因此,其他可用资源(如带宽、功率-孔径乘积(PAP)和时间)的一部分也被分配给每个子孔径,而最大的挑战在于如何定义待执行任务的优化调度策略。为此,本文提出了一种基于规则的任务调度算法。简而言之,在每个时间窗口中,该程序首先分配雷达任务(即体积搜索、提示搜索、更新和确认跟踪),然后利用 COM 观测来填补雷达任务留下的空隙内时间。当有两个并发观测任务时,将根据它们的优先级进行分配。此外,如果带宽和 PAP 足够,其中一些任务也可以并行调度。通过在具有挑战性的场景(包括多个机动目标)中进行模拟,在带宽和时间占用效率方面观察到了有趣的结果。
A Priority-Based Scheduling Scheme for Search, Track, and Communications in MPARs
The modern battlefield scenario is strongly influenced by the innovative capabilities of multifunction phased array radars (MPARs), which can perform a plethora of sensing and communication (COM) activities sequentially or in parallel. In fact, the MPAR can functionally cluster its phased array into bespoke subapertures implementing different tasks. Accordingly, a portion of the other available resources, e.g., bandwidth, power-aperture product (PAP), and time, is also assigned to each subaperture, and the grand challenge is the definition of strategies for optimal scheduling of the tasks to be executed. In this respect, a rule-based algorithm for task scheduling is proposed in this article. In a nutshell, in each time window, the procedure first allocates the radar tasks (viz., volume search, cued search, update, and confirmation tracking) and then utilizes the COM looks to fill the empty intraslot time left by the radar tasks. When there are two concurrent looks, the allocation is performed according to their priorities. Moreover, if the bandwidth and PAP are sufficient, some of them can be also scheduled in parallel. Interesting results in terms of bandwidth and time occupancy efficiency are observed from simulations conducted in challenging scenarios comprising also multiple maneuvering targets.