Cost optimal planning with multi-valued landmarks

DOI10.3233/AIC-140622zbMATH Open1373.68389OpenAlexW2233846624MaRDI QIDQ4589115FDOQ4589115

Authors:

Publication date: 7 November 2017

Published in: AI Communications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.3233/aic-140622

Recommendations

• Landmark-enhanced abstraction heuristics
• The LAMA planner: guiding cost-based anytime planning with landmarks
• scientific article; zbMATH DE number 2243372
• Sound and complete landmarks for and/Or graphs
• Landmarks in hierarchical planning

zbMATH Keywords

cost optimal planningheuristic search based planninglandmark heuristic

Mathematics Subject Classification ID

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

Cited In (7)

• The LAMA planner: guiding cost-based anytime planning with landmarks
• Strengthening landmark heuristics via hitting sets
• Landmarks in hierarchical planning
• Landmark-enhanced abstraction heuristics
• Saturated cost partitioning for optimal classical planning
• Title not available (Why is that?)
• Decomposed planning guided by landmark counting heuristic

This page was built for publication: Cost optimal planning with multi-valued landmarks

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