Interval-based relaxation for general numeric planning

DOI10.3233/978-1-61499-672-9-655MaRDI QIDQ4576198zbMATH OpenOpenAlexFDO

Authors Enrico Scala, P. Haslum, Miquel Ramirez, 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)

Recommendations

• Interval based relaxation heuristics for numeric planning with action costs
• Subgoaling techniques for satisficing and optimal numeric planning
• KI 2004: Advances in Artificial Intelligence
• scientific article; zbMATH DE number 2038902
• An LP-Based Heuristic for Optimal Planning

Cited in

(14)

• Subgoaling techniques for satisficing and optimal numeric planning
• scientific article; zbMATH DE number 5547917 (Why is no real title available?)
• KI 2004: Advances in Artificial Intelligence
• A domain-independent agent architecture for adaptive operation in evolving open worlds
• A Practical Approach to Discretised PDDL+ Problems by Translation to Numeric Planning
• Symbolic pattern planning
• Satisfiability checking: theory and applications
• Decidability and complexity of action-based temporal planning over dense time
• A correct-by-construction approach for development of reliable planning problems
• Interval based relaxation heuristics for numeric planning with action costs
• OMTPlan: A Tool for Optimal Planning Modulo Theories
• The LM-Cut Heuristic Family for Optimal Numeric Planning with Simple Conditions
• Falsification of hybrid systems with symbolic reachability analysis and trajectory splicing
• Gradient-based mixed planning with symbolic and numeric action parameters

This page was built for publication: Interval-based relaxation for general numeric planning

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4576198)