Extending classical planning with state constraints: heuristics and search for optimal planning
DOI10.1613/JAIR.1.11213zbMATH Open1448.68388OpenAlexW2809932296MaRDI QIDQ4580269FDOQ4580269
Authors: P. Haslum, Franc Ivankovic, Miquel Ramirez, Vikas Shivashankar, Dana S. Nau, Dan Gordon, Sylvie Thiébaux
Publication date: 14 August 2018
Published in: Journal of Artificial Intelligence Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1613/jair.1.11213
Recommendations
- Constraint based planning with composable substate graphs
- State-variable planning under structural restrictions: algorithms and complexity
- scientific article; zbMATH DE number 2038902
- A constraint programming formulation for planning: From plan scheduling to plan generation
- Interval based relaxation heuristics for numeric planning with action costs
Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Approximation methods and heuristics in mathematical programming (90C59)
Cited In (4)
- Hybrid planning for challenging construction problems: an answer set programming approach
- Planning graph as the basis for deriving heuristics for plan synthesis by state space and CSP search
- Constraint based planning with composable substate graphs
- State-variable planning under structural restrictions: algorithms and complexity
This page was built for publication: Extending classical planning with state constraints: heuristics and search for optimal planning
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4580269)