{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,11]],"date-time":"2024-09-11T05:37:37Z","timestamp":1726033057692},"publisher-location":"Cham","reference-count":8,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030221010"},{"type":"electronic","value":"9783030221027"}],"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-22102-7_20","type":"book-chapter","created":{"date-parts":[[2019,6,25]],"date-time":"2019-06-25T08:21:26Z","timestamp":1561450886000},"page":"431-440","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Some Thoughts on Forward Induction in Multi-Agent-Path Finding Under Destination Uncertainty"],"prefix":"10.1007","author":[{"given":"Bernhard","family":"Nebel","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2019,6,1]]},"reference":[{"issue":"2","key":"20_CR1","doi-asserted-by":"publisher","first-page":"356","DOI":"10.1006\/jeth.2001.2942","volume":"106","author":"P Battigalli","year":"2002","unstructured":"Battigalli, P., Siniscalchi, M.M.: Strong belief and forward induction reasoning. J. Econ. Theory 106(2), 356\u2013391 (2002). \n                    https:\/\/doi.org\/10.1006\/jeth.2001.2942","journal-title":"J. Econ. Theory"},{"key":"20_CR2","unstructured":"Bolander, T., Engesser, T., Mattm\u00fcller, R., Nebel, B.: Better eager than lazy? How agent types impact the successfulness of implicit coordination. In: Principles of Knowledge Representation and Reasoning: Proceedings of the Sixteenth International Conference (KR 2018), pp. 445\u2013453 (2018). \n                    https:\/\/aaai.org\/ocs\/index.php\/KR\/KR18\/paper\/view\/18070"},{"key":"20_CR3","doi-asserted-by":"publisher","first-page":"75","DOI":"10.4204\/EPTCS.243.6","volume":"243","author":"Thorsten Engesser","year":"2017","unstructured":"Engesser, T., Bolander, T., Mattm\u00fcller, R., Nebel, B.: Cooperative epistemic multi-agent planning for implicit coordination. In: Proceedings of the Ninth Workshop on Methods for Modalities (M4MICLA 2017), pp. 75\u201390 (2017). \n                    https:\/\/doi.org\/10.4204\/EPTCS.243.6","journal-title":"Electronic Proceedings in Theoretical Computer Science"},{"key":"20_CR4","doi-asserted-by":"publisher","unstructured":"Kornhauser, D., Miller, G.L., Spirakis, P.G.: Coordinating pebble motion on graphs, the diameter of permutation groups, and applications. In: 25th Annual Symposium on Foundations of Computer Science (FOCS 1984), pp. 241\u2013250 (1984). \n                    https:\/\/doi.org\/10.1109\/SFCS.1984.715921","DOI":"10.1109\/SFCS.1984.715921"},{"key":"20_CR5","doi-asserted-by":"publisher","first-page":"497","DOI":"10.1613\/jair.1.11376","volume":"64","author":"B Nebel","year":"2019","unstructured":"Nebel, B., Bolander, T., Engesser, T., Mattm\u00fcller, R.: Implicitly coordinated multi-agent path finding under destination uncertainty: success guarantees and computational complexity. J. Artif. Intell. Res. 64, 497\u2013527 (2019). \n                    https:\/\/doi.org\/10.1613\/jair.1.11376","journal-title":"J. Artif. Intell. Res."},{"key":"20_CR6","unstructured":"Ram\u00edrez, M., Geffner, H.: Plan recognition as planning. In: Proceedings of the 21st International Joint Conference on Artificial Intelligence (IJCAI 2009), pp. 1778\u20131783 (2009). \n                    http:\/\/ijcai.org\/Proceedings\/09\/Papers\/296.pdf"},{"key":"20_CR7","unstructured":"Ratner, D., Warmuth, M.K.: Finding a shortest solution for the \n                    \n                      \n                    \n                    $${\\rm N} \\times {\\rm N}$$\n                   extension of the 15-puzzle is intractable. In: Proceedings of the 5th National Conference on Artificial Intelligence (AAAI 1986), pp. 168\u2013172 (1986). \n                    http:\/\/www.aaai.org\/Library\/AAAI\/1986\/aaai86-027.php"},{"issue":"1\u20132","key":"20_CR8","doi-asserted-by":"publisher","first-page":"45","DOI":"10.1016\/0004-3702(78)90012-7","volume":"11","author":"CF Schmidt","year":"1978","unstructured":"Schmidt, C.F., Sridharan, N.S., Goodson, J.L.: The plan recognition problem: an intersection of psychology and artificial intelligence. Artif. Intell. 11(1\u20132), 45\u201383 (1978). \n                    https:\/\/doi.org\/10.1016\/0004-3702(78)90012-7","journal-title":"Artif. Intell."}],"container-title":["Lecture Notes in Computer Science","Description Logic, Theory Combination, and All That"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-22102-7_20","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,25]],"date-time":"2019-06-25T08:25:12Z","timestamp":1561451112000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-22102-7_20"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"ISBN":["9783030221010","9783030221027"],"references-count":8,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-22102-7_20","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":"1 June 2019","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}