{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,8]],"date-time":"2026-04-08T06:37:13Z","timestamp":1775630233028,"version":"3.50.1"},"reference-count":27,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","license":[{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/legalcode"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Access"],"published-print":{"date-parts":[[2020]]},"DOI":"10.1109\/access.2020.2994472","type":"journal-article","created":{"date-parts":[[2020,5,13]],"date-time":"2020-05-13T22:23:51Z","timestamp":1589408631000},"page":"1-1","source":"Crossref","is-referenced-by-count":8,"title":["A Discrete Event Formulation for Multi-Robot Collision Avoidance on Pre-planned Trajectories"],"prefix":"10.1109","author":[{"given":"Diego","family":"Deplano","sequence":"first","affiliation":[]},{"given":"Mauro","family":"Franceschelli","sequence":"additional","affiliation":[]},{"given":"Simon","family":"Ware","sequence":"additional","affiliation":[]},{"given":"Su","family":"Rong","sequence":"additional","affiliation":[]},{"given":"Alessandro","family":"Giua","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/WODES.2016.7497840"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511546877"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.5772\/57313"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1016\/j.artint.2014.11.006"},{"key":"ref14","doi-asserted-by":"crossref","first-page":"117","DOI":"10.1609\/aiide.v1i1.18726","article-title":"Cooperative pathfinding","volume":"1","author":"silver","year":"2005","journal-title":"AIIDE"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/CIMSim.2011.43"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/ICRA.2015.7140034"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/ROBOT.2002.1014852"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/TASE.2015.2445780"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1613\/jair.2408"},{"key":"ref4","article-title":"Collision avoidance in pedestrian-rich environments with deep reinforcement learning","author":"everett","year":"2019","journal-title":"arXiv 1910 11689"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1016\/j.ifacol.2017.08.393"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/ICInfA.2015.7279555"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/TRO.2016.2593448"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/TSSC.1968.300136"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1177\/027836498400300405"},{"key":"ref7","first-page":"2096","article-title":"SCRAM: Scalable collision-avoiding role assignment with minimal-makespan for formational positioning","author":"macalpine","year":"2015","journal-title":"Proc 13th AAAI Conf Artif Intell"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1080\/00207179.2018.1435906"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/ICCA.2017.8003182"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-19457-3_1"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1109\/ROBOT.2009.5152326"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1613\/jair.4447"},{"key":"ref21","first-page":"294","article-title":"Push and swap: Fast cooperative path-finding with completeness guarantees","author":"luna","year":"2011","journal-title":"Proc 22nd Int Joint Conf Artif Intell"},{"key":"ref24","first-page":"40","article-title":"Non-optimal multi-agent pathfinding is solved (since 1984)","author":"r\u00f6ger","year":"2012","journal-title":"Proc 26th AAAI Conf Artif Intell"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.1984.715921"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1016\/S0005-1098(98)00178-2"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-16595-0_42"}],"container-title":["IEEE Access"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/6287639\/6514899\/09093025.pdf?arnumber=9093025","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,10,23]],"date-time":"2022-10-23T17:49:08Z","timestamp":1666547348000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9093025\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020]]},"references-count":27,"URL":"https:\/\/doi.org\/10.1109\/access.2020.2994472","relation":{},"ISSN":["2169-3536"],"issn-type":[{"value":"2169-3536","type":"electronic"}],"subject":[],"published":{"date-parts":[[2020]]}}}