Summer School on Automated Planning and Scheduling

ICAPS-2009

September 16-18, 2009, Thessaloniki, Greece




News  |  General Information  |  Program and Course Material  |  Lecturers  |  Sponsors



News

October 4, 2009: Lecture notes on planning complexity and heuristic-search planning have been updated to their final version.
 
September 16, 2009: The slides of Stephen Smith on The interplay of planning and scheduling are now available online.
 
September 15, 2009: Chapter 8 of Planning as Heuristic Search is now available online.
 
September 14, 2009: Chapter 7 of Planning as Heuristic Search is now available online.
 
September 14, 2009: The slides of Malte Helmert on Computational complexity of planning have been slightly updated. The link now points to the updated version.
 
September 14, 2009: Six out of eight slides' chapters of Carmel Domshlak and Malte Helmert on Planning as Heuristic Search are now available online.
 
September 14, 2009: The slides of Hector Geffner on Planning as general problem solving: AI perspective, Models, Algorithms, Transformations are now available online.
 
September 10, 2009: The slides of Malte Helmert on Computational complexity of planning are now available online.
 
August 19, 2009: The school will take place in the Amfitryon I hall at the Macedonia Palace hotel.
A preliminary schedule of the school is published below.
 



General Information

Domain-independent planning is a thriving area of research, encompassing an increasingly diverse range of techniques and approaches. Although it has been a lively area of academic research for many years, the resulting technology has only begun to scale up to problems of realistic size. As a result, interest in the planning technology is growing rapidly, creating many opportunities for industrial and commercial applications.

The development of basic planning technology has made important strides forward in the recent two decades. Some new efficient approaches to AI planning have been proposed (planning as heuristic search, SAT/CSP-based planning, planning as model checking, efficient HTN planning, etc.) which have dramatically increased the scale and complexity of problem instances that can be tackled by domain-independent technology. The planning systems based on these approaches have been shown to be drastically more efficient than earlier ones, and therefore constitute a promising foundation both for large-scale industrial application, as well as for achieving some key objectives of AI research. Whilst many of these planning approaches have so far been focussed on highly restricted domain representations there have been some important recent developments in the expressive power of the domain representation languages that can be handled, allowing the modelling of time, continuous processes and resources. Much of the power of the modern planning approaches derives from their effective search algorithms and heuristics, the efficient representations of the search spaces they explore, and from the ability of some of these systems to exploit domain knowledge, either supplied by a domain expert or automatically inferred using domain analysis techniques.

The Summer School on Planning and Scheduling is an intensive three-day educational and mentoring program for graduate students and young researchers. The school will bring together subject experts in order to introduce the foundations of automated planning and the broad range of current planning approaches, and to consider ways of developing and exploiting these to make planning a realistically usable tool for complex problem-solving. Likewise, we hope the school will also provide a lively forum for attendees to discuss their research lines.

The school is aimed at PhD students and young academic researchers. For many students, especially these relatively at the beginning of the road, the summer school provides a unique opportunity to get into the field through a broad perspective on what the field is about, what are the grand challenges of the field, how it is connected to other areas of research, and how the techniques developed in the area can advance the industry. The previous summer schools on automated planning (that took place in 2000, 2002, 2003, and 2006) have been a great success. In order to ensure the success of the school, the registration will be restricted to 50 participants.

Organizers

Carmel Domshlak Technion, Haifa, Israel
Maria Fox University of Strathclyde, Glasgow, UK
Shlomo Zilberstein University of Massachusetts, Amherst, MA, US




Lecturers


     
Hector Geffner
ICREA and
Universitat Pompeu Fabra
      Eric Hansen
Mississippi State University
      Malte Helmert
University of Freiburg
     
   
Derek Long
University of Strathclyde
      Stephen S. Smith
Carnegie Mellon University



Program  and Course Material

The school will contain a mixture of tutorial lectures and sessions driven by the attendees' activities. Currently we are planning to have six tutorial sessions of 3 hours each, two sessions per day, on the topics:
  1. Planning as general problem solving: AI perspective, Models, Algorithms, Transformations
  2. Computational complexity of planning
  3. Planning as heuristic search: From basics to advanced methods
  4. The interplay of planning and scheduling
  5. Decision-theoretic planning
  6. Building and evaluating AI planning and scheduling systems: From theory to practice
Additional activities will include:
  • A poster session in which the students will present their own research plans, and will receive feedback both from the lecturers and organizers, as well as from the other attendees.
  • Topic-focused discussion meetings with the lecturers at which the students will break into small groups according to the sub-areas of immediate research interest, each lead by a lecturer/organizer.

Program

Wednesday, Sep. 16th

8:45-9:00
School overview and organizational announcements
9:00-13:00

Planning as general problem solving: AI perspective, Models, Algorithms, Transformations
Hector Geffner     [abstract, slides]
  

Coffee break: 10:30-11:00
  

13:00-14:30
Lunch
14:30-18:30

The interplay of planning and scheduling
Stephen Smith     [abstract, slides (pdf)]
  

Coffee break: 16:00-16:30
  

Thursday, Sep. 17th

9:00-13:00

Computational complexity of planning
Malte Helmert     [abstract, slides]
  

Coffee break: 10:30-11:00
  

13:00-14:30
Lunch
14:30-18:30

Planning as heuristic search: From basics to advanced methods
Carmel Domshlak and Malte Helmert     [abstract, slides]
  

Coffee break: 16:00-16:30
  

Friday, Sep. 18th

9:00-13:00

Building and evaluating AI planning and scheduling systems: From theory to practice
Derek Long     [abstract, slides]
  

Coffee break: 10:30-11:00
  

13:00-14:30
Lunch
14:30-18:30

Decision-theoretic planning
Eric Hansen     [abstract, slides]
  

Coffee break: 16:00-16:30
  




Sponsors

National Science Foundation

    

IJCAI, Inc.

    

Artificial Intelligence
Journal

    

Australia's ICT
Research Centre of Excellence

    

  

Algorithmic Decision Theory
COST Action