Subgoaling Heuristics for Numeric Planning with Infinite Actions

This paper addresses the challenge of numeric planning with control parameters, where the number of applicable actions in a state can be infinite. It proposes a novel approach to tackle this by identifying a tractable subset of problems and transforming them into simpler tasks. The use of subgoaling heuristics allows for effective goal distance estimation, enabling the application of traditional numeric heuristics in a previously intractable setting. This is significant because it expands the applicability of existing planning techniques to more complex scenarios.