Foundations of Artificial Intelligence (FAI) Group
divider line

Seminar: AI Planning – Lifted Planning, Problem Analysis and Grounding (LPAG)

Basics. Seminar, 7 graded ECTS points.

The seminar will be run in a block format. There will be an initial meeting on TBA. All student presentations will be given on a single day after the end of term. A detailed schedule is given below.

All meetings will take place in TBA. The seminar language is English throughout.

Supervisors for the seminar are Daniel Gnad, Jörg Hoffmann, Daniel Höller, and Daniel Fišer.

Your task will be to read and understand a piece of research, to write a summary paper in your own words, to give a presentation, and to provide detailed feedback for the paper and presentation of a fellow student.

All email interaction must be pre-fixed with "[LPAG20-21]" in the email subject.

No plagiarism. It is Ok (and encouraged!) to use web resources to further your understanding of your assigned topic. However, it is inadmissible to use pieces of such material for your summary paper or presentation. Any plagiarism will result in disqualification from the seminar.

Content. Planning is concerned with finding a step-by-step description on how to accomplish a task at hand (a plan). This is done based on a declarative model describing the environment and how it can be changed. Models are usually defined in a first-order language enabling the use of variables in the problem definition. This leads to compact representation, but the majority of planners first generate a variable-free model in a process called grounding. In this seminar, we will have a look at techniques reasoning about the different representations, e.g., extracting information from the lifted representation, finding concise groundings as basis for other systems, or those systems that find plans based on the lifted representation. Requirements:

Prerequisites. Participants must have successfully completed an introductory course in Artificial Intelligence. They should be familiar with automatic planning at least to the extent of the material covered in the Artificial Intelligence course; successful participation in one of our AI Planning courses will be an advantage, but is not absolutely necessary to follow the seminar.

Registration. Is via the central seminar registration system.

Grading. The final grading will be based, in this order of importance, on:

Summary Paper. For the summary paper, you must use this tex template. You are required to read at least 2 related papers, for the related work section. You are allowed to modify the section structure given in the template if, for whatever reason, this is more adequate for the work you are summarizing.

The seminar paper should be about 4 pages long (not counting the literature list, and in the double-column format of the template). This is a rough guideline, not a strict rule. If you need, say, 5-6 pages to do your paper justice then definitely do so.

Schedule and Deadlines (tentative!).

Topics. Each participant will be assigned one topic, each of which consists of one paper. The overall amount and difficulty of the material associated with each topic is roughly balanced.

Area 1: Grounding in Classical Planning (supervisor: Daniel Gnad)

  1. Helmert: Concise finite-domain representations for PDDL planning tasks. Artif. Intell. 173(5-6): 503-535 (2009). (grounding part) Paper: Area 1 Topic 1
  2. Helmert: Concise finite-domain representations for PDDL planning tasks. Artif. Intell. 173(5-6): 503-535 (2009). (FDR part) Paper: Area 1 Topic 2
  3. Gnad et al.: Learning How to Ground a Plan - Partial Grounding in Classical Planning. AAAI 2019: 7602-7609. Paper: Area 1 Topic 3

Area 2: Domain Analysis in Classical Planning (supervisor: Dan Fišer)

  1. Fišer: Lifted Fact-Alternating Mutex Groups and Pruned Grounding of Classical Planning Problems. AAAI 2020: 9835-9842. Paper: Area 2 Topic 1
  2. Röger, Sievers, Katz: Symmetry-Based Task Reduction for Relaxed Reachability Analysis. ICAPS 2018: 208-217. Paper: Area 2 Topic 2
  3. Fišer, Torralba, Shleyfman: Operator Mutexes and Symmetries for Simplifying Planning Tasks. AAAI 2019: 7586-7593. Paper: Area 2 Topic 3

Area 3: Lifted Classical Planning (supervisor: Jörg Hoffmann)

  1. Corrêa et al.: Lifted Successor Generation Using Query Optimization Techniques. ICAPS 2020: 80-89. Paper: Area 3 Topic 1
  2. Pascal Lauer: Unary Relaxation, BSc thesis, Saarland University, 2020. (a new method to compute lifted delete relaxation heuristics) Paper: Area 3 Topic 2

Area 4: Grounding in HTN Planning (supervisor: Daniel Höller)

  1. Ramoul et al.: Grounding of HTN Planning Domain. Int. J. Artif. Intell. Tools 26(5): 1760021:1-1760021:24 (2017). Paper: Area 4 Topic 1
  2. Behnke et al.: On Succinct Groundings of HTN Planning Problems. AAAI 2020: 9775-9784. Paper: Area 4 Topic 2