{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,23]],"date-time":"2025-07-23T12:00:20Z","timestamp":1753272020954,"version":"3.40.3"},"publisher-location":"Cham","reference-count":23,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031194924"},{"type":"electronic","value":"9783031194931"}],"license":[{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2022]]},"DOI":"10.1007\/978-3-031-19493-1_29","type":"book-chapter","created":{"date-parts":[[2022,10,22]],"date-time":"2022-10-22T06:03:14Z","timestamp":1666418594000},"page":"368-382","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Analysis of\u00a0the\u00a0Anytime MAPF Solvers Based on\u00a0the\u00a0Combination of\u00a0Conflict-Based Search (CBS) and\u00a0Focal Search (FS)"],"prefix":"10.1007","author":[{"given":"Ilya","family":"Ivanashev","sequence":"first","affiliation":[]},{"given":"Anton","family":"Andreychuk","sequence":"additional","affiliation":[]},{"given":"Konstantin","family":"Yakovlev","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2022,10,23]]},"reference":[{"key":"29_CR1","doi-asserted-by":"crossref","unstructured":"Andreychuk, A., Yakovlev, K., Atzmon, D., Stern, R.: Multi-agent pathfinding with continuous time. In: Proceedings of the 28th International Joint Conference on Artificial Intelligence (IJCAI 2019), pp. 39\u201345 (2019)","DOI":"10.24963\/ijcai.2019\/6"},{"key":"29_CR2","doi-asserted-by":"crossref","unstructured":"Barer, M., Sharon, G., Stern, R., Felner, A.: Suboptimal variants of the conflict-based search algorithm for the multi-agent pathfinding problem. In: Seventh Annual Symposium on Combinatorial Search (2014)","DOI":"10.1016\/j.artint.2014.11.006"},{"key":"29_CR3","doi-asserted-by":"crossref","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, vol. 25, pp. 47\u201351 (2015)","DOI":"10.1609\/icaps.v25i1.13725"},{"key":"29_CR4","doi-asserted-by":"crossref","unstructured":"Chan, S.H., Li, J., Gange, G., Harabor, D., Stuckey, P.J., Koenig, S.: ECBS with flex distribution for bounded-suboptimal multi-agent path finding. In: Proceedings of the International Symposium on Combinatorial Search, vol. 12, pp. 159\u2013161 (2021)","DOI":"10.1609\/socs.v12i1.18569"},{"key":"29_CR5","doi-asserted-by":"crossref","unstructured":"Cohen, L., et al.: Anytime focal search with applications. In: IJCAI, pp. 1434\u20131441 (2018)","DOI":"10.24963\/ijcai.2018\/199"},{"key":"29_CR6","doi-asserted-by":"crossref","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)","DOI":"10.1609\/icaps.v28i1.13883"},{"key":"29_CR7","doi-asserted-by":"crossref","unstructured":"Gange, G., Harabor, D., Stuckey, P.J.: Lazy CBS: implicit conflict-based search using lazy clause generation. In: The International Conference on Automated Planning and Scheduling (ICAPS), pp. 155\u2013162 (2019)","DOI":"10.1609\/icaps.v29i1.3471"},{"issue":"2","key":"29_CR8","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.: A formal basis for the heuristic determination of minimum cost paths. IEEE Trans. Syst. Sci. Cybern. 4(2), 100\u2013107 (1968)","journal-title":"IEEE Trans. Syst. Sci. Cybern."},{"key":"29_CR9","doi-asserted-by":"crossref","unstructured":"Hu, S., Harabor, D.D., Gange, G., Stuckey, P.J., Sturtevant, N.R.: Multi-agent path finding with temporal jump point search. In: Proceedings of the International Conference on Automated Planning and Scheduling, vol. 32, pp. 169\u2013173 (2022)","DOI":"10.1609\/icaps.v32i1.19798"},{"key":"29_CR10","doi-asserted-by":"crossref","unstructured":"Li, J., Chen, Z., Harabor, D., Stuckey, P., Koenig, S.: Anytime multi-agent path finding via large neighborhood search. In: International Joint Conference on Artificial Intelligence (IJCAI) (2021)","DOI":"10.24963\/ijcai.2021\/568"},{"key":"29_CR11","doi-asserted-by":"crossref","unstructured":"Li, J., Chen, Z., Harabor, D., Stuckey, P.J., Koenig, S.: MAPF-LNS2: fast repairing for multi-agent path finding via large neighborhood search. In: Proceedings of the AAAI Conference on Artificial Intelligence (2022)","DOI":"10.24963\/ijcai.2021\/568"},{"key":"29_CR12","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. In: Proceedings of the International Joint Conference on Artificial Intelligence (IJCAI-2019), pp. 442\u2013449 (2019). https:\/\/doi.org\/10.24963\/ijcai.2019\/63","DOI":"10.24963\/ijcai.2019\/63"},{"key":"29_CR13","doi-asserted-by":"crossref","unstructured":"Li, J., Gange, G., Harabor, D., Stuckey, P.J., Ma, H., Koenig, S.: New techniques for pairwise symmetry breaking in multi-agent path finding. In: Proceedings of the International Conference on Automated Planning and Scheduling, vol. 30, pp. 193\u2013201 (2020)","DOI":"10.1609\/icaps.v30i1.6661"},{"key":"29_CR14","doi-asserted-by":"crossref","unstructured":"Li, J., Harabor, D., Stuckey, P.J., Felner, A., Ma, H., Koenig, S.: Disjoint splitting for multi-agent path finding with conflict-based search. In: Proceedings of the International Conference on Automated Planning and Scheduling, vol. 29, pp. 279\u2013283 (2019)","DOI":"10.1609\/icaps.v29i1.3487"},{"key":"29_CR15","doi-asserted-by":"crossref","unstructured":"Li, J., Ruml, W., Koenig, S.: EECBS: a bounded-suboptimal search for multi-agent path finding. In: Proceedings of the AAAI Conference on Artificial Intelligence (AAAI) (2021)","DOI":"10.1609\/aaai.v35i14.17466"},{"key":"29_CR16","unstructured":"Morris, R., et al.: Planning, scheduling and monitoring for airport surface operations. In: Planning for Hybrid Systems, Papers from the 2016 AAAI Workshop (2016)"},{"key":"29_CR17","doi-asserted-by":"crossref","unstructured":"Pearl, J., Kim, J.H.: Studies in semi-admissible heuristics. IEEE Trans. Pattern Anal. Mach. Intell. PAMI-4(4), 392\u2013399 (1982)","DOI":"10.1109\/TPAMI.1982.4767270"},{"key":"29_CR18","doi-asserted-by":"crossref","unstructured":"Phillips, M., Likhachev, M.: Sipp: safe interval path planning for dynamic environments. In: 2011 IEEE International Conference on Robotics and Automation, pp. 5628\u20135635. IEEE (2011)","DOI":"10.1109\/ICRA.2011.5980306"},{"key":"29_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.R.: Conflict-based search for optimal multi-agent pathfinding. Artif. Intell. 219, 40\u201366 (2015)","journal-title":"Artif. Intell."},{"key":"29_CR20","doi-asserted-by":"crossref","unstructured":"Silver, D.: Cooperative pathfinding. In: The First Artificial Intelligence and Interactive Digital Entertainment Conference, pp. 117\u2013122 (2005)","DOI":"10.1609\/aiide.v1i1.18726"},{"key":"29_CR21","unstructured":"Stern, R., et al.: Multi-agent pathfinding: definitions, variants, and benchmarks. In: Twelfth Annual Symposium on Combinatorial Search (2019)"},{"key":"29_CR22","unstructured":"Veloso, M.M., Biswas, J., Coltin, B., Rosenthal, S.: CoBots: robust symbiotic autonomous mobile service robots. In: the International Joint Conference on Artificial Intelligence (IJCAI), pp. 4423\u20134429 (2015)"},{"key":"29_CR23","unstructured":"Wurman, P.R., D\u2019Andrea, R., Mountz, M.: Coordinating hundreds of cooperative, autonomous vehicles in warehouses. In: the AAAI Conference on Artificial Intelligence (AAAI), pp. 1752\u20131760 (2007)"}],"container-title":["Lecture Notes in Computer Science","Advances in Computational Intelligence"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-19493-1_29","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,3,9]],"date-time":"2023-03-09T14:44:43Z","timestamp":1678373083000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-19493-1_29"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022]]},"ISBN":["9783031194924","9783031194931"],"references-count":23,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-19493-1_29","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2022]]},"assertion":[{"value":"23 October 2022","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"MICAI","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Mexican International Conference on Artificial Intelligence","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Monterrey","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Mexico","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2022","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"24 October 2022","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"29 October 2022","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":"micai2022","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/www.micai.org\/2022\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Double-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Easychair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"137","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"63","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"46% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"17 External reviewers","order":10,"name":"additional_info_on_review_process","label":"Additional Info on Review Process","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}