{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,5]],"date-time":"2025-12-05T12:21:47Z","timestamp":1764937307984,"version":"3.37.3"},"reference-count":30,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"1","license":[{"start":{"date-parts":[[2022,3,1]],"date-time":"2022-03-01T00:00:00Z","timestamp":1646092800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2022,3,1]],"date-time":"2022-03-01T00:00:00Z","timestamp":1646092800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2022,3,1]],"date-time":"2022-03-01T00:00:00Z","timestamp":1646092800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"funder":[{"DOI":"10.13039\/501100004359","name":"Vetenskapsr\u00e5det","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100004359","id-type":"DOI","asserted-by":"publisher"}]},{"name":"Swedish Foundation for Strategic Research"},{"DOI":"10.13039\/501100004063","name":"Knut och Alice Wallenbergs Stiftelse","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100004063","id-type":"DOI","asserted-by":"publisher"}]},{"name":"ERC"},{"name":"LEAFHOUND"},{"name":"EU project CANOPIES"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Control Netw. Syst."],"published-print":{"date-parts":[[2022,3]]},"DOI":"10.1109\/tcns.2021.3106452","type":"journal-article","created":{"date-parts":[[2021,8,20]],"date-time":"2021-08-20T20:02:57Z","timestamp":1629489777000},"page":"367-379","source":"Crossref","is-referenced-by-count":1,"title":["Time-Constrained Leader-Follower Multiagent Task Scheduling and Control Synthesis"],"prefix":"10.1109","volume":"9","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-6046-7129","authenticated-orcid":false,"given":"Pian","family":"Yu","sequence":"first","affiliation":[{"name":"School of Electrical Engineering and Computer Science, KTH Royal Institute of Technology, Stockholm, Sweden"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-7309-8086","authenticated-orcid":false,"given":"Dimos V.","family":"Dimarogonas","sequence":"additional","affiliation":[{"name":"School of Electrical Engineering and Computer Science, KTH Royal Institute of Technology, Stockholm, Sweden"}]}],"member":"263","reference":[{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1007\/s10951-008-0090-8"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.23919\/ACC.2017.7963717"},{"issue":"8","key":"ref3","first-page":"809","article-title":"Scheduling tasks to a team of autonomous mobile service robots in indoor enviroments","volume":"8","author":"Surmann","year":"2002","journal-title":"J. Universal Comput. Sci."},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/TRO.2007.900638"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/TAC.2005.846556"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1016\/j.automatica.2015.08.004"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/MRA.2007.339624"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1016\/j.automatica.2008.08.008"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1177\/0278364914546174"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/MS.1984.234713"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1145\/321738.321743"},{"first-page":"100","volume-title":"Red: Robust Earliest Deadline Scheduling","author":"Buttazzo","key":"ref12"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4615-5535-3"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/12.908988"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/12.508319"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.23919\/ACC.2017.7963113"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.23919\/ACC45564.2020.9147387"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.23919\/ACC.2018.8431695"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/TAC.2008.929402"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1109\/TAC.2009.2013013"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1137\/100799903"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1007\/s10514-018-9700-2"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1016\/j.automatica.2022.110276"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1109\/CDC.2018.8618995"},{"article-title":"Using optimization to find maximum inscribed balls and minimum enclosing balls","year":"2014","author":"Allen-Zhu","key":"ref25"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.18130\/v3t50g"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1109\/TAC.2016.2527731"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1145\/2883817.2883848"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1109\/MCS.2008.931718"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.23943\/princeton\/9780691153896.001.0001"}],"container-title":["IEEE Transactions on Control of Network Systems"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/6509490\/9782698\/09520284.pdf?arnumber=9520284","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,1,11]],"date-time":"2024-01-11T22:39:51Z","timestamp":1705012791000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9520284\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,3]]},"references-count":30,"journal-issue":{"issue":"1"},"URL":"https:\/\/doi.org\/10.1109\/tcns.2021.3106452","relation":{},"ISSN":["2325-5870","2372-2533"],"issn-type":[{"type":"electronic","value":"2325-5870"},{"type":"electronic","value":"2372-2533"}],"subject":[],"published":{"date-parts":[[2022,3]]}}}