ICAPS 2024 Tutorial on Finding multiple plans for classical planning problems

Shirin Sohrabi Michael Katz Junkyu Lee David Speck
Shirin Sohrabi Michael Katz Junkyu Lee David Speck


Brief description

The goal of the tutorial is to familiarise the audience with the theorethical and practical aspects of devising multiple plans for classical planning problems. We will motivate the need for such planners from application perspective, formally define the respective computational problems, as well as describe the existing approaches to solving these problems. We will finish with a hands-on session on using the existing planners.

Target Audience

The tutorial is aimed at ICAPS audience, familiar with classical planning. We hope that the tutorial will help both the practitioners who want to use these tools in applications and the tools builders interested in creating efficient planners.

Tutorial Outline [slides]

  1. Introduction and motivation (30 min)
  2. Planning problems (1 hr)
  3. Planning Methods (2 hrs)
  4. Hands-on session (30 min)

Useful links

Top-quality, top-k planners K* and SymK
Forbid-Iterative Collection of planners for top-k, top-quality, diverse planning
Planning service for cost-optimal, agile, satisficing, top-k, top-quality, diverse planning