The LM-Cut Heuristic Family for Optimal Numeric Planning with Simple Conditions
From MaRDI portal
Publication:5870521
DOI10.1613/jair.1.14034OpenAlexW4313395447MaRDI QIDQ5870521
Ryo Kuroiwa, J. Christopher Beck, Margarita P. Castro, Chiara Piacentini, Alexander Shleyfman
Publication date: 9 January 2023
Published in: Journal of Artificial Intelligence Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1613/jair.1.14034
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- An approach to efficient planning with numerical fluents and multi-criteria plan quality
- Processes and continuous change in a SAT-based planner
- STRIPS: A new approach to the application of theorem proving to problem solving
- Strengthening Landmark Heuristics via Hitting Sets
- On a Practical, Integer-Linear Programming Model for Delete-Free Tasks and its Use as a Heuristic for Cost-Optimal Planning
- On the complexity of integer programming
- Interval-Based Relaxation for General Numeric Planning.
- A Hybrid LP-RPG Heuristic for Modelling Numeric Resource Flows in Planning
- Interval Based Relaxation Heuristics for Numeric Planning with Action Costs
- Subgoaling Techniques for Satisficing and Optimal Numeric Planning
- Planning as heuristic search
- A polynomially solvable special case of the unbounded knapsack problem
This page was built for publication: The LM-Cut Heuristic Family for Optimal Numeric Planning with Simple Conditions