Monday, June 29, 2026 ↑ Back to Navigation

Opening Reception (17:30 – 19:30) — Fitzwilliam Suites & Pre-Function Area

Tuesday, June 30, 2026 — Main Conference Day 1 ↑ Back to Navigation

Morning Session
Session 1A: Classical Planning I
Simplifying Planning Tasks with Fact-Level Relevance Analysis
Cameron Allen, Anita de Mello Koch, Harsha Kokel, George Konidaris and Michael Katz
Monotonic Variants of Saturated Cost Partitioning
Mauricio Salerno, Raquel Fuentetaja and Jendrik Seipp
Potential Heuristics as Real-Valued Multilinear Polynomials
Augusto B. Corrêa, Simon Dold and Malte Helmert
Planner Museum: Evaluating Classical Planners Over Time
Arnaud Lequen, Oliver Joergensen, Windy Phung, Elliot Gestrin, Damien Van Meerbeeck, Markus Fritzsche, Dominik Drexler and Jendrik Seipp
Session 1B: Applications I
GPMS: A Generalized Parallel Machine Scheduling Framework with Rich Temporal and Resource Constraints
Lukas Frühwirth, Christoph Einspieler, Nysret Musliu and Felix Winter
Worksworld: A Domain for Integrated Numeric Planning and Scheduling of Distributed Pipelined Workflows
Taylor Paul and William Regli
Learning-Based Peak Temperature Optimization for Hard Real-Time Pipeline Schedules
Qiangxiao Zhou, Yiheng Wang, Hangbin Xu and Long Cheng
Beyond Pruning: Leveraging Dominance Relations for Heuristic Propagation
María Fernanda Salerno Garmendia, Daniel Fišer and Álvaro Torralba
Finding a Dominating State in a Haystack: Efficient Data Structures for Dominance Pruning
María Fernanda Salerno Garmendia, Daniel Fišer and Álvaro Torralba
Planning with Minimal Disruption
Alberto Pozanco, Marianela Morales, Daniel Borrajo and Manuela Veloso
Planning under Observation Mismatch for Traffic Signal Control via Adaptive Modular World Models
Zherui Huang, Yicheng Liu, Chumeng Liang and Guanjie Zheng
Near-Future Traffic Forecasting for Planning-based Traffic Signal Optimisation
Mattia Chiari, Francesco Percassi, Alfonso Emilio Gerevini and Mauro Vallati
Deep RL for Fast Long-Horizon Operations Scheduling on NASA's Carruthers Geocorona Observatory Mission
Alex Zhang, Jackson Craig and Lara Waldrop
Afternoon Session 1
Session 2B: Model Learning and Model Repair
Domain Model Acquisition From Binary Traces
Arash Haratian, Arnaud Lequen, Daniel Gnad and Jendrik Seipp
Learning Numeric Action Models with Anytime Guarantees
Diego Aineto and Enrico Scala
Learning Lifted Action Models from Unsupervised Visual Traces
Kai Xi, Stephen Gould and Sylvie Thiebaux
On Sample-Efficient Generalized Planning via Learned Transition Models
Nitin Gupta, Vishal Pallagani, John A. Aydin and Biplav Srivastava
Session 2A: Multi-Agent Planning
Risk-Bounded Multi-Agent Visual Navigation via Iterative Risk Allocation
Viraj Parimi and Brian Williams
Online Learning for Decentralized Multi-Agent Planning in Repeated Hedonic Skill Games
Jaber Valizadeh and Ray Telikani
Towards a Unified View of Social Laws with Instantaneous Actions
Alexander Tuisov, Evgeny Mishlyakov, Alexander Shleyfman and Erez Karpas
Boltzmann-based Exploration for Robust Decentralized Multi-Agent Planning
Nhat Nguyen, Duong Nguyen, Gianluca Rizzo and Hung Nguyen
Discrete-Guided Diffusion for Scalable and Safe Multi-Robot Motion Planning
Jinhao Liang, Sven Koenig and Ferdinando Fioretto
A Constraint Formulation for Domain Repair with Ground or Lifted Test Plans
Nika Beriachvili and Arthur Bit-Monnot
Automated Planning Instance Generation with Neuro-Symbolic AI
Carlos Núñez-Molina, Pablo Mesejo and Juan Fernández-Olivares
Optimal Solutions for the Moving Target Vehicle Routing Problem via Branch-and-Price with Relaxed Continuity
Anoop Bhat, Geordan Gutow, Zhongqiang Ren, Sivakumar Rathinam and Howie Choset
Optimal Path Planning in Hostile Environments
Andrzej Kaczmarczyk, Šimon Schierreich, Nicholas Axel Tanujaya and Haifeng Xu
Afternoon Session 2
Session 3B: Planning under Uncertainty and Non-Determinism (FOND, POMDPs, Abstractions)
Leveraging the Value of Information in POMDP Planning
Zakariya Laouar, Qi Heng Ho and Zachary Sunberg
Memory Assignment for Finite-Memory Strategies in Adversarial Patrolling Games
Vojtěch Kůr, Vít Musil and Vojtěch Řehák
Planning under Distribution Shifts with Causal POMDPs
Matteo Ceriscioli and Karthika Mohan
Algorithms for Deciding the Safety of States in Fully Observable Non-deterministic Problems
Johannes Schmalz and Chaahat Jain
Constrained and Robust Policy Synthesis with Satisfiability-Modulo-Probabilistic-Model-Checking
Linus Heck, Filip Macák, Milan Češka and Sebastian Junges
Session 3A: Routing and Scheduling
Scalable Algorithms with Provable Optimality Bounds for the Multiple Watchman Route Problem
Srikar Gouru, Ariel Felner and Jiaoyang Li
H-ANTS: Hierarchical Ant System with Insert-and-Prune Charging for Capacitated Electric Vehicle Routing
Chuyin Peng, Feng-Feng Wei and Wei-Neng Chen
EMOA*: A Framework for Search-Based Multi-Objective Path Planning
Zhongqiang Ren, Carlos Hernández, Maxim Likhachev, Ariel Felner, Sven Koenig, Oren Salzman, Sivakumar Rathinam and Howie Choset
Learning-Guided Simulated Annealing for the Capacitated Vehicle Routing Problem
Jules Andretti, Jérémie Cabessa and Yann Strozecki
GammaZero: Learning to Guide Belief-Space Search for Long-Horizon POMDPs with Generalizable Graph Representations
Rajesh Mangannavar and Prasad Tadepalli
AUPO – Abstracted Until Proven Otherwise: A Reward Distribution Based Abstraction Algorithm
Robin Schmöcker, Alexander Dockhorn and Bodo Rosenhahn
Multi-Neighborhood Simulated Annealing for the Oven Scheduling Problem
Francesca Da Ros, Luca Di Gaspero, Marie-Louise Lackner, Nysret Musliu and Felix Winter
Learning Distributed Scheduling via LLM-Augmented Reinforcement Learning
Yun Liu, Yuqi Feng, Jiahao Fan, Shangce Gao and Yanan Sun
Poster/Demo Session & Industry Forum

Wednesday, July 1, 2026 — Main Conference Day 2 ↑ Back to Navigation

Morning Session
Session 4A: Classical Planning II and Dynamic Programming
Planning as Goal Recognition: Deriving Heuristics from Intention Models
Giacomo Rosa, Jean Honorio, Nir Lipovetzky and Sebastian Sardina
Policy Comparison Oracles for Action Policy Testing
Ben Sievers, Jan Eisenhut and Jörg Hoffmann
Counting and Reasoning with Plans
David Speck, Markus Hecher, Daniel Gnad, Johannes K. Fichte and Augusto B. Corrêa
Finding Optimal Cost-Bounded Plan Reductions
Martha Del Toro, Raquel Fuentetaja and Ángel García-Olaya
Session 4B: Human-Aware Planning
MO-VLA: Preference Adaptation for Vision-Language-Action Models via Multi-Objective Reinforcement Learning
Yan Yang, Mingxuan Jing and Yuquan Wu
How Humans Explain the Difference in the Quality of Plans — A User Study
Benjamin Krarup, Amanda Coles, Dancheng Gao, Derek Long and David Smith
Finding Human-Aligned Abstractions Efficiently for Explaining Plan Quality Differences
Benjamin Krarup, Amanda Coles, Derek Long and David Smith
Domain-Independent Dynamic Programming with Constraint Propagation
Imko Marijnissen, Christopher Beck, Emir Demirović and Ryo Kuroiwa
Operator-Counting Heuristics for Domain-Independent Dynamic Programming
Anubhav Singh, Florian Pommerening, Tanja Schindler, J. Christopher Beck and Malte Helmert
When both Grounding and not Grounding are Bad — A Partially Grounded Encoding of Planning into SAT
João Sá and Gregor Behnke
Markovian Models Anxious to Stay on the Beaten Path: A Psychology-Grounded Approach to Minimising Exposure to Path Uncertainty
Loïs Vanhée and Anais de Graaf
Compiling Model Reconciliation Explanation Problems into Stackelberg and FOND Planning Problems
Sarath Sreedharan and Pascal Bercher
Proactive Assistance Agent with Online Goal Recognition
Qihao Shen, Guang Hu and Chenyuan Zhang
Afternoon Session
Session 5A: Temporal and Numeric Planning
Compiling Expressive Planning With Data Types
Joan Espasa Arxer, Mateu Villaret, Ian Miguel and Carla Davesa Sureda
On-Demand Mutex Constraints for Numeric Planning as SMT
Joan Espasa Arxer, Miquel Bofill, Mateu Villaret and Mustafa Faisal
Compiling Temporal Numeric Planning into Discrete PDDL+
Andrea Micheli, Enrico Scala and Alessandro Valentini
Subgoaling Relaxation-Based Heuristics for Numeric Planning with Infinite Actions
Ángel Aso-Mollar, Diego Aineto, Enrico Scala and Eva Onaindia
Cartesian Abstraction Refinement for Simple Numeric Planning
Tanja Schindler, David Speck and Malte Helmert
Symbolic Pattern Planning
Matteo Cardellini, Enrico Giunchiglia and Marco Maratea
PING: A Physics-Informed Neuro-Symbolic Generator for Continuous-Time Planning
Mahyar Jahani Nasab, Hamid Rezatofighi, Mor Vered and Buser Say
Session 5B: Learning and Planning
Sample-Efficient Hypergradient Estimation for Decentralized Bi-Level Reinforcement Learning
Mikoto Kudo, Takumi Tanabe, Akifumi Wachi and Youhei Akimoto
Mitigating Deception and Interference in Online Goal Recognition Systems
Lorenzo Serina, Mattia Chiari, Matteo Olivato, Luca Putelli, Nicholas Rossetti, Ivan Serina and Alfonso Emilio Gerevini
Relational Neurosymbolic Markov Models
Lennert De Smet, Gabriele Venturato, Luc De Raedt and Giuseppe Marra
Beyond Hard Constraints: Budget-Conditioned Reachability for Safe Offline Reinforcement Learning
Janaka Brahmanage and Akshat Kumar
Per-Domain Generalizing Policies: On Learning Efficient and Robust Q-Value Functions
Nicola J. Müller, Moritz Oster, Isabel Valera, Jörg Hoffmann and Timo P. Gros
QSIM: Mitigating Overestimation in Multi-Agent Reinforcement Learning via Action Similarity Weighted Q-Learning
Yuanjun Li, Bin Zhang, Hao Chen, Zhouyang Jiang, Dapeng Li and Zhiwei Xu
Beyond Message Passing: Modern GNN Architectures for Online Planner Selection
Jana Vatter, Ruben Mayer, Hans-Arno Jacobsen, Horst Samulowitz and Michael Katz
Community Meeting and Awards
Conference Banquet — Guinness Storehouse (Buses depart Conference Hotel at 19:15)

Thursday, July 2, 2026 — Main Conference Day 3 ↑ Back to Navigation

Morning Session
Session 6A: Complexity
Reversibility and Reachability in HTN Planning: Formalization and Computational Complexities in the Totally-Ordered Setting
Jakub Med, Mohammad Yousefi, Lukas Chrpa and Pascal Bercher
I Always Told My Mom That Order Is Overrated: Unordered HTN Planning is in PSPACE and Models Problems Beyond STRIPS
Pascal Lauer, Yifan Zhang, Patrik Haslum and Pascal Bercher
PDDL Axioms Are Equivalent to Least Fixed Point Logic
Claudia Grundke and Gabriele Röger
Computing Planning Width: How Hard is it, Really?
Jiajia Song, Seeun William Umboh, Malte Helmert, Nir Lipovetzky and Sebastian Sardina
Relaxing is Hard: Complexity Results for Lifted Partial Order Causal Link Planning
Harrison Oates and Pascal Bercher
Complexity Results for Fixing Classical Models Using LTL to Express Which Solutions Are (Un)Desired
Huanghua Sheng and Pascal Bercher
Session 6B: Robotics
Interleaving Scheduling and Motion Planning with Incremental Learning of Symbolic Space-Time Motion Abstractions
Elisa Tosello, Arthur Bit-Monnot, Davide Lusuardi, Alessandro Valentini and Andrea Micheli
ACDC: Adaptive Curriculum Planning with Dynamic Contrastive Control for Goal-Conditioned Reinforcement Learning in Robotic Manipulation
Xuerui Wang, Guangyu Ren, Tianhong Dai, Bintao Hu, Shuangyao Huang, Wenzhang Zhang and Hengyan Liu
SaferSAC: A Deep Reinforcement Learning Framework for Autonomous Obstacle Avoidance Navigation in UAVs
Kaibo Su and Kun Zhu
DGV: Fusing Dynamic Graphs and Vision-Language Models for Collaborative Dual-Arm Task Planning
Yapeng Pang, Junjie Xu, Zhidong Qiao, Peng Du and Xinyu Zhang
Grounding Vision and Language to 3D Masks for Long-Horizon Box Rearrangement
Ashish Malik, Caleb Lowe, Aayam Shrestha, Stefan Lee, Fuxin Li and Alan Fern
Temporally Decoupled Diffusion Planning for Autonomous Driving
Xiang Li, Bikun Wang, John Zhang and Jianjun Wang
Afternoon Session 1
Session 7A: Agentic AI, Gen AI, and Foundation Models for Planning
Self-Improvement for Fast, High-Quality Plan Generation
Robert Gieselmann, Henrike von Huelsen, Mihai Samson, Marie-Christine Meyer, Dariusz Piotrowski, Oleksandr Radomskyi, Justin Okamoto, Turan Gojayev, Michael Painter, Gavin Brown, Federico Pecora and Jeremy Wyatt
Automating Thought of Search: A Journey Towards Soundness and Completeness
Daniel Cao, Michael Katz, Harsha Kokel, Kavitha Srinivas and Shirin Sohrabi
Planning in the LLM Era: Building for Reliability and Efficiency
Michael Katz, Harsha Kokel, Kavitha Srinivas and Shirin Sohrabi
Revisiting Tree Search for LLMs: Gumbel and Sequential Halving for Budget-Scalable Reasoning
Leonid Ugadiarov, Yuri Kuratov, Aleksandr Panov and Alexey Skrynnik
GenePlan: Evolving Better Generalized PDDL Plans using Large Language Models
Andrew Murray, Danial Dervovic, Alberto Pozanco and Michael Cashmore
Improved Generalized Planning with LLMs through Strategy Refinement and Reflection
Katharina Stein, Nils Hodel, Daniel Fišer, Jörg Hoffmann, Michael Katz and Alexander Koller
Successor-Generator Planning with LLM-generated Heuristics
Alexander Tuisov, Yonatan Vernik and Alexander Shleyfman
Session 7B: MAPF
db-LaCAM: Fast and Scalable Multi-Robot Kinodynamic Motion Planning with Discontinuity-Bounded Search and Lightweight MAPF
Akmaral Moldagalieva, Keisuke Okumura, Amanda Prorok and Wolfgang Hoenig
Polynomial-Time Configuration Generator for Connected Unlabeled Multi-Agent Pathfinding
Takahiro Suzuki and Keisuke Okumura
LaCAM* Variants for Minimizing Makespan in Multi-Agent Path Finding
Omer Idgar, Dor Atzmon and Ariel Felner
Enhancing Lifelong Multi-Agent Path-Finding by Using Artificial Potential Fields
Arseni Pertzovskiy, Roni Stern, Ariel Felner and Roie Zivan
Sampling-Based Multi-Agent Path Planning Guided by Spatio-Temporal Logic Mission Objectives
Vidisha Kudalkar, Sujit Ponguluri, Anand Balakrishnan and Jyotirmoy Deshmukh
Dynamic Shelf Arrangement and Task Assignment with Stable Matching for Multi-Agent Pickup and Delivery with Multi-Item Packing Problem
Yosuke Fujisawa, Yusaku Wakasugi, Kazuya Nakazawa, Ryo Matsubara and Toshiharu Sugawara
Analyzing Planner Design Trade-Offs for MAPF under Realistic Simulation
Jingtian Yan, Zhifei Li, William Kang, Stephen Smith and Jiaoyang Li
Afternoon Session 2
Session 8A: Plan Execution under Uncertainty
Incremental LTLf Synthesis
Giuseppe De Giacomo, Yves Lespérance, Gianmarco Parretti, Fabio Patrizi and Moshe Y. Vardi
Robust Crop Planning under Uncertainty: Aligning Economic Optimality with Agronomic Sustainability
Runhao Liu, Ziming Chen, You Li and Peng Zhang
Optimal Clifford Synthesis as Planning
Irfansha Shaik and Jaco van de Pol
Complete and Optimal Robust Planning against Nature
Lukas Chrpa and Erez Karpas
Session 8B: Applications II
Fully Packed and Ready to Go: High-Density, Rearrangement-Free, Grid-Based Storage and Retrieval
Tzvika Geft, Kostas Bekris and Jingjin Yu
Automated Planning for Production Routines in Semiconductor Manufacturing
Gianluca Zavan, Konstantin Schekotihin and Thomas Langreiter
Rating Composite AI Models for Robustness Through Probabilistic Planning
Kausik Lakkaraju, Sunandita Patra, Parisa Zehtabi and Biplav Srivastava
RASO: Role-Aware Shared Reflection for Multi-Agent Orchestration in E-Commerce Long-Horizon Planning
Kangjia Niu, Yanning Zhang, Xiuchong Wang, Chennan Ma, Siqi Hong, Hankz Hankui Zhuo, Junxiong Zhu and Bo Zheng
The conference will finish no later than 17:00 on Thursday, July 2.