{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,28]],"date-time":"2025-03-28T06:34:59Z","timestamp":1743143699677,"version":"3.40.3"},"publisher-location":"Cham","reference-count":26,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031632228"},{"type":"electronic","value":"9783031632235"}],"license":[{"start":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T00:00:00Z","timestamp":1704067200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T00:00:00Z","timestamp":1704067200000},"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":[[2024]]},"DOI":"10.1007\/978-3-031-63223-5_26","type":"book-chapter","created":{"date-parts":[[2024,6,20]],"date-time":"2024-06-20T15:02:36Z","timestamp":1718895756000},"page":"349-359","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Incremental Conflict-Based Search for\u00a0Multi-agent Path Finding in\u00a0Dynamic Environment"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0009-0006-4515-7679","authenticated-orcid":false,"given":"Yu","family":"Wang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0009-0001-4065-6659","authenticated-orcid":false,"given":"Yuhong","family":"Shi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-0321-4955","authenticated-orcid":false,"given":"Jianyi","family":"Liu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-9898-5543","authenticated-orcid":false,"given":"Xinhu","family":"Zheng","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2024,6,21]]},"reference":[{"key":"26_CR1","doi-asserted-by":"publisher","unstructured":"Atiq, B., Patoglu, V., Erdem, E.: Dynamic multi-agent path finding based on conflict resolution using answer set programming. In: Electronic Proceedings in Theoretical Computer Science, vol. 325, 223\u2013229 (2020). https:\/\/doi.org\/10.4204\/EPTCS.325.27","DOI":"10.4204\/EPTCS.325.27"},{"key":"26_CR2","doi-asserted-by":"publisher","unstructured":"Botea, A., Surynek, P.: Multi-agent path finding on strongly biconnected digraphs. In: Proceedings of the AAAI Conference on Artificial Intelligence 29 (2015). https:\/\/doi.org\/10.1609\/aaai.v29i1.9430","DOI":"10.1609\/aaai.v29i1.9430"},{"key":"26_CR3","doi-asserted-by":"publisher","unstructured":"Boyarski, E., et al.: Iterative-deepening conflict-based search, pp. 4056\u20134062 (2020). https:\/\/doi.org\/10.24963\/ijcai.2020\/561","DOI":"10.24963\/ijcai.2020\/561"},{"key":"26_CR4","doi-asserted-by":"publisher","unstructured":"Boyarski, E., et al.: ICBS: the improved conflict-based search algorithm for multi-agent pathfinding. In: Proceedings of the International Symposium on Combinatorial Search, vol. 6, 223\u2013225 (2021). https:\/\/doi.org\/10.1609\/socs.v6i1.18343","DOI":"10.1609\/socs.v6i1.18343"},{"key":"26_CR5","doi-asserted-by":"publisher","unstructured":"Boyrasky, E., Felner, A., Sharon, G., Stern, R.: Don\u2019t split, try to work it out: bypassing conflicts in multi-agent pathfinding. In: Proceedings of the International Conference on Automated Planning and Scheduling 25, 47\u201351 (2015). https:\/\/doi.org\/10.1609\/icaps.v25i1.13725","DOI":"10.1609\/icaps.v25i1.13725"},{"key":"26_CR6","doi-asserted-by":"publisher","unstructured":"Cohen, L., Uras, T., Koenig, S.: Feasibility study: using highways for bounded-suboptimal multi-agent path finding. In: Proceedings of the International Symposium on Combinatorial Search 6, 2\u20138 (2021). https:\/\/doi.org\/10.1609\/socs.v6i1.18363","DOI":"10.1609\/socs.v6i1.18363"},{"key":"26_CR7","unstructured":"Cohen, L., Uras, T., Kumar, T., Xu, H., Ayanian, N., Koenig, S.: Improved solvers for bounded-suboptimal multi-agent path finding, pp. 3067\u20133074 (2016)"},{"key":"26_CR8","doi-asserted-by":"publisher","first-page":"443","DOI":"10.1613\/jair.4447","volume":"51","author":"B DeWilde","year":"2014","unstructured":"DeWilde, B., Mors, A., Witteveen, C.: Push and rotate: a complete multi-agent pathfinding algorithm. J. Artif. Intell. Res. 51, 443\u2013492 (2014). https:\/\/doi.org\/10.1613\/jair.4447","journal-title":"J. Artif. Intell. Res."},{"key":"26_CR9","doi-asserted-by":"publisher","unstructured":"Erdem, E., Kisa, D., Oztok, U., Sch\u00fcller, P.: A general formal framework for pathfinding problems with multiple agents. In: Proceedings of the AAAI Conference on Artificial Intelligence, vol. 27, pp. 290\u2013296 (2013). https:\/\/doi.org\/10.1609\/aaai.v27i1.8592","DOI":"10.1609\/aaai.v27i1.8592"},{"key":"26_CR10","doi-asserted-by":"publisher","unstructured":"Felner, A., et al.: Adding heuristics to conflict-based search for multi-agent path finding. In: Proceedings of the International Conference on Automated Planning and Scheduling, vol. 28, pp. 83\u201387 (2018). https:\/\/doi.org\/10.1609\/icaps.v28i1.13883","DOI":"10.1609\/icaps.v28i1.13883"},{"key":"26_CR11","doi-asserted-by":"publisher","first-page":"23","DOI":"10.1109\/100.580977","volume":"4","author":"D Fox","year":"1997","unstructured":"Fox, D., Burgard, W., Thrun, S.: The dynamic window approach to collision avoidance. IEEE Robot. Autom. Mag. 4, 23\u201333 (1997). https:\/\/doi.org\/10.1109\/100.580977","journal-title":"IEEE Robot. Autom. Mag."},{"key":"26_CR12","doi-asserted-by":"publisher","first-page":"93","DOI":"10.1016\/j.artint.2003.12.001","volume":"155","author":"S Koenig","year":"2004","unstructured":"Koenig, S., Likhachev, M., Furcy, D.: Lifelong planning A. Artif. Intell. 155, 93\u2013146 (2004). https:\/\/doi.org\/10.1016\/j.artint.2003.12.001","journal-title":"Artif. Intell."},{"key":"26_CR13","doi-asserted-by":"publisher","unstructured":"Li, J., Felner, A., Boyarski, E., Ma, H., Koenig, S.: Improved heuristics for multi-agent path finding with conflict-based search, pp. 442\u2013449 (2019). https:\/\/doi.org\/10.24963\/ijcai.2019\/63","DOI":"10.24963\/ijcai.2019\/63"},{"key":"26_CR14","doi-asserted-by":"crossref","unstructured":"Ma, H., Li, J., Kumar, T., Koenig, S.: Lifelong multi-agent path finding for online pickup and delivery tasks (2017)","DOI":"10.24963\/ijcai.2018\/58"},{"key":"26_CR15","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"218","DOI":"10.1007\/978-3-319-25524-8_14","volume-title":"PRIMA 2015: Principles and Practice of Multi-Agent Systems","author":"A Murano","year":"2015","unstructured":"Murano, A., Perelli, G., Rubin, S.: Multi-agent path planning in known dynamic environments. In: Chen, Q., Torroni, P., Villata, S., Hsu, J., Omicini, A. (eds.) PRIMA 2015. LNCS (LNAI), vol. 9387, pp. 218\u2013231. Springer, Cham (2015). https:\/\/doi.org\/10.1007\/978-3-319-25524-8_14"},{"key":"26_CR16","doi-asserted-by":"publisher","unstructured":"Okoso, A., Otaki, K., Nishi, T.: Multi-agent path finding with priority for cooperative automated valet parking, pp. 2135\u20132140 (2019). https:\/\/doi.org\/10.1109\/ITSC.2019.8917112","DOI":"10.1109\/ITSC.2019.8917112"},{"key":"26_CR17","unstructured":"R\u00f6smann, C., Feiten, W., Woesch, T., Hoffmann, F., Bertram, T.: Trajectory modification considering dynamic constraints of autonomous robots, pp.\u00a01\u20136 (2012)"},{"key":"26_CR18","doi-asserted-by":"publisher","first-page":"220","DOI":"10.1016\/j.future.2020.09.032","volume":"116","author":"F Semiz","year":"2021","unstructured":"Semiz, F., Polat, F.: Incremental multi-agent path finding. Fut. Gen. Comput. Syst. 116, 220\u2013233 (2021). https:\/\/doi.org\/10.1016\/j.future.2020.09.032","journal-title":"Fut. Gen. Comput. Syst."},{"key":"26_CR19","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.: Conflict-based search for optimal multi-agent pathfinding. Artif. Intell. 219, 40\u201366 (2015). https:\/\/doi.org\/10.1016\/j.artint.2014.11.006","journal-title":"Artif. Intell."},{"key":"26_CR20","doi-asserted-by":"publisher","unstructured":"Sharon, G., Stern, R., Felner, A., Sturtevant, N.: Meta-agent conflict-based search for optimal multi-agent path finding. In: Proceedings of the International Symposium on Combinatorial Search, vol. 3, pp. 97\u2013104 (2021). https:\/\/doi.org\/10.1609\/socs.v3i1.18244","DOI":"10.1609\/socs.v3i1.18244"},{"key":"26_CR21","doi-asserted-by":"publisher","unstructured":"Sharon, G., Stern, R., Goldenberg, M., Felner, A.: The increasing cost tree search for optimal multi-agent pathfinding, vol.\u00a0195, pp. 662\u2013667 (2011). https:\/\/doi.org\/10.1016\/j.artint.2012.11.006","DOI":"10.1016\/j.artint.2012.11.006"},{"key":"26_CR22","doi-asserted-by":"crossref","unstructured":"Stern, R., et al.: Multi-agent pathfinding: definitions, variants, and benchmarks. In: Symposium on Combinatorial Search (SoCS), pp. 151\u2013158 (2019)","DOI":"10.1609\/socs.v10i1.18510"},{"key":"26_CR23","unstructured":"Surynek, P.: Reduced time-expansion graphs for solving cooperative path finding sub-optimally (2015)"},{"key":"26_CR24","unstructured":"Wurman, P., D\u2019Andrea, R., Mountz, M.: Coordinating hundreds of cooperative, autonomous vehicles in warehouses, vol.\u00a029, pp. 1752 (2007)"},{"key":"26_CR25","doi-asserted-by":"publisher","unstructured":"Yi, B., Stiller, C.: Model predictive trajectory planning for automated driving. IEEE Trans. Intell. Veh. PP, 1\u20131 (2018). https:\/\/doi.org\/10.1109\/TIV.2018.2886683","DOI":"10.1109\/TIV.2018.2886683"},{"key":"26_CR26","doi-asserted-by":"publisher","unstructured":"Yu, J., LaValle, S.: Planning optimal paths for multiple robots on graphs. In: Proceedings - IEEE International Conference on Robotics and Automation (2012). https:\/\/doi.org\/10.1109\/ICRA.2013.6631084","DOI":"10.1109\/ICRA.2013.6631084"}],"container-title":["IFIP Advances in Information and Communication Technology","Artificial Intelligence Applications and Innovations"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-63223-5_26","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,6,20]],"date-time":"2024-06-20T15:06:44Z","timestamp":1718896004000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-63223-5_26"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024]]},"ISBN":["9783031632228","9783031632235"],"references-count":26,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-63223-5_26","relation":{},"ISSN":["1868-4238","1868-422X"],"issn-type":[{"type":"print","value":"1868-4238"},{"type":"electronic","value":"1868-422X"}],"subject":[],"published":{"date-parts":[[2024]]},"assertion":[{"value":"21 June 2024","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"AIAI","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"IFIP International Conference on Artificial Intelligence Applications and Innovations","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Corfu","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Greece","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2024","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"27 June 2024","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"30 June 2024","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"20","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"aiai2024","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/ifipaiai.org\/2024\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}