PPaperPicks
← All conferences
Editions20262025

ICAPS 2025

A*

International Conference on Automated Planning and Scheduling

Official site ↗
53
accepted papers
153
authors
November 9-14, 2025
dates
Australia
location

53 / 53 papers

  1. 1
    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
  2. 2
    A Formalism for Optimal Search with Dynamic Heuristics
    Remo Christen
    ,
    Florian Pommerening
    ,
    Clemens Büchner
    ,
    Malte Helmert
  3. 3
    A Sampling Approach to Planning with Infinite Domain Control Variables
    Ángel Aso-Mollar
    ,
    Diego Aineto
    ,
    Enrico Scala
    ,
    Eva Onaindia
  4. 4
    A* for Bounding Shortest Paths in the Graphs of Convex Sets
    Kaarthik Sundar
    ,
    Sivakumar Rathinam
  5. 5
    Agent Planning Programs as Non-deterministic Planning under Fairness
    Nitin Yadav
    ,
    Sebastian Sardiña
    ,
    Hector Geffner
  6. 6
    Alternation-Based Novelty Search
    Augusto B. Corrêa
    ,
    Jendrik Seipp
  7. 7
    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
  8. 8
    Analyzing Launch Operations Using the Spaceport Throughput Analysis Resource (STAR)
    Richard Levinson
    ,
    Vijayakumar Baskaran
    ,
    Jeffrey Brink
    ,
    Jeremy Frank
  9. 9
    Automating the Generation of Prompts for LLM-based Action Choice in PDDL Planning
    Katharina Stein
    ,
    Daniel Fiser
    ,
    Jörg Hoffmann
    ,
    Alexander Koller
  10. 10
    Chasing Progress, Not Perfection: Revisiting Strategies for End-to-End LLM Plan Generation
    Sukai Huang
    ,
    Trevor Cohn
    ,
    Nir Lipovetzky
  11. 11
    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
  12. 12
    Cost-Optimal FOND Planning as Bi-Objective Best-First Search
    Diego Aineto
    ,
    Enrico Scala
  13. 13
    Delete-Free Planning with Object Creation is Undecidable
    Augusto B. Corrêa
  14. 14
    DynTaskMAS: A Dynamic Task Graph-driven Framework for Asynchronous and Parallel LLM-based Multi-Agent Systems
    Junwei Yu
    ,
    Yepeng Ding
    ,
    Hiroyuki Sato
  15. 15
    Frontmatter
    Daniel Harabor
    ,
    Nir Lipovetzky
    ,
    Miquel Ramírez
    ,
    Sebastian Sardiña
  16. 16
    Going Topological in Multi-risk Extended Markov Ratio Decision Processes
    Alexander Zadorojniy
    ,
    Orit Davidovich
    ,
    Takayuki Osogami
  17. 17
    Hardness of Chosen Length Planning Games and Regular Fixed Methods FOND HTN Planning
    Maurice Dekker
    ,
    Gregor Behnke
  18. 18
    HDDLGym: A Tool for Studying Multi-Agent Hierarchical Problems Defined in HDDL with OpenAI Gym
    Ngoc La
    ,
    Ruaridh Mon-Williams
    ,
    Julie A. Shah
  19. 19
    How Good is Perfect? On the Incompleteness of A* for Total-Order HTN Planning
    Mohammad Yousefi
    ,
    Mario Schmautz
    ,
    Patrik Haslum
    ,
    Pascal Bercher
  20. 20
    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
  21. 21
    HTN Plan Repair Algorithms Compared: Strengths and Weaknesses of Different Methods
    Paul Zaidins
    ,
    Robert P. Goldman
    ,
    Ugur Kuter
    ,
    Dana S. Nau
    ,
    Mark Roberts
  22. 22
    Initial Condition Retrieving for Hybrid and Numeric Planning Problems
    Matteo Cardellini
    ,
    Francesco Percassi
    ,
    Marco Maratea
    ,
    Mauro Vallati
  23. 23
    Instance-based Approximation Guarantees for Graph-based Nearest Neighbor Search
    Yannick Bosch
    ,
    Sabine Storandt
  24. 24
    Is This Plan Necessarily Redundant? On the Computational Complexity of Unobserved Domain Learning
    Pascal Bachor
    ,
    Maurice Dekker
    ,
    Gregor Behnke
  25. 25
    Knowledge Engineering for Planning and Scheduling in the LLM Era
    Mauro Vallati
    ,
    Roman Barták
    ,
    Lukás Chrpa
    ,
    Thomas L. McCluskey
    ,
    Ronald P. A. Petrick
  26. 26
    Landmark Generation in HTN Planning Revisited
    Victor Scherer Putrich
    ,
    Felipe Meneguzzi
    ,
    André Grahl Pereira
  27. 27
    Learning Efficiency Meets Symmetry Breaking
    Yingbin Bai
    ,
    Sylvie Thiébaux
    ,
    Felipe W. Trevizan
  28. 28
    Learning Lifted STRIPS Models from Action Traces alone: A Simple, General, and Scalable Solution
    Jonas Gösgens
    ,
    Niklas Jansen
    ,
    Hector Geffner
  29. 29
    Leveraging Action Relational Structures for Integrated Learning and Planning
    Ryan Xiao Wang
    ,
    Felipe W. Trevizan
  30. 30
    LTLf Adaptive Synthesis for Multi-Tier Goals in Nondeterministic Domains
    Giuseppe De Giacomo
    ,
    Gianmarco Parretti
    ,
    Shufang Zhu
  31. 31
    New Exact Methods for Solving Quadratic Traveling Salesman Problem
    Yuxiao Chen
    ,
    Anubhav Singh
    ,
    Ryo Kuroiwa
    ,
    J. Christopher Beck
  32. 32
    Observation Adaptation via Annealed Importance Resampling for Partially Observable Markov Decision Processes
    Yunuo Zhang
    ,
    Baiting Luo
    ,
    Ayan Mukhopadhyay
    ,
    Abhishek Dubey
  33. 33
    On Generating Robust Plans and Linear Execution Strategies in Planning Against Nature
    Lukás Chrpa
    ,
    Erez Karpas
  34. 34
    On Picking Good Policies: Leveraging Action-Policy Testing in Policy Training
    Jan Eisenhut
    ,
    Daniel Fiser
    ,
    Isabel Valera
    ,
    Jörg Hoffmann
  35. 35
    On Planning Through LLMs
    Mattia Chiari
    ,
    Luca Putelli
    ,
    Nicholas Rossetti
    ,
    Ivan Serina
    ,
    Alfonso Emilio Gerevini
  36. 36
    On the Gains from Using Action Observations in Domain Repair
    Alba Gragera
    ,
    Raquel Fuentetaja
    ,
    Ángel García Olaya
    ,
    Fernando Fernández
  37. 37
    On the Notion of Plan Quality for PDDL+
    Francesco Percassi
    ,
    Enrico Scala
    ,
    Mauro Vallati
  38. 38
    On Using Lazy Greedy Best-First Search with Subgoaling Relaxation in Numeric Planning Problems
    Enrico Scala
    ,
    Luigi Bonassi
  39. 39
    Parallelizing Multi-objective A* Search
    Saman Ahmadi
    ,
    Nathan R. Sturtevant
    ,
    Andrea Raith
    ,
    Daniel Harabor
    ,
    Mahdi Jalili
  40. 40
    Partially Observable Monte-Carlo Graph Search
    Yang You
    ,
    Vincent Thomas
    ,
    Alex Schutz
    ,
    Robert Skilton
    ,
    Nick Hawes
    ,
    Olivier Buffet
  41. 41
    Per-Domain Generalizing Policies: On Validation Instances and Scaling Behavior
    Timo P. Gros
    ,
    Nicola J. Müller
    ,
    Daniel Fiser
    ,
    Isabel Valera
    ,
    Verena Wolf
    ,
    Jörg Hoffmann
  42. 42
    Platform-Aware Mission Planning
    Stefan Panjkovic
    ,
    Alessandro Cimatti
    ,
    Andrea Micheli
    ,
    Stefano Tonetta
  43. 43
    Posthoc: The Visualisation Platform for Search
    Kevin Zheng
    ,
    Daniel Harabor
    ,
    Michael Wybrow
  44. 44
    Potential Heuristics: Weakening Consistency Constraints
    Pascal Lauer
    ,
    Daniel Fiser
  45. 45
    Proceedings of the Thirty-Fifth International Conference on Automated Planning and Scheduling, ICAPS 2025, Melbourne, Victoria, Australia, November 9-14, 2025
    Daniel Harabor
    ,
    Miquel Ramírez
  46. 46
    Pseudo-Boolean Proof Logging for Optimal Classical Planning
    Simon Dold
    ,
    Malte Helmert
    ,
    Jakob Nordström
    ,
    Gabriele Röger
    ,
    Tanja Schindler
  47. 47
    Quality Diversity for Variational Quantum Circuit Optimization
    Maximilian Zorn
    ,
    Jonas Stein
    ,
    Maximilian Balthasar Mansky
    ,
    Philipp Altmann
    ,
    Michael Kölle
    ,
    Claudia Linnhoff-Popien
  48. 48
    Rack Position Optimization in Large-Scale Heterogeneous Data Centers
    Chang-Lin Chen
    ,
    Jiayu Chen
    ,
    Tian Lan
    ,
    Zhaoxia Zhao
    ,
    Hongbo Dong
    ,
    Vaneet Aggarwal
  49. 49
    Revisiting LLMs in Planning from Literature Review: a Semi-Automated Analysis Approach and Evolving Categories Representing Shifting Perspectives
    Vishal Pallagani
    ,
    Nitin Gupta
    ,
    Bharath C. Muppasani
    ,
    Biplav Srivastava
  50. 50
    Safe Interval Randomized Path Planning For Manipulators
    Nuraddin Kerimov
    ,
    Aleksandr Onegin
    ,
    Konstantin S. Yakovlev