{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,2]],"date-time":"2026-01-02T07:24:56Z","timestamp":1767338696813,"version":"build-2065373602"},"reference-count":49,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"8","license":[{"start":{"date-parts":[[2022,8,1]],"date-time":"2022-08-01T00:00:00Z","timestamp":1659312000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2022,8,1]],"date-time":"2022-08-01T00:00:00Z","timestamp":1659312000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2022,8,1]],"date-time":"2022-08-01T00:00:00Z","timestamp":1659312000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["62076060","61932007","61806053","61807008"],"award-info":[{"award-number":["62076060","61932007","61806053","61807008"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100004608","name":"Natural Science Foundation of Jiangsu Province of China","doi-asserted-by":"publisher","award":["BK20180356","BK20180369"],"award-info":[{"award-number":["BK20180356","BK20180369"]}],"id":[{"id":"10.13039\/501100004608","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Intell. Transport. Syst."],"published-print":{"date-parts":[[2022,8]]},"DOI":"10.1109\/tits.2021.3128934","type":"journal-article","created":{"date-parts":[[2021,11,24]],"date-time":"2021-11-24T20:31:41Z","timestamp":1637785901000},"page":"13805-13818","source":"Crossref","is-referenced-by-count":6,"title":["Efficient Online City-Scale Patrolling by Exploiting Offline Model-Based Coordination Policy"],"prefix":"10.1109","volume":"23","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-9080-4971","authenticated-orcid":false,"given":"Wanyuan","family":"Wang","sequence":"first","affiliation":[{"name":"School of Computer Science and Engineering, Southeast University, Nanjing, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-4721-616X","authenticated-orcid":false,"given":"Hansi","family":"Tao","sequence":"additional","affiliation":[{"name":"School of Computer Science and Engineering, Southeast University, Nanjing, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-7349-5249","authenticated-orcid":false,"given":"Yichuan","family":"Jiang","sequence":"additional","affiliation":[{"name":"School of Computer Science and Engineering, Southeast University, Nanjing, China"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1080\/07418829500096231"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1007\/s10610-015-9282-x"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1093\/restud\/rdx044"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1016\/j.artint.2018.04.005"},{"key":"ref5","first-page":"8113","article-title":"Credit assignment for collective multiagent RL with global rewards","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","author":"Nguyen"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1145\/3178876.3186104"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v26i1.8176"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v29i1.9238"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v32i1.11346"},{"key":"ref10","first-page":"21","article-title":"Multiagent self-organization for a taxi dispatch system","volume-title":"Proc. AAMAS","author":"Alshamsi"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1145\/3308558.3313433"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1145\/3357384.3357799"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.24963\/ijcai.2019\/64"},{"key":"ref14","article-title":"Efficient collaborative multi-agent deep reinforcement learning for large-scale fleet management","volume-title":"arXiv:1802.06444","author":"Lin","year":"2018"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/TITS.2014.2345480"},{"key":"ref16","first-page":"168","article-title":"Prioritized allocation of emergency responders based on a continuous-time incident prediction model","volume-title":"Proc. AAMAS","author":"Mukhopadhyay"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v28i2.19028"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1145\/3219819.3219824"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/TITS.2019.2955989"},{"key":"ref20","first-page":"47","article-title":"Simulation-based optimization of resource placement and emergency response","volume-title":"Proc. IAAI","author":"Bjanason"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-47413-7_9"},{"key":"ref22","first-page":"501","article-title":"Regrets only! Online stochastic optimization under time constraints","volume-title":"Proc. 19th Nat. Conf. Artif. Intell.","author":"Bent"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1287\/moor.1120.0551"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.14778\/3137628.3137643"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2019.00133"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v32i1.11477"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1109\/ISI.2007.379538"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1016\/j.tre.2011.07.005"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1007\/s10479-014-1648-9"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1287\/trsc.1030.0079"},{"key":"ref31","first-page":"2204","article-title":"Efficient planning of informative paths for multiple robots","volume-title":"Proc. 20th Int. Joint Conf. Artif. Intell.","author":"Singh"},{"key":"ref32","first-page":"2118","article-title":"Optimal route search with the coverage of users\u2019 preferences","volume-title":"Proc. IJCAI","author":"Zeng"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejor.2010.03.045"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1109\/INFOCOM.2014.6848001"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1109\/TITS.2016.2593707"},{"key":"ref36","first-page":"957","article-title":"Optimal patrol strategy for protecting moving targets with multiple mobile resources","volume-title":"Proc. Int. Conf. Autom. Agents Multi-Agent Syst.","author":"Fang"},{"key":"ref37","first-page":"1122","article-title":"Multi-agent patrolling with reinforcement learning","volume-title":"Proc. 3rd Int. Joint Conf. Auto. Agents Multiagent Syst.","volume":"3","author":"Santana"},{"key":"ref38","first-page":"299","article-title":"Decentralised coordination of mobile sensors using the max-sum algorithm","volume-title":"Proc. 21st Int. Joint Conf. Artif. Intell.","author":"Stranders"},{"key":"ref39","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v24i1.7608"},{"key":"ref40","first-page":"417","article-title":"Decentralized Bayesian reinforcement learning for online agent collaboration","volume-title":"Proc. Int. Conf. Autom. Agents Multiagent Syst.","author":"Teacy"},{"key":"ref41","first-page":"980","article-title":"Unifying temporal and structural credit assignment problems","volume-title":"Proc. 3rd Int. Joint Conf. Autom. Agents Multiagent Syst.","author":"Agogino"},{"key":"ref42","first-page":"171","article-title":"Counterfactual exploration for improving multiagent learning","volume-title":"Proc. Int. Conf. Autom. Agents Multiagent Syst.","author":"Colby"},{"key":"ref43","doi-asserted-by":"publisher","DOI":"10.1145\/3292500.3330724"},{"key":"ref44","doi-asserted-by":"publisher","DOI":"10.1145\/3219819.3219993"},{"issue":"2","key":"ref45","doi-asserted-by":"crossref","first-page":"289","DOI":"10.1023\/A:1021814225969","article-title":"The sample average approximation method applied to stochastic routing problems: A computational study","volume":"24","author":"Verweij","year":"2003","journal-title":"Comput. Opt. Appl."},{"key":"ref46","doi-asserted-by":"publisher","DOI":"10.1162\/153244303765208377"},{"key":"ref47","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-40328-6_2"},{"key":"ref48","first-page":"101","article-title":"Agent coordination with regret clearing","volume-title":"Proc. 23rd AAAI Conf. Artif. Intell.","author":"Koenig"},{"key":"ref49","first-page":"1729","article-title":"Regret minimization in games with incomplete information","volume-title":"Proc. NIPS","author":"Zinkevich"}],"container-title":["IEEE Transactions on Intelligent Transportation Systems"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/6979\/9853713\/09626542.pdf?arnumber=9626542","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,12,31]],"date-time":"2024-12-31T19:44:39Z","timestamp":1735674279000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9626542\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,8]]},"references-count":49,"journal-issue":{"issue":"8"},"URL":"https:\/\/doi.org\/10.1109\/tits.2021.3128934","relation":{},"ISSN":["1524-9050","1558-0016"],"issn-type":[{"type":"print","value":"1524-9050"},{"type":"electronic","value":"1558-0016"}],"subject":[],"published":{"date-parts":[[2022,8]]}}}