L1 (10:30 - 10:50) - Platform-Aware Mission Planning Stefan Panjkovic, Alessandro Cimatti, Andrea Micheli, Stefano Tonetta View Paper

L3 (10:50 - 11:10) - Temporal Numeric Planning with Patterns Matteo Cardellini, Enrico Giunchiglia [Previously Published Papers Track]

L5 (11:10 - 11:30) - A Flow Based Planning Method for Multi-Agent Progression with Deployable Agents and Communication Constraints Emile Siboulet, Roland Godet, Arthur Bit-Monnot, Marc-Emmanuel Coupvent des Graviers, Christophe GUETTIER, Simon Lacroix View Paper

L7 (11:30 - 11:50) - Analyzing Launch Operations using the Spaceport Throughput Analysis Resource (STAR) Jeremy Frank, Richard Levinson, Vijayakumar Baskaran, Jeffrey S Brink View Paper

L2 (10:30 - 10:50) - A Formalism for Optimal Search with Dynamic Heuristics Remo Christen, Florian Pommerening, Clemens Büchner, Malte Helmert View Paper

L4 (10:50 - 11:10) - Pseudo-Boolean Proof Logging for Optimal Classical Planning Simon Dold, Malte Helmert, Jakob Nordström, Gabriele Röger, Tanja Schindler View Paper

L6 (11:10 - 11:30) - Delete-Free Planning with Object Creation is Undecidable Augusto B. Corrêa View Paper

L8 (11:30 - 11:50) - Alternation-Based Novelty Search Augusto B. Corrêa, Jendrik Seipp View Paper

See CPAIOR Program for details

L9 (13:30 - 13:50) - On the Gains from Using Action Observations in Domain Repair Alba Gragera, Raquel Fuentetaja, Angel Garcia Olaya, Fernando Fernández View Paper

L11 (13:50 - 14:10) - Strategies to Improve Goal Selection in Satisficing Oversubscription Planning Angel Garcia Olaya, Patricia J. Riddle, Mike Barley View Paper

L13 (14:10 - 14:30) - On Generating Robust Plans and Linear Execution Strategies in Planning Against Nature Lukas Chrpa, Erez Karpas View Paper

L15 (14:30 - 14:50) - Speed vs Accuracy in Goal Recognition for Time-Sensitive Applications: a Game-Theoretic Approach Sara Bernardini, Fabio Fagnani, Santiago Franco [Previously Published Papers Track]

L10 (13:30 - 13:50) - Partially Observable Monte-Carlo Graph Search YANG YOU, Vincent Thomas, Alex Schutz, Robert Skilton, Nick Hawes, Olivier Buffet View Paper

L12 (13:50 - 14:10) - Landmark-Assisted Monte Carlo Planning David H. Chan, Mark Roberts, Dana S. Nau [Previously Published Papers Track]

L14 (14:10 - 14:30) - Cost-Optimal FOND Planning as Bi-Objective Best-First Search Diego Aineto, Enrico Scala View Paper | [Best Paper Award]

L16 (14:30 - 14:50) - Observation Adaptation via Annealed Importance Resampling for Partially Observable Markov Decision Processes Yunuo Zhang, Baiting Luo, Ayan Mukhopadhyay, Abhishek Dubey View Paper

See CPAIOR Program for details

L17 (15:30 - 15:50) - Per-Domain Generalizing Policies: On Validation Instances and Scaling Behavior Timo P. Gros, Nicola J. Müller, Daniel Fišer, Isabel Valera, Verena Wolf, Jörg Hoffmann View Paper

L19 (15:50 - 16:10) - Learning Efficiency Meets Symmetry Breaking Yingbin Bai, Sylvie Thiebaux, Felipe Trevizan View Paper

L21 (16:10 - 16:30) - On Picking Good Policies: Leveraging Action-Policy Testing in Policy Training Jan Eisenhut, Daniel Fišer, Isabel Valera, Jörg Hoffmann View Paper

L18 (15:30 - 15:50) - Quality Diversity for Variational Quantum Circuit Optimization Maximilian Zorn, Jonas Stein, Maximilian Balthasar Mansky, Philipp Altmann, Michael Kölle, Claudia Linnhoff-Popien View Paper

L20 (15:50 - 16:10) - New Exact Methods for Solving Quadratic Traveling Salesman Problem Yuxiao Chen, Anubhav Singh, Ryo Kuroiwa, Chris Beck View Paper

L22 (16:10 - 16:30) - Rack Position Optimization in Large-Scale Heterogeneous Data Centers Chang-Lin Chen, Jiayu Chen, Tian Lan, Zhaoxia Zhao, Hongbo Dong, Vaneet Aggarwal View Paper

See CPAIOR Program for details

L23 (10:30 - 10:50) - Knowledge Engineering for Planning and Scheduling in the LLM Era Mauro Vallati, Roman Barták, Lukas Chrpa, Thomas Leo McCluskey, Ron Petrick View Paper

L25 (10:50 - 11:10) - Revisiting LLMs in Planning from Literature Review: a Semi-Automated Analysis Approach and Evolving Categories Representing Shifting Perspectives Vishal Pallagani, Nitin Gupta, Bharath Chandra Muppasani, Biplav Srivastava View Paper

L27 (11:10 - 11:30) - On Planning Through LLMs Mattia Chiari, Luca Putelli, Nicholas Rossetti, Ivan Serina, Alfonso Gerevini View Paper

L29 (11:30 - 11:50) - Chasing Progress, Not Perfection: Revisiting Strategies for End-to-End LLM Plan Generation Sukai Huang, Trevor Cohn, Nir Lipovetzky View Paper

L24 (10:30 - 10:50) - A Sampling Approach to Planning with Infinite Domain Control Variables Ángel Aso-Mollar, Diego Aineto, Enrico Scala, Eva Onaindia View Paper

L26 (10:50 - 11:10) - Initial Condition Retrieving for Hybrid and Numeric Planning Problems Matteo Cardellini, Francesco Percassi, Marco Maratea, Mauro Vallati View Paper

L28 (11:10 - 11:30) - On the Notion of Plan Quality for PDDL+ Francesco Percassi, Enrico Scala, Mauro Vallati View Paper

L30 (11:30 - 11:50) - A Lazy Approach to Neural Numerical Planning with Control Parameters René Heescha, Alessandro Cimatti, Jonas Ehrhardta, Alexander Diedricha, Oliver Niggemanna [Previously Published Papers Track]

See CPAIOR Program for details

L31 (13:30 - 13:50) - On Using Lazy Greedy Best-First Search with Subgoaling Relaxation in Numeric Planning Problems Enrico Scala, Luigi Bonassi View Paper

L33 (13:50 - 14:10) - A* for Bounding Shortest Paths in the Graphs of Convex Sets Kaarthik Sundar, Sivakumar Rathinam View Paper

L35 (14:10 - 14:30) - Safe Interval Randomized Path Planning For Manipulators Nuraddin Kerimov, Aleksandr Onegin, Konstantin Yakovlev View Paper | [Best Student Paper Award]

L37 (14:30 - 14:50) - State-Based Disassembly Planning Chao Lei, Nir Lipovetzky, Krista A. Ehinger [Previously Published Papers Track]

L32 (13:30 - 13:50) - Hardness of Chosen Length Planning Games and Regular Fixed Methods FOND HTN Planning P. Maurice Dekker, Gregor Behnke View Paper

L34 (13:50 - 14:10) - HTN Plan Repair Algorithms Compared: Strengths and Weaknesses of Different Methods Paul Zaidins, Robert P. Goldman, Ugur Kuter, Dana S. Nau, Mark Roberts View Paper | [Best Paper Award (Honourable Mention)]

L36 (14:10 - 14:30) - Agent Planning Programs as Non-deterministic Planning under Fairness Nitin Yadav, Sebastian Sardina, Hector Geffner View Paper

L38 (14:30 - 14:50) - LTLf Adaptive Synthesis for Multi-Tier Goals in Nondeterministic Domains Giuseppe De Giacomo, Gianmarco Parretti, Shufang Zhu View Paper

See CPAIOR Program for details

L39 (11:00 - 11:20) - Parallelizing Multi-objective A* Search Saman Ahmadi, Nathan R. Sturtevant, Andrea Raith, Daniel Harabor, Mahdi Jalili View Paper | [Best Paper Award]

L41 (11:20 - 11:40) - Parallel Greedy Best-First Search with a Bound on Expansions Relative to Sequential Search Takumi Shimoda, Alex Fukunaga [Previously Published Papers Track]

L43 (11:40 - 12:00) - Instance-based Approximation Guarantees for Graph-based Nearest Neighbor Search Yannick Bosch, Sabine Storandt View Paper

L45 (12:00 - 12:20) - Posthoc: The Visualisation Platform for Search Kevin Zheng, Daniel Harabor, Michael Wybrow View Paper

L40 (11:00 - 11:20) - Leveraging Action Relational Structures for Integrated Learning and Planning Ryan Xiao Wang, Felipe Trevizan View Paper

L42 (11:20 - 11:40) - Is This Plan Necessarily Redundant? On the Computational Complexity of Unobserved Domain Learning Pascal Bachor, P. Maurice Dekker, Gregor Behnke View Paper

L44 (11:40 - 12:00) - Learning Lifted STRIPS Models from Action Traces alone: A Simple, General, and Scalable Solution Jonas Gösgens, Niklas Jansen, Hector Geffner View Paper

L46 (12:00 - 12:20) - Lifted action models learning from partial traces Leonardo Lamanna, Luciano Serafini, Alessandro Saetti, Alfonso Emilio Gerevini, Paolo Traverso [Previously Published Papers Track]

See KR Program for details

L47 (13:30 - 13:50) - How Good is Perfect? On the Incompleteness of A* for Total-Order HTN Planning Mohammad Yousefi, Mario Schmautz, Patrik Haslum, Pascal Tobias Bercher View Paper

L49 (13:50 - 14:10) - Tight Bounds for Lifted HTN Plan Verification and Bounded Plan Existence Pascal Lauer, S.T. Lin, Pascal Tobias Bercher View Paper

L51 (14:10 - 14:30) - Landmark Generation in HTN Planning Revisited Victor Scherer Putrich, Felipe Meneguzzi, André Grahl Pereira View Paper

L53 (14:30 - 14:50) - SibylSatOpt: a MaxSAT-based Greedy Optimal Search for TOHTN Planning Gaspard Quenard, Damien Pellier, Humbert FIORINO View Paper

L48 (13:30 - 13:50) - Going Topological in Multi-risk Extended Markov Ratio Decision Processes Alexander Zadorojniy, Orit Davidovich, Takayuki Osogami View Paper

L50 (13:50 - 14:10) - Howard’s Policy Iteration is Subexponential for Deterministic Markov Decision Problems with Rewards of Fixed Bit-size and Arbitrary Discount Factor Dibyangshu Mukherjee, Shivaram Kalyanakrishnan View Paper

L52 (14:10 - 14:30) - An Improved Lower Bound on the Length of Locally-Improving Policy Sequences in MDPs with Large Action Sets Pratyush Agarwal, Mulinti Shaik Wajid, Shivaram Kalyanakrishnan View Paper

L54 (14:30 - 14:50) - HDDLGym: A Tool for Studying Multi-Agent Hierarchical Problems Defined in HDDL with OpenAI Gym Ngoc La, Ruaridh Mon-Williams, Julie Shah View Paper

See KR Program for details

L55 (15:30 - 15:50) - Potential Heuristics: Weakening Consistency Constraints Pascal Lauer, Daniel Fišer View Paper

L57 (15:50 - 16:10) - Continuing the Quest for Polynomial Time Heuristics in PDDL Input Size: Tractable Cases for Lifted h^{add} Pascal Lauer, Alvaro Torralba, Daniel Höller, Jörg Hoffmann View Paper

L59 (16:10 - 16:30) - Count-Based Novelty Exploration in Classical Planning Giacomo Rosa, Nir Lipovetzky [Previously Published Papers Track]

L56 (15:30 - 15:50) - Automating the Generation of Prompts for LLM-based Action Choice in PDDL Planning Katharina Stein, Daniel Fišer, Jörg Hoffmann, Alexander Koller View Paper

L58 (15:50 - 16:10) - DynTaskMAS: A Dynamic Task Graph-driven Framework for Asynchronous and Parallel LLM-based Multi-Agent Systems Junwei Yu, Yepeng Ding, Hiroyuki Sato View Paper

See KR Program for details