We consider optimal numeric planning with numeric conditions consisting of linear expressions of numeric state variables and actions that increase or decrease numeric state variables by constant quantities. We build on previous research to introduce a new variant of the numeric hmax heuristic based on the delete-relaxed version of such planning tasks. Although our hmax heuristic is inadmissible, it yields a numeric version of the classical LM-cut heuristic which is admissible. Further, we prove that our LM-cut heuristic neither dominates nor is dominated by the existing numeric heuristic hmaxhbd . Admissibility also holds when integrating the numeric cuts into the operator-counting (OC) heuristic producing an admissible numeric version of the OC heuristic. Through experiments, we demonstrate that both these heuristics compete favorably with the state-of-the-art heuristics: in particular, while sometimes expanding more nodes than other heuristics, numeric OC solves 19 more problem instances than the next closest heuristic.
|Title of host publication||31st International Conference on Automated Planning and Scheduling, ICAPS 2021|
|Editors||Susanne Biundo, Minh Do, Robert Goldman, Michael Katz, Qiang Yang, Hankz Hankui Zhuo|
|Publisher||Association for the Advancement of Artificial Intelligence|
|Number of pages||9|
|State||Published - 2021|
|Event||31st International Conference on Automated Planning and Scheduling, ICAPS 2021 - Guangzhou, Virtual, China|
Duration: 2 Aug 2021 → 13 Aug 2021
|Name||Proceedings International Conference on Automated Planning and Scheduling, ICAPS|
|Conference||31st International Conference on Automated Planning and Scheduling, ICAPS 2021|
|Period||2/08/21 → 13/08/21|
Bibliographical notePublisher Copyright:
Copyright © 2021, Association for the Advancement of Artificial Intelligence (www.aaai.org). All rights reserved.