Interval-Based Relaxation for General Numeric Planning.

DOI10.3233/978-1-61499-672-9-655zbMath1403.68246OpenAlexW2571800388MaRDI QIDQ4576198

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

Publication date: 12 July 2018

Full work available at URL: https://doi.org/10.3233/978-1-61499-672-9-655

Mathematics Subject Classification ID

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

Related Items (7)

Decidability and complexity of action-based temporal planning over dense time ⋮ Satisfiability Checking: Theory and Applications ⋮ OMTPlan: A Tool for Optimal Planning Modulo Theories ⋮ Falsification of hybrid systems with symbolic reachability analysis and trajectory splicing ⋮ Gradient-based mixed planning with symbolic and numeric action parameters ⋮ 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: Interval-Based Relaxation for General Numeric Planning.