{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T20:34:35Z","timestamp":1743021275505,"version":"3.40.3"},"publisher-location":"Cham","reference-count":12,"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_28","type":"book-chapter","created":{"date-parts":[[2022,10,22]],"date-time":"2022-10-22T06:03:14Z","timestamp":1666418594000},"page":"355-367","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Towards a\u00a0Complete Multi-agent Pathfinding Algorithm for\u00a0Large Agents"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-8858-2831","authenticated-orcid":false,"given":"Stepan","family":"Dergachev","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-4377-321X","authenticated-orcid":false,"given":"Konstantin","family":"Yakovlev","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2022,10,23]]},"reference":[{"key":"28_CR1","doi-asserted-by":"crossref","unstructured":"Andreychuk, A., Yakovlev, K., Boyarski, E., Stern, R.: Improving continuous-time conflict based search. In: AAAI Conference on Artificial Intelligence. vol. 35, pp. 11220\u201311227 (2021)","DOI":"10.1609\/aaai.v35i13.17338"},{"key":"28_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: SoCS 2014. vol. 2014-Janua, pp. 19\u201327 (2014)","DOI":"10.1609\/socs.v5i1.18315"},{"key":"28_CR3","unstructured":"Boyarski, E., Felner, A., Stern, R., Sharon, G., Betzalel, O., Tolpin, D., Shimony, E.: ICBS: Improved Conflict-Based Search Algorithm for Multi-Agent Pathfinding. In: IJCAI 2015. pp. 740\u2013746 (2015)"},{"issue":"3","key":"28_CR4","doi-asserted-by":"publisher","first-page":"835","DOI":"10.1109\/TASE.2015.2445780","volume":"12","author":"M \u010c\u00e1p","year":"2015","unstructured":"\u010c\u00e1p, M., Nov\u00e1k, P., Kleiner, A., Seleck\u00fd, M.: Prioritized planning algorithms for trajectory coordination of multiple mobile robots. IEEE Transactions on Automation Science and Engineering 12(3), 835\u2013849 (2015)","journal-title":"IEEE Transactions on Automation Science and Engineering"},{"key":"28_CR5","unstructured":"De Wilde, B., Ter Mors, A.W., Witteveen, C.: Push and rotate: Cooperative multi-agent path planning. In: AAMAS 2013. vol. 1, pp. 87\u201394 (2013)"},{"key":"28_CR6","first-page":"40","volume":"218","author":"Conflict-based search for optimal multiagent path finding","year":"2015","unstructured":"Conflict-based search for optimal multiagent path finding: Sharon, G., Stern, R., Felner, A., Sturtevant., N.R. Artificial Intelligence 218, 40\u201366 (2015)","journal-title":"Artificial Intelligence"},{"issue":"1","key":"28_CR7","doi-asserted-by":"crossref","first-page":"97","DOI":"10.1609\/socs.v3i1.18244","volume":"2012","author":"G Sharon","year":"2012","unstructured":"Sharon, G., Stern, R., Felner, A., Sturtevant, N.R.: Meta-Agent Conflict-Based Search For Optimal Multi-Agent Path Finding. SoCS 2012(1), 97\u2013104 (2012)","journal-title":"SoCS"},{"key":"28_CR8","doi-asserted-by":"crossref","unstructured":"Stern, R., Sturtevant, N.R., Felner, A., Koenig, S., Ma, H., Walker, T.T., Li, J., Atzmon, D., Cohen, L., Kumar, T.K.S., Others: Multi-agent pathfinding: Definitions, variants, and benchmarks. In: SoCS 2019. pp. 151\u2013158 (2019)","DOI":"10.1609\/socs.v10i1.18510"},{"key":"28_CR9","doi-asserted-by":"crossref","unstructured":"Surynek, P.: A novel approach to path planning for multiple robots in bi-connected graphs. In: ICRA 2009. pp. 3613\u20133619 (2009)","DOI":"10.1109\/ROBOT.2009.5152326"},{"key":"28_CR10","doi-asserted-by":"crossref","unstructured":"Walker, T.T., Sturtevant, N.R., Felner, A.: Extended increasing cost tree search for non-unit cost domains. In: IJCAI 2018. vol. 2018-July, pp. 534\u2013540 (2018)","DOI":"10.24963\/ijcai.2018\/74"},{"key":"28_CR11","doi-asserted-by":"crossref","unstructured":"Yakovlev, K., Andreychuk, A., Vorobyev, V.: Prioritized multi-agent path finding for differential drive robots. In: ECMR 2019. pp. 1\u20136 (2019)","DOI":"10.1109\/ECMR.2019.8870957"},{"key":"28_CR12","doi-asserted-by":"crossref","unstructured":"Yu, J., Rus, D.: Pebble motion on graphs with rotations: Efficient feasibility tests and planning algorithms. In: Algorithmic foundations of robotics XI, pp. 729\u2013746. Springer (2015)","DOI":"10.1007\/978-3-319-16595-0_42"}],"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_28","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,3,9]],"date-time":"2023-03-09T14:44:27Z","timestamp":1678373067000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-19493-1_28"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022]]},"ISBN":["9783031194924","9783031194931"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-19493-1_28","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)"}}]}}