{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,10]],"date-time":"2026-04-10T21:02:54Z","timestamp":1775854974359,"version":"3.50.1"},"reference-count":61,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2021,11,6]],"date-time":"2021-11-06T00:00:00Z","timestamp":1636156800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,11,6]],"date-time":"2021-11-06T00:00:00Z","timestamp":1636156800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["1941722"],"award-info":[{"award-number":["1941722"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["849952"],"award-info":[{"award-number":["849952"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100002427","name":"Ford Motor Company","doi-asserted-by":"publisher","id":[{"id":"10.13039\/100002427","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Auton Robot"],"published-print":{"date-parts":[[2022,1]]},"DOI":"10.1007\/s10514-021-10022-9","type":"journal-article","created":{"date-parts":[[2021,11,6]],"date-time":"2021-11-06T10:03:42Z","timestamp":1636193022000},"page":"231-247","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":105,"title":["Dynamic multi-robot task allocation under uncertainty and temporal constraints"],"prefix":"10.1007","volume":"46","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-4829-8806","authenticated-orcid":false,"given":"Shushman","family":"Choudhury","sequence":"first","affiliation":[]},{"given":"Jayesh K.","family":"Gupta","sequence":"additional","affiliation":[]},{"given":"Mykel J.","family":"Kochenderfer","sequence":"additional","affiliation":[]},{"given":"Dorsa","family":"Sadigh","sequence":"additional","affiliation":[]},{"given":"Jeannette","family":"Bohg","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2021,11,6]]},"reference":[{"issue":"1\u20134","key":"10022_CR1","doi-asserted-by":"publisher","first-page":"267","DOI":"10.1023\/B:ANOR.0000004773.66339.df","volume":"124","author":"S Ahmed","year":"2003","unstructured":"Ahmed, S., & Garcia, R. (2003). Dynamic capacity acquisition and assignment under uncertainty. Annals of Operations Research, 124(1\u20134), 267\u2013283.","journal-title":"Annals of Operations Research"},{"issue":"2","key":"10022_CR2","doi-asserted-by":"publisher","first-page":"279","DOI":"10.1016\/j.ijpe.2011.04.020","volume":"132","author":"N Al-Hinai","year":"2011","unstructured":"Al-Hinai, N., & ElMekkawy, T. Y. (2011). Robust and stable flexible job shop scheduling with random machine breakdowns using a hybrid genetic algorithm. International Journal of Production Economics, 132(2), 279\u2013291.","journal-title":"International Journal of Production Economics"},{"issue":"2","key":"10022_CR3","doi-asserted-by":"publisher","first-page":"459","DOI":"10.1137\/S0097539797324874","volume":"29","author":"S Albers","year":"1999","unstructured":"Albers, S. (1999). Better bounds for online scheduling. SIAM Journal on Computing, 29(2), 459\u2013473.","journal-title":"SIAM Journal on Computing"},{"issue":"3","key":"10022_CR4","doi-asserted-by":"publisher","first-page":"462","DOI":"10.1073\/pnas.1611675114","volume":"114","author":"J Alonso-Mora","year":"2017","unstructured":"Alonso-Mora, J., Samaranayake, S., Wallar, A., Frazzoli, E., & Rus, D. (2017). On-demand high-capacity ride-sharing via dynamic trip-vehicle assignment. Proceedings of the National Academy of Sciences, 114(3), 462\u2013467.","journal-title":"Proceedings of the National Academy of Sciences"},{"key":"10022_CR5","unstructured":"Barer, M., Sharon, G., Stern, R., & Felner, A. (2014). Suboptimal variants of the conflict-based search algorithm for the multi-agent pathfinding problem. In European conference on artificial intelligence (ECAI), pp. 961\u2013962."},{"key":"10022_CR6","doi-asserted-by":"crossref","unstructured":"Behrens, J. K., Lange, R., & Mansouri, M. (2019). A constraint programming approach to simultaneous task allocation and motion scheduling for industrial dual-arm manipulation tasks. In IEEE international conference on robotics and automation (ICRA), IEEE, pp. 8705\u20138711.","DOI":"10.1109\/ICRA.2019.8794022"},{"key":"10022_CR7","volume-title":"Dynamic programming and optimal control","author":"DP Bertsekas","year":"2005","unstructured":"Bertsekas, D. P. (2005). Dynamic programming and optimal control. Athena Scientific."},{"issue":"1","key":"10022_CR8","doi-asserted-by":"publisher","first-page":"65","DOI":"10.1137\/141000671","volume":"59","author":"J Bezanson","year":"2017","unstructured":"Bezanson, J., Edelman, A., Karpinski, S., & Shah, V. B. (2017). Julia: A fresh approach to numerical computing. SIAM Review, 59(1), 65\u201398.","journal-title":"SIAM Review"},{"key":"10022_CR9","unstructured":"Boutilier, C. (1996). Planning, learning and coordination in multiagent decision processes. In Conference on theoretical aspects of rationality and knowledge, Morgan Kaufmann Publishers Inc., pp. 195\u2013210."},{"key":"10022_CR10","unstructured":"Boyarski, E., Felner, A., Stern, R., Sharon, G., Tolpin, D., Betzalel, O., & Shimony, S. E. (2015). ICBS: Improved conflict-based search algorithm for multi-agent pathfinding. In International joint conference on artificial intelligence (IJCAI), pp. 740\u2013746."},{"key":"10022_CR11","doi-asserted-by":"crossref","unstructured":"Burkard, R. E., Dell\u2019Amico, M., & Martello, S. (2009). Assignment problems, SIAM.","DOI":"10.1137\/1.9780898717754"},{"key":"10022_CR12","doi-asserted-by":"crossref","unstructured":"Campbell, T., Johnson, L., & How, J. P. (2013). Multiagent allocation of Markov decision process tasks. In American control conference (ACC), IEEE, pp. 2356\u20132361.","DOI":"10.1109\/ACC.2013.6580186"},{"key":"10022_CR13","doi-asserted-by":"crossref","unstructured":"Chaari, T., Chaabane, S., Aissani, N., & Trentesaux, D. (2014). Scheduling under uncertainty: Survey and research directions. In International conference on advanced logistics and transport, ICALT, pp. 229\u2013234.","DOI":"10.1109\/ICAdLT.2014.6866316"},{"issue":"3","key":"10022_CR14","doi-asserted-by":"publisher","first-page":"964","DOI":"10.1016\/j.ejor.2017.01.033","volume":"260","author":"A Che","year":"2017","unstructured":"Che, A., Kats, V., & Levner, E. (2017). An efficient bicriteria algorithm for stable robotic flow shop scheduling. European Journal of Operational Research, 260(3), 964\u2013971.","journal-title":"European Journal of Operational Research"},{"issue":"4","key":"10022_CR15","doi-asserted-by":"publisher","first-page":"411","DOI":"10.1016\/j.orl.2004.08.006","volume":"33","author":"RK Cheung","year":"2005","unstructured":"Cheung, R. K., Hang, D. D., & Shi, N. (2005). A labeling method for dynamic driver-task assignment with uncertain task durations. Operations Research Letters, 33(4), 411\u2013420.","journal-title":"Operations Research Letters"},{"key":"10022_CR16","doi-asserted-by":"crossref","unstructured":"Choudhury, S., Gupta, J. K., Kochenderfer, M. J., Sadigh, D., & Bohg, J. (2020a). Dynamic multi-robot task allocation under uncertainty and temporal constraints. Robotics: Science and Systems Foundation.","DOI":"10.15607\/RSS.2020.XVI.068"},{"key":"10022_CR17","doi-asserted-by":"crossref","unstructured":"Choudhury, S., Solovey, K., Kochenderfer, M. J., & Pavone, M. (2020b). Efficient large-scale multi-drone delivery using transit networks. In IEEE international conference on robotics and automation (ICRA).","DOI":"10.1109\/ICRA40945.2020.9197313"},{"issue":"3","key":"10022_CR18","doi-asserted-by":"publisher","first-page":"153","DOI":"10.1080\/09511929208944524","volume":"5","author":"LK Church","year":"1992","unstructured":"Church, L. K., & Uzsoy, R. (1992). Analysis of periodic and event-driven rescheduling policies in dynamic shops. International Journal of Computer Integrated Manufacturing, 5(3), 153\u2013163.","journal-title":"International Journal of Computer Integrated Manufacturing"},{"key":"10022_CR19","doi-asserted-by":"crossref","unstructured":"Coltin, B., & Veloso, M. M. (2014). Online pickup and delivery planning with transfers for mobile robots. In IEEE international conference on robotics and automation (ICRA), IEEE, pp. 5786\u20135791.","DOI":"10.1109\/ICRA.2014.6907709"},{"issue":"1","key":"10022_CR20","doi-asserted-by":"publisher","first-page":"29","DOI":"10.1007\/s10479-007-0170-8","volume":"153","author":"J Cordeau","year":"2007","unstructured":"Cordeau, J., & Laporte, G. (2007). The dial-a-ride problem: Models and algorithms. Annals of Operations Research, 153(1), 29\u201346.","journal-title":"Annals of Operations Research"},{"issue":"12","key":"10022_CR21","doi-asserted-by":"publisher","first-page":"1497","DOI":"10.1109\/32.58762","volume":"15","author":"ML Dertouzos","year":"1989","unstructured":"Dertouzos, M. L., & Mok, A. K. (1989). Multiprocessor online scheduling of hard-real-time tasks. IEEE Transactions on Software Engineering, 15(12), 1497\u20131506.","journal-title":"IEEE Transactions on Software Engineering"},{"issue":"26","key":"10022_CR22","first-page":"1","volume":"18","author":"M Egorov","year":"2017","unstructured":"Egorov, M., Sunberg, Z. N., Balaban, E., Wheeler, T. A., Gupta, J. K., & Kochenderfer, M. J. (2017). POMDPs.jl: A framework for sequential decision making under uncertainty. Journal of Machine Learning Research (JMLR), 18(26), 1\u20135.","journal-title":"Journal of Machine Learning Research (JMLR)"},{"key":"10022_CR23","unstructured":"Felner, A., Stern, R., Shimony, S. E., Boyarski, E., Goldenberg, M., Sharon, G., Sturtevant, N., Wagner, G., & Surynek, P. (2017). Search-based optimal solvers for the multi-agent pathfinding problem: Summary and challenges. In Symposium on combinatorial search."},{"key":"10022_CR24","doi-asserted-by":"publisher","first-page":"113","DOI":"10.1016\/j.cie.2019.01.036","volume":"129","author":"JM Framinan","year":"2019","unstructured":"Framinan, J. M., Fernandez-Viagas, V., & Perez-Gonzalez, P. (2019). Using real-time information to reschedule jobs in a flowshop with variable processing times. Computers & Industrial Engineering, 129, 113\u2013125.","journal-title":"Computers & Industrial Engineering"},{"issue":"4","key":"10022_CR25","doi-asserted-by":"publisher","first-page":"397","DOI":"10.1137\/0204035","volume":"4","author":"MR Garey","year":"1975","unstructured":"Garey, M. R., & Johnson, D. S. (1975). Complexity results for multiprocessor scheduling under resource constraints. SIAM Journal on Computing, 4(4), 397\u2013411.","journal-title":"SIAM Journal on Computing"},{"issue":"9","key":"10022_CR26","doi-asserted-by":"publisher","first-page":"939","DOI":"10.1177\/0278364904045564","volume":"23","author":"BP Gerkey","year":"2004","unstructured":"Gerkey, B. P., & Mataric, 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":"10022_CR27","doi-asserted-by":"crossref","unstructured":"Gini, M. L. (2017). Multi-robot allocation of tasks with temporal and ordering constraints. In AAAI conference on artificial intelligence (AAAI), pp. 4863\u20134869.","DOI":"10.1609\/aaai.v31i1.11145"},{"issue":"1","key":"10022_CR28","doi-asserted-by":"publisher","first-page":"220","DOI":"10.1109\/TRO.2018.2795034","volume":"34","author":"MC Gombolay","year":"2018","unstructured":"Gombolay, M. C., Wilcox, R., & Shah, J. A. (2018). Fast scheduling of robot teams performing tasks with temporospatial constraints. IEEE Transactions on Robotics (TRO), 34(1), 220\u2013239.","journal-title":"IEEE Transactions on Robotics (TRO)"},{"issue":"4","key":"10022_CR29","doi-asserted-by":"publisher","first-page":"399","DOI":"10.5267\/j.ijiec.2017.2.001","volume":"8","author":"E Gonz\u00e1lez-Neira","year":"2017","unstructured":"Gonz\u00e1lez-Neira, E., Montoya-Torres, J., & Barrera, D. (2017). Flow-shop scheduling problem under uncertainties: Review and trends. International Journal of Industrial Engineering Computations, 8(4), 399\u2013426.","journal-title":"International Journal of Industrial Engineering Computations"},{"key":"10022_CR30","unstructured":"H\u00f6nig, W., Kiesel, S., Tinka, A., Durham, J., & Ayanian, N. (2018). Conflict-based search with optimal task assignment. In International conference on autonomous agents and multiagent systems (AAMAS)."},{"key":"10022_CR31","doi-asserted-by":"publisher","first-page":"278","DOI":"10.1016\/j.trc.2018.05.003","volume":"92","author":"M Hyland","year":"2018","unstructured":"Hyland, M., & Mahmassani, H. S. (2018). Dynamic autonomous vehicle fleet operations: Optimization-based strategies to assign AVs to immediate traveler demand requests. Transportation Research Part C: Emerging Technologies, 92, 278\u2013297.","journal-title":"Transportation Research Part C: Emerging Technologies"},{"issue":"1","key":"10022_CR32","doi-asserted-by":"publisher","first-page":"41","DOI":"10.1109\/LRA.2016.2535907","volume":"2","author":"L Johannsmeier","year":"2016","unstructured":"Johannsmeier, L., & Haddadin, S. (2016). A hierarchical human\u2013robot interaction-planning framework for task allocation in collaborative industrial assembly processes. IEEE Robotics and Automation Letters, 2(1), 41\u201348.","journal-title":"IEEE Robotics and Automation Letters"},{"key":"10022_CR33","doi-asserted-by":"crossref","unstructured":"Kartal, B., Nunes, E., Godoy, J., & Gini, M. L. (2016). Monte Carlo tree search for multi-robot task allocation. In AAAI conference on artificial intelligence (AAAI), pp. 4222\u20134223.","DOI":"10.1609\/aaai.v30i1.9945"},{"key":"10022_CR34","doi-asserted-by":"publisher","DOI":"10.7551\/mitpress\/10187.001.0001","volume-title":"Decision making under uncertainty: Theory and application","author":"MJ Kochenderfer","year":"2015","unstructured":"Kochenderfer, M. J. (2015). Decision making under uncertainty: Theory and application. MIT Press."},{"key":"10022_CR35","first-page":"1124","volume":"3","author":"JR Kok","year":"2003","unstructured":"Kok, J. R., Spaan, M. T., & Vlassis, N. (2003). Multi-robot decision making using coordination graphs. International Conference on Advanced Robotics (ICAR), 3, 1124\u20131129.","journal-title":"International Conference on Advanced Robotics (ICAR)"},{"key":"10022_CR36","unstructured":"Lanctot, M., Zambaldi, V., Gruslys, A., Lazaridou, A., Tuyls, K., P\u00e9rolat, J., Silver, D., & Graepel, T. (2017). A unified game-theoretic approach to multiagent reinforcement learning. In Advances in neural information processing systems, pp. 4190\u20134203."},{"issue":"3","key":"10022_CR37","doi-asserted-by":"publisher","first-page":"559","DOI":"10.1016\/S0377-2217(02)00363-6","volume":"148","author":"HC Lau","year":"2003","unstructured":"Lau, H. C., Sim, M., & Teo, K. M. (2003a). Vehicle routing problem with time windows and a limited number of vehicles. European Journal of Operational Research, 148(3), 559\u2013569.","journal-title":"European Journal of Operational Research"},{"issue":"3","key":"10022_CR38","doi-asserted-by":"publisher","first-page":"559","DOI":"10.1016\/S0377-2217(02)00363-6","volume":"148","author":"HC Lau","year":"2003","unstructured":"Lau, H. C., Sim, M., & Teo, K. M. (2003b). Vehicle routing problem with time windows and a limited number of vehicles. European Journal of Operational Research, 148(3), 559\u2013569.","journal-title":"European Journal of Operational Research"},{"key":"10022_CR39","doi-asserted-by":"publisher","DOI":"10.1007\/BFb0036069","volume-title":"Robot motion planning and control","author":"JP Laumond","year":"1998","unstructured":"Laumond, J. P., et al. (1998). Robot motion planning and control (Vol. 229). Springer."},{"key":"10022_CR40","doi-asserted-by":"crossref","unstructured":"Lenstra, J. K., Kan, A. R., & Brucker, P. (1977). Complexity of machine scheduling problems. In Annals of discrete mathematics, Vol.\u00a01, Elsevier, pp. 343\u2013362.","DOI":"10.1016\/S0167-5060(08)70743-X"},{"issue":"3","key":"10022_CR41","doi-asserted-by":"publisher","first-page":"225","DOI":"10.1177\/0278364906063426","volume":"25","author":"K Lerman","year":"2006","unstructured":"Lerman, K., Jones, C. V., Galstyan, A., & Mataric, M. J. (2006). Analysis of dynamic task allocation in multi-robot systems. International Journal of Robotics Researh (IJRR), 25(3), 225\u2013241.","journal-title":"International Journal of Robotics Researh (IJRR)"},{"issue":"6\u20137","key":"10022_CR42","doi-asserted-by":"publisher","first-page":"1069","DOI":"10.1016\/j.compchemeng.2003.09.020","volume":"28","author":"X Lin","year":"2004","unstructured":"Lin, X., Janak, S. L., & Floudas, C. A. (2004). A new robust optimization approach for scheduling under uncertainty: I\u2014Bounded uncertainty. Computers & Chemical Engineering, 28(6\u20137), 1069\u20131085.","journal-title":"Computers & Chemical Engineering"},{"key":"10022_CR43","doi-asserted-by":"crossref","unstructured":"Littman, M. L. (1994). Markov games as a framework for multi-agent reinforcement learning. In Machine learning, Elsevier, pp. 157\u2013163.","DOI":"10.1016\/B978-1-55860-335-6.50027-1"},{"issue":"7","key":"10022_CR44","doi-asserted-by":"publisher","first-page":"936","DOI":"10.1177\/0278364911404579","volume":"30","author":"L Liu","year":"2011","unstructured":"Liu, L., & Shell, D. A. (2011). Assessing optimal assignment under uncertainty: An interval-based algorithm. The International Journal of Robotics Research, 30(7), 936\u2013953.","journal-title":"The International Journal of Robotics Research"},{"issue":"2\u20133","key":"10022_CR45","doi-asserted-by":"publisher","first-page":"255","DOI":"10.1023\/A:1022291921717","volume":"14","author":"MJ Mataric","year":"2003","unstructured":"Mataric, M. J., Sukhatme, G. S., & \u00d8stergaard, E. H. (2003). Multi-robot task allocation in uncertain environments. Autonomous Robots, 14(2\u20133), 255\u2013263.","journal-title":"Autonomous Robots"},{"issue":"1","key":"10022_CR46","doi-asserted-by":"publisher","first-page":"32","DOI":"10.1137\/0105003","volume":"5","author":"J Munkres","year":"1957","unstructured":"Munkres, J. (1957). Algorithms for the assignment and transportation problems. Journal of the Society for Industrial and Applied Mathematics, 5(1), 32\u201338.","journal-title":"Journal of the Society for Industrial and Applied Mathematics"},{"key":"10022_CR47","doi-asserted-by":"publisher","first-page":"55","DOI":"10.1016\/j.robot.2016.10.008","volume":"90","author":"E Nunes","year":"2017","unstructured":"Nunes, E., Manner, M. D., Mitiche, H., & Gini, M. L. (2017). A taxonomy for task allocation problems with temporal and ordering constraints. Robotics and Autonomous Systems, 90, 55\u201370.","journal-title":"Robotics and Autonomous Systems"},{"issue":"18","key":"10022_CR48","doi-asserted-by":"publisher","first-page":"4217","DOI":"10.1080\/002075499189745","volume":"37","author":"R O\u2019onovan","year":"1999","unstructured":"O\u2019onovan, R., Uzsoy, R., & McKay, K. N. (1999). Predictable scheduling of a single machine with breakdowns and sensitive jobs. International Journal of Production Research, 37(18), 4217\u20134233.","journal-title":"International Journal of Production Research"},{"key":"10022_CR49","doi-asserted-by":"crossref","unstructured":"P\u00e9ret, L., & Garcia, F. (2013). Online resolution techniques. In Markov decision processes in artificial intelligence, pp. 153\u2013184.","DOI":"10.1002\/9781118557426.ch6"},{"key":"10022_CR50","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4614-2361-4","volume-title":"Scheduling","author":"M Pinedo","year":"2012","unstructured":"Pinedo, M. (2012). Scheduling (Vol. 29). Springer."},{"issue":"1","key":"10022_CR51","doi-asserted-by":"publisher","first-page":"84","DOI":"10.1016\/j.jmsy.2013.03.004","volume":"33","author":"D Rahmani","year":"2014","unstructured":"Rahmani, D., & Heydari, M. (2014). Robust and stable flow shop scheduling with unexpected arrivals of new jobs and uncertain processing times. Journal of Manufacturing Systems, 33(1), 84\u201392.","journal-title":"Journal of Manufacturing Systems"},{"key":"10022_CR52","doi-asserted-by":"crossref","unstructured":"Raman, V., Donz\u00e9, A., Sadigh, D., Murray, R. M., & Seshia, S. A. (2015). Reactive synthesis from signal temporal logic specifications. In International conference on hybrid systems: Computation and control, pp. 239\u2013248.","DOI":"10.1145\/2728606.2728628"},{"key":"10022_CR53","doi-asserted-by":"crossref","unstructured":"Sharon, G., Stern, R., Felner, A., & Sturtevant, N. (2012). Conflict-based search for optimal multi-agent path finding. In AAAI conference on artificial intelligence (AAAI).","DOI":"10.1016\/j.artint.2012.11.006"},{"key":"10022_CR54","volume-title":"Reinforcement learning: An introduction","author":"RS Sutton","year":"2018","unstructured":"Sutton, R. S., & Barto, A. G. (2018). Reinforcement learning: An introduction. MIT press."},{"issue":"2","key":"10022_CR55","doi-asserted-by":"publisher","first-page":"124","DOI":"10.1080\/09537289408919480","volume":"5","author":"E Szelke","year":"1994","unstructured":"Szelke, E., & Kerr, R. M. (1994). Knowledge-based reactive scheduling. Production Planning & Control, 5(2), 124\u2013145.","journal-title":"Production Planning & Control"},{"issue":"9","key":"10022_CR56","doi-asserted-by":"publisher","first-page":"1514","DOI":"10.1093\/comjnl\/bxq063","volume":"54","author":"S Timotheou","year":"2010","unstructured":"Timotheou, S. (2010). Asset-task assignment algorithms in the presence of execution uncertainty. The Computer Journal, 54(9), 1514\u20131525.","journal-title":"The Computer Journal"},{"key":"10022_CR57","doi-asserted-by":"crossref","unstructured":"Timotheou, S. (2011). Network flow approaches for an asset-task assignment problem with execution uncertainty. In Computer and information sciences, Springer, pp. 33\u201338.","DOI":"10.1007\/978-90-481-9794-1_7"},{"key":"10022_CR58","doi-asserted-by":"publisher","first-page":"881","DOI":"10.1613\/jair.5507","volume":"60","author":"T Vodopivec","year":"2017","unstructured":"Vodopivec, T., Samothrakis, S., & Ster, B. (2017). On Monte Carlo tree search and reinforcement learning. Journal of Artificial Intelligence Research, 60, 881\u2013936.","journal-title":"Journal of Artificial Intelligence Research"},{"issue":"3","key":"10022_CR59","doi-asserted-by":"publisher","first-page":"4509","DOI":"10.1109\/LRA.2020.3002198","volume":"5","author":"Z Wang","year":"2020","unstructured":"Wang, Z., & Gombolay, M. (2020). Learning scheduling policies for multi-robot coordination with graph attention networks. IEEE Robotics and Automation Letters, 5(3), 4509\u20134516.","journal-title":"IEEE Robotics and Automation Letters"},{"key":"10022_CR60","doi-asserted-by":"crossref","unstructured":"Yan, Z., Jouandeau, N., & Ch\u00e9rif, A. A. (2012). Multi-robot heuristic goods transportation. In IEEE international conference on intelligent systems, pp. 409\u2013414.","DOI":"10.1109\/IS.2012.6335251"},{"key":"10022_CR61","unstructured":"Zhang, C., Song, W., Cao, Z., Zhang, J., Tan, P. S., & Chi, X. (2020). Learning to dispatch for job shop scheduling via deep reinforcement learning. In Advances in neural information processing systems (NIPS), Vol. 33."}],"container-title":["Autonomous Robots"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10514-021-10022-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10514-021-10022-9\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10514-021-10022-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,1,14]],"date-time":"2023-01-14T15:53:19Z","timestamp":1673711599000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10514-021-10022-9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,11,6]]},"references-count":61,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2022,1]]}},"alternative-id":["10022"],"URL":"https:\/\/doi.org\/10.1007\/s10514-021-10022-9","relation":{},"ISSN":["0929-5593","1573-7527"],"issn-type":[{"value":"0929-5593","type":"print"},{"value":"1573-7527","type":"electronic"}],"subject":[],"published":{"date-parts":[[2021,11,6]]},"assertion":[{"value":"14 January 2021","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"27 September 2021","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"6 November 2021","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}