Handling Infinite Domain Parameters in Planning Through Best-First Search with Delayed Partial Expansions

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

doi:10.24963/ijcai.2025/940

Handling Infinite Domain Parameters in Planning Through Best-First Search with Delayed Partial Expansions

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

Download BibTeX Cite

Proceedings of the Thirty-Fourth International Joint Conference on Artificial Intelligence. Main Track. Pages 8456-8464.

https://doi.org/10.24963/ijcai.2025/940

Keywords

Planning and Scheduling: PS: Mixed discrete/continuous planning
Planning and Scheduling: PS: Search in planning and scheduling
Search: S: Heuristic search
Planning and Scheduling: PS: Planning algorithms

Abstract

In automated planning, control parameters extend standard action representations through the introduction of continuous numeric decision variables. Existing state-of-the-art approaches have primarily handled control parameters as embedded constraints alongside other temporal and numeric restrictions, and thus have implicitly treated them as additional constraints rather than as decision points in the search space. In this paper, we propose an efficient alternative that explicitly handles control parameters as true decision points within a systematic search scheme. We develop a best-first, heuristic search algorithm that operates over infinite decision spaces defined by control parameters and prove a notion of completeness in the limit under certain conditions. Our algorithm leverages the concept of delayed partial expansion, where a state is not fully expanded but instead incrementally expands a subset of its successors. Our results demonstrate that this novel search algorithm is a competitive alternative to existing approaches for solving planning problems involving control parameters.

Ángel Aso-Mollar, Diego Aineto, Enrico Scala, and Eva Onaindia. 2025. Handling Infinite Domain Parameters in Planning Through Best-First Search with Delayed Partial Expansions. In Proceedings of the Thirty-Fourth International Joint Conference on Artificial Intelligence, IJCAI-25. IJCAI, 8456–8464. https://doi.org/10.24963/ijcai.2025/940

@inproceedings{ijcai2025p940,
  title     = {Handling Infinite Domain Parameters in Planning Through Best-First Search with Delayed Partial Expansions},
  author    = {Aso-Mollar, Ángel and Aineto, Diego and Scala, Enrico and Onaindia, Eva},
  booktitle = {Proceedings of the Thirty-Fourth International Joint Conference on
               Artificial Intelligence, {IJCAI-25}},
  publisher = {International Joint Conferences on Artificial Intelligence Organization},
  editor    = {James Kwok},
  pages     = {8456--8464},
  year      = {2025},
  month     = {8},
  note      = {Main Track},
  doi       = {10.24963/ijcai.2025/940},
  url       = {https://doi.org/10.24963/ijcai.2025/940},
}

TY  - CPAPER
TI  - Handling Infinite Domain Parameters in Planning Through Best-First Search with Delayed Partial Expansions
AU  - Aso-Mollar, Ángel
AU  - Aineto, Diego
AU  - Scala, Enrico
AU  - Onaindia, Eva
T2  - Proceedings of the Thirty-Fourth International Joint Conference on Artificial Intelligence, IJCAI-25
PB  - International Joint Conferences on Artificial Intelligence Organization
PY  - 2025
SP  - 8456
EP  - 8464
DO  - 10.24963/ijcai.2025/940
UR  - https://doi.org/10.24963/ijcai.2025/940
ER  -