{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,10,30]],"date-time":"2024-10-30T08:58:08Z","timestamp":1730278688305,"version":"3.28.0"},"reference-count":21,"publisher":"IEEE","license":[{"start":{"date-parts":[[2019,10,1]],"date-time":"2019-10-01T00:00:00Z","timestamp":1569888000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2019,10,1]],"date-time":"2019-10-01T00:00:00Z","timestamp":1569888000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2019,10,1]],"date-time":"2019-10-01T00:00:00Z","timestamp":1569888000000},"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":[],"published-print":{"date-parts":[[2019,10]]},"DOI":"10.1109\/itsc.2019.8916906","type":"proceedings-article","created":{"date-parts":[[2019,11,29]],"date-time":"2019-11-29T11:11:50Z","timestamp":1575025910000},"page":"4456-4463","source":"Crossref","is-referenced-by-count":1,"title":["Push, Stop, and Replan: An Application of Pebble Motion on Graphs to Planning in Automated Warehouses"],"prefix":"10.1109","author":[{"given":"Miroslav","family":"Kulich","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Tomas","family":"Novak","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Libor","family":"Preucil","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref10","first-page":"380","article-title":"Fast and Memory-Efficient Multi-Agent Pathfinding","author":"wang","year":"2008","journal-title":"ICAPS"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/70.736775"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/70.988973"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/IROS.2005.1545306"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/ROBOT.2001.932565"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/TASE.2015.2445780"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1007\/s12351-010-0093-z"},{"key":"ref17","first-page":"55","article-title":"MAPP: a Scalable Multi-Agent Path Planning Algorithm with Tractability and Completeness Guarantees","author":"wang","year":"2011","journal-title":"Journal of Artificial Intelligence Research"},{"key":"ref18","first-page":"117","article-title":"Cooperative Pathfinding","author":"silver","year":"2005","journal-title":"The 1st Conference on Artificial Intelligence and Interactive Digital Entertainment"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/IROS.2011.6095085"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4615-4022-9"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-22670-0_1"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1613\/jair.2408"},{"key":"ref5","article-title":"Rapidly-Exploring Random Trees: A New Tool for Path Planning","volume":"11","author":"lavalle","year":"1998","journal-title":"Technical Report (Computer Science Deptartment Iowa State University)"},{"key":"ref8","first-page":"112","article-title":"Biased Cost Pathfinding","author":"geramifard","year":"2006","journal-title":"Artificial Intelligence for Interactive Digital Entertainment Conference"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.15607\/RSS.2009.V.018"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1177\/027836498400300405"},{"key":"ref1","doi-asserted-by":"crossref","first-page":"443","DOI":"10.1613\/jair.4447","article-title":"Push and Rotate: A complete Multi-agent Pathfinding algorithm","volume":"51","author":"dewilde","year":"2014","journal-title":"Journal of Artificial Intelligence Research"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/TRO.2008.918056"},{"article-title":"Boost graph library: A* heuristic search - 1.64.0","year":"0","author":"beevers","key":"ref20"},{"journal-title":"Dijkstra’s shortest paths","year":"2017","author":"siek","key":"ref21"}],"event":{"name":"2019 IEEE Intelligent Transportation Systems Conference - ITSC","start":{"date-parts":[[2019,10,27]]},"location":"Auckland, New Zealand","end":{"date-parts":[[2019,10,30]]}},"container-title":["2019 IEEE Intelligent Transportation Systems Conference (ITSC)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/8907344\/8916833\/08916906.pdf?arnumber=8916906","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,7,18]],"date-time":"2022-07-18T14:46:13Z","timestamp":1658155573000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/8916906\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,10]]},"references-count":21,"URL":"https:\/\/doi.org\/10.1109\/itsc.2019.8916906","relation":{},"subject":[],"published":{"date-parts":[[2019,10]]}}}