{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,17]],"date-time":"2026-03-17T07:36:47Z","timestamp":1773733007426,"version":"3.50.1"},"reference-count":42,"publisher":"Springer Science and Business Media LLC","issue":"1-2","license":[{"start":{"date-parts":[[2011,1,31]],"date-time":"2011-01-31T00:00:00Z","timestamp":1296432000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Mach Learn"],"published-print":{"date-parts":[[2011,7]]},"DOI":"10.1007\/s10994-011-5234-y","type":"journal-article","created":{"date-parts":[[2011,1,30]],"date-time":"2011-01-30T17:35:25Z","timestamp":1296408925000},"page":"81-107","source":"Crossref","is-referenced-by-count":17,"title":["The first learning track of the international planning competition"],"prefix":"10.1007","volume":"84","author":[{"given":"Alan","family":"Fern","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Roni","family":"Khardon","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Prasad","family":"Tadepalli","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2011,1,31]]},"reference":[{"issue":"1\u20132","key":"5234_CR1","doi-asserted-by":"crossref","first-page":"29","DOI":"10.1016\/S0004-3702(02)00246-1","volume":"141","author":"R. Aler","year":"2002","unstructured":"Aler, R., Borrajo, D., & Isasi, P. (2002). Using genetic programming to learn and improve control knowledge. Artificial Intelligence, 141(1\u20132), 29\u201356.","journal-title":"Artificial Intelligence"},{"issue":"3","key":"5234_CR2","doi-asserted-by":"crossref","first-page":"131","DOI":"10.3233\/ICG-2007-30302","volume":"30","author":"R. Bjarnason","year":"2007","unstructured":"Bjarnason, R., Tadepalli, P., & Fern, A. (2007). Searching solitaire in real time. ICGA Journal, 30(3), 131\u2013142.","journal-title":"ICGA Journal"},{"key":"5234_CR3","doi-asserted-by":"crossref","first-page":"285","DOI":"10.1016\/S0004-3702(98)00034-4","volume":"101","author":"H. Blockeel","year":"1997","unstructured":"Blockeel, H., & De Raedt, L. (1997). Top-down induction of first order logical decision trees. Artificial Intelligence, 101, 285\u2013297.","journal-title":"Artificial Intelligence"},{"key":"5234_CR4","first-page":"12","volume-title":"Proceedings of the international conference on automated planning and scheduling","author":"B. Bonet","year":"2003","unstructured":"Bonet, B., & Geffner, H. (2003). Labeled RTDP: improving the convergence of real-time dynamic programming. In Proceedings of the international conference on automated planning and scheduling (pp. 12\u201331)."},{"key":"5234_CR5","first-page":"690","volume-title":"Proceedings of the international joint conference of artificial intelligence","author":"C. Boutilier","year":"2001","unstructured":"Boutilier, C., Reiter, R., & Price, B. (2001). Symbolic dynamic programming for first-order MDPs. In Proceedings of the international joint conference of artificial intelligence (pp.\u00a0690\u2013700)."},{"key":"5234_CR6","doi-asserted-by":"crossref","first-page":"323","DOI":"10.1613\/jair.1918","volume":"26","author":"Y. Chen","year":"2006","unstructured":"Chen, Y., Wah, B. W., & Hsu, C. (2006). Temporal planning using subgoal partitioning and resolution in SGPlan. Journal of Artificial Intelligence Research, 26, 323\u2013369.","journal-title":"Journal of Artificial Intelligence Research"},{"key":"5234_CR7","doi-asserted-by":"crossref","first-page":"7","DOI":"10.1023\/A:1007694015589","volume":"43","author":"S. Dzeroski","year":"2001","unstructured":"Dzeroski, S., De Raedt, L., & Driessens, K. (2001). Relational reinforcement learning. Machine Learning Journal, 43, 7\u201352.","journal-title":"Machine Learning Journal"},{"key":"5234_CR8","first-page":"843","volume-title":"Proceedings of the thirteenth national conference on artificial intelligence","author":"T. A. Estlin","year":"1996","unstructured":"Estlin, T. A., & Mooney, R. J. (1996). Multi-strategy learning of search control for partial-order planning. In Proceedings of the thirteenth national conference on artificial intelligence (pp.\u00a0843\u2013848)."},{"key":"5234_CR9","doi-asserted-by":"crossref","first-page":"85","DOI":"10.1613\/jair.1700","volume":"25","author":"A. Fern","year":"2006","unstructured":"Fern, A., Yoon, S., & Givan, R. (2006). Approximate policy iteration with a policy language bias: solving relational Markov decision processes. Journal of Artificial Intelligence Research, 25, 85\u2013118.","journal-title":"Journal of Artificial Intelligence Research"},{"issue":"3\/4","key":"5234_CR10","doi-asserted-by":"crossref","first-page":"189","DOI":"10.1016\/0004-3702(71)90010-5","volume":"2","author":"R. Fikes","year":"1971","unstructured":"Fikes, R., & Nilsson, N. (1971). STRIPS: A new approach to the application of theorem proving to problem solving. Artificial Intelligence Journal, 2(3\/4), 189\u2013208.","journal-title":"Artificial Intelligence Journal"},{"issue":"1\u20133","key":"5234_CR11","doi-asserted-by":"crossref","first-page":"251","DOI":"10.1016\/0004-3702(72)90051-3","volume":"3","author":"R. E. Fikes","year":"1972","unstructured":"Fikes, R. E., Hart, P. E., & Nilsson, N. J. (1972). Learning and executing generalized robot plans. Artificial Intelligence Journal, 3(1\u20133), 251\u2013288.","journal-title":"Artificial Intelligence Journal"},{"key":"5234_CR12","volume-title":"International conference on automated planning and scheduling","author":"B. Galvani","year":"2009","unstructured":"Galvani, B., Gerevini, A., Saetti, A., & Vallati, M. (2009). A planner based on an automatically configurable portfolio of domain-independent planners with macro-actions: PbP. In International conference on automated planning and scheduling."},{"key":"5234_CR13","doi-asserted-by":"crossref","first-page":"263","DOI":"10.1613\/jair.855","volume":"14","author":"J. Hoffmann","year":"2001","unstructured":"Hoffmann, J., & Nebel, B. (2001). The FF planning system: Fast plan generation through heuristic search. Journal of Artificial Intelligence Research, 14, 263\u2013302.","journal-title":"Journal of Artificial Intelligence Research"},{"key":"5234_CR14","first-page":"415","volume-title":"Proceedings of seventeenth international conference on machine learning","author":"Y.-C. Huang","year":"2000","unstructured":"Huang, Y.-C., Selman, B., & Kautz, H. (2000). Learning declarative control rules for constraint-based planning. In Proceedings of seventeenth international conference on machine learning (pp.\u00a0415\u2013422)."},{"issue":"4","key":"5234_CR15","first-page":"285","volume":"3","author":"G. Iba","year":"1989","unstructured":"Iba, G. (1989). A heuristic approach to the discovery of macro-operators. Machine Learning, 3(4), 285\u2013317.","journal-title":"Machine Learning"},{"key":"5234_CR16","volume-title":"Proceedings of the international conference on automated planning and scheduling","author":"S. Joshi","year":"2008","unstructured":"Joshi, S., & Khardon, R. (2008). Stochastic planning with first order decision diagrams. In Proceedings of the international conference on automated planning and scheduling."},{"key":"5234_CR17","first-page":"89","volume-title":"Proceedings of the international conference on automated planning and scheduling","author":"S. Joshi","year":"2010","unstructured":"Joshi, S., Kersting, K., & Khardon, R. (2010). Self-Taught decision theoretic planning with first-order decision diagrams. In Proceedings of the international conference on automated planning and scheduling (pp. 89\u201396)."},{"issue":"1\u20132","key":"5234_CR18","doi-asserted-by":"crossref","first-page":"219","DOI":"10.1016\/S0004-3702(01)00109-6","volume":"129","author":"A. Junghanns","year":"2001","unstructured":"Junghanns, A., & Schaeffer, J. (2001). Sokoban: enhancing general single-agent search methods using domain knowledge. Artificial Intelligence, 129(1\u20132), 219\u2013251.","journal-title":"Artificial Intelligence"},{"key":"5234_CR19","volume-title":"Proceedings of the international conference on machine learning","author":"K. Kersting","year":"2004","unstructured":"Kersting, K., van Otterlo, M., & De Raedt, L. (2004). Bellman goes relational. In Proceedings of the international conference on machine learning."},{"issue":"1\u20132","key":"5234_CR20","doi-asserted-by":"crossref","first-page":"125","DOI":"10.1016\/S0004-3702(99)00060-0","volume":"113","author":"R. Khardon","year":"1999","unstructured":"Khardon, R. (1999). Learning action strategies for planning domains. Artificial Intelligence, 113(1\u20132), 125\u2013148.","journal-title":"Artificial Intelligence"},{"key":"5234_CR21","volume-title":"Proceedings of the seventh international conference on case based reasoning","author":"T. Rosa La","year":"2007","unstructured":"La Rosa, T., Garc\u00eda Olaya, A., & Borrajo, D. (2007). Using cases utility for heuristic planning improvement. In Proceedings of the seventh international conference on case based reasoning."},{"key":"5234_CR22","volume-title":"Proceedings of seventh international conference on principles of knowledge representation and reasoning","author":"M. Martin","year":"2000","unstructured":"Martin, M., & Geffner, H. (2000). Learning generalized policies in planning domains using concept languages. In Proceedings of seventh international conference on principles of knowledge representation and reasoning."},{"key":"5234_CR23","volume-title":"The 1st international planning competition","author":"D. McDermott","year":"1998","unstructured":"McDermott, D. (1998). PDDL\u2014the planning domain definition language. In The 1st international planning competition."},{"key":"5234_CR24","volume-title":"Proceedings of national conference on artificial intelligence","author":"S. Minton","year":"1988","unstructured":"Minton, S. (1988). Quantitative results concerning the utility of explanation-based learning. In Proceedings of national conference on artificial intelligence."},{"key":"5234_CR25","volume-title":"Machine learning methods for planning","year":"1993","unstructured":"Minton, S. (Ed.) (1993). Machine learning methods for planning. San Mateo: Morgan Kaufmann."},{"key":"5234_CR26","doi-asserted-by":"crossref","first-page":"63","DOI":"10.1016\/0004-3702(89)90047-7","volume":"40","author":"S. Minton","year":"1989","unstructured":"Minton, S., Carbonell, J. G., Knoblock, C. A., Kuokka, D., Etzioni, O., & Gil, Y. (1989). Explanation-based learning: a problem solving perspective. Artificial Intelligence, 40, 63\u2013118.","journal-title":"Artificial Intelligence"},{"key":"5234_CR27","volume-title":"International conference on knowledge-based computer systems","author":"R. Nigenda","year":"2000","unstructured":"Nigenda, R., Nguyen, X., & Kambhampati, S. (2000). AltAlt: combining the advantages of graphplan and heuristic state search. In International conference on knowledge-based computer systems. Citeseer."},{"key":"5234_CR28","doi-asserted-by":"crossref","DOI":"10.1002\/9780470316887","volume-title":"Markov decision processes: discrete dynamic stochastic programming","author":"M. L. Puterman","year":"1994","unstructured":"Puterman, M. L. (1994). Markov decision processes: discrete dynamic stochastic programming. New York: Wiley."},{"key":"5234_CR29","volume-title":"Proceedings of the international planning competition","author":"S. Richter","year":"2008","unstructured":"Richter, S., & Westphal, M. (2008). The Lama planner using landmark counting in heuristic search. In Proceedings of the international planning competition."},{"key":"5234_CR30","doi-asserted-by":"crossref","first-page":"748","DOI":"10.1016\/j.artint.2008.11.003","volume":"173","author":"S. Sanner","year":"2009","unstructured":"Sanner, S., & Boutilier, C. (2009). Practical solution techniques for first-order MDPs. Artificial Intelligence, 173, 748\u2013788.","journal-title":"Artificial Intelligence"},{"key":"5234_CR31","volume-title":"Reinforcement learning: an introduction","author":"R. Sutton","year":"1998","unstructured":"Sutton, R., & Barto, A. (1998). Reinforcement learning: an introduction. Cambridge: MIT."},{"key":"5234_CR32","volume-title":"Proceedings of the workshop on relational reinforcement learning","author":"P. Tadepalli","year":"2004","unstructured":"Tadepalli, P., Givan, B., & Driessens, K. (2004). Relational reinforcement: an overview. In Proceedings of the workshop on relational reinforcement learning, Banff, Canada, International conference on machine learning."},{"key":"5234_CR33","first-page":"1633","volume":"10","author":"M. E. Taylor","year":"2009","unstructured":"Taylor, M. E., & Stone, P. (2009). Transfer learning for reinforcement learning domains: a survey. J. Mach. Learn. Res., 10, 1633\u20131685.","journal-title":"J. Mach. Learn. Res."},{"issue":"3","key":"5234_CR34","doi-asserted-by":"crossref","first-page":"298","DOI":"10.1016\/j.artint.2005.08.004","volume":"170","author":"V. Vidal","year":"2006","unstructured":"Vidal, V., & Geffner, H. (2006). Branching and pruning: an optimal temporal POCL planner based on constraint programming. Artificial Intelligence, 170(3), 298\u2013335.","journal-title":"Artificial Intelligence"},{"key":"5234_CR35","volume-title":"Proceedings of the workshop on uncertainty in artificial intelligence","author":"C. Wang","year":"2007","unstructured":"Wang, C., & Khardon, R. (2007). Policy iteration for relational MDPs. In Proceedings of the workshop on uncertainty in artificial intelligence."},{"key":"5234_CR36","doi-asserted-by":"crossref","first-page":"431","DOI":"10.1613\/jair.2489","volume":"31","author":"C. Wang","year":"2008","unstructured":"Wang, C., Joshi, S., & Khardon, R. (2008). First-Order decision diagrams for relational MDPs. Journal of Artificial Intelligence Research, 31, 431\u2013472.","journal-title":"Journal of Artificial Intelligence Research"},{"issue":"2","key":"5234_CR37","doi-asserted-by":"crossref","first-page":"81","DOI":"10.1609\/aimag.v31i2.2227","volume":"31","author":"S. Whiteson","year":"2010","unstructured":"Whiteson, S., Tanner, B., & White, A. (2010). AI Magazine, 31(2), 81\u201394.","journal-title":"AI Magazine"},{"key":"5234_CR38","doi-asserted-by":"crossref","unstructured":"Xu, L., Hutter, F., Hoos, H., & Leyton-Brown, K. (2007). SATzilla-07: the design and analysis of an algorithm portfolio for SAT. In Lecture Notes in Computer Science (Vol.\u00a04741, p.\u00a0712).","DOI":"10.1007\/978-3-540-74970-7_50"},{"key":"5234_CR39","volume-title":"Proceedings of eighteenth conference in uncertainty in artificial intelligence","author":"S. Yoon","year":"2002","unstructured":"Yoon, S., Fern, A., & Givan, R. (2002). Inductive policy selection for first-order MDPs. In Proceedings of eighteenth conference in uncertainty in artificial intelligence."},{"key":"5234_CR40","volume-title":"International conference on automated planning and scheduling (ICAPS)","author":"S. Yoon","year":"2006","unstructured":"Yoon, S., Fern, A., & Givan, R. (2006). Learning heuristic functions from relaxed plans. In International conference on automated planning and scheduling (ICAPS)."},{"key":"5234_CR41","volume-title":"Proceedings of the ICAPS-03 workshop on PDDL","author":"H. Younes","year":"2003","unstructured":"Younes, H. (2003). Extending PDDL to model stochastic decision processes. In Proceedings of the ICAPS-03 workshop on PDDL."},{"issue":"2","key":"5234_CR42","first-page":"73","volume":"24","author":"T. Zimmerman","year":"2003","unstructured":"Zimmerman, T., & Kambhampati, S. (2003). Learning-assisted automated planning: looking back, taking stock, going forward. AI Magazine, 24(2), 73\u201396.","journal-title":"AI Magazine"}],"container-title":["Machine Learning"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10994-011-5234-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10994-011-5234-y\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10994-011-5234-y","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,8]],"date-time":"2019-06-08T06:32:12Z","timestamp":1559975532000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10994-011-5234-y"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011,1,31]]},"references-count":42,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[2011,7]]}},"alternative-id":["5234"],"URL":"https:\/\/doi.org\/10.1007\/s10994-011-5234-y","relation":{},"ISSN":["0885-6125","1573-0565"],"issn-type":[{"value":"0885-6125","type":"print"},{"value":"1573-0565","type":"electronic"}],"subject":[],"published":{"date-parts":[[2011,1,31]]}}}