{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,3]],"date-time":"2025-11-03T04:43:15Z","timestamp":1762144995049},"publisher-location":"Berlin, Heidelberg","reference-count":17,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642451102"},{"type":"electronic","value":"9783642451119"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-3-642-45111-9_38","type":"book-chapter","created":{"date-parts":[[2013,11,15]],"date-time":"2013-11-15T16:30:38Z","timestamp":1384533038000},"page":"435-449","source":"Crossref","is-referenced-by-count":2,"title":["Using Monte Carlo Tree Search to Solve Planning Problems in Transportation Domains"],"prefix":"10.1007","author":[{"given":"Otakar","family":"Trunda","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Roman","family":"Bart\u00e1k","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"2-3","key":"38_CR1","doi-asserted-by":"publisher","first-page":"235","DOI":"10.1023\/A:1013689704352","volume":"47","author":"P. Auer","year":"2002","unstructured":"Auer, P., Cesa-Bianchi, N., Fischer, P.: Finite-time Analysis of the Multiarmed Bandit Problem. Machine Learning\u00a047(2-3), 235\u2013256 (2002)","journal-title":"Machine Learning"},{"key":"38_CR2","doi-asserted-by":"crossref","first-page":"131","DOI":"10.3233\/ICG-2011-34302","volume":"34","author":"P. Baudi\u0161","year":"2011","unstructured":"Baudi\u0161, P.: Balancing MCTS by Dynamically Adjusting Komi Value. ICGA Journal\u00a034, 131\u2013139 (2011)","journal-title":"ICGA Journal"},{"key":"38_CR3","doi-asserted-by":"crossref","unstructured":"Chaslot, G., Bakkes, S., Szita, I., Spronck, P.: Monte-Carlo Tree Search: A New Framework for Game AI. In: Proceedings of the 4th Artificial Intelligence for Interactive Digital Entertainment conference (AIIDE), pp. 216\u2013217. AAAI Press (2008)","DOI":"10.1609\/aiide.v4i1.18700"},{"key":"38_CR4","unstructured":"Dechter, R.: Constraint Processing. Morgan Kaufmann Publishers Inc. (2003)"},{"key":"38_CR5","volume-title":"Automated Planning: Theory and Practice","author":"M. Ghallab","year":"2004","unstructured":"Ghallab, M., Nau, D.S., Traverso, P.: Automated Planning: Theory and Practice. Elsiever Morgan Kaufmann, Amsterdam (2004)"},{"key":"38_CR6","unstructured":"Gerevini, A., Saetti, A., Serina, I.: Planning in PDDL2.2 Domains with LPG-TD. In: International Planning Competition, 14th International Conference on Automated Planning and Scheduling (IPC at ICAPS) (2004)"},{"key":"38_CR7","series-title":"LNAI","doi-asserted-by":"publisher","first-page":"282","DOI":"10.1007\/11871842_29","volume-title":"Machine Learning: ECML 2006","author":"L. Kocsis","year":"2006","unstructured":"Kocsis, L., Szepesv\u00e1ri, C.: Bandit Based Monte-Carlo Planning. In: F\u00fcrnkranz, J., Scheffer, T., Spiliopoulou, M. (eds.) ECML 2006. LNCS (LNAI), vol.\u00a04212, pp. 282\u2013293. Springer, Heidelberg (2006)"},{"key":"38_CR8","unstructured":"Loth, M., Sebag, M., Hamadi, Y., Schoenauer, M., Schulte, C.: Hybridizing Constraint Programming and Monte-Carlo Tree Search: Application to the Job Shop Problem (unpublished)"},{"key":"38_CR9","unstructured":"Nakhost, H., M\u00fcller, M.: Monte-Carlo exploration for deterministic planning. In: Proceedings of the International Joint Conference on Artificial Intelligence (IJCAI), pp. 1766\u20131771 (2009)"},{"key":"38_CR10","unstructured":"Olaya, A., L\u00f3pez, C., Jim\u00e9nez, S.: International Planning Competition (2011), http:\/\/ipc.icaps-conference.org\/ (retrieved)"},{"key":"38_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-3-540-87608-3_1","volume-title":"Computers and Games","author":"M.P.D. Schadd","year":"2008","unstructured":"Schadd, M.P.D., Winands, M.H.M., van den Herik, H.J., Chaslot, G.M.J.B., Uiterwijk, J.W.H.M.: Single-player Monte-Carlo tree search. In: van den Herik, H.J., Xu, X., Ma, Z., Winands, M.H.M. (eds.) CG 2008. LNCS, vol.\u00a05131, pp. 1\u201312. Springer, Heidelberg (2008)"},{"key":"38_CR12","unstructured":"Schadd, M.P.D., Winands, M.H.M., van den Herik, H.J., Aldewereld, H.: Addressing NP-Complete Puzzles with Monte-Carlo Methods. In: Proceedings of the AISB 2008 Symposium on Logic and the Simulation of Interaction and Reasoning\u00a0vol. 9, (2008)"},{"key":"38_CR13","doi-asserted-by":"crossref","unstructured":"Toropila, D., Dvo\u0159\u00e1k, F., Trunda, O., Hanes, M., Bart\u00e1k, R.: Three Approaches to Solve the Petrobras Challenge: Exploiting Planning Techniques for Solving Real-Life Logistics Problems. In: Proceedings of ICTAI 2012, pp. 191\u2013198. IEEE Conference Publishing Services (2012)","DOI":"10.1109\/ICTAI.2012.34"},{"key":"38_CR14","unstructured":"Trunda, O.: Monte Carlo Techniques in Planning. Master\u2019s thesis. Faculty of Mathematics and Physics, Charles University in Prague (2013)"},{"key":"38_CR15","unstructured":"Vaquero, T.S., Costa, G., Tonidandel, F., Igreja, H., Silva, J.R., Beck, C.: Planning and scheduling ship operations on petroleum ports and platform. In: Proceedings of the ICAPS Scheduling and Planning Applications Workshop, pp. 8\u201316 (2012)"},{"key":"38_CR16","unstructured":"Wickler, G.: Using planning domain features to facilitate knowledge engineering. In: Proceedings of the Workshop on Knowledge Engineering for Planning and Scheduling (KEPS 2011), pp. 39\u201346 (2011)"},{"key":"38_CR17","doi-asserted-by":"crossref","unstructured":"Xie, F., Nakhost, H., M\u00fcller, M.: A Local Monte Carlo Tree Search Approach in Deterministic Planning. In: Proceedings of the AAAI Conference on Artificial Intelligence (AAAI 2011), pp. 1832\u20131833 (2011)","DOI":"10.1609\/aaai.v25i1.8039"}],"container-title":["Lecture Notes in Computer Science","Advances in Soft Computing and Its Applications"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-45111-9_38","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,7,6]],"date-time":"2023-07-06T15:14:47Z","timestamp":1688656487000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-45111-9_38"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783642451102","9783642451119"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-45111-9_38","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2013]]}}}