{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,8,26]],"date-time":"2024-08-26T05:05:20Z","timestamp":1724648720097},"reference-count":33,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","license":[{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by-nc-nd\/4.0\/"}],"funder":[{"DOI":"10.13039\/100006602","name":"Air Force Research Laboratory","doi-asserted-by":"publisher","award":["FA8750-18-2-0114"],"id":[{"id":"10.13039\/100006602","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000006","name":"U.S. Office of Naval Research","doi-asserted-by":"publisher","award":["N00014-20-1-2712"],"id":[{"id":"10.13039\/100000006","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Access"],"published-print":{"date-parts":[[2022]]},"DOI":"10.1109\/access.2022.3224146","type":"journal-article","created":{"date-parts":[[2022,11,24]],"date-time":"2022-11-24T18:23:47Z","timestamp":1669314227000},"page":"124083-124102","source":"Crossref","is-referenced-by-count":3,"title":["Distributed Task Allocation Algorithms for Multi-Agent Systems With Very Low Communication"],"prefix":"10.1109","volume":"10","author":[{"ORCID":"http:\/\/orcid.org\/0000-0001-8476-5411","authenticated-orcid":false,"given":"Akshay","family":"Bapat","sequence":"first","affiliation":[{"name":"A. James Clark School of Engineering, University of Maryland, College Park, MD, USA"}]},{"ORCID":"http:\/\/orcid.org\/0000-0002-4758-9743","authenticated-orcid":false,"given":"Bharath Reddy","family":"Bora","sequence":"additional","affiliation":[{"name":"A. James Clark School of Engineering, University of Maryland, College Park, MD, USA"}]},{"ORCID":"http:\/\/orcid.org\/0000-0002-4081-1196","authenticated-orcid":false,"given":"Jeffrey W.","family":"Herrmann","sequence":"additional","affiliation":[{"name":"A. James Clark School of Engineering, University of Maryland, College Park, MD, USA"}]},{"ORCID":"http:\/\/orcid.org\/0000-0001-5248-6266","authenticated-orcid":false,"given":"Shapour","family":"Azarm","sequence":"additional","affiliation":[{"name":"A. James Clark School of Engineering, University of Maryland, College Park, MD, USA"}]},{"ORCID":"http:\/\/orcid.org\/0000-0002-7238-8759","authenticated-orcid":false,"given":"Huan","family":"Xu","sequence":"additional","affiliation":[{"name":"A. James Clark School of Engineering, University of Maryland, College Park, MD, USA"}]},{"ORCID":"http:\/\/orcid.org\/0000-0001-7432-0734","authenticated-orcid":false,"given":"Michael W.","family":"Otte","sequence":"additional","affiliation":[{"name":"A. James Clark School of Engineering, University of Maryland, College Park, MD, USA"}]}],"member":"263","reference":[{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4419-7787-8"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1109\/MCI.2006.329691"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1109\/COMST.2018.2856587"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-18299-5_2"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/TCYB.2015.2418052"},{"key":"ref11","author":"kirk","year":"2020","journal-title":"Fixed start\/end point multiple traveling salesmen problem—Genetic algorithm"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/TRO.2009.2022423"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1007\/978-4-431-55879-8_16"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.4304\/jcp.7.9.2160-2167"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/ICRA40945.2020.9197314"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/NAECON46414.2019.9057847"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1177\/0278364918755924"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/SAHCN.2019.8824898"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.2514\/6.2006-6454"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-54927-9"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/ACCESS.2018.2885455"},{"key":"ref27","first-page":"5","article-title":"ROS: An open-source robot operating system","author":"quigley","year":"2009","journal-title":"Proc ICRA Workshop Open Source Softw"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/TCST.2011.2167331"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1007\/s10514-019-09828-5"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1109\/ROBIO.2013.6739809"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/LRA.2019.2963646"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.2514\/6.2010-8421"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.2514\/6.2011-1441"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1002\/rob.20403"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/ICUAS.2017.7991447"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/EST.2010.31"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1109\/CDC.2005.1582370"},{"key":"ref22","article-title":"Data-driven metareasoning for collaborative autonomous systems","author":"herrmann","year":"2020"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.23919\/WMNC.2019.8881681"},{"key":"ref24","article-title":"Development of decentralized task allocation algorithms for multi-agent systems with very low communication","author":"bapat","year":"2020"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1109\/ACCESS.2021.3096229"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1017\/S0305004100034095"},{"key":"ref25","article-title":"Worst-case analysis of a new heuristic for the travelling salesman problem","author":"christofides","year":"1976"}],"container-title":["IEEE Access"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/6287639\/9668973\/09961172.pdf?arnumber=9961172","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,12,2]],"date-time":"2022-12-02T15:46:28Z","timestamp":1669995988000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9961172\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022]]},"references-count":33,"URL":"https:\/\/doi.org\/10.1109\/access.2022.3224146","relation":{},"ISSN":["2169-3536"],"issn-type":[{"value":"2169-3536","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022]]}}}
