| 2025 | Potential Heuristics: Weakening Consistency Constraints. | Pascal Lauer, Daniel Fiser |
| 2025 | HDDLGym: A Tool for Studying Multi-Agent Hierarchical Problems Defined in HDDL with OpenAI Gym. | Ngoc La, Ruaridh Mon-Williams, Julie A. Shah |
| 2025 | Safe Interval Randomized Path Planning For Manipulators. | Nuraddin Kerimov, Aleksandr Onegin, Konstantin S. Yakovlev |
| 2025 | Chasing Progress, Not Perfection: Revisiting Strategies for End-to-End LLM Plan Generation. | Sukai Huang, Trevor Cohn, Nir Lipovetzky |
| 2025 | Frontmatter. | Daniel Harabor, Nir Lipovetzky, Miquel Ramrez, Sebastian Sardia |
| 2025 | Per-Domain Generalizing Policies: On Validation Instances and Scaling Behavior. | Timo P. Gros, Nicola J. Mller, Daniel Fiser, Isabel Valera, Verena Wolf, Jrg Hoffmann |
| 2025 | On the Gains from Using Action Observations in Domain Repair. | Alba Gragera, Raquel Fuentetaja, ngel Garca Olaya, Fernando Fernndez |
| 2025 | Learning Lifted STRIPS Models from Action Traces alone: A Simple, General, and Scalable Solution. | Jonas Gsgens, Niklas Jansen, Hector Geffner |
| 2025 | LTLf Adaptive Synthesis for Multi-Tier Goals in Nondeterministic Domains. | Giuseppe De Giacomo, Gianmarco Parretti, Shufang Zhu |
| 2025 | On Picking Good Policies: Leveraging Action-Policy Testing in Policy Training. | Jan Eisenhut, Daniel Fiser, Isabel Valera, Jrg Hoffmann |
| 2025 | Pseudo-Boolean Proof Logging for Optimal Classical Planning. | Simon Dold, Malte Helmert, Jakob Nordstrm, Gabriele Rger, Tanja Schindler |
| 2025 | Hardness of Chosen Length Planning Games and Regular Fixed Methods FOND HTN Planning. | Maurice Dekker, Gregor Behnke |
| 2025 | Alternation-Based Novelty Search. | Augusto B. Corra, Jendrik Seipp |
| 2025 | Delete-Free Planning with Object Creation is Undecidable. | Augusto B. Corra |
| 2025 | On Generating Robust Plans and Linear Execution Strategies in Planning Against Nature. | Luks Chrpa, Erez Karpas |
| 2025 | A Formalism for Optimal Search with Dynamic Heuristics. | Remo Christen, Florian Pommerening, Clemens Bchner, Malte Helmert |
| 2025 | On Planning Through LLMs. | Mattia Chiari, Luca Putelli, Nicholas Rossetti, Ivan Serina, Alfonso Emilio Gerevini |
| 2025 | New Exact Methods for Solving Quadratic Traveling Salesman Problem. | Yuxiao Chen, Anubhav Singh, Ryo Kuroiwa, J. Christopher Beck |
| 2025 | Rack Position Optimization in Large-Scale Heterogeneous Data Centers. | Chang-Lin Chen, Jiayu Chen, Tian Lan, Zhaoxia Zhao, Hongbo Dong, Vaneet Aggarwal |
| 2025 | Initial Condition Retrieving for Hybrid and Numeric Planning Problems. | Matteo Cardellini, Francesco Percassi, Marco Maratea, Mauro Vallati |
| 2025 | Instance-based Approximation Guarantees for Graph-based Nearest Neighbor Search. | Yannick Bosch, Sabine Storandt |
| 2025 | Learning Efficiency Meets Symmetry Breaking. | Yingbin Bai, Sylvie Thibaux, Felipe W. Trevizan |
| 2025 | Is This Plan Necessarily Redundant? On the Computational Complexity of Unobserved Domain Learning. | Pascal Bachor, Maurice Dekker, Gregor Behnke |
| 2025 | A Sampling Approach to Planning with Infinite Domain Control Variables. | ngel Aso-Mollar, Diego Aineto, Enrico Scala, Eva Onaindia |
| 2025 | Cost-Optimal FOND Planning as Bi-Objective Best-First Search. | Diego Aineto, Enrico Scala |