Interval Based Relaxation Heuristics for Numeric Planning with Action Costs

We adapt the relaxation heuristics h max , h add and h FF to interval based numeric relaxation frameworks, combining them with two different relaxation techniques and with two different search techniques. In contrast to previous approaches, the heuristics presented here are not limited to a subset of numeric planning and support action costs.