{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,10]],"date-time":"2025-10-10T07:11:51Z","timestamp":1760080311907,"version":"3.37.3"},"reference-count":56,"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":["61876199"],"award-info":[{"award-number":["61876199"]}],"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":[[2019]]},"DOI":"10.1109\/access.2019.2942966","type":"journal-article","created":{"date-parts":[[2019,9,24]],"date-time":"2019-09-24T01:09:01Z","timestamp":1569287341000},"page":"138495-138511","source":"Crossref","is-referenced-by-count":17,"title":["Multi-Robot Cooperative Task Allocation With Definite Path-Conflict-Free Handling"],"prefix":"10.1109","volume":"7","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-0724-0440","authenticated-orcid":false,"given":"Hongguang","family":"Zhang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Han","family":"Luo","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Zan","family":"Wang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yuhong","family":"Liu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yuanan","family":"Liu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref39","doi-asserted-by":"publisher","DOI":"10.1016\/S0004-3702(97)00078-7"},{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.1115\/1.4028849"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1007\/s10846-014-0154-2"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1007\/s10514-010-9202-3"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1016\/j.cie.2012.09.004"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1016\/j.engappai.2007.03.008"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1016\/j.robot.2016.02.003"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1186\/s40064-016-3027-2"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1007\/s00500-014-1274-0"},{"key":"ref34","first-page":"492","article-title":"Decentralised online planning for multi-robot warehouse commissioning","author":"claes","year":"2017","journal-title":"Proc 16th Conf Autonomous Agents and MultiAgent Systems"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1109\/TRO.2006.878948"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1111\/coin.12194"},{"key":"ref29","first-page":"395","article-title":"Combining re-allocating and re-scheduling for dynamic multi-robot task allocation","author":"chen","year":"2016","journal-title":"Proc IEEE Int Conf Syst Man and Cybern (SMC)"},{"key":"ref2","first-page":"27","article-title":"Autonomous agents research in robotics: A report from the trenches","author":"kaminka","year":"2012","journal-title":"Proc AAAI Spring Symp Ser Designing Intell Robots"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/JPROC.2006.876939"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-32274-0_17"},{"key":"ref22","first-page":"2110","article-title":"Multi-robot auctions for allocation of tasks with temporal constraints","author":"nunes","year":"2015","journal-title":"Proc 29th AAAI Conf Artif Intell"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1109\/IROS.2010.5650006"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1109\/SIMPAR.2016.7862396"},{"key":"ref23","first-page":"1078","article-title":"Iterated multi-robot auctions for precedence-constrained task scheduling","author":"mcintire","year":"2016","journal-title":"Proc 1st Int Conf Autonomous Agents Multiagent Syst"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1109\/TASE.2015.2438032"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1109\/TRO.2017.2693377"},{"key":"ref50","doi-asserted-by":"publisher","DOI":"10.1109\/ROBOT.2007.363989"},{"key":"ref51","doi-asserted-by":"publisher","DOI":"10.1007\/s10514-016-9579-8"},{"key":"ref56","doi-asserted-by":"publisher","DOI":"10.1016\/j.eswa.2011.04.163"},{"key":"ref55","doi-asserted-by":"publisher","DOI":"10.1016\/j.cie.2015.10.010"},{"key":"ref54","doi-asserted-by":"publisher","DOI":"10.1016\/j.asoc.2017.12.031"},{"key":"ref53","first-page":"152","article-title":"Algorithm of task-allocation based on realizing at the lowest cost in multimobile robot system","author":"zu","year":"2004","journal-title":"Proc Int Conf Mach Learn Cybern"},{"key":"ref52","doi-asserted-by":"publisher","DOI":"10.3182\/20120914-2-US-4030.00029"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1038\/35023164"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/ACCESS.2017.2773127"},{"key":"ref40","doi-asserted-by":"publisher","DOI":"10.1016\/S0921-8890(97)00033-X"},{"key":"ref12","first-page":"6681","article-title":"Multi-robot task allocation and scheduling based on fish swarm algorithm","author":"zheng","year":"2010","journal-title":"Proc 8th World Congr Intell Control Automat"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-70093-9_1"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/ACCESS.2018.2828499"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/SMC.2016.7844232"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1371\/journal.pone.0170659"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/ICBR.2013.6729278"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1023\/A:1022291921717"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1177\/0278364906063426"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.5772\/57313"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1177\/0278364904045564"},{"journal-title":"NASA Counting on Humanoid Robots for Deep Space Exploration","year":"2019","key":"ref6"},{"journal-title":"This Robot Superhero Could Be the Future of Disaster Relief Operations","year":"2019","key":"ref5"},{"journal-title":"Ocean Tech Using Robots to Conduct Deep-Sea Research","year":"2019","key":"ref8"},{"journal-title":"Another Robot Just Broke Down Investigating Fukushima’s Record High Radiation Levels","year":"2019","key":"ref7"},{"key":"ref49","doi-asserted-by":"crossref","first-page":"1049","DOI":"10.1007\/s10845-014-0909-4","article-title":"Optimal bid valuation using path finding for multi-robot task allocation","volume":"26","author":"\u00f6zt\u00fcrk","year":"2015","journal-title":"J Intell Manuf"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1177\/0278364913496484"},{"key":"ref46","doi-asserted-by":"publisher","DOI":"10.1109\/TASE.2015.2415514"},{"key":"ref45","doi-asserted-by":"publisher","DOI":"10.1007\/s10489-015-0660-3"},{"key":"ref48","doi-asserted-by":"publisher","DOI":"10.1016\/j.eswa.2016.05.007"},{"key":"ref47","doi-asserted-by":"publisher","DOI":"10.1109\/TASE.2016.2603781"},{"key":"ref42","doi-asserted-by":"publisher","DOI":"10.1109\/70.988973"},{"key":"ref41","doi-asserted-by":"publisher","DOI":"10.1007\/s004539910020"},{"key":"ref44","doi-asserted-by":"publisher","DOI":"10.1109\/TASE.2015.2432746"},{"key":"ref43","doi-asserted-by":"publisher","DOI":"10.1007\/s10846-016-0362-z"}],"container-title":["IEEE Access"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/6287639\/8600701\/08846209.pdf?arnumber=8846209","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,8,10]],"date-time":"2021-08-10T19:40:48Z","timestamp":1628624448000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/8846209\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"references-count":56,"URL":"https:\/\/doi.org\/10.1109\/access.2019.2942966","relation":{},"ISSN":["2169-3536"],"issn-type":[{"type":"electronic","value":"2169-3536"}],"subject":[],"published":{"date-parts":[[2019]]}}}