Interval Based Relaxation Heuristics for Numeric Planning with Action Costs

DOI10.1007/978-3-319-67190-1_2zbMath1498.68291OpenAlexW2728174733MaRDI QIDQ5044847

Bernhard Nebel, Johannes Aldinger

Publication date: 2 November 2022

Published in: KI 2017: Advances in Artificial Intelligence (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-67190-1_2

Mathematics Subject Classification ID

Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)

Related Items (1)

The LM-Cut Heuristic Family for Optimal Numeric Planning with Simple Conditions

This page was built for publication: Interval Based Relaxation Heuristics for Numeric Planning with Action Costs