{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,8,5]],"date-time":"2026-08-05T09:44:43Z","timestamp":1785923083403,"version":"3.56.0"},"reference-count":18,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2026,9,1]],"date-time":"2026-09-01T00:00:00Z","timestamp":1788220800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2026,9,1]],"date-time":"2026-09-01T00:00:00Z","timestamp":1788220800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[2026,6,19]],"date-time":"2026-06-19T00:00:00Z","timestamp":1781827200000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Array"],"published-print":{"date-parts":[[2026,9]]},"DOI":"10.1016\/j.array.2026.101032","type":"journal-article","created":{"date-parts":[[2026,6,24]],"date-time":"2026-06-24T07:00:06Z","timestamp":1782284406000},"page":"101032","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":0,"special_numbering":"C","title":["The counterfactual baseline multi-agent reinforcement learning Time-Sensitive Network planning algorithm based on graph convolution"],"prefix":"10.1016","volume":"31","author":[{"given":"Changsheng","family":"Chen","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Kaiye","family":"Zhang","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0009-0004-6100-5873","authenticated-orcid":false,"given":"Le","family":"Wang","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"78","reference":[{"key":"10.1016\/j.array.2026.101032_b1","doi-asserted-by":"crossref","first-page":"10664","DOI":"10.1109\/ACCESS.2024.3353466","article-title":"Proposal and investigation of a lite time sensitive networking solution for the support of real time services in space launcher networks","volume":"12","author":"Fiori","year":"2024","journal-title":"IEEE ACCESS"},{"issue":"9","key":"10.1016\/j.array.2026.101032_b2","doi-asserted-by":"crossref","first-page":"12707","DOI":"10.1007\/s13369-026-11319-6","article-title":"NAS: AI-driven network automation for multi-vendor environments","volume":"51","author":"Alyahya","year":"2026","journal-title":"Arab J Sci Eng"},{"issue":"11","key":"10.1016\/j.array.2026.101032_b3","doi-asserted-by":"crossref","first-page":"30","DOI":"10.23919\/JCC.ea.2021-0888.202302","article-title":"Recent trends of in-vehicle time sensitive networking technologies, applications and challenges","volume":"20","author":"Xu","year":"2023","journal-title":"China Commun"},{"issue":"pa","key":"10.1016\/j.array.2026.101032_b4","article-title":"Multi-source strategy adaptation network for time-triggered flow scheduling in unknown environments","volume":"186","author":"Zhang","year":"2026","journal-title":"Appl Soft Comput"},{"key":"10.1016\/j.array.2026.101032_b5","first-page":"1551","article-title":"An overview of scheduling mechanisms for time-sensitive networks","author":"Craciunas","year":"2017","journal-title":"Proc the Real-Time Summer Sch L\u00e9cole D\u00e9t\u00c9 Temps R\u00e9el (ETR)"},{"key":"10.1016\/j.array.2026.101032_b6","series-title":"Hybrid-parallel: Achieving high performance and energy efficient distributed inference on robots","author":"Sun","year":"2024"},{"issue":"c","key":"10.1016\/j.array.2026.101032_b7","article-title":"TD-GCN: A novel fusion method for network topological and dynamical features","volume":"191","author":"Xu","year":"2025","journal-title":"Chaos Solitons Fractals"},{"key":"10.1016\/j.array.2026.101032_b8","series-title":"IFIP networking 2024","article-title":"AI-based dynamic schedule calculation in time sensitive networks using GCN-TD3","author":"Islam","year":"2024"},{"key":"10.1016\/j.array.2026.101032_b9","series-title":"2025 IEEE UEMCON","first-page":"to appear","article-title":"GCN-driven reinforcement learning for probabilistic real-time guarantees in industrial URLLC","author":"Alqudah","year":"2025"},{"key":"10.1016\/j.array.2026.101032_b10","series-title":"2025 IEEE\/ACM international symposium on edge computing","first-page":"1","article-title":"Graph convolutional multi-agent reinforcement learning for dynamic flow scheduling in time-sensitive networks","author":"Li","year":"2025"},{"key":"10.1016\/j.array.2026.101032_b11","article-title":"Performance study and analysis of time sensitive networking","author":"Sulji","year":"2019","journal-title":"ResearchGate"},{"key":"10.1016\/j.array.2026.101032_b12","series-title":"2025","article-title":"GCN-driven reinforcement learning for probabilistic real-time guarantees in industrial URLLC","author":"Alqudah","year":"2025"},{"issue":"8","key":"10.1016\/j.array.2026.101032_b13","article-title":"A large-scale scan of IPv6 IP-ID","volume":"47","author":"Huang","year":"2025","journal-title":"Comput Eng Sci \/ Jisuanji Gongcheng Yu Kexue"},{"issue":"21","key":"10.1016\/j.array.2026.101032_b14","doi-asserted-by":"crossref","first-page":"8099","DOI":"10.3390\/s22218099","article-title":"Multi-agent systems for resource allocation and scheduling in a smart grid","volume":"22","author":"Binyamin","year":"2022","journal-title":"Sensors"},{"issue":"c","key":"10.1016\/j.array.2026.101032_b15","article-title":"A learnable dynamic scheduling for directed graph jobs flow in heterogeneous supercomputing clusters","volume":"175","author":"Wang","year":"2026","journal-title":"Future Gener Comput Syst"},{"key":"10.1016\/j.array.2026.101032_b16","series-title":"2019 IEEE 25th international conference on embedded and real-time computing systems and applications","article-title":"Exploring practical limitations of joint routing and scheduling for tsn with ILP","author":"Falk","year":"2019"},{"key":"10.1016\/j.array.2026.101032_b17","doi-asserted-by":"crossref","DOI":"10.1109\/TCCN.2024.3362469","article-title":"Deterministic cognition: Cross-domain flow scheduling for time-sensitive networks","author":"Peng","year":"2024","journal-title":"IEEE Trans Cogn Commun Netw"},{"issue":"16","key":"10.1016\/j.array.2026.101032_b18","doi-asserted-by":"crossref","first-page":"14375","DOI":"10.1109\/JIOT.2023.3264909","article-title":"A survey on in-vehicle time-sensitive networking","volume":"10","author":"Peng","year":"2023","journal-title":"IEEE Internet Things J"}],"container-title":["Array"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S2590005626003553?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S2590005626003553?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2026,8,5]],"date-time":"2026-08-05T08:52:46Z","timestamp":1785919966000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S2590005626003553"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,9]]},"references-count":18,"alternative-id":["S2590005626003553"],"URL":"https:\/\/doi.org\/10.1016\/j.array.2026.101032","relation":{},"ISSN":["2590-0056"],"issn-type":[{"value":"2590-0056","type":"print"}],"subject":[],"published":{"date-parts":[[2026,9]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"The counterfactual baseline multi-agent reinforcement learning Time-Sensitive Network planning algorithm based on graph convolution","name":"articletitle","label":"Article Title"},{"value":"Array","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.array.2026.101032","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"\u00a9 2026 The Authors. Published by Elsevier Inc.","name":"copyright","label":"Copyright"}],"article-number":"101032"}}