Subgoaling Heuristics for Numeric Planning with Infinite Actions
Published:Dec 26, 2025 20:05
•1 min read
•ArXiv
Analysis
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.
Key Takeaways
Reference
“The proposed compilation makes it possible to effectively use subgoaling heuristics to estimate goal distance in numeric planning problems involving control parameters.”