{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,8,9]],"date-time":"2024-08-09T21:13:32Z","timestamp":1723238012774},"reference-count":33,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2013,7,3]],"date-time":"2013-07-03T00:00:00Z","timestamp":1372809600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Auton Robot"],"published-print":{"date-parts":[[2013,11]]},"DOI":"10.1007\/s10514-013-9351-2","type":"journal-article","created":{"date-parts":[[2013,7,2]],"date-time":"2013-07-02T04:47:50Z","timestamp":1372740470000},"page":"271-286","source":"Crossref","is-referenced-by-count":17,"title":["An anytime assignment algorithm: From local task swapping to global optimality"],"prefix":"10.1007","volume":"35","author":[{"given":"Lantao","family":"Liu","sequence":"first","affiliation":[]},{"given":"Dylan A.","family":"Shell","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2013,7,3]]},"reference":[{"key":"9351_CR1","doi-asserted-by":"crossref","first-page":"85","DOI":"10.1007\/978-3-642-77489-8_5","volume-title":"Combinatorial optimization","author":"M Akg\u00fcl","year":"1992","unstructured":"Akg\u00fcl, M. (1992). The linear assignment problem. In M. Akgiil & S. Tufecki (Eds.), Combinatorial optimization (pp. 85\u2013122). Berlin: Springer."},{"issue":"3","key":"9351_CR2","doi-asserted-by":"crossref","first-page":"578","DOI":"10.1287\/mnsc.10.3.578","volume":"10","author":"ML Balinski","year":"1964","unstructured":"Balinski, M. L., & Gomory, R. E. (1964). A primal method for the assignment and transportation problems. Management Science, 10(3), 578\u2013593.","journal-title":"Management Science"},{"key":"9351_CR3","doi-asserted-by":"crossref","unstructured":"Berhault, M., Huang, H., Keskinocak, P., Koenig, S., Elmaghraby, W., Griffin, P., & Kleywegt, A. J. (2003). Robot Exploration with Combinatorial Auctions (pp. 1957\u20131962). In Proceedings of the IROS.","DOI":"10.1109\/IROS.2003.1248932"},{"issue":"4","key":"9351_CR4","doi-asserted-by":"crossref","first-page":"133","DOI":"10.1287\/inte.20.4.133","volume":"20","author":"DP Bertsekas","year":"1990","unstructured":"Bertsekas, D. P. (1990). The auction algorithm for assignment and other network flow problems: A tutorial. Interfaces, 20(4), 133\u2013149.","journal-title":"Interfaces"},{"key":"9351_CR5","doi-asserted-by":"crossref","DOI":"10.1137\/1.9780898717754","volume-title":"Assignment problems","author":"R Burkard","year":"2009","unstructured":"Burkard, R., Dell\u2019Amico, M., & Martello, S. (2009). Assignment problems. New York, NY: Society for Industrial and Applied Mathematics."},{"key":"9351_CR6","first-page":"226","volume":"4","author":"YU Cao","year":"1997","unstructured":"Cao, Y. U., Fukunaga, A. S., & Kahng, A. B. (1997). Cooperative mobile robotics: Antecedents and directions. Autonomous Robots, 4, 226\u2013234.","journal-title":"Autonomous Robots"},{"key":"9351_CR7","doi-asserted-by":"crossref","unstructured":"Chaimowicz, L., Campos, M. F. M., & Kumar, V. (2002). Dynamic role assignment for cooperative robots (pp. 293\u2013298). In Proceedings of the IEEE International Conference on Robotics and Automation.","DOI":"10.1109\/ROBOT.2002.1013376"},{"key":"9351_CR8","doi-asserted-by":"crossref","unstructured":"Cunningham, W., & Marsh, A. B, I. (1978). A primal algorithm for optimum matching. Mathematical Programming Study, 8, 50\u201372.","DOI":"10.1007\/BFb0121194"},{"key":"9351_CR9","doi-asserted-by":"crossref","DOI":"10.1515\/9781400884179","volume-title":"Linear programming and extensions","author":"G Dantzig","year":"1963","unstructured":"Dantzig, G. (1963). Linear programming and extensions. Princeton: Princeton University Press."},{"key":"9351_CR10","doi-asserted-by":"crossref","unstructured":"Dias, M.B., & Stentz, A. (2002). Opportunistic optimization for market-based multirobot control (pp. 2714\u20132720 ). In Proceedings of the IROS.","DOI":"10.1109\/IRDS.2002.1041680"},{"key":"9351_CR11","doi-asserted-by":"crossref","unstructured":"Dias, M. B., Zlot, R., Kalra, N., & Stentz, A. (2006). Market-based multirobot coordination: A survey and analysis. In Proceedings of the IEEE.","DOI":"10.1109\/JPROC.2006.876939"},{"issue":"2","key":"9351_CR12","doi-asserted-by":"crossref","first-page":"248","DOI":"10.1145\/321694.321699","volume":"19","author":"J Edmonds","year":"1972","unstructured":"Edmonds, J., & Karp, R. M. (1972). Theoretical improvements in algorithmic efficiency for network flow problems. Journal of the ACM, 19(2), 248\u2013264.","journal-title":"Journal of the ACM"},{"key":"9351_CR13","unstructured":"Farinelli, A., Iocchi, L., Nardi, D., & Ziparo, V. A. (2006). Assignment of dynamically perceived tasks by token passing in multi-robot systems. In Proceedings of the IEEE, Special Issue on Multi-robot Systems."},{"issue":"9","key":"9351_CR14","doi-asserted-by":"crossref","first-page":"939","DOI":"10.1177\/0278364904045564","volume":"23","author":"BP Gerkey","year":"2004","unstructured":"Gerkey, B. P., & Matari\u0107, M. J. (2004). A formal analysis and taxonomy of task allocation in multi-robot systems. International Journal of Robotics Research, 23(9), 939\u2013954.","journal-title":"International Journal of Robotics Research"},{"key":"9351_CR15","doi-asserted-by":"crossref","first-page":"721","DOI":"10.1007\/978-3-642-13022-9_72","volume":"6096","author":"S Giordani","year":"2010","unstructured":"Giordani, S., Lujak, M., & Martinelli, F. (2010). A distributed algorithm for the multi-robot task allocation problem. LNCS: Trends in Applied Intelligent Systems, 6096, 721\u2013730.","journal-title":"LNCS: Trends in Applied Intelligent Systems"},{"issue":"2","key":"9351_CR16","doi-asserted-by":"crossref","first-page":"153","DOI":"10.1007\/BF01585996","volume":"71","author":"AV Goldberg","year":"1995","unstructured":"Goldberg, A. V., & Kennedy, R. (1995). An efficient cost scaling algorithm for the assignment problem. Mathematics Programs, 71(2), 153\u2013177.","journal-title":"Mathematics Programs"},{"key":"9351_CR17","unstructured":"Golfarelli, M., Maio, D., & Rizzi, S. (1997). Multi-agent path planning based on task-swap negotiation (pp. 69\u201382). In Proceedings of the UK Planning and Scheduling Special Interest Group, Workshop."},{"key":"9351_CR18","doi-asserted-by":"crossref","unstructured":"Koenig, S., Keskinocak, P., & Tovey, C. A. (2010). Progress on agent coordination with cooperative auctions. In Proceedings of the AAAI.","DOI":"10.1609\/aaai.v24i1.7764"},{"key":"9351_CR19","doi-asserted-by":"crossref","first-page":"83","DOI":"10.1002\/nav.3800020109","volume":"2","author":"HW Kuhn","year":"1955","unstructured":"Kuhn, H. W. (1955). The Hungarian method for the assignment problem. Naval Research Logistic Quarterly, 2, 83\u201397.","journal-title":"Naval Research Logistic Quarterly"},{"key":"9351_CR20","unstructured":"Lagoudakis, M. G., Markakis, E., Kempe, D., Keskinocak, P., Kleywegt, A., Koenig, S., et al. (2005). Auction-based multi-robot routing. In Robotics: Science and Systems. Cambridge: MIT Press."},{"issue":"7","key":"9351_CR21","doi-asserted-by":"crossref","first-page":"936","DOI":"10.1177\/0278364911404579","volume":"30","author":"L Liu","year":"2011","unstructured":"Liu, L., & Shell, D. (2011). Assessing optimal assignment under uncertainty: An interval-based algorithm. International Journal of Robotics Research, 30(7), 936\u2013953.","journal-title":"International Journal of Robotics Research"},{"key":"9351_CR22","doi-asserted-by":"crossref","unstructured":"Liu, L., & Shell, D. (2012a). A distributable and computation-flexible assignment algorithm: From local task swapping to global optimality. In Proceedings of Robotics: Science and Systems, Sydney, Australia.","DOI":"10.15607\/RSS.2012.VIII.033"},{"issue":"3","key":"9351_CR23","doi-asserted-by":"crossref","first-page":"291","DOI":"10.1007\/s10514-012-9303-2","volume":"33","author":"L Liu","year":"2012","unstructured":"Liu, L., & Shell, D. (2012b). Large-scale multi-robot task allocation via dynamic partitioning and distribution. Autonomous Robots, 33(3), 291\u2013307.","journal-title":"Autonomous Robots"},{"key":"9351_CR24","doi-asserted-by":"crossref","unstructured":"Nanjanath, M., & Gini, M. (2006). Dynamic task allocation for robots via auctions (pp. 2781\u20132786). In Proceedings of the ICRA.","DOI":"10.1109\/ROBOT.2006.1642122"},{"key":"9351_CR25","volume-title":"Handbook of robotics chapter 40","author":"LE Parker","year":"2008","unstructured":"Parker, L. E. (2008). Multiple mobile robot systems. In B. Siciliano & O. Khatib (Eds.), Handbook of robotics chapter 40. Berlin: Springer."},{"key":"9351_CR26","unstructured":"Sandholm, T. (1998). Contract types for satisficing task allocation: I Theoretical results (pp. 68\u201375). In Proceedings of the AAAI Spring Symposium: Satisficing Models."},{"key":"9351_CR27","doi-asserted-by":"crossref","unstructured":"Sariel, S., & Balch, T. (2006). A distributed multi-robot cooperation framework for real time task achievement. In Proceedings of Distributed Autonomous Robotic Systems.","DOI":"10.1007\/4-431-35881-1_19"},{"key":"9351_CR28","doi-asserted-by":"crossref","unstructured":"Stone, P., Kaminka, G. A., Kraus, S., & Rosenschein, J. S. (2010). Ad Hoc autonomous agent teams: Collaboration without pre-coordination. In Proceedings of the AAAI.","DOI":"10.1609\/aaai.v24i1.7529"},{"key":"9351_CR29","unstructured":"Thomas, L., Rachid, A., & Simon, L. (2004). A distributed tasks allocation scheme in multi-UAV context (pp. 3622\u20133627). In Proceedings of the ICRA."},{"key":"9351_CR30","doi-asserted-by":"crossref","unstructured":"Wawerla, J., & Vaughan, R. T. (2009). Robot task switching under diminishing returns (pp. 5033\u20135038). In Proceedings of the 2009 IEEE\/RSJ international conference on Intelligent robots and systems, IROS\u201909.","DOI":"10.1109\/IROS.2009.5354126"},{"key":"9351_CR31","doi-asserted-by":"crossref","unstructured":"Zavlanos, M. M., Spesivtsev, L., & Pappas, G. J. (2008). A distributed auction algorithm for the assignment problem. In Proceedings of the CDC.","DOI":"10.1109\/CDC.2008.4739098"},{"key":"9351_CR32","unstructured":"Zheng, X., & Koenig, S. (2009). K-swaps: cooperative negotiation for solving task-allocation problems (pp. 373\u2013378). In Proceedings of the International Joint Conferences on Artificial Intelligence (IJCAI)."},{"issue":"3","key":"9351_CR33","first-page":"73","volume":"17","author":"S Zilberstein","year":"1996","unstructured":"Zilberstein, S. (1996). Using anytime algorithms in intelligent systems. AI Magazine, 17(3), 73\u201383.","journal-title":"AI Magazine"}],"container-title":["Autonomous Robots"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10514-013-9351-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10514-013-9351-2\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10514-013-9351-2","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,7,2]],"date-time":"2023-07-02T20:33:59Z","timestamp":1688330039000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10514-013-9351-2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,7,3]]},"references-count":33,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2013,11]]}},"alternative-id":["9351"],"URL":"https:\/\/doi.org\/10.1007\/s10514-013-9351-2","relation":{},"ISSN":["0929-5593","1573-7527"],"issn-type":[{"value":"0929-5593","type":"print"},{"value":"1573-7527","type":"electronic"}],"subject":[],"published":{"date-parts":[[2013,7,3]]}}}