{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T20:18:46Z","timestamp":1740169126215,"version":"3.37.3"},"reference-count":32,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","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:\/\/creativecommons.org\/licenses\/by\/4.0\/legalcode"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["61673327"],"award-info":[{"award-number":["61673327"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100004750","name":"Science and Technology on Avionics Integration Laboratory and the Aeronautical Science Foundation of China","doi-asserted-by":"publisher","award":["20185568005"],"award-info":[{"award-number":["20185568005"]}],"id":[{"id":"10.13039\/501100004750","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Access"],"published-print":{"date-parts":[[2019]]},"DOI":"10.1109\/access.2019.2939181","type":"journal-article","created":{"date-parts":[[2019,9,3]],"date-time":"2019-09-03T15:22:48Z","timestamp":1567524168000},"page":"132286-132301","source":"Crossref","is-referenced-by-count":11,"title":["Cooperative Path Planning for Multiple Robots With Motion Constraints in Obstacle-Strewn Environment"],"prefix":"10.1109","volume":"7","author":[{"given":"Jiang","family":"Shao","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-8670-3190","authenticated-orcid":false,"given":"Delin","family":"Luo","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yang","family":"Xu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-4926-3202","authenticated-orcid":false,"given":"Haibin","family":"Duan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1016\/j.ins.2018.06.061"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1108\/IJICC-02-2014-0005"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1137\/0215014"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1007\/s10514-017-9691-4"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-45058-0_14"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/TAC.2017.2680602"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1016\/j.eswa.2011.09.090"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/TCNS.2015.2504034"},{"key":"ref15","first-page":"2003","article-title":"Graph decomposition for efficient multi-robot path planning","author":"ryan","year":"2007","journal-title":"Proc 20th Int Joint Conf Artif Intell"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1613\/jair.2408"},{"key":"ref17","doi-asserted-by":"crossref","first-page":"13","DOI":"10.3233\/IFS-2009-0412","article-title":"Cooperative multi-robot path planning using differential evolution","volume":"20","author":"chakraborty","year":"2009","journal-title":"J Intell Fuzzy Syst"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/ACCESS.2017.2723892"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1016\/j.neucom.2018.06.032"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1007\/s10883-014-9222-y"},{"key":"ref4","article-title":"Optimal trajectory-planning of UAVs via B-splines and disjunctive programming","author":"babaei","year":"2018","journal-title":"arXiv 1807 02931"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.23919\/ACC.2017.7963331"},{"key":"ref3","article-title":"SEAR: A polynomial-time multi-robot path planning algorithm with expected constant-factor optimality guarantee","author":"han","year":"2017","journal-title":"arXiv 1709 08215"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1007\/BF01258291"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1109\/SIBCON.2017.7998564"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.2307\/2372560"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1016\/j.artint.2014.11.001"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/TITS.2017.2673778"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.3390\/app9050827"},{"key":"ref9","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"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/TRO.2016.2593448"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1109\/ACCESS.2018.2864188"},{"key":"ref22","first-page":"471","article-title":"Partial-expansion A* with selective node generation","author":"felner","year":"2012","journal-title":"Proc 26th AAAI Conf Artif Intell"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1109\/TSSC.1968.300136"},{"key":"ref24","doi-asserted-by":"crossref","first-page":"691","DOI":"10.1007\/s10514-017-9659-4","article-title":"Decentralized multi-robot belief space planning in unknown environments via identification and efficient re-evaluation of impacted paths","volume":"42","author":"regev","year":"2017","journal-title":"Autonom Robot"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1109\/TRO.2016.2524018"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1109\/IDAP.2018.8620808"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1109\/HNICEM.2017.8269498"}],"container-title":["IEEE Access"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/6287639\/8600701\/08822952.pdf?arnumber=8822952","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,1,12]],"date-time":"2022-01-12T11:31:02Z","timestamp":1641987062000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/8822952\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"references-count":32,"URL":"https:\/\/doi.org\/10.1109\/access.2019.2939181","relation":{},"ISSN":["2169-3536"],"issn-type":[{"type":"electronic","value":"2169-3536"}],"subject":[],"published":{"date-parts":[[2019]]}}}