{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,17]],"date-time":"2026-02-17T12:18:44Z","timestamp":1771330724499,"version":"3.50.1"},"reference-count":43,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"1","license":[{"start":{"date-parts":[[2025,3,1]],"date-time":"2025-03-01T00:00:00Z","timestamp":1740787200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2025,3,1]],"date-time":"2025-03-01T00:00:00Z","timestamp":1740787200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2025,3,1]],"date-time":"2025-03-01T00:00:00Z","timestamp":1740787200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"funder":[{"name":"Shanghai Pujiang Program","award":["22PJ1404900"],"award-info":[{"award-number":["22PJ1404900"]}]},{"DOI":"10.13039\/100007219","name":"Natural Science Foundation of Shanghai","doi-asserted-by":"publisher","award":["23ZR1428900"],"award-info":[{"award-number":["23ZR1428900"]}],"id":[{"id":"10.13039\/100007219","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["62373247"],"award-info":[{"award-number":["62373247"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["62303314"],"award-info":[{"award-number":["62303314"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Control Netw. Syst."],"published-print":{"date-parts":[[2025,3]]},"DOI":"10.1109\/tcns.2024.3463502","type":"journal-article","created":{"date-parts":[[2024,9,18]],"date-time":"2024-09-18T18:01:07Z","timestamp":1726682467000},"page":"300-312","source":"Crossref","is-referenced-by-count":4,"title":["Multirobot Stochastic Patrolling via Graph Partitioning"],"prefix":"10.1109","volume":"12","author":[{"ORCID":"https:\/\/orcid.org\/0009-0009-9630-356X","authenticated-orcid":false,"given":"Weizhen","family":"Wang","sequence":"first","affiliation":[{"name":"Department of Automation, Shanghai Jiao Tong University, Shanghai, China"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-2655-3987","authenticated-orcid":false,"given":"Xiaoming","family":"Duan","sequence":"additional","affiliation":[{"name":"Department of Automation, Shanghai Jiao Tong University, Shanghai, China"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-6253-7802","authenticated-orcid":false,"given":"Jianping","family":"He","sequence":"additional","affiliation":[{"name":"Department of Automation, Shanghai Jiao Tong University, Shanghai, China"}]}],"member":"263","reference":[{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/MRA.2017.2662222"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1016\/j.isatra.2006.08.001"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1002\/rob.20405"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1137\/15M1010737"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-36483-8_11"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/IAT.2004.1342959"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1177\/0278364913504011"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1007\/s10472-010-9193-y"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/TRO.2012.2201293"},{"key":"ref10","article-title":"On cyclic solutions to the min-max latency multi-robot patrolling problem","volume-title":"Proc. Int. Symp. Comput. Geometry","author":"Afshani","year":"2022"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1145\/1774088.1774360"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/IROS.2014.6942585"},{"key":"ref13","first-page":"261","article-title":"Autonomous graph partitioning for multi-agent patrolling problems","volume-title":"Proc. Federated Conf. Comput. Sci. Inf. Syst.","author":"Wiandt","year":"2018"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-93031-2_38"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/EuCNC.2019.8802015"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1146\/annurev-control-071520-120123"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/CDC.2009.5400569"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611975031.106"},{"issue":"1","key":"ref19","first-page":"887","article-title":"Multi-robot adversarial patrolling: Facing a full-knowledge opponent","volume":"42","author":"Agmon","year":"2011","journal-title":"J. Artif. Intell. Res."},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1109\/CDC.2018.8619136"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1109\/TCNS.2021.3058932"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1109\/tac.2025.3549295"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1007\/s00440-023-01257-x"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1109\/TAC.2018.2844120"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1109\/TAC.2019.2906473"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1109\/TAC.2015.2426317"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1109\/LCSYS.2023.3288492"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-88190-2_18"},{"key":"ref29","article-title":"Greater London crime statistics","year":"2023"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1080\/03610926.2012.741742"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.13001\/1081-3810.1624"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1109\/ICKECS56523.2022.10060857"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1109\/ICTAI.2016.0035"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1109\/ICUAS.2017.7991314"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1287\/inte.2013.0700"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1007\/s10898-009-9520-1"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1007\/s10479-008-0481-4"},{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.1007\/s10479-016-2234-0"},{"key":"ref39","doi-asserted-by":"publisher","DOI":"10.1007\/BF02523688"},{"key":"ref40","first-page":"8269","article-title":"Memory-efficient approximation algorithms for max-$k$-cut and correlation clustering","volume-title":"Proc. Int. Conf. Neural Inf. Process. Syst.","author":"Shinde","year":"2021"},{"key":"ref41","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-68279-0_8"},{"key":"ref42","doi-asserted-by":"publisher","DOI":"10.1016\/j.jnt.2015.06.023"},{"key":"ref43","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-52282-4_52"}],"container-title":["IEEE Transactions on Control of Network Systems"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx8\/6509490\/10935358\/10683971.pdf?arnumber=10683971","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,3,24]],"date-time":"2025-03-24T18:56:38Z","timestamp":1742842598000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/10683971\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,3]]},"references-count":43,"journal-issue":{"issue":"1"},"URL":"https:\/\/doi.org\/10.1109\/tcns.2024.3463502","relation":{},"ISSN":["2325-5870","2372-2533"],"issn-type":[{"value":"2325-5870","type":"electronic"},{"value":"2372-2533","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025,3]]}}}