Multi-Agent Graph-Partitioned Hierarchical Representation Learning for Distributed Routing Optimization in Dynamic Maritime Networks
Electronics · 26.05.2026 · 15 (11) · 2298
DOI: 10.3390/electronics15112298 ↗Kurz gefasst
Fachartikel in der Zeitschrift Electronics, online erschienen am 26.05.2026. Verfasst von Xin Sun und 2 weiteren Autor:innen. Die Arbeit nennt 13 Literaturangaben. Der Volltext ist frei zugänglich (Open Access, CC BY 4.0). Gefördert von: Key Basic Research Project of the Fundamental Reinforcement Program, Research on Key Technologies of Multi-level Heterogeneous Networking and Resource Optimization Scheduling in the Sea Area.
Abstract (Originalsprache)
The rapid growth of maritime communication networks introduces significant challenges to routing optimization, arising from large-scale network topologies, highly dynamic node mobility, and stringent real-time communication requirements. Conventional routing algorithms often exhibit limited scalability and poor adaptability when facing frequent topology variations. The routing problem is modeled as a multi-agent distributed decision-making process, where each node acts as an autonomous agent. In this paper, we propose a graph-partitioned hierarchical graph representation learning framework (GP-HGRL) for scalable and continual routing optimization in dynamic maritime networks. By explicitly modeling the network as a time-evolving graph, GP-HGRL first partitions the global topology into topology-aware subgraphs, enabling distributed learning and inference with reduced computational complexity. A hierarchical graph neural network architecture is then developed to jointly capture intra-subgraph local structures and inter-subgraph global dependencies, producing topology-aware embeddings for routing decision-making. Based on the learned representations, a deep reinforcement learning policy is employed to perform distributed next-hop routing decisions. To effectively handle topology dynamics induced by node mobility and link variations, we further introduce a continual graph learning mechanism that selectively updates representations and routing policies only within affected subgraphs, thereby avoiding costly global retraining and preserving routing stability. Extensive simulations demonstrate that GP-HGRL consistently outperforms shortest-path routing and existing reinforcement learning-based approaches in terms of packet delivery ratio, retransmission rate, packet loss, and training efficiency under various network loads and dynamic conditions.
Förderung
- Key Basic Research Project of the Fundamental Reinforcement Program
- Research on Key Technologies of Multi-level Heterogeneous Networking and Resource Optimization Scheduling in the Sea Area
Zitieren
APA
Sun, X., Yang, T., & Zhang, X. (2026). Multi-Agent Graph-Partitioned Hierarchical Representation Learning for Distributed Routing Optimization in Dynamic Maritime Networks. Electronics, 15(11), 2298. https://doi.org/10.3390/electronics15112298
Vancouver
Sun X, Yang T, Zhang X. Multi-Agent Graph-Partitioned Hierarchical Representation Learning for Distributed Routing Optimization in Dynamic Maritime Networks. Electronics. 2026;15(11):2298. doi:10.3390/electronics15112298
BibTeX
@article{Sun2026,
author = {Sun, Xin and Yang, Tingting and Zhang, Xiufeng},
title = {Multi-Agent Graph-Partitioned Hierarchical Representation Learning for Distributed Routing Optimization in Dynamic Maritime Networks},
journal = {Electronics},
year = {2026},
volume = {15},
number = {11},
pages = {2298},
doi = {10.3390/electronics15112298}
}
EUVIMED