Search

Search Results

• Pseudo-Boolean Proof Logging for Optimal Classical Planning

  Simon Dold, Malte Helmert, Jakob Nordström, Gabriele Röger, Tanja Schindler

  54-63

  2025-09-16

• Tight Bounds for Lifted HTN Plan Verification and Bounded Plan Existence

  Pascal Lauer, Songtuan Lin, Pascal Bercher

  64-73

  2025-09-16

• Continuing the Quest for Polynomial Time Heuristics in PDDL Input Size: Tractable Cases for Lifted hᵃᵈᵈ

  Pascal Lauer, Álvaro Torralba, Daniel Höller, Jörg Hoffmann

  74-83

  2025-09-16

• 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

  84-92

  2025-09-16

• Platform-Aware Mission Planning

  Stefan Panjkovic, Alessandro Cimatti, Andrea Micheli, Stefano Tonetta

  93-101

  2025-09-16

• On the Notion of Plan Quality for PDDL+

  Francesco Percassi, Enrico Scala, Mauro Vallati

  102-111

  2025-09-16

• How Good is Perfect? On the Incompleteness of A* for Total-Order HTN Planning

  Mohammad Yousefi, Mario Schmautz, Patrik Haslum, Pascal Bercher

  112-120

  2025-09-16

• Going Topological in Multi-risk Extended Markov Ratio Decision Processes

  Alexander Zadorojniy, Orit Davidovich, Takayuki Osogami

  121-129

  2025-09-16

• Parallelizing Multi-objective A* Search

  Saman Ahmadi, Nathan R. Sturtevant, Andrea Raith, Daniel Harabor, Mahdi Jalili

  131-139

  2025-09-16

• Cost-Optimal FOND Planning as Bi-Objective Best-First Search

  Diego Aineto, Enrico Scala

  140-148

  2025-09-16

• A Sampling Approach to Planning with Infinite Domain Control Variables

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

  149-153

  2025-09-16

• Learning Efficiency Meets Symmetry Breaking

  Yingbin Bai, Sylvie Thiébaux, Felipe Trevizan

  154-159

  2025-09-16

• Instance-based Approximation Guarantees for Graph-based Nearest Neighbor Search

  Yannick Bosch, Sabine Storandt

  160-168

  2025-09-16

• On Generating Robust Plans and Linear Execution Strategies in Planning Against Nature

  Lukáš Chrpa, Erez Karpas

  169-177

  2025-09-16

• Alternation-Based Novelty Search

  Augusto B. Corrêa, Jendrik Seipp

  178-182

  2025-09-16

• On Picking Good Policies: Leveraging Action-Policy Testing in Policy Training

  Jan Eisenhut, Daniel Fišer, Isabel Valera, Jörg Hoffmann

  183-188

  2025-09-16

• Learning Lifted STRIPS Models from Action Traces alone: A Simple, General, and Scalable Solution

  Jonas Gösgens, Niklas Jansen, Hector Geffner

  189-197

  2025-09-16

• 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

  198-203

  2025-09-16

• Chasing Progress, Not Perfection: Revisiting Strategies for End-to-End LLM Plan Generation

  Sukai Huang, Trevor Cohn, Nir Lipovetzky

  204-212

  2025-09-16

• Safe Interval Randomized Path Planning For Manipulators

  Nuraddin Kerimov, Aleksandr Onegin, Konstantin Yakovlev

  213-217

  2025-09-16

• Potential Heuristics: Weakening Consistency Constraints

  Pascal Lauer, Daniel Fišer

  218-222

  2025-09-16

• Strategies to Improve Goal Selection in Satisficing Oversubscription Planning

  Ángel García Olaya, Patricia J. Riddle, Michael Barley

  223-227

  2025-09-16

• Landmark Generation in HTN Planning Revisited

  Victor Scherer Putrich, Felipe Meneguzzi, André Grahl Pereira

  228-235

  2025-09-16

• SibylSatOpt: a MaxSAT-based Greedy Optimal Search for TOHTN Planning

  Gaspard Quenard, Damien Pellier, Humbert Fiorino

  236-244

  2025-09-16

• On Using Lazy Greedy Best-First Search with Subgoaling Relaxation in Numeric Planning Problems

  Enrico Scala, Luigi Bonassi

  245-249

  2025-09-16