List of Papers Accepted to ICAPS 2026

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

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

Rating Composite AI Models for Robustness Through Probabilistic Planning

Kausik Lakkaraju, Sunandita Patra, Parisa Zehtabi and Biplav Srivastava

LaCAM* Variants for Minimizing Makespan in Multi-Agent Path Finding

Omer Idgar, Dor Atzmon and Ariel Felner

Complete and Optimal Robust Planning against Nature

Lukas Chrpa and Erez Karpas

Relaxing is Hard: Complexity Results for Lifted Partial Order Causal Link Planning

Harrison Oates and Pascal Bercher

Domain-Independent Dynamic Programming with Constraint Propagation

Imko Marijnissen, Christopher Beck, Emir Demirović and Ryo Kuroiwa

AUPO - Abstracted until proven otherwise: A reward distribution based abstraction algorithm

Robin Schmöcker, Alexander Dockhorn and Bodo Rosenhahn

Beyond Hard Constraints: Budget-Conditioned Reachability For Safe Offline Reinforcement Learning

Janaka Brahmanage and Akshat Kumar

Robust Crop Planning under Uncertainty: Aligning Economic Optimality with Agronomic Sustainability

Runhao Liu, Ziming Chen, You Li and Peng Zhang

Algorithms for Deciding the Safety of States in Fully Observable Non-deterministic Problems

Johannes Schmalz and Chaahat Jain

Sample-Efficient Hypergradient Estimation for Decentralized Bi-Level Reinforcement Learning

Mikoto Kudo, Takumi Tanabe, Akifumi Wachi and Youhei Akimoto

Complexity Results for Fixing Classical Models Using LTL to Express Which Solutions Are (Un)Desired

Huanghua Sheng and Pascal Bercher

Domain Model Acquisition From Binary Traces

Arash Haratian, Arnaud Lequen, Daniel Gnad and Jendrik Seipp

Continual Learning 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

Simplifying Planning Tasks with Fact-Level Relevance Analysis

Cameron Allen, Anita de Mello Koch, Harsha Kokel, George Konidaris and Michael Katz

Deep RL for Fast Long-Horizon Operations Scheduling on NASA’s Carruthers Geocorona Observatory Mission

Alex Zhang, Jackson Craig and Lara Waldrop

Planning in the LLM Era: Building for Reliability and Efficiency

Michael Katz, Harsha Kokel, Kavitha Srinivas and Shirin Sohrabi

Automating Thought of Search: A Journey Towards Soundness and Completeness

Daniel Cao, Michael Katz, Harsha Kokel, Kavitha Srinivas and Shirin Sohrabi

Risk-Bounded Multi-Agent Visual Navigation via Iterative Risk Allocation

Viraj Parimi and Brian Williams

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

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

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

Planning as Goal Recognition: Deriving Heuristics from Intention Models

Giacomo Rosa, Jean Honorio, Nir Lipovetzky and Sebastian Sardina

H-ANTS: Hierarchical Ant System with Insert-and-Prune Charging for Capacitated Electric Vehicle Routing

Chuyin Peng, Feng-Feng Wei and Wei-Neng Chen

Incremental LTLf Synthesis

Giuseppe De Giacomo, Yves Lespérance, Gianmarco Parretti, Fabio Patrizi and Moshe Y. Vardi

GenePlan: Evolving Better Generalized PDDL Plans using Large Language Models

Andrew Murray, Danial Dervovic, Alberto Pozanco and Michael Cashmore

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

MO-VLA: Preference Adaptation for Vision-Language-Action Models via Multi-Objective Reinforcement Learning

Yan Yang, Mingxuan Jing and Yuquan Wu

Temporally Decoupled Diffusion Planning for Autonomous Driving

Xiang Li, Bikun Wang, John Zhang and Jianjun Wang

SaferSAC: A Deep Reinforcement Learning Framework for Autonomous Obstacle Avoidance Navigation in UAVs

Kaibo Su and Kun Zhu

Potential Heuristics as Real-Valued Multilinear Polynomials

Augusto B. Corrêa, Simon Dold and Malte Helmert

Planning with Minimal Disruption

Alberto Pozanco, Marianela Morales, Daniel Borrajo and Manuela Veloso

Compiling Temporal Numeric Planning into Discrete PDDL+

Andrea Micheli, Enrico Scala and Alessandro Valentini

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

When both Grounding and not Grounding are Bad -- A Partially Grounded Encoding of Planning into SAT

João Sá and Gregor Behnke

Fully Packed and Ready to Go: High-Density, Rearrangement-Free, Grid-Based Storage and Retrieval

Tzvika Geft, Kostas Bekris and Jingjin Yu

On Sample-Efficient Generalized Planning via Learned Transition Models

Nitin Gupta, Vishal Pallagani, John A. Aydin and Biplav Srivastava

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

Enhancing Lifelong Multi-Agent Path-finding by Using Artificial Potential Fields

Arseni Pertzovskiy, Roni Stern, Ariel Felner and Roie Zivan

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

PING: A Physics‑Informed Neuro‑Symbolic Generator for Continuous‑Time Planning

Mahyar Jahani Nasab, Hamid Rezatofighi, Mor Vered and Buser Say

Policy Comparison Oracles for Action Policy Testing

Ben Sievers, Jan Eisenhut and Jörg Hoffmann

Scalable Algorithms with Provable Optimality Bounds for the Multiple Watchman Route Problem

Srikar Gouru, Ariel Felner and Jiaoyang Li

Planning under Distribution Shifts with Causal POMDPs

Matteo Ceriscioli and Karthika Mohan

Learning Distributed Scheduling via LLM-Augmented Reinforcement Learning

Yun Liu, Yuqi Feng, Jiahao Fan, Shangce Gao and Yanan Sun

Boltzmann-based Exploration for Robust Decentralized Multi-Agent Planning

Nhat Nguyen, Duong Nguyen, Gianluca Rizzo and Hung Nguyen

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

Learning Numeric Action Models with Anytime Guarantees

Diego Aineto and Enrico Scala

Proactive Assistance Agent with Online Goal Recognition

Qihao Shen, Guang Hu and Chenyuan Zhang

Learning-Guided Simulated Annealing for the Capacitated Vehicle Routing Problem

Jules Andretti, Jérémie Cabessa and Yann Strozecki

Monotonic Variants of Saturated Cost Partitioning

Mauricio Salerno, Raquel Fuentetaja and Jendrik Seipp

On-Demand Mutex Constraints for Numeric Planning as SMT

Joan Espasa Arxer, Miquel Bofill, Mateu Villaret and Mustafa Faisal

Compiling Expressive Planning With Data Types

Joan Espasa Arxer, Mateu Villaret, Ian Miguel and Carla Davesa Sureda

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

PDDL Axioms Are Equivalent to Least Fixed Point Logic

Claudia Grundke and Gabriele Röger

Finding Optimal Cost-Bounded Plan Reductions

Martha Del Toro, Raquel Fuentetaja and Ángel García-Olaya

A Constraint Formulation for Domain Repair with Ground or Lifted Test Plans

Nika Beriachvili and Arthur Bit-Monnot

Near-Future Traffic Forecasting for Planning-based Traffic Signal Optimisation

Mattia Chiari, Francesco Percassi, Alfonso Emilio Gerevini and Mauro Vallati

Successor-Generator Planning with LLM-generated Heuristics

Alexander Tuisov, Yonatan Vernik and Alexander Shleyfman

Automated planning for production routines in semiconductor manufacturing

Gianluca Zavan, Konstantin Schekotihin and Thomas Langreiter

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

Memory Assignment for Finite-Memory Strategies in Adversarial Patrolling Games

Vojtěch Kůr, Vít Musil and Vojtěch Řehák

Beyond Pruning: Leveraging Dominance Relations for Heuristic Propagation

María Fernanda Salerno Garmendia, Daniel Fišer and Álvaro Torralba

Planning under Observation Mismatch for Traffic Signal Control via Adaptive Modular World Models

Zherui Huang, Yicheng Liu, Chumeng Liang and Guanjie Zheng

Finding a Dominating State in a Haystack: Efficient Data Structures for Dominance Pruning

María Fernanda Salerno Garmendia, Daniel Fišer and Álvaro Torralba

Optimal Path Planning in Hostile Environments

Andrzej Kaczmarczyk, Šimon Schierreich, Nicholas Axel Tanujaya and Haifeng Xu

Subgoaling Relaxation-based Heuristics for Numeric Planning with Infinite Actions

Ángel Aso-Mollar, Diego Aineto, Enrico Scala and Eva Onaindia

Operator-Counting Heuristics for Domain-Independent Dynamic Programming

Anubhav Singh, Florian Pommerening, Tanja Schindler, J. Christopher Beck and Malte Helmert

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

Compiling Model Reconciliation Explanation Problems into Stackelberg and FOND Planning Problems

Sarath Sreedharan and Pascal Bercher

Cartesian Abstraction Refinement for Simple Numeric Planning

Tanja Schindler, David Speck and Malte Helmert

GPMS: A Generalized Parallel Machine Scheduling Framework with Rich Temporal and Resource Constraints

Lukas Frühwirth, Christoph Einspieler, Nysret Musliu and Felix Winter

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

Revisiting Tree Search for LLMs: Gumbel and Sequential Halving for Budget-Scalable Reasoning

Leonid Ugadiarov, Yuri Kuratov, Aleksandr Panov and Alexey Skrynnik

Online Learning for Decentralized Multi-Agent Planning in Repeated Hedonic Skill Games

Jaber Valizadeh and Ray Telikani

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

Sampling-Based Multi-Agent Path Planning Guided by Spatio-Temporal Logic Mission Objectives

Vidisha Kudalkar, Sujit Ponguluri, Anand Balakrishnan and Jyotirmoy Deshmukh

Analyzing Planner Design Trade-offs for MAPF under Realistic Simulation

Jingtian Yan, Zhifei Li, William Kang, Stephen Smith and Jiaoyang Li

Worksworld: A Domain for Integrated Numeric Planning and Scheduling of Distributed Pipelined Workflows

Taylor Paul and William Regli

Computing Planning Width: How Hard is it, Really?

Jiajia Song, Seeun William Umboh, Malte Helmert, Nir Lipovetzky and Sebastian Sardina

Learning Lifted Action Models from Unsupervised Visual Traces

Kai Xi, Stephen Gould and Sylvie Thiebaux

Learning-Based Peak Temperature Optimization for Hard Real-Time Pipeline Schedules

Qiangxiao Zhou, Yiheng Wang, Hangbin Xu and Long Cheng

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

Leveraging the Value of Information in POMDP Planning

Zakariya Laouar, Qi Heng Ho and Zachary Sunberg

GammaZero: Learning to Guide Belief-Space Search for Long-Horizon POMDPs with Generalizable Graph Representations

Rajesh Mangannavar and Prasad Tadepalli

Optimal Clifford Synthesis as Planning

Irfansha Shaik and Jaco van de Pol

Reversibility and Reachability in HTN Planning: Formalization and Computational Complexities in the Totally-Ordered Setting

Jakub Med, Mohammad Yousefi, Lukas Chrpa and Pascal Bercher