ICAPS 2007

Workshop Program:

8:55am	Welcome and Introduction
9:00am	Invited Talk P. Langley.
9:55am	Talk: Learning Recursive HTN-Method Structures for Planning. Q.Yang, R. Pan, S. J. Pan.
10:15am	Talk: Towards Model-lite Planning: A Proposal For Learning and Planning with Incomplete Domain Models. S.Yoon, S. Kambhampati.
10:30am	Break
11:00am	Talk: LoopDISTILL: Learning Domain-Specific Planners from Example Plans. E. Winner, M. M. Veloso.
11:20am	Talk: Learning to Solve Constraint Problems. S. Epstein, S. Petrovic.
11:40am	Talk: Cost-Sensitive Reinforcement Learning. R. Goetschalckx, K. Driessens.
12:00pm	Lunch
1:30pm	Talk: Using Abstraction for Generalized Planning. S. Srivastava, N. Immerman, S. Zilberstein.
1:50pm	Talk: Learned Models of Performance for Many Planners. M. Roberts, A. Howe, L. Flom.
2:05pm	Introductions to Posters Each poster presenter is invited to give 1-2 minute introduction.
2:15pm	Poster Presentations The authors of all accepted papers are invited to give a poster presentation.
4:00pm	Talk: The International Planning Competition: Learning Track. A. Fern.
4:15pm	Panel Discussion on the Future of AI Planning and Learning Panelists: D. Borrajo, A. Fern, S. Kambhampati, P. Langley, and W. Ruml.
5:45pm	Closing Remarks