List of Papers Accepted to ICAPS 2025

Primary Keywords

Applications

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]

Rack Position Optimization in Large-Scale Heterogeneous Data Centers

[Chang-Lin Chen Jiayu Chen Tian Lan Zhaoxia Zhao Hongbo Dong Vaneet Aggarwal]

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]

Posthoc: The Visualisation Platform for Search

[Kevin Zheng Daniel Harabor Michael Wybrow]

Analyzing Launch Operations using the Spaceport Throughput Analysis Resource (STAR)

[Jeremy Frank Richard Levinson Vijayakumar Baskaran Jeffrey S Brink]

DynTaskMAS: A Dynamic Task Graph-driven Framework for Asynchronous and Parallel LLM-based Multi-Agent Systems

[Junwei Yu Yepeng Ding Hiroyuki Sato]

HDDLGym: A Tool for Studying Multi-Agent Hierarchical Problems Defined in HDDL with OpenAI Gym

[Ngoc La Ruaridh Mon-Williams Julie Shah]

Robotics and Control Theory

A* for Bounding Shortest Paths in the Graphs of Convex Sets

[Kaarthik Sundar Sivakumar Rathinam]

Safe Interval Randomized Path Planinng For Manipulators

[Nuraddin Kerimov Aleksandr Onegin Konstantin Yakovlev]

Abstract Models

New Exact Methods for Solving Quadratic Traveling Salesman Problem

[Yuxiao Chen Anubhav Singh Ryo Kuroiwa Chris Beck]

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

[Mohammad Yousefi Mario Schmautz Patrik Haslum Pascal Tobias Bercher]

A Formalism for Optimal Search with Dynamic Heuristics

[Remo Christen Florian Pommerening Clemens Büchner Malte Helmert]

Pseudo-Boolean Proof Logging for Optimal Classical Planning

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

Delete-Free Planning with Object Creation is Undecidable

[Augusto B. Corrêa]

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

[Diego Aineto Enrico Scala]

Parallelizing Multi-objective A* Search

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

Partially Observable Monte-Carlo Graph Search

[YANG YOU Vincent Thomas Alex Schutz Robert Skilton Nick Hawes Olivier Buffet]

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]

Strategies to Improve Goal Selection in Satisficing Oversubscription Planning

[Angel Garcia Olaya Patricia J. Riddle Mike Barley]

Going Topological in Multi-risk Extended Markov Ratio Decision Processes

[Alexander Zadorojniy Orit Davidovich Takayuki Osogami]

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

[Enrico Scala Luigi Bonassi]

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

[Lukas Chrpa Erez Karpas]

Automating the Generation of Prompts for LLM-based Action Choice in PDDL Planning

[Katharina Stein Daniel Fišer Jörg Hoffmann Alexander Koller]

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

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

Platform-Aware Mission Planning

[Stefan Panjkovic Alessandro Cimatti Andrea Micheli Stefano Tonetta]

Potential Heuristics: Weakening Consistency Constraints

[Pascal Lauer Daniel Fišer]

Observation Adaptation via Annealed Importance Resampling for Partially Observable Markov Decision Processes

[Yunuo Zhang Baiting Luo Ayan Mukhopadhyay Abhishek Dubey]

Tight Bounds for Lifted HTN Plan Verification and Bounded Plan Existence

[Pascal Lauer S.T. Lin Pascal Tobias Bercher]

Alternation-Based Novelty Search

[Augusto B. Corrêa Jendrik Seipp]

Landmark Generation in HTN Planning Revisited

[Victor Scherer Putrich Felipe Meneguzzi André Grahl Pereira]

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]

Hardness of Chosen Length Planning Games and Regular Fixed Methods FOND HTN Planning

[P. Maurice Dekker Gregor Behnke]

On the Notion of Plan Quality for PDDL+

[Francesco Percassi Enrico Scala Mauro Vallati]

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]

Agent Planning Programs as Non-deterministic Planning under Fairness

[Nitin Yadav Sebastian Sardina Hector Geffner]

A Sampling Approach to Planning with Infinite Domain Control Variables

[Ángel Aso-Mollar Diego Aineto Enrico Scala Eva Onaindia]

Initial Condition Retrieving for Hybrid and Numeric Planning Problems

[Matteo Cardellini Francesco Percassi Marco Maratea Mauro Vallati]

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

[Gaspard Quenard Damien Pellier Humbert FIORINO]

Machine Learning

Leveraging Action Relational Structures for Integrated Learning and Planning

[Ryan Xiao Wang Felipe Trevizan]

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]

Rack Position Optimization in Large-Scale Heterogeneous Data Centers

[Chang-Lin Chen Jiayu Chen Tian Lan Zhaoxia Zhao Hongbo Dong Vaneet Aggarwal]

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

[Jonas Gösgens Niklas Jansen Hector Geffner]

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

[Sukai Huang Nir Lipovetzky]

Automating the Generation of Prompts for LLM-based Action Choice in PDDL Planning

[Katharina Stein Daniel Fišer Jörg Hoffmann Alexander Koller]

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

[Yannick Bosch Sabine Storandt]

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

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

Learning Efficiency Meets Symmetry Breaking

[Yingbin Bai Sylvie Thiebaux Felipe Trevizan]

On Planning Through LLMs

[Mattia Chiari Luca Putelli Nicholas Rossetti Ivan Serina Alfonso Gerevini]

HDDLGym: A Tool for Studying Multi-Agent Hierarchical Problems Defined in HDDL with OpenAI Gym

[Ngoc La Ruaridh Mon-Williams Julie Shah]

Knowledge Engineering

Quality Diversity for Variational Quantum Circuit Optimization

[Maximilian Zorn Jonas Stein Maximilian Balthasar Mansky Philipp Altmann Michael Kölle Claudia Linnhoff-Popien]

On the Gains from Using Action Observations in Domain Repair

[Alba Gragera Raquel Fuentetaja Angel Garcia Olaya Fernando Fernández]

Is This Plan Necessarily Redundant? On the Computational Complexity of Unobserved Domain Learning

[Pascal Bachor P. Maurice Dekker Gregor Behnke]

Knowledge Engineering for Planning and Scheduling in the LLM Era

[Mauro Vallati Roman Barták Lukas Chrpa Thomas Leo McCluskey Ron Petrick]

HTN Plan Repair Algorithms Compared: Strengths and Weaknesses of Different Methods

[Paul Zaidins Robert P. Goldman Ugur Kuter Dana S. Nau Mark Roberts]

LTLf Adaptive Synthesis for Multi-Tier Goals in Nondeterministic Domains

[Giuseppe De Giacomo Gianmarco Parretti Shufang Zhu]

Initial Condition Retrieving for Hybrid and Numeric Planning Problems

[Matteo Cardellini Francesco Percassi Marco Maratea Mauro Vallati]