{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,27]],"date-time":"2026-01-27T21:21:48Z","timestamp":1769548908925,"version":"3.49.0"},"publisher-location":"Cham","reference-count":21,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783030595340","type":"print"},{"value":"9783030595357","type":"electronic"}],"license":[{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2020]]},"DOI":"10.1007\/978-3-030-59535-7_3","type":"book-chapter","created":{"date-parts":[[2020,9,21]],"date-time":"2020-09-21T07:03:52Z","timestamp":1600671832000},"page":"29-45","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["Multi-agent Path Finding with Kinematic Constraints via Conflict Based Search"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-5320-4603","authenticated-orcid":false,"given":"Anton","family":"Andreychuk","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2020,9,22]]},"reference":[{"key":"3_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, pp. 39\u201345. AAAI Press (2019)","DOI":"10.24963\/ijcai.2019\/6"},{"key":"3_CR2","unstructured":"Andreychuk, A., Yakovlev, K.: Two techniques that enhance the performance of multi-robot prioritized path planning. In: Proceedings of the 17th International Conference on Autonomous Agents and MultiAgent Systems, pp. 2177\u20132179 (2018)"},{"issue":"3","key":"3_CR3","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 Trans. Autom. Sci. Eng. 12(3), 835\u2013849 (2015)","journal-title":"IEEE Trans. Autom. Sci. Eng."},{"issue":"4","key":"3_CR4","doi-asserted-by":"publisher","first-page":"638","DOI":"10.1109\/TASE.2012.2214676","volume":"9","author":"R D\u2019Andrea","year":"2012","unstructured":"D\u2019Andrea, R.: Guest editorial: a revolution in the warehouse: a retrospective on Kiva Systems and the grand challenges ahead. IEEE Trans. Autom. Sci. Eng. 9(4), 638\u2013639 (2012)","journal-title":"IEEE Trans. Autom. Sci. Eng."},{"key":"3_CR5","doi-asserted-by":"publisher","first-page":"1419","DOI":"10.1007\/BF01840371","volume":"2","author":"M Erdmann","year":"1987","unstructured":"Erdmann, M., Lozano-Perez, T.: On multiple moving objects. Algorithmica 2, 1419\u20131424 (1987)","journal-title":"Algorithmica"},{"issue":"8","key":"3_CR6","doi-asserted-by":"publisher","first-page":"1543","DOI":"10.1007\/s10514-018-9719-4","volume":"42","author":"J Godoy","year":"2018","unstructured":"Godoy, J., Chen, T., Guy, S.J., Karamouzas, I., Gini, M.: ALAN: adaptive learning for multi-agent navigation. Auton. Rob. 42(8), 1543\u20131562 (2018). \nhttps:\/\/doi.org\/10.1007\/s10514-018-9719-4","journal-title":"Auton. Rob."},{"key":"3_CR7","doi-asserted-by":"crossref","unstructured":"Guy, S.J., Karamouzas, I.: Guide to anticipatory collision avoidance. In: Game AI Pro 2: Collected Wisdom of Game AI Professional, pp. 195\u2013207. AK Peters\/CRC Press (2015)","DOI":"10.1201\/b18373-23"},{"issue":"2","key":"3_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":"3_CR9","doi-asserted-by":"crossref","unstructured":"Li, J., Surynek, P., Felner, A., Ma, H., Kumar, T.S., Koenig, S.: Multi-agent path finding for large agents. In: Proceedings of the AAAI Conference on Artificial Intelligence, vol. 33, pp. 7627\u20137634 (2019)","DOI":"10.1609\/aaai.v33i01.33017627"},{"key":"3_CR10","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":"3_CR11","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":"3_CR12","doi-asserted-by":"publisher","first-page":"470","DOI":"10.1016\/j.artint.2012.11.006","volume":"195","author":"G Sharon","year":"2013","unstructured":"Sharon, G., Stern, R., Goldenberg, M., Felner, A.: The increasing cost tree search for optimal multi-agent pathfinding. Artif. Intell. 195, 470\u2013495 (2013)","journal-title":"Artif. Intell."},{"issue":"4","key":"3_CR13","doi-asserted-by":"publisher","first-page":"696","DOI":"10.1109\/TRO.2011.2120810","volume":"27","author":"J Snape","year":"2011","unstructured":"Snape, J., Van Den Berg, J., Guy, S.J., Manocha, D.: The hybrid reciprocal velocity obstacle. IEEE Trans. Robot. 27(4), 696\u2013706 (2011)","journal-title":"IEEE Trans. Robot."},{"issue":"2","key":"3_CR14","doi-asserted-by":"publisher","first-page":"144","DOI":"10.1109\/TCIAIG.2012.2197681","volume":"4","author":"NR Sturtevant","year":"2012","unstructured":"Sturtevant, N.R.: Benchmarks for grid-based pathfinding. IEEE Trans. Comput. Intell. AI Games 4(2), 144\u2013148 (2012)","journal-title":"IEEE Trans. Comput. Intell. AI Games"},{"key":"3_CR15","unstructured":"Surynek, P.: Multi-agent path finding with continuous time and geometric agents viewed through satisfiability modulo theories (SMT). In: Twelfth Annual Symposium on Combinatorial Search (2019)"},{"key":"3_CR16","doi-asserted-by":"crossref","unstructured":"Wagner, G., Choset, H.: M*: a complete multirobot path planning algorithm with performance bounds. In: 2011 IEEE\/RSJ International Conference on Intelligent Robots and Systems, pp. 3260\u20133267. IEEE (2011)","DOI":"10.1109\/IROS.2011.6095022"},{"key":"3_CR17","doi-asserted-by":"crossref","unstructured":"Walker, T.T., Sturtevant, N.R., Felner, A.: Extended increasing cost tree search for non-unit cost domains. In: Proceedings of the 27th International Joint Conference on Artificial Intelligence, pp. 534\u2013540 (2018)","DOI":"10.24963\/ijcai.2018\/74"},{"key":"3_CR18","first-page":"55","volume":"42","author":"KHC Wang","year":"2011","unstructured":"Wang, K.H.C., Botea, A.: MAPP: a scalable multi-agent path planning algorithm with tractability and completeness guarantees. J. Artif. Intell. Res. 42, 55\u201390 (2011)","journal-title":"J. Artif. Intell. Res."},{"key":"3_CR19","unstructured":"de Wilde, B., ter Mors, A.W., Witteveen, C.: Push and rotate: cooperative multi-agent path planning. In: Proceedings of The 2013 International Conference on Autonomous Agents and Multi-Agent Systems, pp. 87\u201394 (2013)"},{"key":"3_CR20","doi-asserted-by":"crossref","unstructured":"Yakovlev, K., Andreychuk, A., Vorobyev, V.: Prioritized multi-agent path finding for differential drive robots. In: Proceedings of The 2019 European Conference on Mobile Robots (ECMR), pp. 1\u20136. IEEE (2019)","DOI":"10.1109\/ECMR.2019.8870957"},{"key":"3_CR21","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"310","DOI":"10.1007\/978-3-030-26118-4_30","volume-title":"Interactive Collaborative Robotics","author":"K Yakovlev","year":"2019","unstructured":"Yakovlev, K., Andreychuk, A., Belinskaya, J., Makarov, D.: Combining safe interval path planning and constrained path following control: preliminary results. In: Ronzhin, A., Rigoll, G., Meshcheryakov, R. (eds.) ICR 2019. LNCS (LNAI), vol. 11659, pp. 310\u2013319. Springer, Cham (2019). \nhttps:\/\/doi.org\/10.1007\/978-3-030-26118-4_30"}],"container-title":["Lecture Notes in Computer Science","Artificial Intelligence"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-59535-7_3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,10,1]],"date-time":"2020-10-01T23:21:00Z","timestamp":1601594460000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-59535-7_3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020]]},"ISBN":["9783030595340","9783030595357"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-59535-7_3","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2020]]},"assertion":[{"value":"22 September 2020","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"RCAI","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Russian Conference on Artificial Intelligence","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Moscow","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Russia","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2020","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"10 October 2020","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"16 October 2020","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"18","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"rcai2020","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/caics.ru\/en_raai","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-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":"140","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":"27","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":"8","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":"19% - 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":"2.8","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":"6","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":"No","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}