{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,2]],"date-time":"2025-11-02T17:01:17Z","timestamp":1762102877850},"publisher-location":"Berlin, Heidelberg","reference-count":11,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540893776"},{"type":"electronic","value":"9783540893783"}],"license":[{"start":{"date-parts":[[2008,1,1]],"date-time":"2008-01-01T00:00:00Z","timestamp":1199145600000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2008]]},"DOI":"10.1007\/978-3-540-89378-3_12","type":"book-chapter","created":{"date-parts":[[2008,11,26]],"date-time":"2008-11-26T21:43:58Z","timestamp":1227735838000},"page":"116-127","source":"Crossref","is-referenced-by-count":0,"title":["Constraint-Based Multi-agent Path Planning"],"prefix":"10.1007","author":[{"given":"Malcolm","family":"Ryan","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"12_CR1","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\u00a031, 497\u2013542 (2008)","journal-title":"Journal of Artificial Intelligence Research"},{"key":"12_CR2","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511546877","volume-title":"Planning Algorithms","author":"S.M. LaValle","year":"2006","unstructured":"LaValle, S.M.: Planning Algorithms. Cambridge University Press, Cambridge (2006)"},{"key":"12_CR3","unstructured":"Gecode Team: Gecode: Generic constraint development environment (2006), \n                    \n                      http:\/\/www.gecode.org"},{"key":"12_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"360","DOI":"10.1007\/978-3-540-40031-8_24","volume-title":"Computers and Games","author":"A. Botea","year":"2003","unstructured":"Botea, A., M\u00fcller, M., Schaeffer, J.: Using abstraction for planning in sokoban. In: Schaeffer, J., M\u00fcller, M., Bj\u00f6rnsson, Y. (eds.) CG 2002. LNCS, vol.\u00a02883, pp. 360\u2013375. Springer, Heidelberg (2003)"},{"issue":"1-2","key":"12_CR5","doi-asserted-by":"publisher","first-page":"219","DOI":"10.1016\/S0004-3702(01)00109-6","volume":"129","author":"A. Junghanns","year":"2001","unstructured":"Junghanns, A., Schaeffer, J.: Sokoban: Enhancing general single-agent search methods using domain knowledge. Artificial Intelligence\u00a0129(1-2), 219\u2013251 (2001)","journal-title":"Artificial Intelligence"},{"key":"12_CR6","unstructured":"van Beek, P., Chen, X.: CPlan: A constraint programming approach to planning. In: Proceedings of the AAAI National Conference, pp. 585\u2013590 (1999)"},{"issue":"1-2","key":"12_CR7","doi-asserted-by":"publisher","first-page":"281","DOI":"10.1016\/S0004-3702(96)00047-1","volume":"90","author":"A. Blum","year":"1997","unstructured":"Blum, A., Furst, M.: Fast planning through planning graph analysis. Artificial Intelligence\u00a090(1-2), 281\u2013300 (1997)","journal-title":"Artificial Intelligence"},{"issue":"2","key":"12_CR8","doi-asserted-by":"publisher","first-page":"151","DOI":"10.1016\/S0004-3702(01)00128-X","volume":"132","author":"M. Do","year":"2001","unstructured":"Do, M., Kambhampati, S.: Planning as constraint satisfaction: Solving the planning graph by compiling it into CSP. Artificial Intelligence\u00a0132(2), 151\u2013182 (2001)","journal-title":"Artificial Intelligence"},{"key":"12_CR9","unstructured":"Lopez, A., Bacchus, F.: Generalizing GraphPlan by Formulating Planning as a CSP. In: Proceeding of the International Joint Conference on Artificial Intelligence, IJCAI 2003 (2003)"},{"key":"12_CR10","unstructured":"Kautz, H., Selman, B., Hoffmann, J.: SatPlan: Planning as Satisfiability. In: Abstracts of the 5th International Planning Competition (2006)"},{"key":"12_CR11","unstructured":"Mann, M., Tack, G., Will, S.: Decomposition during search for propagation-based constraint solvers. Technical Report arXiv:0712.2389v2, Cornell University Library (2007)"}],"container-title":["Lecture Notes in Computer Science","AI 2008: Advances in Artificial Intelligence"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-89378-3_12","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,3,4]],"date-time":"2019-03-04T05:59:37Z","timestamp":1551679177000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-89378-3_12"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008]]},"ISBN":["9783540893776","9783540893783"],"references-count":11,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-89378-3_12","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2008]]}}}