Subgoaling Techniques for Satisficing and Optimal Numeric Planning

DOI10.1613/jair.1.11875zbMath1461.68219OpenAlexW3048427244MaRDI QIDQ5121406

Miquel Ramirez, Patrik Haslum, Enrico Scala, Sylvie Thiébaux

Publication date: 14 September 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.11875

Mathematics Subject Classification ID

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

Related Items (4)

A first polynomial non-clausal class in many-valued logic ⋮ The possibilistic Horn non-clausal knowledge bases ⋮ The LM-Cut Heuristic Family for Optimal Numeric Planning with Simple Conditions ⋮ A Practical Approach to Discretised PDDL+ Problems by Translation to Numeric Planning

This page was built for publication: Subgoaling Techniques for Satisficing and Optimal Numeric Planning