{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,20]],"date-time":"2026-06-20T16:35:52Z","timestamp":1781973352114,"version":"3.54.5"},"reference-count":53,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2021,8,2]],"date-time":"2021-08-02T00:00:00Z","timestamp":1627862400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,8,2]],"date-time":"2021-08-02T00:00:00Z","timestamp":1627862400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/100000006","name":"Office of Naval Research","doi-asserted-by":"crossref","award":["GR10006659"],"award-info":[{"award-number":["GR10006659"]}],"id":[{"id":"10.13039\/100000006","id-type":"DOI","asserted-by":"crossref"}]},{"name":"Lockheed Martin Corporation","award":["GR00000509"],"award-info":[{"award-number":["GR00000509"]}]}],"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-09997-2","type":"journal-article","created":{"date-parts":[[2021,8,2]],"date-time":"2021-08-02T10:03:04Z","timestamp":1627898584000},"page":"249-268","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":52,"title":["Heterogeneous graph attention networks for scalable multi-robot scheduling with temporospatial constraints"],"prefix":"10.1007","volume":"46","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-6364-5074","authenticated-orcid":false,"given":"Zheyuan","family":"Wang","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Chen","family":"Liu","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Matthew","family":"Gombolay","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2021,8,2]]},"reference":[{"issue":"1","key":"9997_CR1","doi-asserted-by":"publisher","first-page":"238","DOI":"10.1007\/BF01386316","volume":"4","author":"JF Benders","year":"1962","unstructured":"Benders, J. F. (1962). Partitioning procedures for solving mixed-variables programming problems. Numerische Mathematik, 4(1), 238\u2013252.","journal-title":"Numerische Mathematik"},{"key":"9997_CR2","doi-asserted-by":"crossref","unstructured":"Bengio, Y., Lodi, A., & Prouvost, A. (2021). Machine learning for combinatorial optimization: A methodological tour d\u2019horizon. European Journal of Operational Research, 290(2), 405\u2013421. https:\/\/doi.org\/10.1016\/j.ejor.2020.07.063.","DOI":"10.1016\/j.ejor.2020.07.063"},{"issue":"16","key":"9997_CR3","doi-asserted-by":"publisher","first-page":"5522","DOI":"10.1080\/00207543.2018.1470695","volume":"56","author":"K Bogner","year":"2018","unstructured":"Bogner, K., Pferschy, U., Unterberger, R., & Zeiner, H. (2018). Optimised scheduling in human\u2013robot collaboration\u2014A use case in the assembly of printed circuit boards. International Journal of Production Research, 56(16), 5522\u20135540.","journal-title":"International Journal of Production Research"},{"key":"9997_CR4","doi-asserted-by":"crossref","unstructured":"Casalino, A., Zanchettin, A. M., Piroddi, L., & Rocco, P. (2021). Optimal scheduling of human\u2013robot collaborative assembly operations with time petri nets. IEEE Transactions on Automation Science and Engineering, 18(1), 70\u201384. https:\/\/doi.org\/10.1109\/TASE.2019.2932150.","DOI":"10.1109\/TASE.2019.2932150"},{"issue":"3","key":"9997_CR5","doi-asserted-by":"publisher","first-page":"333","DOI":"10.1007\/s10951-011-0239-8","volume":"15","author":"E Castro","year":"2012","unstructured":"Castro, E., & Petrovic, S. (2012). Combined mathematical programming and heuristics for a radiotherapy pre-treatment scheduling problem. Journal of Scheduling, 15(3), 333\u2013346.","journal-title":"Journal of Scheduling"},{"issue":"1","key":"9997_CR6","doi-asserted-by":"publisher","first-page":"23","DOI":"10.1016\/j.ejor.2007.10.040","volume":"193","author":"J Chen","year":"2009","unstructured":"Chen, J., & Askin, R. G. (2009). Project selection, scheduling and resource allocation with time dependent returns. European Journal of Operational Research, 193(1), 23\u201334.","journal-title":"European Journal of Operational Research"},{"key":"9997_CR7","doi-asserted-by":"publisher","unstructured":"Choudhury, S., Gupta, J., Kochenderfer, M.J., Sadigh, D., & Bohg, J. (2020). Dynamic multi-robot task allocation under uncertainty and temporal constraints. In Proceedings of Robotics: Science and Systems (RSS). https:\/\/doi.org\/10.15607\/rss.2020.xvi.068.","DOI":"10.15607\/rss.2020.xvi.068"},{"issue":"1\u20133","key":"9997_CR8","doi-asserted-by":"publisher","first-page":"61","DOI":"10.1016\/0004-3702(91)90006-6","volume":"49","author":"R Dechter","year":"1991","unstructured":"Dechter, R., Meiri, I., & Pearl, J. (1991). Temporal constraint networks. Artificial Intelligence, 49(1\u20133), 61\u201395.","journal-title":"Artificial Intelligence"},{"issue":"8","key":"9997_CR9","doi-asserted-by":"publisher","first-page":"2599","DOI":"10.1016\/j.cor.2006.12.019","volume":"35","author":"I Essafi","year":"2008","unstructured":"Essafi, I., Mati, Y., & Dauz\u00e8re-P\u00e9r\u00e8s, S. (2008). A genetic local search algorithm for minimizing total weighted tardiness in the job-shop scheduling problem. Computers & Operations Research, 35(8), 2599\u20132616.","journal-title":"Computers & Operations Research"},{"key":"9997_CR10","doi-asserted-by":"crossref","unstructured":"Flushing, E. F., Gambardella, L. M., & Di\u00a0Caro, G. A. (2017). Simultaneous task allocation, data routing, and transmission scheduling in mobile multi-robot teams. In 2017 IEEE\/RSJ International Conference on Intelligent Robots and Systems (IROS) (pp. 1861\u20131868). IEEE.","DOI":"10.1109\/IROS.2017.8206002"},{"key":"9997_CR11","unstructured":"Fout, A., Byrd, J., Shariat, B., & Ben-Hur, A. (2017) Protein interface prediction using graph convolutional networks. In Advances in neural information processing systems, pp. 6530\u20136539."},{"key":"9997_CR12","doi-asserted-by":"crossref","unstructured":"Gombolay, M., Wilcox, R., & Shah, J. (2013) Fast scheduling of multi-robot teams with temporospatial constraints. In Robotics: Science and system, pp. 49\u201356.","DOI":"10.15607\/RSS.2013.IX.049"},{"issue":"1","key":"9997_CR13","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. J., & Shah, J. A. (2018). Fast scheduling of robot teams performing tasks with temporospatial constraints. IEEE Transactions on Robotics, 34(1), 220\u2013239.","journal-title":"IEEE Transactions on Robotics"},{"key":"9997_CR14","doi-asserted-by":"crossref","unstructured":"Hamaguchi, T., Oiwa, H., Shimbo, M., & Matsumoto, Y. (2017). Knowledge transfer for out-of-knowledge-base entities: A graph neural network approach. arXiv preprint arXiv:1706.05674.","DOI":"10.24963\/ijcai.2017\/250"},{"key":"9997_CR15","unstructured":"Hamilton, W. L., Ying, R., & Leskovec, J. (2018). Inductive representation learning on large graphs. arXiv:1706.02216."},{"issue":"2","key":"9997_CR16","doi-asserted-by":"publisher","first-page":"2146","DOI":"10.1109\/LRA.2020.2970689","volume":"5","author":"SKK Hari","year":"2020","unstructured":"Hari, S. K. K., Nayak, A., & Rathinam, S. (2020). An approximation algorithm for a task allocation, sequencing and scheduling problem involving a human\u2013robot team. IEEE Robotics and Automation Letters, 5(2), 2146\u20132153.","journal-title":"IEEE Robotics and Automation Letters"},{"issue":"1","key":"9997_CR17","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/321992.321993","volume":"24","author":"DB Johnson","year":"1977","unstructured":"Johnson, D. B. (1977). Efficient algorithms for shortest paths in sparse networks. Journal of the ACM (JACM), 24(1), 1\u201313.","journal-title":"Journal of the ACM (JACM)"},{"key":"9997_CR18","unstructured":"Kartal, B., Nunes, E., Godoy, J., & Gini, M. (2016). Monte Carlo tree search with branch and bound for multi-robot task allocation. In The IJCAI-16 workshop on autonomous mobile service robots, Vol. 33."},{"key":"9997_CR19","unstructured":"Khalil, E., Dai, H., Zhang, Y., Dilkina, B., & Song, L. (2017). Learning combinatorial optimization algorithms over graphs. In Advances in neural information processing systems, pp. 6348\u20136358."},{"key":"9997_CR20","unstructured":"Kingma, D. P., & Ba, J. (2014). Adam: A method for stochastic optimization. arXiv preprint arXiv:1412.6980."},{"key":"9997_CR21","unstructured":"Kool, W., van Hoof, H., & Welling, M. (2019). Attention, learn to solve routing problems! In International conference on learning representations."},{"issue":"12","key":"9997_CR22","doi-asserted-by":"publisher","first-page":"1495","DOI":"10.1177\/0278364913496484","volume":"32","author":"GA Korsah","year":"2013","unstructured":"Korsah, G. A., Stentz, A., & Dias, M. B. (2013). A comprehensive taxonomy for multi-robot task allocation. The International Journal of Robotics Research, 32(12), 1495\u20131512.","journal-title":"The International Journal of Robotics Research"},{"issue":"7553","key":"9997_CR23","doi-asserted-by":"publisher","first-page":"436","DOI":"10.1038\/nature14539","volume":"521","author":"Y LeCun","year":"2015","unstructured":"LeCun, Y., Bengio, Y., & Hinton, G. (2015). Deep learning. Nature, 521(7553), 436\u2013444.","journal-title":"Nature"},{"key":"9997_CR24","doi-asserted-by":"crossref","unstructured":"Nikou, A., Boskos, D., Tumova, J., & Dimarogonas, D. V. (2017) Cooperative planning for coupled multi-agent systems under timed temporal specifications. In 2017 American Control Conference (ACC) (pp. 1847\u20131852). IEEE.","DOI":"10.23919\/ACC.2017.7963221"},{"key":"9997_CR25","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., Mitiche, H., & Gini, M. (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"},{"key":"9997_CR26","first-page":"8024","volume":"32","author":"A Paszke","year":"2019","unstructured":"Paszke, A., Gross, S., Massa, F., Lerer, A., Bradbury, J., Chanan, G., et al. (2019). Pytorch: An imperative style, high-performance deep learning library. Advances in Neural Information Processing Systems, 32, 8024\u20138035.","journal-title":"Advances in Neural Information Processing Systems"},{"key":"9997_CR27","doi-asserted-by":"crossref","unstructured":"Pinedo, M. (2012). Scheduling, Vol. 29. Springer.","DOI":"10.1007\/978-1-4614-2361-4"},{"key":"9997_CR28","doi-asserted-by":"crossref","unstructured":"Piot, B., Geist, M., & Pietquin, O. (2014). Boosted bellman residual minimization handling expert demonstrations. In Joint European Conference on machine learning and knowledge discovery in databases (pp. 549\u2013564). Springer.","DOI":"10.1007\/978-3-662-44851-9_35"},{"key":"9997_CR29","first-page":"1655","volume":"7","author":"H Raghavan","year":"2006","unstructured":"Raghavan, H., Madani, O., & Jones, R. (2006). Active learning with feedback on features and instances. Journal of Machine Learning Research, 7, 1655\u20131686.","journal-title":"Journal of Machine Learning Research"},{"key":"9997_CR30","doi-asserted-by":"crossref","unstructured":"Ren, H., & Tang, L. (2009). An improved hybrid milp\/cp algorithm framework for the job-shop scheduling. In 2009 IEEE international conference on automation and logistics (pp. 890\u2013894). IEEE.","DOI":"10.1109\/ICAL.2009.5262795"},{"key":"9997_CR31","doi-asserted-by":"publisher","first-page":"604","DOI":"10.1016\/j.cie.2018.03.039","volume":"125","author":"YR Shiue","year":"2018","unstructured":"Shiue, Y. R., Lee, K. C., & Su, C. T. (2018). Real-time scheduling for a smart factory using a reinforcement learning approach. Computers & Industrial Engineering, 125, 604\u2013614.","journal-title":"Computers & Industrial Engineering"},{"issue":"2","key":"9997_CR32","doi-asserted-by":"publisher","first-page":"161","DOI":"10.1002\/net.3230160205","volume":"16","author":"MM Solomon","year":"1986","unstructured":"Solomon, M. M. (1986). On the worst-case performance of some heuristics for the vehicle routing and scheduling problem with time window constraints. Networks, 16(2), 161\u2013174.","journal-title":"Networks"},{"key":"9997_CR33","doi-asserted-by":"crossref","unstructured":"Solovey, K., Bandyopadhyay, S., Rossi, F., Wolf, M. T., & Pavone, M. (2020). Fast near-optimal heterogeneous task allocation via flow decomposition. arXiv preprint arXiv:201103603.","DOI":"10.1109\/ICRA48506.2021.9560880"},{"key":"9997_CR34","doi-asserted-by":"crossref","unstructured":"Tang, G., & Webb, P. (2019). Human\u2013robot shared workspace in aerospace factories. In Human\u2013robot interaction: Safety, standardization, and benchmarking, pp. 71\u201380.","DOI":"10.1201\/9781315213781-5"},{"key":"9997_CR35","unstructured":"Tsamardinos, I. (2000). Reformulating temporal plans for efficient execution. Master\u2019s thesis, University of Pittsburgh."},{"issue":"1\u20132","key":"9997_CR36","doi-asserted-by":"publisher","first-page":"43","DOI":"10.1016\/S0004-3702(03)00113-9","volume":"151","author":"I Tsamardinos","year":"2003","unstructured":"Tsamardinos, I., & Pollack, M. E. (2003). Efficient solution techniques for disjunctive temporal reasoning problems. Artificial Intelligence, 151(1\u20132), 43\u201389.","journal-title":"Artificial Intelligence"},{"key":"9997_CR37","unstructured":"Veli\u010dkovi\u0107, P., Cucurull, G., Casanova, A., Romero, A., Lio, P., & Bengio, Y. (2017). Graph attention networks. arXiv preprint arXiv:1710.10903."},{"key":"9997_CR38","doi-asserted-by":"publisher","first-page":"103560","DOI":"10.1016\/j.robot.2020.103560","volume":"131","author":"H Wang","year":"2020","unstructured":"Wang, H., Chen, W., & Wang, J. (2020). Coupled task scheduling for heterogeneous multi-robot system of two robot types performing complex-schedule order fulfillment tasks. Robotics and Autonomous Systems, 131, 103560.","journal-title":"Robotics and Autonomous Systems"},{"key":"9997_CR39","unstructured":"Wang, M., Yu, L., Zheng, D., Gan, Q., Gai, Y., Ye, Z., Li, M., Zhou, J., Huang, Q., Ma, C., Huang, Z., Guo, Q., Zhang, H., Lin, H., Zhao, J., Li, J., Smola, A. J., Zhang, Z. (2019a). Deep graph library: Towards efficient and scalable deep learning on graphs. ICLR workshop on representation learning on graphs and manifolds."},{"key":"9997_CR40","doi-asserted-by":"crossref","unstructured":"Wang, X., Ji, H., Shi, C., Wang, B., Ye, Y., Cui, P., Yu, P. S. (2019b). Heterogeneous graph attention network. In The World Wide Web Conference (pp. 2022\u20132032). ACM.","DOI":"10.1145\/3308558.3313562"},{"issue":"5","key":"9997_CR41","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/3326362","volume":"38","author":"Y Wang","year":"2019","unstructured":"Wang, Y., Sun, Y., Liu, Z., Sarma, S. E., Bronstein, M. M., & Solomon, J. M. (2019c). Dynamic graph CNN for learning on point clouds. ACM Transactions on Graphics (TOG), 38(5), 1\u201312.","journal-title":"ACM Transactions on Graphics (TOG)"},{"issue":"1","key":"9997_CR42","doi-asserted-by":"publisher","first-page":"73","DOI":"10.1016\/j.engappai.2004.08.018","volume":"18","author":"YC Wang","year":"2005","unstructured":"Wang, Y. C., & Usher, J. M. (2005). Application of reinforcement learning for agent-based production scheduling. Engineering Applications of Artificial Intelligence, 18(1), 73\u201382.","journal-title":"Engineering Applications of Artificial Intelligence"},{"key":"9997_CR43","unstructured":"Wang, Z., & Gombolay, M. (2019). Learning to dynamically coordinate multi-robot teams in graph attention networks. arXiv preprint arXiv:1912.02059."},{"key":"9997_CR44","doi-asserted-by":"crossref","unstructured":"Wang, Z., & Gombolay, M. (2020). Heterogeneous graph attention networks for scalable multi-robot scheduling with temporospatial constraints. In Robotics: Science and System XVI.","DOI":"10.15607\/RSS.2020.XVI.094"},{"issue":"1","key":"9997_CR45","doi-asserted-by":"publisher","first-page":"26","DOI":"10.1109\/MCS.2019.2949973","volume":"40","author":"S Wilson","year":"2020","unstructured":"Wilson, S., Glotfelter, P., Wang, L., Mayya, S., Notomista, G., Mote, M., et al. (2020). The robotarium: Globally impactful opportunities, challenges, and lessons learned in remote-access, distributed control of multirobot systems. IEEE Control Systems Magazine, 40(1), 26\u201344.","journal-title":"IEEE Control Systems Magazine"},{"issue":"5","key":"9997_CR46","doi-asserted-by":"publisher","first-page":"430","DOI":"10.1016\/j.future.2010.10.009","volume":"27","author":"J Wu","year":"2011","unstructured":"Wu, J., Xu, X., Zhang, P., & Liu, C. (2011). A novel multi-agent reinforcement learning approach for job scheduling in grid computing. Future Generation Computer Systems, 27(5), 430\u2013439.","journal-title":"Future Generation Computer Systems"},{"key":"9997_CR47","doi-asserted-by":"crossref","unstructured":"Wu, Z., Pan, S., Chen, F., Long, G., Zhang, C., & Philip, S. Y. (2021). A comprehensive survey on graph neural networks. IEEE Transactions on Neural Networks and Learning Systems, 32(1), 4\u201324. https:\/\/doi.org\/10.1109\/TNNLS.2020.2978386..","DOI":"10.1109\/TNNLS.2020.2978386"},{"key":"9997_CR48","unstructured":"Xu, K., Hu, W., Leskovec, J., & Jegelka, S. (2019). How powerful are graph neural networks? In International conference on learning representations."},{"key":"9997_CR49","doi-asserted-by":"crossref","unstructured":"Yan, S., Xiong, Y., & Lin, D. (2018). Spatial temporal graph convolutional networks for skeleton-based action recognition. In Proceedings of the AAAI conference on artificial intelligence, Vol. 32, pp. 7444\u20137452.","DOI":"10.1609\/aaai.v32i1.12328"},{"issue":"12","key":"9997_CR50","doi-asserted-by":"publisher","first-page":"399","DOI":"10.5772\/57313","volume":"10","author":"Z Yan","year":"2013","unstructured":"Yan, Z., Jouandeau, N., & Cherif, A. A. (2013). A survey and analysis of multi-robot coordination. International Journal of Advanced Robotic Systems, 10(12), 399.","journal-title":"International Journal of Advanced Robotic Systems"},{"key":"9997_CR51","doi-asserted-by":"crossref","unstructured":"Yang, X., Deng, C., Liu, T., & Tao, D. (2020). Heterogeneous graph attention network for unsupervised multiple-target domain adaptation. IEEE Transactions on Pattern Analysis and Machine Intelligence. https:\/\/doi.org\/10.1109\/TPAMI.2020.3026079.","DOI":"10.1109\/TPAMI.2020.3026079"},{"key":"9997_CR52","doi-asserted-by":"crossref","unstructured":"Zhang, S., Chen, Y., Zhang, J., & Jia, Y. (2020). Real-time adaptive assembly scheduling in human-multi-robot collaboration according to human capability. In 2020 IEEE International Conference on Robotics and Automation (ICRA), pp. 3860\u20133866. IEEE.","DOI":"10.1109\/ICRA40945.2020.9196618"},{"key":"9997_CR53","unstructured":"Zhou, J., Cui, G., Zhang, Z., Yang, C., Liu, Z., Wang, L., Li, C., & Sun, M. (2018). Graph neural networks: A review of methods and applications. arXiv preprint arXiv:1812.08434."}],"container-title":["Autonomous Robots"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10514-021-09997-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10514-021-09997-2\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10514-021-09997-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,1,6]],"date-time":"2023-01-06T04:23:07Z","timestamp":1672978987000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10514-021-09997-2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,8,2]]},"references-count":53,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2022,1]]}},"alternative-id":["9997"],"URL":"https:\/\/doi.org\/10.1007\/s10514-021-09997-2","relation":{},"ISSN":["0929-5593","1573-7527"],"issn-type":[{"value":"0929-5593","type":"print"},{"value":"1573-7527","type":"electronic"}],"subject":[],"published":{"date-parts":[[2021,8,2]]},"assertion":[{"value":"31 January 2021","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"26 June 2021","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"2 August 2021","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"This work was supported in part by the Office of Naval Research under grant GR10006659 and Lockheed Martin Corporation under grant GR00000509.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Funding"}}]}}