What makes planners predictable?

ICAPS 2008 - Proceedings of the 18th International Conference on Automated Planning and Scheduling

Volumn , Issue , 2008, Pages 288-295

  Roberts, Mark ^a   Howe, Adele E ^a   Wilson, Brandon ^b   Des Jardins, Marie ^b  

^a Colorado State University   (United States)

^b University of Marylandw Baltimore County   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

BENCH-MARK PROBLEMS; DOMAIN FEATURES; PERFORMANCE DATUM; PROBLEM STRUCTURES; RUN-TIME; SEARCH SPACES; TRAINING DATUM; UNDERLYING CAUSE;

SCHEDULING;

PLANNING;

EID: 58849113596     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (17)

1. Bacchus, F. 2001. Aips'00 planning competition. AI Magazine 3(22):47-56.
2. Elandt-Johnson, R. C., and Johnson, N. L. 1980. Survival Models and Data Analysis. New York: Wiley and Sons.
3. Helmert, M. 2006a. The fast downward planning system. Journal of Artifical Intelligence Research 26:191-246.
4. Helmert, M. 2006b. New complexity results for classical planning benchmarks. In Proc. of the ICAPS-06. AAAI Press, Menlo Park, California. Cumbria, UK. June 6-10., 52-61.
5. Hoffmann, J., and Edelkamp, S. 2005. The deterministic part of IPC-4: An overview. Journal of Artificial Intelligence Research 24:519-579.
6. Hoffmann, J. 2001. Local search topology in planning benchmarks: An empirical analysis. In Proceedings of IJ-CAI'01., 453-458. Seattle, Washington, USA: Kaufmann.
7. Hoffmann, J. 2004. Utilizing Problem Structure in Planning: A local search approach. Berlin, New York: Springer-Verlag.
8. Hoffmann, J. 2005. Where ignoring delete lists works: Local search topology in planning benchmarks. Journal of Artificial Intelligence Research 24:685-758.
9. Holte, R. C. 1993. Very simple classification rules perform well on most commonly used datasets. Machine Learning 3:63-91.
10. Howe, A.; Dahlman, E.; Hansen, C.; Scheetz, M.; and von-Mayrhauser, A. 1999. Exploiting competitive planner performance. In Proc. 5th European ECP-99. Springer, LNCS, 1809. Durham, UK, September 8-10.
11. Kutner, M.; Nachtsheim, C.; Neter, J.; and Li, W 2005. Applied Linear Statistical Models. McGraw Hill.
12. Long, D., and Fox, M. 2003. The 3rd international planning competition: Results and analysis. Journal of Artificial Intelligence Research 20:1-59.
13. Roberts, M., and Howe, A. 2007. Learned models of performance for many planners. In Working Notes of ICAPS 2007 Workshop on AI Planning and Learning.
14. Roberts, M., and Howe, A. forthcoming. Learning from planner performance. Artificial Intelligence.
15. Spath, H. 1979. Algorithm 39 Clusterwise linear regression. Computing 22(4):367-373.
16. Vrakas, D.; Tsoumakas, G.; Bassiliades, N.; and Vlahavas, I. 2005. Intelligent Techniques for Planning. Idea Group. chapter Machine Learning for Adaptive Planning, 90-120.
17. Witten, I. H., and Frank, E. 2005. Data Mining: Practical machine learning tools and techniques. San Francisco: Morgan Kaufmann, 2nd edition.