{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,10]],"date-time":"2026-02-10T18:52:42Z","timestamp":1770749562299,"version":"3.50.0"},"reference-count":57,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"1","license":[{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"content-version":"am","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"funder":[{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["ECCS-1405156"],"award-info":[{"award-number":["ECCS-1405156"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["ECCS-1707695"],"award-info":[{"award-number":["ECCS-1707695"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]},{"name":"IRAD Program of the Georgia Tech Research Institute"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Automat. Sci. Eng."],"published-print":{"date-parts":[[2019,1]]},"DOI":"10.1109\/tase.2018.2798630","type":"journal-article","created":{"date-parts":[[2018,2,15]],"date-time":"2018-02-15T19:15:19Z","timestamp":1518722119000},"page":"363-381","source":"Crossref","is-referenced-by-count":24,"title":["Optimized Multiagent Routing for a Class of Guidepath-Based Transport Systems"],"prefix":"10.1109","volume":"16","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-6359-0552","authenticated-orcid":false,"given":"Greyson","family":"Daugherty","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-6176-0925","authenticated-orcid":false,"given":"Spyros","family":"Reveliotis","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-7330-5962","authenticated-orcid":false,"given":"Greg","family":"Mohler","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref39","author":"zhou","year":"2004","journal-title":"Deadlock Resolution in Computer-Integrated Systems"},{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.1007\/978-0-387-68612-7"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1287\/opre.41.6.1077"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1109\/TSSC.1968.300136"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1016\/j.artint.2014.11.006"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1016\/j.artint.2014.11.001"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1109\/5.21072"},{"key":"ref36","doi-asserted-by":"crossref","first-page":"315","DOI":"10.1115\/1.2901666","article-title":"A labeling algorithm for the navigation of automated guided vehicles","volume":"115","author":"huang","year":"1993","journal-title":"J Eng Ind"},{"key":"ref35","author":"ghiani","year":"2004","journal-title":"Introduction to Logistics Systems Planning and Control"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1023\/B:FLEX.0000036032.41757.3d"},{"key":"ref28","first-page":"564","article-title":"Towards optimal cooperative path planning in hard setups through satisfiability solving","author":"surynek","year":"2012","journal-title":"Proc 12th Pacific Rim Int Conf Artif Intell"},{"key":"ref27","author":"hopcroft","year":"1979","journal-title":"Introduction to Automata Theory Languages and Computation"},{"key":"ref29","first-page":"28","article-title":"Finding optimal solutions to cooperative pathfinding problems","author":"standley","year":"2010","journal-title":"Proc AAAI"},{"key":"ref2","doi-asserted-by":"crossref","DOI":"10.1201\/9781420066272","author":"heragu","year":"2008","journal-title":"Facilities Design"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511546877"},{"key":"ref20","author":"yu","year":"2015","journal-title":"Optimal multi-robot path planning on graphs Structure and computational complexity"},{"key":"ref22","first-page":"3166","article-title":"Multi-agent path finding with payload transfers and the package-exchange robot-routing problem","author":"ma","year":"2016","journal-title":"Proc AAAI"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1109\/TRO.2016.2593448"},{"key":"ref24","first-page":"88","article-title":"Multi-agent pathfinding with simultaneous execution of single-agent primitives","author":"sajid","year":"2012","journal-title":"Proc Symp Combin Search"},{"key":"ref23","author":"garey","year":"1979","journal-title":"Computers and Intractability A Guide to the Theory of NP-Completeness"},{"key":"ref26","first-page":"55","article-title":"MAPP: A scalable multi-agent path planning algorithm with tractability and completeness guarantees","volume":"42","author":"wang","year":"2011","journal-title":"J Artif Intell Res"},{"key":"ref25","first-page":"668","article-title":"Complete algorithms for cooperative pathfinding problems","author":"standley","year":"2011","journal-title":"Proc 22nd Int Joint Conf Artif Intell"},{"key":"ref50","doi-asserted-by":"publisher","DOI":"10.1109\/TASE.2010.2043096"},{"key":"ref51","doi-asserted-by":"publisher","DOI":"10.1109\/5.24143"},{"key":"ref57","doi-asserted-by":"publisher","DOI":"10.1023\/A:1018936219150"},{"key":"ref56","doi-asserted-by":"publisher","DOI":"10.1109\/SOLI.2017.8120972"},{"key":"ref55","article-title":"Cooperating sequential processes","author":"dijkstra","year":"1965"},{"key":"ref54","author":"ahuja","year":"1993","journal-title":"Network Flows Theory Algorithms and Applications"},{"key":"ref53","doi-asserted-by":"publisher","DOI":"10.1080\/07408179108963842"},{"key":"ref52","doi-asserted-by":"publisher","DOI":"10.1109\/70.210791"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/CDC.2016.7798510"},{"key":"ref11","article-title":"A customized dual ascent algorithm for a class of traffic coordination problems","author":"daugherty","year":"2016"},{"key":"ref40","doi-asserted-by":"publisher","DOI":"10.1561\/2600000010"},{"key":"ref12","doi-asserted-by":"crossref","first-page":"82","DOI":"10.1007\/BFb0120690","article-title":"Lagrangian relaxation for integer programming","volume":"2","author":"geoffrion","year":"1974","journal-title":"Math Program Stud"},{"key":"ref13","author":"bertsekas","year":"1999","journal-title":"Nonlinear Programming"},{"key":"ref14","author":"papadimitriou","year":"1998","journal-title":"Combinatorial Optimization Algorithms and Complexity"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/TAC.2010.2046111"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.1984.715921"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1007\/PL00009259"},{"key":"ref18","doi-asserted-by":"crossref","first-page":"157","DOI":"10.1007\/978-3-642-36279-8_10","article-title":"Multi-agent path planning and network flow","author":"yu","year":"2013","journal-title":"Algorithmic Foundations of Robotics VI"},{"key":"ref19","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-319-16595-0_42","article-title":"Pebble motion on graphs with rotations: Efficient feasibility tests and planning algorithms","author":"yu","year":"2015","journal-title":"Algorithmic Foundations of Robotics XI"},{"key":"ref4","first-page":"23","article-title":"Cooperative pathfinding","author":"silver","year":"2005","journal-title":"Proc Artif Intell Interactive Digit Entertainment Conf"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1016\/0095-8956(74)90098-7"},{"key":"ref6","first-page":"32","article-title":"Semiconductor manufacturing: The final automation wave","author":"nestel-patt","year":"1998","journal-title":"Robotics World"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511976667"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1080\/07408170008967423"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1002\/047134608X.W7015"},{"key":"ref49","doi-asserted-by":"publisher","DOI":"10.1109\/TMECH.2006.886255"},{"key":"ref9","author":"pinedo","year":"2002","journal-title":"Scheduling"},{"key":"ref46","doi-asserted-by":"publisher","DOI":"10.1016\/j.automatica.2013.02.036"},{"key":"ref45","doi-asserted-by":"publisher","DOI":"10.1109\/TRO.2010.2098270"},{"key":"ref48","doi-asserted-by":"publisher","DOI":"10.1109\/TRO.2005.853489"},{"key":"ref47","first-page":"5301","article-title":"Petri net modeling and Lagrangian relaxation approach to vehicle scheduling in 300 mm semiconductor manufacturing","author":"liao","year":"2004","journal-title":"Proc IEEE Int Conf Robot Autom"},{"key":"ref42","doi-asserted-by":"publisher","DOI":"10.1080\/00207540110118073"},{"key":"ref41","first-page":"64","article-title":"Resource-oriented Petri nets in deadlock avoidance of AGV systems","author":"wu","year":"2001","journal-title":"Proc IEEE ICRA"},{"key":"ref44","doi-asserted-by":"publisher","DOI":"10.1109\/TAC.2008.929375"},{"key":"ref43","doi-asserted-by":"crossref","first-page":"1231","DOI":"10.1016\/j.conengprac.2006.02.007","article-title":"Monitor design for colored Petri nets: An application to deadlock prevention in railway networks","volume":"14","author":"giua","year":"2006","journal-title":"Control Eng Pract"}],"container-title":["IEEE Transactions on Automation Science and Engineering"],"original-title":[],"link":[{"URL":"https:\/\/ieeexplore.ieee.org\/ielaam\/8856\/8602371\/8292889-aam.pdf","content-type":"application\/pdf","content-version":"am","intended-application":"syndication"},{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/8856\/8602371\/08292889.pdf?arnumber=8292889","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,7,13]],"date-time":"2022-07-13T21:07:50Z","timestamp":1657746470000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/8292889\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,1]]},"references-count":57,"journal-issue":{"issue":"1"},"URL":"https:\/\/doi.org\/10.1109\/tase.2018.2798630","relation":{},"ISSN":["1545-5955","1558-3783"],"issn-type":[{"value":"1545-5955","type":"print"},{"value":"1558-3783","type":"electronic"}],"subject":[],"published":{"date-parts":[[2019,1]]}}}