Multiradar Collaborative Task Scheduling Algorithm Based on Graph Neural Networks with Model Knowledge Embedding

Modern radar systems face increasingly complex challenges in tasks such as detection, tracking, and identification. The diversity of task types, limited data resources, and strict execution time requirements make radar task scheduling a strongly NP-hard problem. However, existing scheduling algorithms struggle to efficiently handle multiradar collaborative tasks involving complex logical constraints. Therefore, Artificial Intelligence (AI)-based scheduling algorithms have gained significant attention. However, their efficiency is heavily dependent on effectively extracting the key features of the problem. The ability to quickly and comprehensively extract common features of multiradar scheduling problems is essential for improving the efficiency of such AI scheduling algorithms. Therefore, this paper proposes a Model Knowledge Embedded Graph Neural Network (MKEGNN) scheduling algorithm. This method frames the radar task collaborative scheduling problem as a heterogeneous network graph, leveraging model knowledge to optimize the training process of the Graph Neural Network (GNN) algorithm. A key innovation of this algorithm is its capability to capture critical model knowledge using low-complexity calculations, which helps to further optimize the GNN model. During the feature extraction stage, the algorithm employs a random unitary matrix transformation. This approach utilizes the spectral features of the random Laplacian matrix from the task’s heterogeneous graph as global features, enhancing the GNN’s ability to extract shared problem features while downplaying individual characteristics. In the parameterized decision-making stage, the algorithm leverages the upper and lower bound knowledge derived from guiding and empirical solutions of the problem model. This strategy significantly reduces the decision space, enabling the network to optimize quickly and accelerating the learning process. Extensive simulation experiments confirm the effectiveness of the MKEGNN algorithm. Compared to existing approaches, it demonstrates improved stability and accuracy across all task sets, boosting the scheduling success rate by 3%~10% and the weighted success rate by 5%~15%. For particularly challenging task sets involving complex multiradar collaborations, the success rate improves by over 4%. The results highlight the algorithm’s stability and robustness.

Institutions

Publication Details

Journal
SHILAP Revista de lepidopterología
Published
2025-04-01
DOI
https://doi.org/10.12000/jr24222
Primary Topic
Radar Systems and Signal Processing
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Multiradar Collaborative Task Scheduling Algorithm Based on Graph Neural Networks with Model Knowledge Embedding

SHILAP Revista de lepidopterología
Radar Systems and Signal Processing
article

Multiradar Collaborative Task Scheduling Algorithm Based on Graph Neural Networks with Model Knowledge Embedding

article en

Abstract

Modern radar systems face increasingly complex challenges in tasks such as detection, tracking, and identification. The diversity of task types, limited data resources, and strict execution time requirements make radar task scheduling a strongly NP-hard problem. However, existing scheduling algorithms struggle to efficiently handle multiradar collaborative tasks involving complex logical constraints. Therefore, Artificial Intelligence (AI)-based scheduling algorithms have gained significant attention. However, their efficiency is heavily dependent on effectively extracting the key features of the problem. The ability to quickly and comprehensively extract common features of multiradar scheduling problems is essential for improving the efficiency of such AI scheduling algorithms. Therefore, this paper proposes a Model Knowledge Embedded Graph Neural Network (MKEGNN) scheduling algorithm. This method frames the radar task collaborative scheduling problem as a heterogeneous network graph, leveraging model knowledge to optimize the training process of the Graph Neural Network (GNN) algorithm. A key innovation of this algorithm is its capability to capture critical model knowledge using low-complexity calculations, which helps to further optimize the GNN model. During the feature extraction stage, the algorithm employs a random unitary matrix transformation. This approach utilizes the spectral features of the random Laplacian matrix from the task’s heterogeneous graph as global features, enhancing the GNN’s ability to extract shared problem features while downplaying individual characteristics. In the parameterized decision-making stage, the algorithm leverages the upper and lower bound knowledge derived from guiding and empirical solutions of the problem model. This strategy significantly reduces the decision space, enabling the network to optimize quickly and accelerating the learning process. Extensive simulation experiments confirm the effectiveness of the MKEGNN algorithm. Compared to existing approaches, it demonstrates improved stability and accuracy across all task sets, boosting the scheduling success rate by 3%~10% and the weighted success rate by 5%~15%. For particularly challenging task sets involving complex multiradar collaborations, the success rate improves by over 4%. The results highlight the algorithm’s stability and robustness.

SHILAP Revista de lepidopterología
Shanghai Jiao Tong University (CN)
Openalex Percentile: Top 43%
Radar Systems and Signal Processing
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.