{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,8]],"date-time":"2024-09-08T15:24:37Z","timestamp":1725809077144},"publisher-location":"Cham","reference-count":18,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319135595"},{"type":"electronic","value":"9783319135601"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014]]},"DOI":"10.1007\/978-3-319-13560-1_66","type":"book-chapter","created":{"date-parts":[[2014,11,14]],"date-time":"2014-11-14T10:24:07Z","timestamp":1415960647000},"page":"827-833","source":"Crossref","is-referenced-by-count":3,"title":["A Simple Approach to Solving Cooperative Path-Finding as Propositional Satisfiability Works Well"],"prefix":"10.1007","author":[{"given":"Pavel","family":"Surynek","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"66_CR1","unstructured":"Audemard, G., Simon, L.: The Glucose SAT Solver (2013), http:\/\/labri.fr\/perso\/lsimon\/glucose\/ (accessed in June 2014)"},{"key":"66_CR2","unstructured":"Biere, A., Heule, M., van Maaren, H., Walsh, T.: Handbook of Satisfiability. IOS Press (2009)"},{"key":"66_CR3","doi-asserted-by":"crossref","unstructured":"Bjork, M.: Successful SAT Encoding Techniques. Journal on Satisfiability, Boolean Modeling and Computation (2009)","DOI":"10.3233\/SAT190085"},{"key":"66_CR4","unstructured":"Dechter, R.: Constraint Processing. Morgan Kaufmann Publishers (2003)"},{"key":"66_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"502","DOI":"10.1007\/978-3-540-24605-3_37","volume-title":"Theory and Applications of Satisfiability Testing","author":"N. E\u00e9n","year":"2004","unstructured":"E\u00e9n, N., S\u00f6rensson, N.: An Extensible SAT-solver. In: Giunchiglia, E., Tacchella, A. (eds.) SAT 2003. LNCS, vol.\u00a02919, pp. 502\u2013518. Springer, Heidelberg (2004)"},{"key":"66_CR6","unstructured":"Gent, I.P., Walsh, T.: The SAT Phase Transition. In: Proceedings of the 11th European Conference on Artificial Intelligence (ECAI 1994), pp. 105\u2013109. John Wiley and Sons (1994)"},{"key":"66_CR7","doi-asserted-by":"crossref","unstructured":"Huang, R., Chen, Y., Zhang, W.: A Novel Transition Based Encoding Scheme for Planning as Satisfiability. In: Proceedings AAAI 2010. AAAI Press (2010)","DOI":"10.1609\/aaai.v24i1.7544"},{"key":"66_CR8","unstructured":"Kautz, H., Selman, B.: Unifying SAT-based and Graph-based Planning. In: Proceedings of the 16th International Joint Conference on Artificial Intelligence (IJCAI 1999), pp. 318\u2013325. Morgan Kaufmann (1999)"},{"key":"66_CR9","unstructured":"Korf, R.E., Taylor, L.A.: Finding Optimal Solutions to the 24-Puzzle. In: Proceedings of the 13th National Conference on Artificial Intelligence (AAAI 1996), pp. 1202\u20131207. AAAI Press (1996)"},{"key":"66_CR10","unstructured":"Ratner, D., Warmuth, M.K.: Finding a Shortest Solution for the N \u00d7 N Extension of the 15-PUZZLE Is Intractable. In: Proceedings of AAAI 1986, pp. 168\u2013172. Morgan Kaufmann (1986)"},{"key":"66_CR11","unstructured":"R\u00e9gin, J.-C.: A Filtering Algorithm for Constraints of Difference in CSPs. In: Proceedings of the 12th National Conference on Artificial Intelligence (AAAI 1994), pp. 362\u2013367. AAAI Press (1994)"},{"key":"66_CR12","doi-asserted-by":"crossref","first-page":"497","DOI":"10.1613\/jair.2408","volume":"31","author":"M.R.K. Ryan","year":"2008","unstructured":"Ryan, M.R.K.: Exploiting Subgraph Structure in Multi-Robot Path Planning. Journal of Artificial Intelligence Research (JAIR)\u00a031, 497\u2013542 (2008)","journal-title":"Journal of Artificial Intelligence Research (JAIR)"},{"key":"66_CR13","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. Artificial Intelligence\u00a0195, 470\u2013495 (2013)","journal-title":"Artificial Intelligence"},{"key":"66_CR14","doi-asserted-by":"crossref","unstructured":"Silver, D.: Cooperative Pathfinding. In: Proceedings of the 1st Artificial Intelligence and Interactive Digital Entertainment Conference (AIIDE 2005), pp. 117\u2013122. AAAI Press (2005)","DOI":"10.1609\/aiide.v1i1.18726"},{"key":"66_CR15","unstructured":"Standley, T.S., Korf, R.E.: Complete Algorithms for Cooperative Pathfinding Problems. In: Proceedings of the 22nd International Joint Conference on Artificial Intelligence (IJCAI 2011), pp. 668\u2013673. IJCAI\/AAAI Press (2011)"},{"key":"66_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"564","DOI":"10.1007\/978-3-642-32695-0_50","volume-title":"PRICAI 2012: Trends in Artificial Intelligence","author":"P. Surynek","year":"2012","unstructured":"Surynek, P.: Towards Optimal Cooperative Path Planning in Hard Setups through Satisfiability Solving. In: Anthony, P., Ishizuka, M., Lukose, D. (eds.) PRICAI 2012. LNCS, vol.\u00a07458, pp. 564\u2013576. Springer, Heidelberg (2012)"},{"key":"66_CR17","doi-asserted-by":"crossref","unstructured":"Surynek, P.: On Propositional Encodings of Cooperative Path-Finding. In: Proceedings of the 24th International Conference on Tools with Artificial Intelligence (ICTAI 2012), pp. 524\u2013531. IEEE Press (2012)","DOI":"10.1109\/ICTAI.2012.77"},{"key":"66_CR18","unstructured":"de Wilde, B., ter Mors, A., Witteveen, C.: Push and rotate: cooperative multi-agent path planning. In: Proceedings of International Conference on Autonomous Agents and Multi-Agent Systems (AAMAS 2013), pp. 87\u201394. IFAAMAS (2013)"}],"container-title":["Lecture Notes in Computer Science","PRICAI 2014: Trends in Artificial Intelligence"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-13560-1_66","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,7,18]],"date-time":"2023-07-18T03:56:42Z","timestamp":1689652602000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-13560-1_66"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783319135595","9783319135601"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-13560-1_66","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2014]]}}}