{"type":"ScholarlyArticle","title":"Handling Infinite Domain Parameters in Planning Through Best-First Search with Delayed Partial Expansions","authors":[{"name":"Ángel Aso-Mollar","slug":"angel-aso-mollar","given":"Ángel","family":"Aso-Mollar","affiliation":""},{"name":"Diego Aineto","slug":"diego-aineto","given":"Diego","family":"Aineto","affiliation":""},{"name":"Enrico Scala","slug":"enrico-scala","given":"Enrico","family":"Scala","affiliation":""},{"name":"Eva Onaindia","slug":"eva-onaindia","given":"Eva","family":"Onaindia","affiliation":""}],"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.","doi":"10.24963/ijcai.2025/940","url":"https://ijcai.org/proceedings/2025/940","pdf":"https://ijcai.org/proceedings/2025/0940.pdf","markdown":"https://ijcai.org/proceedings/2025/940.md","bibtex":"https://ijcai.org/proceedings/2025/bibtex/940","volume":{"slug":"2025","title":"Proceedings of the Thirty-Fourth International Joint Conference on Artificial Intelligence","short_title":"IJCAI 2025","url":"https://ijcai.org/proceedings/2025/","year":2025,"location":"Montreal, Canada","dates":"16-22 August 2025","editors":"James Kwok","isbn":"978-1-956792-06-5","publisher":"International Joint Conferences on Artificial Intelligence Organization","doi_prefix":"10.24963/ijcai.2025"},"section":"Planning and Scheduling","track":"Main Track","number":940,"pages":{"first":8456,"last":8464},"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"],"videos":[],"references":[],"license_note":"Copyright International Joint Conferences on Artificial Intelligence."}