{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,8,11]],"date-time":"2026-08-11T17:47:13Z","timestamp":1786470433510,"version":"build-2736575974"},"reference-count":27,"publisher":"Wiley","issue":"5","license":[{"start":{"date-parts":[[2026,5,15]],"date-time":"2026-05-15T00:00:00Z","timestamp":1778803200000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/onlinelibrary.wiley.com\/termsAndConditions#vor"},{"start":{"date-parts":[[2026,5,15]],"date-time":"2026-05-15T00:00:00Z","timestamp":1778803200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/doi.wiley.com\/10.1002\/tdm_license_1.1"}],"content-domain":{"domain":["onlinelibrary.wiley.com"],"crossmark-restriction":true},"short-container-title":["Satell Commun Network"],"published-print":{"date-parts":[[2026,9]]},"abstract":"<jats:title>ABSTRACT<\/jats:title>\n                  <jats:p>Spatial information networks (SINs) are network systems characterized by their complex structure, high\u2010speed operation, and extreme dynamics. Their intricate topology, involving a vast number of nodes and links, coupled with a harsh operating environment, makes them susceptible to both natural and man\u2010made interference. This poses significant challenges to network stability. Therefore, the primary objective of topology optimization for SIN is to rapidly construct a network topology that is stable, highly connected, robust, and efficient. Previous optimization algorithms, including exact solutions based on dynamic programming and approximate solutions based on heuristics, struggle with limitations in escaping local optima and achieving rapid convergence. To address these drawbacks, this paper introduces a novel approach: a reinforcement learning\u2013enhanced adaptive genetic algorithm (RL\u2010GA). This framework integrates reinforcement learning to dynamically adjust the key parameters of the genetic algorithm, enhancing its ability to escape local optima and accelerate convergence. Experimental results, based on simulations of the Iridium and Qianfan satellite constellations, demonstrate that the proposed RL\u2010GA algorithm outperforms existing methods in both solution quality (optimization results) and convergence speed. This advancement offers a more effective solution for SIN topology optimization, thereby enhancing the stability and efficiency of space\u2010based communication networks.<\/jats:p>","DOI":"10.1002\/sat.70050","type":"journal-article","created":{"date-parts":[[2026,5,15]],"date-time":"2026-05-15T15:32:21Z","timestamp":1778859141000},"page":"636-649","update-policy":"https:\/\/doi.org\/10.1002\/crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["RL\u2010GA: An Optimization Strategy for Spatial Information Network Topology"],"prefix":"10.1002","volume":"44","author":[{"ORCID":"https:\/\/orcid.org\/0009-0006-6708-5274","authenticated-orcid":false,"given":"Zhenxing","family":"Hu","sequence":"first","affiliation":[{"name":"School of Mathematical Sciences University of Electronic Science and Technology of China  Chengdu Sichuan China"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Peng","family":"Yang","sequence":"additional","affiliation":[{"name":"School of Mathematical Sciences University of Electronic Science and Technology of China  Chengdu Sichuan China"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Jun","family":"Huang","sequence":"additional","affiliation":[{"name":"School of Mathematical Sciences University of Electronic Science and Technology of China  Chengdu Sichuan China"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"311","published-online":{"date-parts":[[2026,5,15]]},"reference":[{"key":"e_1_2_10_2_1","doi-asserted-by":"publisher","DOI":"10.1002\/sat.1375"},{"key":"e_1_2_10_3_1","doi-asserted-by":"publisher","DOI":"10.1109\/TVT.2021.3058126"},{"key":"e_1_2_10_4_1","doi-asserted-by":"publisher","DOI":"10.1109\/MCOM.2015.7180512"},{"key":"e_1_2_10_5_1","doi-asserted-by":"publisher","DOI":"10.1109\/JSAC.2018.2804045"},{"key":"e_1_2_10_6_1","doi-asserted-by":"publisher","DOI":"10.1109\/TSMCA.2011.2116117"},{"key":"e_1_2_10_7_1","doi-asserted-by":"publisher","DOI":"10.1088\/0256-307X\/27\/7\/078902"},{"key":"e_1_2_10_8_1","doi-asserted-by":"publisher","DOI":"10.1109\/JIOT.2021.3082168"},{"key":"e_1_2_10_9_1","doi-asserted-by":"publisher","DOI":"10.1109\/OJCOMS.2021.3114669"},{"key":"e_1_2_10_10_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.ast.2017.07.003"},{"key":"e_1_2_10_11_1","doi-asserted-by":"publisher","DOI":"10.3390\/s20041114"},{"key":"e_1_2_10_12_1","doi-asserted-by":"publisher","DOI":"10.1109\/25.704858"},{"key":"e_1_2_10_13_1","doi-asserted-by":"publisher","DOI":"10.1002\/sat.1212"},{"key":"e_1_2_10_14_1","doi-asserted-by":"publisher","DOI":"10.1109\/PAAP.2015.37"},{"key":"e_1_2_10_15_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-031-06788-4_49"},{"key":"e_1_2_10_16_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-031-06761-7_53"},{"key":"e_1_2_10_17_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICICSE52190.2021.9404103"},{"key":"e_1_2_10_18_1","doi-asserted-by":"crossref","unstructured":"D.Adjodah D.Calacci A.Dubey et\u00a0al. \u201cLeveraging Communication Topologies Between Learning Agents in Deep Reinforcement Learning \u201d preprint arXiv March 11 2020 https:\/\/doi.org\/10.48550\/arXiv.1902.06740.","DOI":"10.65109\/LVJF2437"},{"key":"e_1_2_10_19_1","unstructured":"V.Waradpande D.Kudenko andM.Khosla \u201cGraph\u2010Based State Representation for Deep Reinforcement Learning \u201d preprint arXiv February 16 2021 https:\/\/doi.org\/10.48550\/arXiv.2004.13965."},{"key":"e_1_2_10_20_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00521-019-04527-9"},{"key":"e_1_2_10_21_1","doi-asserted-by":"publisher","DOI":"10.1587\/transcom.2020EBP3061"},{"key":"e_1_2_10_22_1","first-page":"1","volume-title":"2019 IEEE Global Communications Conference (GLOBECOM)","author":"Meng X.","year":"2019"},{"key":"e_1_2_10_23_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.asr.2016.12.027"},{"key":"e_1_2_10_24_1","unstructured":"D.Cvetkovi\u0107 M.Doob andH.Sachs \u201cSpectra of Graphs \u201d (1979)."},{"key":"e_1_2_10_25_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-031-06761-7_33"},{"key":"e_1_2_10_26_1","doi-asserted-by":"publisher","DOI":"10.1038\/s41598-018-29275-z"},{"key":"e_1_2_10_27_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.compeleceng.2014.12.014"},{"key":"e_1_2_10_28_1","volume-title":"International Conference on Learning Representations","author":"Lu H.","year":"2019"}],"container-title":["International Journal of Satellite Communications and Networking"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/pdf\/10.1002\/sat.70050","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/full-xml\/10.1002\/sat.70050","content-type":"application\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/pdf\/10.1002\/sat.70050","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,8,11]],"date-time":"2026-08-11T17:21:23Z","timestamp":1786468883000},"score":1,"resource":{"primary":{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/10.1002\/sat.70050"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,5,15]]},"references-count":27,"journal-issue":{"issue":"5","published-print":{"date-parts":[[2026,9]]}},"alternative-id":["10.1002\/sat.70050"],"URL":"https:\/\/doi.org\/10.1002\/sat.70050","archive":["Portico"],"relation":{},"ISSN":["1542-0973","1542-0981"],"issn-type":[{"value":"1542-0973","type":"print"},{"value":"1542-0981","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026,5,15]]},"assertion":[{"value":"2025-12-03","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2026-03-06","order":2,"name":"accepted","label":"Accepted","group":{"name":"publication_history","label":"Publication History"}},{"value":"2026-05-15","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}