Saturated Cost Partitioning for Optimal Classical Planning

DOI10.1613/JAIR.1.11673zbMath1442.68220OpenAlexW3003267832MaRDI QIDQ5214809

Malte Helmert, Thomas Keller, Jendrik Seipp

Publication date: 5 February 2020

Published in: Journal of Artificial Intelligence Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1613/jair.1.11673

Mathematics Subject Classification ID

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

Related Items (2)

On transformation of conditional, conformant and parallel planning to linear programming ⋮ Online Relaxation Refinement for Satisficing Planning: On Partial Delete Relaxation, Complete Hill-Climbing, and Novelty Pruning

This page was built for publication: Saturated Cost Partitioning for Optimal Classical Planning