{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,11]],"date-time":"2024-09-11T12:55:45Z","timestamp":1726059345334},"publisher-location":"Cham","reference-count":32,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030351656"},{"type":"electronic","value":"9783030351663"}],"license":[{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"content-version":"tdm","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":[[2019]]},"DOI":"10.1007\/978-3-030-35166-3_17","type":"book-chapter","created":{"date-parts":[[2019,11,16]],"date-time":"2019-11-16T15:01:27Z","timestamp":1573916487000},"page":"235-249","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Multi-agent Path Finding with Capacity Constraints"],"prefix":"10.1007","author":[{"ORCID":"http:\/\/orcid.org\/0000-0001-7200-0542","authenticated-orcid":false,"given":"Pavel","family":"Surynek","sequence":"first","affiliation":[]},{"given":"T. K. Satish","family":"Kumar","sequence":"additional","affiliation":[]},{"given":"Sven","family":"Koenig","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2019,11,12]]},"reference":[{"key":"17_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"309","DOI":"10.1007\/978-3-642-39071-5_23","volume-title":"Theory and Applications of Satisfiability Testing \u2013 SAT 2013","author":"G Audemard","year":"2013","unstructured":"Audemard, G., Lagniez, J.-M., Simon, L.: Improving glucose for incremental SAT solving with assumptions: application to MUS extraction. In: J\u00e4rvisalo, M., Van Gelder, A. (eds.) SAT 2013. LNCS, vol. 7962, pp. 309\u2013317. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-39071-5_23"},{"key":"17_CR2","unstructured":"Audemard, G., Simon, L.: Predicting learnt clauses quality in modern SAT solvers. In: IJCAI, pp. 399\u2013404 (2009)"},{"key":"17_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"108","DOI":"10.1007\/978-3-540-45193-8_8","volume-title":"Principles and Practice of Constraint Programming \u2013 CP 2003","author":"O Bailleux","year":"2003","unstructured":"Bailleux, O., Boufkhad, Y.: Efficient CNF encoding of Boolean cardinality constraints. In: Rossi, F. (ed.) CP 2003. LNCS, vol. 2833, pp. 108\u2013122. Springer, Heidelberg (2003). https:\/\/doi.org\/10.1007\/978-3-540-45193-8_8"},{"volume-title":"Handbook of Satisfiability: Volume 185 Frontiers in Artificial Intelligence and Applications","year":"2009","author":"A Biere","key":"17_CR4","unstructured":"Biere, A., Biere, A., Heule, M., van Maaren, H., Walsh, T.: Handbook of Satisfiability: Volume 185 Frontiers in Artificial Intelligence and Applications. IOS Press, Amsterdam (2009)"},{"issue":"3","key":"17_CR5","doi-asserted-by":"publisher","first-page":"273","DOI":"10.1007\/s10601-012-9123-1","volume":"17","author":"M Bofill","year":"2012","unstructured":"Bofill, M., Palah\u00ed, M., Suy, J., Villaret, M.: Solving constraint satisfaction problems with SAT modulo theories. Constraints 17(3), 273\u2013303 (2012)","journal-title":"Constraints"},{"key":"17_CR6","unstructured":"Boyarski, E., et al.: ICBS: improved conflict-based search algorithm for multi-agent pathfinding. In: IJCAI, pp. 740\u2013746 (2015)"},{"key":"17_CR7","doi-asserted-by":"publisher","first-page":"591","DOI":"10.1613\/jair.2502","volume":"31","author":"K Dresner","year":"2008","unstructured":"Dresner, K., Stone, P.: A multiagent approach to autonomous intersection management. JAIR 31, 591\u2013656 (2008)","journal-title":"JAIR"},{"key":"17_CR8","doi-asserted-by":"crossref","unstructured":"H\u00f6nig, W., et al.: Summary: multi-agent path finding with kinematic constraints. In: Proceedings of the Twenty-Sixth International Joint Conference on Artificial Intelligence, IJCAI 2017, pp. 4869\u20134873 (2017)","DOI":"10.24963\/ijcai.2017\/684"},{"key":"17_CR9","doi-asserted-by":"crossref","unstructured":"Kornhauser, D., Miller, G.L., Spirakis, P.G.: Coordinating pebble motion on graphs, the diameter of permutation groups, and applications. In: FOCS 1984, pp. 241\u2013250 (1984)","DOI":"10.1109\/SFCS.1984.715921"},{"key":"17_CR10","doi-asserted-by":"crossref","unstructured":"Kumar, K., Romanski, J., Hentenryck, P.V.: Optimizing infrastructure enhancements for evacuation planning. In: Proceedings of the Thirtieth AAAI Conference on Artificial Intelligence, pp. 3864\u20133870. AAAI Press (2016)","DOI":"10.1609\/aaai.v30i1.9897"},{"key":"17_CR11","doi-asserted-by":"crossref","unstructured":"Li, J., Surynek, P., Felner, A., Ma, H., Koenig, S.: Multi-agent path finding for large agents. In: AAAI, pp. 7627\u20137634. AAAI Press (2019)","DOI":"10.1609\/aaai.v33i01.33017627"},{"key":"17_CR12","unstructured":"Liu, S., Mohta, K., Atanasov, N., Kumar, V.: Towards search-based motion planning for micro aerial vehicles. CoRR abs\/1810.03071 (2018). http:\/\/arxiv.org\/abs\/1810.03071"},{"key":"17_CR13","unstructured":"Ma, H., et al.: Overview: generalizations of multi-agent path finding to real-world scenarios. CoRR abs\/1702.05515 (2017). http:\/\/arxiv.org\/abs\/1702.05515"},{"key":"17_CR14","doi-asserted-by":"crossref","unstructured":"Ma, H., Wagner, G., Felner, A., Li, J., Kumar, T.K.S., Koenig, S.: Multi-agent path finding with deadlines. In: Proceedings of the Twenty-Seventh International Joint Conference on Artificial Intelligence, IJCAI 2018, 13\u201319 July 2018, Stockholm, Sweden, pp. 417\u2013423 (2018)","DOI":"10.24963\/ijcai.2018\/58"},{"key":"17_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-3-642-15396-9_1","volume-title":"Principles and Practice of Constraint Programming \u2013 CP 2010","author":"R Nieuwenhuis","year":"2010","unstructured":"Nieuwenhuis, R.: SAT modulo theories: getting the best of SAT and global constraint filtering. In: Cohen, D. (ed.) CP 2010. LNCS, vol. 6308, pp. 1\u20132. Springer, Heidelberg (2010). https:\/\/doi.org\/10.1007\/978-3-642-15396-9_1"},{"issue":"6","key":"17_CR16","doi-asserted-by":"publisher","first-page":"937","DOI":"10.1145\/1217856.1217859","volume":"53","author":"R Nieuwenhuis","year":"2006","unstructured":"Nieuwenhuis, R., Oliveras, A., Tinelli, C.: Solving SAT and SAT modulo theories: from an abstract Davis-Putnam-Logemann-Loveland procedure to DPLL(T). J. ACM 53(6), 937\u2013977 (2006)","journal-title":"J. ACM"},{"key":"17_CR17","unstructured":"Ratner, D., Warmuth, M.K.: Finding a shortest solution for the N $$\\times $$ N extension of the 15-puzzle is intractable. In: AAAI, pp. 168\u2013172 (1986)"},{"key":"17_CR18","doi-asserted-by":"publisher","first-page":"497","DOI":"10.1613\/jair.2408","volume":"31","author":"MRK Ryan","year":"2008","unstructured":"Ryan, M.R.K.: Exploiting subgraph structure in multi-robot path planning. J. Artif. Intell. Res. (JAIR) 31, 497\u2013542 (2008)","journal-title":"J. Artif. Intell. Res. (JAIR)"},{"key":"17_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)","journal-title":"Artif. Intell."},{"key":"17_CR20","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."},{"key":"17_CR21","doi-asserted-by":"crossref","unstructured":"Sharon, G., Stern, R., Felner, A., Sturtevant, N.R.: Conflict-based search for optimal multi-agent path finding. In: AAAI (2012)","DOI":"10.1016\/j.artint.2012.11.006"},{"key":"17_CR22","unstructured":"Silva, J., Lynce, I.: Towards robust CNF encodings of cardinality constraints. In: CP, pp. 483\u2013497 (2007)"},{"key":"17_CR23","doi-asserted-by":"crossref","unstructured":"Silver, D.: Cooperative pathfinding. In: AIIDE, pp. 117\u2013122 (2005)","DOI":"10.1609\/aiide.v1i1.18726"},{"key":"17_CR24","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"827","DOI":"10.1007\/11564751_73","volume-title":"Principles and Practice of Constraint Programming - CP 2005","author":"C Sinz","year":"2005","unstructured":"Sinz, C.: Towards an optimal CNF encoding of Boolean cardinality constraints. In: van Beek, P. (ed.) CP 2005. LNCS, vol. 3709, pp. 827\u2013831. Springer, Heidelberg (2005). https:\/\/doi.org\/10.1007\/11564751_73"},{"key":"17_CR25","doi-asserted-by":"crossref","unstructured":"Standley, T.: Finding optimal solutions to cooperative pathfinding problems. In: AAAI, pp. 173\u2013178 (2010)","DOI":"10.1609\/aaai.v24i1.7564"},{"issue":"2","key":"17_CR26","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. Comput. Intell. AI Games 4(2), 144\u2013148 (2012)","journal-title":"Comput. Intell. AI Games"},{"key":"17_CR27","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"},{"issue":"3\u20134","key":"17_CR28","doi-asserted-by":"publisher","first-page":"329","DOI":"10.1007\/s10472-017-9560-z","volume":"81","author":"P Surynek","year":"2017","unstructured":"Surynek, P.: Time-expanded graph-based propositional encodings for makespan-optimal solving of cooperative path finding problems. Ann. Math. Artif. Intell. 81(3\u20134), 329\u2013375 (2017)","journal-title":"Ann. Math. Artif. Intell."},{"key":"17_CR29","unstructured":"Surynek, P.: Lazy modeling of variants of token swapping problem and multi-agent path finding through combination of satisfiability modulo theories and conflict-based search. CoRR abs\/1809.05959 (2018). http:\/\/arxiv.org\/abs\/1809.05959"},{"key":"17_CR30","doi-asserted-by":"crossref","unstructured":"Surynek, P.: Unifying search-based and compilation-based approaches to multi-agent path finding through satisfiability modulo theories. In: Proceedings of the 28th International Joint Conference on Artificial Intelligence, IJCAI 2019, pp. 1177\u20131183. ijcai.org (2019)","DOI":"10.24963\/ijcai.2019\/164"},{"key":"17_CR31","unstructured":"Surynek, P., Felner, A., Stern, R., Boyarski, E.: Efficient SAT approach to multi-agent path finding under the sum of costs objective. In: ECAI, pp. 810\u2013818 (2016)"},{"key":"17_CR32","first-page":"55","volume":"42","author":"K Wang","year":"2011","unstructured":"Wang, K., Botea, A.: MAPP: a scalable multi-agent path planning algorithm with tractability and completeness guarantees. JAIR 42, 55\u201390 (2011)","journal-title":"JAIR"}],"container-title":["Lecture Notes in Computer Science","AI*IA 2019 \u2013 Advances in Artificial Intelligence"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-35166-3_17","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,9,23]],"date-time":"2023-09-23T01:38:05Z","timestamp":1695433085000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-35166-3_17"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"ISBN":["9783030351656","9783030351663"],"references-count":32,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-35166-3_17","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2019]]},"assertion":[{"value":"12 November 2019","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"AI*IA","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference of the Italian Association for Artificial Intelligence","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Rende","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Italy","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2019","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"19 November 2019","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"22 November 2019","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":"aiia2019","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/aiia2019.mat.unical.it\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}