{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,11]],"date-time":"2025-09-11T19:33:25Z","timestamp":1757619205297,"version":"3.44.0"},"publisher-location":"Singapore","reference-count":20,"publisher":"Springer Nature Singapore","isbn-type":[{"type":"print","value":"9789819698172"},{"type":"electronic","value":"9789819698189"}],"license":[{"start":{"date-parts":[[2025,1,1]],"date-time":"2025-01-01T00:00:00Z","timestamp":1735689600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,1,1]],"date-time":"2025-01-01T00:00:00Z","timestamp":1735689600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2025]]},"DOI":"10.1007\/978-981-96-9818-9_38","type":"book-chapter","created":{"date-parts":[[2025,7,19]],"date-time":"2025-07-19T12:24:26Z","timestamp":1752927866000},"page":"449-460","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Improve QMIX from CBS Intervention Guide and Curiosity Mechanism for Multi-Agent Path Finding"],"prefix":"10.1007","author":[{"given":"Bin","family":"Gu","sequence":"first","affiliation":[]},{"given":"Quanjin","family":"Wang","sequence":"additional","affiliation":[]},{"given":"Hanlin","family":"Zhu","sequence":"additional","affiliation":[]},{"given":"Bingqian","family":"Chen","sequence":"additional","affiliation":[]},{"given":"Shuo","family":"Feng","sequence":"additional","affiliation":[]},{"given":"Shupan","family":"Li","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2025,7,20]]},"reference":[{"key":"38_CR1","doi-asserted-by":"crossref","unstructured":"Stern, R., et al.: Multi-agent pathfinding: Definitions, variants, and benchmarks. In: Proceedings of the International Symposium on Combinatorial Search, pp. 151\u2013158 (2019)","DOI":"10.1609\/socs.v10i1.18510"},{"key":"38_CR2","doi-asserted-by":"publisher","first-page":"77","DOI":"10.1007\/s43154-022-00083-8","volume":"3","author":"H Ma","year":"2022","unstructured":"Ma, H.: Graph-based multi-robot path finding and planning. Curr. Robot Rep. 3, 77\u201384 (2022)","journal-title":"Curr. Robot Rep."},{"key":"38_CR3","doi-asserted-by":"publisher","first-page":"47946","DOI":"10.1109\/ACCESS.2021.3066622","volume":"9","author":"H Tang","year":"2021","unstructured":"Tang, H., Cheng, X., Jiang, W., Chen, S.: Research on equipment configuration optimization of AGV unmanned warehouse. IEEE Access 9, 47946\u201347959 (2021)","journal-title":"IEEE Access"},{"key":"38_CR4","doi-asserted-by":"crossref","unstructured":"Xiao, Y., Cao, H., Huo, M., Chen, D., Zhou, H., Yu, Q.: Research on high-quality paths and strategies for 5g industrial private networks. In: Proceedings of the 2024 4th International Conference on Signal Processing and Communication Technology. pp. 266\u2013273. ACM, Shenzhen Sichuan China (2024)","DOI":"10.1145\/3712464.3712512"},{"key":"38_CR5","doi-asserted-by":"publisher","first-page":"1941","DOI":"10.1109\/LRA.2017.2715406","volume":"2","author":"J Banfi","year":"2017","unstructured":"Banfi, J., Basilico, N., Amigoni, F.: Intractability of time-optimal multirobot path planning on 2D grid graphs with holes. IEEE Robot. Autom. Lett. 2, 1941\u20131947 (2017)","journal-title":"IEEE Robot. Autom. Lett."},{"key":"38_CR6","doi-asserted-by":"publisher","first-page":"40","DOI":"10.1016\/j.artint.2014.11.006","volume":"219","author":"G Sharon","year":"2015","unstructured":"Sharon, G., Stern, R., Felner, A., Sturtevant, N.R.: Conflict-based search for optimal multi-agent pathfinding. Artif. Intell. 219, 40\u201366 (2015)","journal-title":"Artif. Intell."},{"key":"38_CR7","doi-asserted-by":"crossref","unstructured":"Ma, H., Harabor, D., Stuckey, P.J., Li, J., Koenig, S.: Searching with consistent prioritization for multi-agent path finding. In: Proceedings of the AAAI conference on artificial intelligence. pp. 7643\u20137650 (2019)","DOI":"10.1609\/aaai.v33i01.33017643"},{"key":"38_CR8","doi-asserted-by":"publisher","DOI":"10.1016\/j.artint.2022.103752","volume":"310","author":"K Okumura","year":"2022","unstructured":"Okumura, K., Machida, M., D\u00e9fago, X., Tamura, Y.: Priority inheritance with backtracking for iterative multi-agent path finding. Artif. Intell. 310, 103752 (2022)","journal-title":"Artif. Intell."},{"key":"38_CR9","doi-asserted-by":"publisher","first-page":"41","DOI":"10.1007\/s10462-023-10670-6","volume":"57","author":"J Chung","year":"2024","unstructured":"Chung, J., Fayyad, J., Younes, Y.A., Najjaran, H.: Learning team-based navigation: a review of deep reinforcement learning techniques for multi-agent pathfinding. Artif. Intell. Rev. 57, 41 (2024)","journal-title":"Artif. Intell. Rev."},{"key":"38_CR10","doi-asserted-by":"publisher","first-page":"4948","DOI":"10.3390\/app11114948","volume":"11","author":"L Canese","year":"2021","unstructured":"Canese, L., et al.: Multi-agent reinforcement learning: a review of challenges and applications. Appl. Sci. 11, 4948 (2021)","journal-title":"Appl. Sci."},{"key":"38_CR11","doi-asserted-by":"publisher","first-page":"2378","DOI":"10.1109\/LRA.2019.2903261","volume":"4","author":"G Sartoretti","year":"2019","unstructured":"Sartoretti, G., et al.: Primal: Pathfinding via reinforcement and imitation multi-agent learning. IEEE Robot. Autom. Lett. 4, 2378\u20132385 (2019)","journal-title":"IEEE Robot. Autom. Lett."},{"key":"38_CR12","doi-asserted-by":"publisher","first-page":"10233","DOI":"10.1109\/TII.2023.3240585","volume":"19","author":"L Chen","year":"2023","unstructured":"Chen, L., et al.: Transformer-based imitative reinforcement learning for multirobot path planning. IEEE Trans. Industr. Inf. 19, 10233\u201310243 (2023)","journal-title":"IEEE Trans. Industr. Inf."},{"key":"38_CR13","doi-asserted-by":"publisher","DOI":"10.1016\/j.knosys.2023.111121","volume":"283","author":"J Gao","year":"2024","unstructured":"Gao, J., Li, Y., Li, X., Yan, K., Lin, K., Wu, X.: A review of graph-based multi-agent pathfinding solvers: from classical to beyond classical. Knowl.-Based Syst. 283, 111121 (2024)","journal-title":"Knowl.-Based Syst."},{"key":"38_CR14","first-page":"1","volume":"21","author":"T Rashid","year":"2020","unstructured":"Rashid, T., Samvelyan, M., De Witt, C.S., Farquhar, G., Foerster, J., Whiteson, S.: Monotonic value function factorisation for deep multi-agent reinforcement learning. J. Mach. Learn. Res. 21, 1\u201351 (2020)","journal-title":"J. Mach. Learn. Res."},{"key":"38_CR15","unstructured":"Yuan, M., Castanyer, R.C., Li, B., Jin, X., Berseth, G., Zeng, W.: RLeXplore: Accelerating Research in Intrinsically-Motivated Reinforcement Learning (2024). http:\/\/arxiv.org\/abs\/2405.19548"},{"key":"38_CR16","unstructured":"Burda, Y., Edwards, H., Storkey, A., Klimov, O.: Exploration by Random Network Distillation (2018). http:\/\/arxiv.org\/abs\/1810.12894"},{"key":"38_CR17","doi-asserted-by":"publisher","first-page":"5533","DOI":"10.1109\/LRA.2021.3077863","volume":"6","author":"Q Li","year":"2021","unstructured":"Li, Q., Lin, W., Liu, Z., Prorok, A.: Message-aware graph attention networks for large-scale multi-robot path planning. IEEE Robot. Autom. Lett. 6, 5533\u20135540 (2021)","journal-title":"IEEE Robot. Autom. Lett."},{"key":"38_CR18","doi-asserted-by":"crossref","unstructured":"Ma, Z., Luo, Y., Ma, H.: Distributed heuristic multi-agent path finding with communication. In: 2021 IEEE International Conference on Robotics and Automation (ICRA). pp. 8699\u20138705 (2021)","DOI":"10.1109\/ICRA48506.2021.9560748"},{"key":"38_CR19","doi-asserted-by":"publisher","first-page":"1455","DOI":"10.1109\/LRA.2021.3139145","volume":"7","author":"Z Ma","year":"2022","unstructured":"Ma, Z., Luo, Y., Pan, J.: Learning selective communication for multi-agent path finding. IEEE Robot. Autom. Lett. 7, 1455\u20131462 (2022)","journal-title":"IEEE Robot. Autom. Lett."},{"key":"38_CR20","doi-asserted-by":"crossref","unstructured":"Wang, Y., Xiang, B., Huang, S., Sartoretti, G.: SCRIMP: scalable communication for reinforcement- and imitation-learning-based multi-agent pathfinding. In: 2023 IEEE\/RSJ International Conference on Intelligent Robots and Systems (IROS). pp. 9301\u20139308 (2023)","DOI":"10.1109\/IROS55552.2023.10342305"}],"container-title":["Lecture Notes in Computer Science","Advanced Intelligent Computing Technology and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-981-96-9818-9_38","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,9,7]],"date-time":"2025-09-07T15:07:30Z","timestamp":1757257650000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-981-96-9818-9_38"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025]]},"ISBN":["9789819698172","9789819698189"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/978-981-96-9818-9_38","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2025]]},"assertion":[{"value":"20 July 2025","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ICIC","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Intelligent Computing","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Ningbo","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"China","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2025","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"26 July 2025","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"29 July 2025","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"21","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"icic2025","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/www.ic-icc.cn\/icg\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}