{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,24]],"date-time":"2025-10-24T08:25:47Z","timestamp":1761294347581,"version":"3.37.3"},"reference-count":28,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","license":[{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/legalcode"}],"funder":[{"DOI":"10.13039\/501100001809","name":"General Program of National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["61973336"],"award-info":[{"award-number":["61973336"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Access"],"published-print":{"date-parts":[[2021]]},"DOI":"10.1109\/access.2021.3097897","type":"journal-article","created":{"date-parts":[[2021,7,29]],"date-time":"2021-07-29T20:08:28Z","timestamp":1627589308000},"page":"106399-106411","source":"Crossref","is-referenced-by-count":7,"title":["Dynamic Node Allocation-Based Multirobot Path Planning"],"prefix":"10.1109","volume":"9","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-3313-8308","authenticated-orcid":false,"given":"Wenbo","family":"Zhao","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Rui","family":"Lin","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Shuai","family":"Dong","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Weiwei","family":"Zhao","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yuhui","family":"Cheng","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1016\/j.artint.2007.11.009"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/ICARM49381.2020.9195297"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1613\/jair.4447"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/LRA.2020.2967317"},{"key":"ref14","article-title":"Lifelong multi-agent path finding for online pickup and delivery tasks","author":"ma","year":"2017","journal-title":"arXiv 1705 10868"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/LRA.2020.2967326"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1016\/j.artint.2014.11.001"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/TRO.2008.918056"},{"key":"ref18","first-page":"2003","article-title":"Graph decomposition for efficient multi-robot path planning","author":"ryan","year":"2007","journal-title":"Proc IJCAI"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/IROS.2011.6095085"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1109\/ROBOT.1991.131810"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1177\/027836498600500106"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1177\/027836498900800406"},{"key":"ref3","first-page":"767","article-title":"A knowledge based genetic algorithm for path planning in unstructured mobile robot environments","author":"hu","year":"2004","journal-title":"Proc IEEE Int Conf Robot Biomimetics"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/IROS.1994.407619"},{"article-title":"Rapidly-exploring random trees: A new tool for path planning","year":"1998","author":"lavalle","key":"ref5"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/TSSC.1968.300136"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1007\/BF01386390"},{"key":"ref2","first-page":"2424","article-title":"Genetic path planning for mobile robots","volume":"4","author":"gerke","year":"1999","journal-title":"Proc Amer Control Conf"},{"key":"ref9","first-page":"89","article-title":"Optimal and efficient path planning for unknown and dynamic environments","volume":"10","author":"stentz","year":"1993","journal-title":"Int J Robot Automat"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1016\/j.asoc.2009.02.014"},{"key":"ref20","first-page":"1443","article-title":"Structure and intractability of optimal multi-robot path planning on graphs","author":"yu","year":"2013","journal-title":"Proc 27th AAAI Conf Artif Intell (AAAI)"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.5391\/IJFIS.2019.19.2.67"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1109\/IROS.2005.1545306"},{"key":"ref24","doi-asserted-by":"crossref","first-page":"485","DOI":"10.1609\/icaps.v28i1.13923","article-title":"A loosely-coupled approach for multi-robot coordination, motion planning and control","author":"pecora","year":"2018","journal-title":"Proc ICAPS"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1109\/ICNSC.2015.7116061"},{"key":"ref26","first-page":"58","article-title":"Amazon use robots handle order","volume":"1","author":"dynamics","year":"2015","journal-title":"J Robot Technique and Application"},{"key":"ref25","first-page":"36","volume":"23","year":"2014","journal-title":"Amazon is Equipped With Robots to Meet Holiday Season"}],"container-title":["IEEE Access"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/6287639\/9312710\/09488180.pdf?arnumber=9488180","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,1,5]],"date-time":"2023-01-05T21:56:15Z","timestamp":1672955775000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9488180\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021]]},"references-count":28,"URL":"https:\/\/doi.org\/10.1109\/access.2021.3097897","relation":{},"ISSN":["2169-3536"],"issn-type":[{"type":"electronic","value":"2169-3536"}],"subject":[],"published":{"date-parts":[[2021]]}}}