{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,15]],"date-time":"2026-01-15T22:44:19Z","timestamp":1768517059335,"version":"3.49.0"},"reference-count":12,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2016,10]]},"DOI":"10.1109\/smc.2016.7844273","type":"proceedings-article","created":{"date-parts":[[2017,2,10]],"date-time":"2017-02-10T10:57:47Z","timestamp":1486724267000},"page":"000395-000400","source":"Crossref","is-referenced-by-count":4,"title":["Combining re-allocating and re-scheduling for dynamic multi-robot task allocation"],"prefix":"10.1109","author":[{"family":"Yin Chen","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"family":"Xinjun Mao","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"family":"Fu Hou","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"family":"Qiuzen Wang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"family":"Shuo Yang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/JPROC.2006.876939"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1177\/0278364913496484"},{"key":"ref10","article-title":"The dynamic hungarian algorithm for the assignment problem with changing costs","author":"mills-tettey","year":"2007","journal-title":"Tech Report CMU-RI-TR-07-27 Carnegie Mellon Univ"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/SASO.2013.14"},{"key":"ref11","first-page":"574","article-title":"Multi-robot task allocation with real-time path planning","author":"woosley","year":"2013","journal-title":"Proc the 12th Int Florida AI Research Society Conf"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1177\/0278364906063426"},{"key":"ref12","first-page":"87","article-title":"Repeated sequential single-cluster auctions with dynamic tasks for MRTA with pickup and delivery","author":"heap","year":"2013","journal-title":"MATES"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/AIM.2012.6265938"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1016\/j.robot.2010.03.011"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1177\/0278364904045564"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/ICRA.2015.7139351"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1007\/s10846-014-0088-8"}],"event":{"name":"2016 IEEE International Conference on Systems, Man, and Cybernetics (SMC)","location":"Budapest, Hungary","start":{"date-parts":[[2016,10,9]]},"end":{"date-parts":[[2016,10,12]]}},"container-title":["2016 IEEE International Conference on Systems, Man, and Cybernetics (SMC)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/7830913\/7844217\/07844273.pdf?arnumber=7844273","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,3,1]],"date-time":"2017-03-01T17:44:24Z","timestamp":1488390264000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/7844273\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,10]]},"references-count":12,"URL":"https:\/\/doi.org\/10.1109\/smc.2016.7844273","relation":{},"subject":[],"published":{"date-parts":[[2016,10]]}}}