Your Location:
Home >
Browse articles >
A Multi-Agent Graph Reinforcement Learning Method for Many-to-Many Communication Routing in SDWN
PAPERS | Updated:2025-10-16
    • A Multi-Agent Graph Reinforcement Learning Method for Many-to-Many Communication Routing in SDWN

    • WEN Peng , YE Miao , WANG Yong , HE Qian , QIU Hong-bing
    • ACTA ELECTRONICA SINICA Vol. 53, Issue 6, Pages: 1885-1905(2025)
    • DOI: 10.12263/DZXB.20240980     

      CLC:
    • Revised:2025-05-05 ,

    Scan QR Code

  •  
  •  
  • Full Text(HTML)

  • Figs( 17 ) Tabs( 5 )

  • References

  • Publication Info

  • Metrics

Sections
icon
The trial reading is over, you can activate your VIP account to continue reading.
Deactivate >
icon
The trial reading is over. You can log in to your account, go to the personal center, purchase VIP membership, and read the full text.
Already a VIP member?
Log in >

224

Views

191

Downloads

3

CSCD

Alert me when the article has been cited
Submit
Tools
  • BibTeXDownload
  • EndnoteDownload
  • RefMan Download
  • NoteExpressDownload
  • NoteFirstDownload

Related Articles

Time Decoupling and Metric Alignment Transformer for Industrial Multi-Time-Scale Soft Sensing
An Efficient BiCore-Index Maintenance Algorithm on Dynamic Bipartite Graphs
Two-Stage Detection for OTFS Based on Global Initial Detection and Local List Refinement
Multi-Base-Station Cooperative Integrated Sensing and Communication Design for Nearshore Scenarios
Reconfigurable Intelligent Surface Assisted Robust Secrecy Transmission for Wideband Terahertz Integrated Sensing and Communication Systems

Related Author

WEN Peng
YE Miao
WANG Yong
HE Qian
QIU Hong-bing

Related Institution

School of Information and Communication, Guilin University of Electronic Science and Technology
School of Computer and Information Security, Guilin University of Electronic Science and Technology