ourAMSTERcaps 2025
ourAMSTERcaps – our Amsterdam Conference on Automated Planning and Scheduling
ourAMSTERcaps is a european research meeting focussed on automated planning and scheduling. At ourAMSTERcaps, we discuss the newest research developements and develop new and exciting ideas for the future. This is the second edition of this event. The first edition was held in Saarbrücken in 2022.
Location
OURcaps 2025 will be hosted in Amsterdam, The Netherlands. Our sessions are held in LAB42.
Organisers
Gregor Behnke, UvA (Local Organiser), Daniel Fišer (Aalborg), Malte Helmert (Basel), Jörg Hoffmann (Saarbrücken), Jendrik Seipp (Linköping), Álvaro Torralba (Aalborg)
Timetable
| Time | Topic | Title | Speaker | Location |
|---|---|---|---|---|
| Wednesday July 16 | ||||
| 9:15-9:45 | Welcome and Introduction | LAB42, L3.36 | ||
| 9:45-11:15 | Heuristics for Classical Planning I | Computing all orders for Saturated Cost Partitioning | Paul Höft (30 min) | LAB42, L3.36 |
| Abstraction Heuristics for Classical Planning Tasks with Conditional Effects | Martín Pozo (15 min) | |||
| Everything is not Allowed: Constrained Cartesian Abstractions for Optimal Classical Planning | Martín Pozo (20 min) | |||
| Finding Plans and Heuristics with Spectral Graph Theory | Johannes Schmalz (15 min) | |||
| 11:15-11:45 | Coffee Break | LAB42, L3.36 | ||
| 11:45-13:15 | Heuristics for Classical Planning II | Tree Compression for States in Scorpion/Mimir | Oliver Joergensen (20 min) | LAB42, L3.36 |
| Potential Heuristics: Weakening Consistency Constraints | Pascal Lauer (20 min) | |||
| Cost Partitioning over Label-fragments | Mika Skjelnes (15 min) | |||
| What Makes You Different? Contrastive Heuristics with Qualified Dominance | Rasmus Tollund (20 min) | |||
| 13:15-14:15 | Lunch Break | Cafe Neo | ||
| 14:15-15:45 | Search Algorithms | A Formalism for Optimal Search with Dynamic Heuristics | Remo Christen (20 min) | LAB42, L3.36 |
| A* with heuristic propagation | María Fernanda Salerno (20 min) | |||
| Pseudo-Boolean Proof Logging for Optimal Classical Planning | Simon Dold (20 min) | |||
| Classical Planning using Constraint Programming and Belief Propagation | Damien Van Meerbeeck (20 min) | |||
| 15:45-16:15 | Coffee Break | LAB42, L3.36 | ||
| 16:15-17:45 | Knowledge Engineering | Tinget: Automatically Uncovering Intended Constraints over Initial States | Elliot Gestrin (15 min) | LAB42, L3.36 |
| Negated Occurrences of Predicates in PDDL Axiom Bodies | Gabi Röger (15 min) | |||
| Planning Instance Generation with Answer Set Programming | Claudia Grundke (15 min) | |||
| Exploiting Counter-Example Action Sequences to Repair Planning Domains | Songtuan Lin (15 min) | |||
| Learning Domains from Executed Plan: You need others to be reasonable | Gregor Behnke (20 min) | |||
| Thursday July 17 | ||||
| 9:30-11:15 | Policy-based Planning | Per-Domain Generalizing Policies: On Validation Instances and Scaling Behavior | Timo Gros (15 min) | LAB42, L3.36 |
| About the Challenges of Per-Domain Generalization | Nicola Müller (15 min) | |||
| On Picking Good Policies: Leveraging Action-Policy Testing in Policy Training | Jan Eisenhut (15 min) | |||
| Retraining Learned Action Policies | Chaahat Jain (15 min) | |||
| Probabilistic Verification via Policy Predicate Abstraction | Marcel Vinzent (15 min) | |||
| 11:15-11:45 | Coffee Break | LAB42, L3.36 | ||
| 11:45-13:15 | Stochastic Shortest Path Problems | The Stochastic-Shortest Path Problem Zoo | Thorsten Klößner (30 min) | LAB42, L3.36 |
| Finding Policies for Stochastic Shortest Path Problems via Plans and Cycles | Johannes Schmalz (15 min) | |||
| Transformations over Probabilistic Transition Systems | Thorsten Klößner (30 min) | |||
| 13:15-14:15 | Lunch Break | Cafe Neo | ||
| 14:15-15:45 | ML and LLMs in Planning | Symmetry Aware Transformer Training for Automated Planning | Markus Fritzsche (20 min) | LAB42, L3.36 |
| LLM-Generated Heuristics for Classical Planning | Jendrik Seipp (15 min) | |||
| Using LLMs to generate per-domain policies and a verification feedback loop | Jörg Hoffmann (15 min) | |||
| Language interaction with planning based agent | Martin Funkquist (15 min) | |||
| Evaluting Correctness and Completeness of LLM-Generated Planning Models with Minimal Synchronized Information | Elliot Gestrin (15 min) | |||
| 15:45-16:15 | Coffee Break | LAB42, L3.36 | ||
| 16:15-17:45 | Other Topics | Chosen Length Planning Games and Regular Fixed Methods FOND HTN Planning | Maurice Dekker (15 min) | LAB42, L3.36 |
| Explainable Planning | Daniel Gnad (30 min) | |||
| Friday July 18 | ||||
| 9:30-11:15 | Tools | Finding Bugs with Machetli: Short demo and latest developments | (20 min) | LAB42, L3.36 |
| 11:15-11:45 | Coffee Break | LAB42, L3.36 | ||
| 11:45-13:15 | TBA | LAB42, L3.36 | ||
| 13:15-14:15 | Lunch Break | Cafe Neo | ||