{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,4]],"date-time":"2026-04-04T01:22:38Z","timestamp":1775265758444,"version":"3.50.1"},"reference-count":51,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2018,11,7]],"date-time":"2018-11-07T00:00:00Z","timestamp":1541548800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2018,11,7]],"date-time":"2018-11-07T00:00:00Z","timestamp":1541548800000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/100000104","name":"National Aeronautics and Space Administration","doi-asserted-by":"crossref","award":["NNX14AI10G"],"award-info":[{"award-number":["NNX14AI10G"]}],"id":[{"id":"10.13039\/100000104","id-type":"DOI","asserted-by":"crossref"}]},{"DOI":"10.13039\/100000006","name":"Office of Naval Research","doi-asserted-by":"crossref","award":["N00014-17-1-2581"],"award-info":[{"award-number":["N00014-17-1-2581"]}],"id":[{"id":"10.13039\/100000006","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Auton Robot"],"published-print":{"date-parts":[[2019,3]]},"DOI":"10.1007\/s10514-018-9811-9","type":"journal-article","created":{"date-parts":[[2018,11,7]],"date-time":"2018-11-07T08:38:28Z","timestamp":1541579908000},"page":"789-811","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":16,"title":["Real-time distributed non-myopic task selection for heterogeneous robotic teams"],"prefix":"10.1007","volume":"43","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-6283-4332","authenticated-orcid":false,"given":"Andrew J.","family":"Smith","sequence":"first","affiliation":[]},{"given":"Graeme","family":"Best","sequence":"additional","affiliation":[]},{"given":"Javier","family":"Yu","sequence":"additional","affiliation":[]},{"given":"Geoffrey A.","family":"Hollinger","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2018,11,7]]},"reference":[{"issue":"4","key":"9811_CR1","doi-asserted-by":"publisher","first-page":"1054","DOI":"10.2307\/1427934","volume":"27","author":"R Agrawal","year":"1995","unstructured":"Agrawal, R. (1995). Sample mean based index policies by O(log n) regret for the multi-armed bandit problem. Advances in Applied Probability, 27(4), 1054\u20131078.","journal-title":"Advances in Applied Probability"},{"issue":"14","key":"9811_CR2","doi-asserted-by":"publisher","first-page":"1760","DOI":"10.1177\/0278364916679611","volume":"35","author":"C Amato","year":"2016","unstructured":"Amato, C., Konidaris, G., Anders, A., Cruz, G., How, J. P., & Kaelbling, L. P. (2016). Policy search for multi-robot coordination under uncertainty. International Journal of Robotics Research, 35(14), 1760\u20131778.","journal-title":"International Journal of Robotics Research"},{"key":"9811_CR3","unstructured":"Arkin, R. C., & Balch, T. (1998). Cooperative multiagent robotic systems. In Artificial intelligence and mobile robots."},{"issue":"2","key":"9811_CR4","doi-asserted-by":"publisher","first-page":"12","DOI":"10.1109\/MRA.2017.2691138","volume":"24","author":"N Ayanian","year":"2017","unstructured":"Ayanian, N., Fitch, R., Franchi, A., & Sabattini, L. (2017). Multirobot systems. IEEE Robotics & Automation Magazine, 24(2), 12\u201316.","journal-title":"IEEE Robotics & Automation Magazine"},{"key":"9811_CR5","doi-asserted-by":"crossref","unstructured":"Beck, Z., Teacy, L., Rogers, A., & Jennings, N. R. (2016). Online planning for collaborative search and rescue by heterogeneous robot teams. In Proceedings of the international conference on autonomous agents & multiagent systems (pp. 1024\u20131033).","DOI":"10.65109\/BMUM1634"},{"issue":"3","key":"9811_CR6","doi-asserted-by":"publisher","first-page":"209","DOI":"10.1016\/j.omega.2004.10.004","volume":"34","author":"T Bektas","year":"2006","unstructured":"Bektas, T. (2006). The multiple traveling salesman problem: An overview of formulations and solution procedures. Omega, 34(3), 209\u2013219.","journal-title":"Omega"},{"key":"9811_CR7","doi-asserted-by":"publisher","unstructured":"Best, G., Cliff, O., Patten, T., Mettu, R. R., & Fitch, R. (2018). Dec-MCTS: Decentralized planning for multi-robot active perception. International Journal of Robotics Research. https:\/\/doi.org\/10.1177\/0278364918755924 .","DOI":"10.1177\/0278364918755924"},{"key":"9811_CR8","doi-asserted-by":"crossref","unstructured":"Best, G., Forrai, M., Mettu, R. R., & Fitch, R. (2018). Planning-aware communication for decentralised multi-robot coordination. In Proceedings of the IEEE International Conference on Robotics and Automation.","DOI":"10.1109\/ICRA.2018.8460617"},{"key":"9811_CR9","doi-asserted-by":"crossref","unstructured":"Best, G., Huang, S., & Fitch, R. (2018). Decentralised mission monitoring with spatiotemporal optimal stopping. In Proceedings of the IEEE\/RSJ international conference on intelligent robots and systems.","DOI":"10.1109\/IROS.2018.8593663"},{"issue":"4","key":"9811_CR10","doi-asserted-by":"publisher","first-page":"715","DOI":"10.1007\/s10514-017-9691-4","volume":"42","author":"G Best","year":"2018","unstructured":"Best, G., Faigl, J., & Fitch, R. (2018). Online planning for multi-robot active perception with self-organising maps. Autonomous Robots, 42(4), 715\u2013738.","journal-title":"Autonomous Robots"},{"key":"9811_CR11","volume-title":"Solving time-dependent planning problems","author":"M Boddy","year":"1989","unstructured":"Boddy, M., & Dean, T. L. (1989). Solving time-dependent planning problems. Providence: Department of Computer Science, Brown University."},{"issue":"1","key":"9811_CR12","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1109\/TCIAIG.2012.2186810","volume":"4","author":"CB Browne","year":"2012","unstructured":"Browne, C. B., Powley, E., Whitehouse, D., Lucas, S. M., Cowling, P. I., Rohlfshagen, P., et al. (2012). A survey of Monte Carlo tree search methods. IEEE Transactions on Computational Intelligence and AI in Games, 4(1), 1\u201343.","journal-title":"IEEE Transactions on Computational Intelligence and AI in Games"},{"issue":"1","key":"9811_CR13","doi-asserted-by":"publisher","first-page":"126","DOI":"10.1287\/opre.1040.0145","volume":"53","author":"HS Chang","year":"2005","unstructured":"Chang, H. S., Fu, M. C., Hu, J., & Marcus, S. I. (2005). An adaptive sampling algorithm for solving Markov decision processes. Operations Research, 53(1), 126\u2013139.","journal-title":"Operations Research"},{"issue":"4","key":"9811_CR14","doi-asserted-by":"publisher","first-page":"912","DOI":"10.1109\/TRO.2009.2022423","volume":"25","author":"H Choi","year":"2009","unstructured":"Choi, H., Brunet, L., & How, J. P. (2009). Consensus-based decentralized auctions for robust task allocation. IEEE Transactions on Robotics, 25(4), 912\u2013926.","journal-title":"IEEE Transactions on Robotics"},{"issue":"4","key":"9811_CR15","doi-asserted-by":"publisher","first-page":"932","DOI":"10.1109\/TRO.2017.2693377","volume":"33","author":"S Chopra","year":"2017","unstructured":"Chopra, S., Notarstefano, G., Rice, M., & Egerstedt, M. (2017). Distributed version of the Hungarian method for a multirobot assignment. IEEE Transactions on Robotics, 33(4), 932\u2013947.","journal-title":"IEEE Transactions on Robotics"},{"key":"9811_CR16","doi-asserted-by":"publisher","unstructured":"Corah, M., & Michael, N. (2018). Distributed matroid-constrained submodular maximization for multi-robot exploration: Theory and practice. Autonomous Robots. https:\/\/doi.org\/10.1007\/s10514-018-9778-6 .","DOI":"10.1007\/s10514-018-9778-6"},{"issue":"5","key":"9811_CR17","doi-asserted-by":"publisher","first-page":"1238","DOI":"10.1016\/j.cja.2013.07.009","volume":"26","author":"Q Deng","year":"2013","unstructured":"Deng, Q., Yu, J., & Wang, N. (2013). Cooperative task assignment of multiple heterogeneous unmanned aerial vehicles using a modified genetic algorithm with multi-type genes. Chinese Journal of Aeronautics, 26(5), 1238\u20131250.","journal-title":"Chinese Journal of Aeronautics"},{"key":"9811_CR18","doi-asserted-by":"crossref","unstructured":"Desrosiers, J., Dumas, Y., Solomon, M. M., & Soumis, F. (1995). Chapter 2: Time constrained routing and scheduling. In M. O. Ball, T. L. Magnanti, C. L. Monma, & G. L. Nemhauser (Eds.), Handbooks in operations research and management science (Vol. 8, pp. 35\u2013139). Elsevier","DOI":"10.1016\/S0927-0507(05)80106-9"},{"key":"9811_CR19","unstructured":"DJI. Matrice 100 quadcopter for developers. https:\/\/www.dji.com\/matrice100 ."},{"key":"9811_CR20","unstructured":"Faigl, J., Kulich, M., & Preucil, L. (2012). Goal assignment using distance cost in multi-robot exploration. In: Proceedings of the IEEE International Conference on Intelligent Robots and Systems (pp. 3741\u20133746)."},{"key":"9811_CR21","unstructured":"Fukuda, T., Nakagawa, S., Kawauchi, Y., & Buss, M. (1989). Structure decision for self organising robots based on cell structures. In Proceedings of the IEEE international conference on robotics and automation."},{"key":"9811_CR22","unstructured":"Garivier, A., & Moulines, E. (2011). On upper-confidence bound policies for switching bandit problems. In Proceedings of the international conference on algorithmic learning theory (pp. 174\u2013188). Berlin: Springer."},{"issue":"5","key":"9811_CR23","doi-asserted-by":"publisher","first-page":"758","DOI":"10.1109\/TRA.2002.803462","volume":"18","author":"BP Gerkey","year":"2002","unstructured":"Gerkey, B. P., & Mataric, M. J. (2002). Sold!: Auction methods for multirobot coordination. IEEE Transactions on Robotics and Automation, 18(5), 758\u2013768.","journal-title":"IEEE Transactions on Robotics and Automation"},{"issue":"2","key":"9811_CR24","doi-asserted-by":"publisher","first-page":"100","DOI":"10.1109\/TSSC.1968.300136","volume":"4","author":"PE Hart","year":"1968","unstructured":"Hart, P. E., Nilsson, N. J., & Raphael, B. (1968). A formal basis for the heuristic determination of minimum cost paths. IEEE transactions on Systems Science and Cybernetics, 4(2), 100\u2013107.","journal-title":"IEEE transactions on Systems Science and Cybernetics"},{"key":"9811_CR25","unstructured":"Karp, R.M. (1992). On-line algorithms versus off-line algorithms: How much is it worth to know the future? In IFIP Congress (1) (Vol. 12, pp. 416\u2013429)."},{"key":"9811_CR26","doi-asserted-by":"crossref","unstructured":"Kartal, B., Godoy, J., Karamouzas, I., & Guy, S. J. (2015). Stochastic tree search with useful cycles for patrolling problems. In Proceedings of the IEEE international conference on robotics and automation (ICRA) (pp. 1289\u20131294).","DOI":"10.1109\/ICRA.2015.7139357"},{"key":"9811_CR27","doi-asserted-by":"crossref","unstructured":"Kocsis, L., & Szepesv\u00e1ri, C. (2006). Bandit based Monte-Carlo planning. In Proceedings of the European conference on machine learning (pp. 282\u2013293).","DOI":"10.1007\/11871842_29"},{"key":"9811_CR28","doi-asserted-by":"crossref","unstructured":"Labb\u00e9, M., & Michaud, F. (2014). Online global loop closure detection for large-scale multi-session graph-based SLAM. In Proceedings of the IEEE\/RSJ international conference on intelligent robots and systems (pp. 2661\u20132666).","DOI":"10.1109\/IROS.2014.6942926"},{"issue":"5","key":"9811_CR29","doi-asserted-by":"publisher","first-page":"1230","DOI":"10.1109\/TRO.2016.2596772","volume":"32","author":"X Lan","year":"2016","unstructured":"Lan, X., & Schwager, M. (2016). Rapidly exploring random cycles: Persistent estimation of spatiotemporal fields with multiple sensing robots. IEEE Transactions on Robotics, 32(5), 1230\u20131244.","journal-title":"IEEE Transactions on Robotics"},{"key":"9811_CR30","doi-asserted-by":"crossref","unstructured":"Liu, Y., & Chopra, N. (2009). Controlled synchronization of robotic manipulators in the task space. In Proceedings of the ASME dynamic systems and control conference (pp. 443\u2013450).","DOI":"10.1115\/DSCC2009-2684"},{"issue":"3","key":"9811_CR31","doi-asserted-by":"publisher","first-page":"429","DOI":"10.1007\/s10514-015-9481-9","volume":"39","author":"L Liu","year":"2015","unstructured":"Liu, L., Michael, N., & Shell, D. A. (2015). Communication constrained task allocation with optimized local task swaps. Autonomous Robots, 39(3), 429\u2013444.","journal-title":"Autonomous Robots"},{"issue":"3","key":"9811_CR32","doi-asserted-by":"publisher","first-page":"291","DOI":"10.1007\/s10514-012-9303-2","volume":"33","author":"L Liu","year":"2012","unstructured":"Liu, L., & Shell, D. A. (2012). Large-scale multi-robot task allocation via dynamic partitioning and distribution. Autonomous Robots, 33(3), 291\u2013307.","journal-title":"Autonomous Robots"},{"key":"9811_CR33","doi-asserted-by":"crossref","unstructured":"Luo, L., Chakraborty, N., & Sycara, K. (2012). Competitive analysis of repeated greedy auction algorithm for online multi-robot task assignment. In Proceedings of the IEEE international conference on robotics and automation (pp. 4792\u20134799).","DOI":"10.1109\/ICRA.2012.6225195"},{"issue":"1","key":"9811_CR34","doi-asserted-by":"publisher","first-page":"128","DOI":"10.1109\/TRO.2014.2380593","volume":"31","author":"N Mathew","year":"2015","unstructured":"Mathew, N., Smith, S., & Waslander, S. (2015). Multirobot rendezvous planning for recharging in persistent tasks. IEEE Transactions on Robotics, 31(1), 128\u2013142.","journal-title":"IEEE Transactions on Robotics"},{"key":"9811_CR35","doi-asserted-by":"crossref","unstructured":"Meyer, J., Sendobry, A., Kohlbrecher, S., Klingauf, U., & von Stryk, O. (2012). Comprehensive simulation of quadrotor UAVs using ROS and Gazebo. In Proceedings of the international conference on simulation, modeling and programming for autonomous robots (SIMPAR).","DOI":"10.1007\/978-3-642-34327-8_36"},{"key":"9811_CR36","unstructured":"Mills-Tettey, G. A., Stentz, A., & Dias, M. B. (2007). The dynamic Hungarian algorithm for the assignment problem with changing costs. Technical Report, Carnegie Mellon University."},{"issue":"8","key":"9811_CR37","doi-asserted-by":"publisher","first-page":"669","DOI":"10.1016\/j.trb.2003.09.001","volume":"38","author":"S Mitrovi\u0107-Mini\u0107","year":"2004","unstructured":"Mitrovi\u0107-Mini\u0107, S., Krishnamurti, R., & Laporte, G. (2004). Double-horizon based heuristics for the dynamic pickup and delivery problem with time windows. Transportation Research Part B: Methodological, 38(8), 669\u2013685.","journal-title":"Transportation Research Part B: Methodological"},{"key":"9811_CR38","unstructured":"O. S. R. Foundation. Robot operating system. http:\/\/www.ros.org\/ . Accessed 7 February 2017."},{"key":"9811_CR39","unstructured":"O. S. R. Foundation: Gazebo: Robot simulation made easy. http:\/\/gazebosim.org\/ . Accessed 13 October 2017."},{"issue":"2","key":"9811_CR40","doi-asserted-by":"publisher","first-page":"231","DOI":"10.1177\/0278364917692864","volume":"36","author":"S Omidshafiei","year":"2017","unstructured":"Omidshafiei, S., Agha-Mohammadi, A., Amato, C., Liu, S., How, J. P., & Vian, J. (2017). Decentralized control of multi-robot partially observable Markov decision processes using belief space macro-actions. International Journal of Robotics Research, 36(2), 231\u2013258.","journal-title":"International Journal of Robotics Research"},{"key":"9811_CR41","doi-asserted-by":"crossref","unstructured":"Petersen, K., Kleiner, A., & von Stryk, O. (2013). Fast task-sequence allocation for heterogeneous robot teams with a human in the loop. In Proceedings of the international conference on intelligent robots and systems (pp. 1648\u20131655).","DOI":"10.1109\/IROS.2013.6696570"},{"issue":"4","key":"9811_CR42","doi-asserted-by":"publisher","first-page":"361","DOI":"10.1109\/TCIAIG.2014.2346997","volume":"7","author":"L Schaefers","year":"2015","unstructured":"Schaefers, L., & Platzner, M. (2015). Distributed Monte Carlo tree search: A novel technique and its application to computer Go. IEEE Transactions on Computational Intelligence and AI in Games, 7(4), 361\u2013374.","journal-title":"IEEE Transactions on Computational Intelligence and AI in Games"},{"issue":"1","key":"9811_CR43","doi-asserted-by":"publisher","first-page":"6","DOI":"10.1109\/5.259423","volume":"82","author":"KG Shin","year":"1994","unstructured":"Shin, K. G., & Ramanathan, P. (1994). Real-time computing: A new discipline of computer science and engineering. Proceedings of the IEEE, 82(1), 6\u201324.","journal-title":"Proceedings of the IEEE"},{"key":"9811_CR44","unstructured":"Smith, A. Github\/smithan7. https:\/\/github.com\/smithan7 ."},{"issue":"1","key":"9811_CR45","doi-asserted-by":"publisher","first-page":"20","DOI":"10.1109\/MRA.2010.935795","volume":"17","author":"RN Smith","year":"2010","unstructured":"Smith, R. N., Das, E. C., Heidarsson, H., Pereira, A. M., Arrichiello, F., Cetnic, I., et al. (2010). Usc CINAPS builds bridges. IEEE Robotics & Automation Magazine, 17(1), 20\u201330.","journal-title":"IEEE Robotics & Automation Magazine"},{"issue":"04n05","key":"9811_CR46","doi-asserted-by":"publisher","first-page":"475","DOI":"10.1142\/S0219525909002295","volume":"12","author":"K Tumer","year":"2009","unstructured":"Tumer, K., & Agogino, A. (2009). Multiagent learning for black box system reward functions. Advances in Complex Systems, 12(04n05), 475\u2013492.","journal-title":"Advances in Complex Systems"},{"key":"9811_CR47","unstructured":"Yoshizoe, K., Kishimoto, A., Kaneko, T., Yoshimoto, H., & Ishikawa, Y. (2011). Scalable distributed Monte-Carlo tree search. In Proceedings of the fourth annual symposium on combinatorial search."},{"issue":"5","key":"9811_CR48","doi-asserted-by":"publisher","first-page":"1106","DOI":"10.1109\/TRO.2016.2593450","volume":"32","author":"J Yu","year":"2016","unstructured":"Yu, J., Schwager, M., & Rus, D. (2016). Correlated orienteering problem and its application to persistent monitoring tasks. IEEE Transactions on Robotics, 32(5), 1106\u20131118.","journal-title":"IEEE Transactions on Robotics"},{"key":"9811_CR49","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 IEEE conference on decision and control (pp. 1212\u20131217).","DOI":"10.1109\/CDC.2008.4739098"},{"key":"9811_CR50","unstructured":"Zheng, X., & Koenig, S. (2009). K-swaps: Cooperative negotiation for solving task-allocation problems. In: Proceedings of the international joint conference on artificial intelligence (Vol. 9, pp. 373\u2013378)."},{"key":"9811_CR51","doi-asserted-by":"crossref","unstructured":"Zlot, R., Stentz, A., Dias, M. B., & Thayer, S. (2002). Multi-robot exploration controlled by a market economy. In Proceedings of the IEEE international conference on robotics and automation (Vol. 3, pp. 3016\u20133023).","DOI":"10.1109\/ROBOT.2002.1013690"}],"container-title":["Autonomous Robots"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10514-018-9811-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10514-018-9811-9\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10514-018-9811-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,4,4]],"date-time":"2026-04-04T00:17:25Z","timestamp":1775261845000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10514-018-9811-9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,11,7]]},"references-count":51,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2019,3]]}},"alternative-id":["9811"],"URL":"https:\/\/doi.org\/10.1007\/s10514-018-9811-9","relation":{},"ISSN":["0929-5593","1573-7527"],"issn-type":[{"value":"0929-5593","type":"print"},{"value":"1573-7527","type":"electronic"}],"subject":[],"published":{"date-parts":[[2018,11,7]]},"assertion":[{"value":"13 April 2018","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"6 October 2018","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"7 November 2018","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}