{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T12:51:20Z","timestamp":1740142280221,"version":"3.37.3"},"reference-count":27,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"2","license":[{"start":{"date-parts":[[2019,2,1]],"date-time":"2019-02-01T00:00:00Z","timestamp":1548979200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2019,2,1]],"date-time":"2019-02-01T00:00:00Z","timestamp":1548979200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2019,2,1]],"date-time":"2019-02-01T00:00:00Z","timestamp":1548979200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Ind. Inf."],"published-print":{"date-parts":[[2019,2]]},"DOI":"10.1109\/tii.2018.2824405","type":"journal-article","created":{"date-parts":[[2018,4,9]],"date-time":"2018-04-09T21:03:17Z","timestamp":1523307797000},"page":"699-709","source":"Crossref","is-referenced-by-count":4,"title":["Multiagent Gathering With Collision Avoidance and a Minimax Distance Criterion\u2014Efficient Algorithms and Hardware Realization"],"prefix":"10.1109","volume":"15","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-6876-4424","authenticated-orcid":false,"given":"Bhaskar","family":"Vundurthy","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-5279-7830","authenticated-orcid":false,"given":"K.","family":"Sridharan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/JPROC.2015.2508598"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/TII.2012.2222034"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/ICSMC.1999.825397"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/gcce.2014.7031124"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/CIHLI.2014.7013393"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/ISAMSR.2015.7379778"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1287\/trsc.6.4.379"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevLett.75.1226"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/TII.2012.2219061"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1287\/opre.15.6.1163"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1287\/moor.8.4.498"},{"key":"ref12","first-page":"31","article-title":"The best deployment of a naval force in the vicinity of potential trouble spots","volume-title":"","author":"Isaacs","year":"1964"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1137\/0601036"},{"key":"ref14","first-page":"216","article-title":"Shortest paths for a two robot rendezvous","volume-title":"Proc. 5th Can. Conf. Comput. Geometry","author":"Wynters","year":"1993"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/TRO.2009.2013493"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/TAC.2003.812781"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/TAC.2004.834113"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/TAC.2005.846556"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/TII.2012.2217971"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1109\/TII.2012.2235074"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1109\/TII.2012.2216536"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1109\/TII.2016.2607150"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1109\/TII.2016.2607148"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539795289604"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1515\/9781400876082"},{"key":"ref26","first-page":"209","article-title":"Some complexity questions related to distributed computing","volume-title":"Proc. 11th ACM Symp. Theory Comput.","author":"Yao","year":"1979"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.1978.22"}],"container-title":["IEEE Transactions on Industrial Informatics"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/9424\/8633991\/08333810.pdf?arnumber=8333810","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,1,24]],"date-time":"2024-01-24T00:10:07Z","timestamp":1706055007000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/8333810\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,2]]},"references-count":27,"journal-issue":{"issue":"2"},"URL":"https:\/\/doi.org\/10.1109\/tii.2018.2824405","relation":{},"ISSN":["1551-3203","1941-0050"],"issn-type":[{"type":"print","value":"1551-3203"},{"type":"electronic","value":"1941-0050"}],"subject":[],"published":{"date-parts":[[2019,2]]}}}