Sound and complete landmarks for and/Or graphs

DOI10.3233/978-1-60750-606-5-335MaRDI QIDQ2999154zbMATH OpenOpenAlexFDO

Authors Emil Keyder, Silvia Richter, Malte Helmert

Publication date 11 May 2011

Full work available at URL https://gki.informatik.uni-freiburg.de/papers/keyder-etal-ecai2010.pdf

Mathematics Subject Classification ID

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

Recommendations

• scientific article; zbMATH DE number 2243372
• Decomposed planning guided by landmark counting heuristic
• Landmarks in hierarchical planning
• Strengthening landmark heuristics via hitting sets
• Landmark-enhanced abstraction heuristics

Cited in

(9)

• Landmark-based approaches for goal recognition as planning
• Strengthening landmark heuristics via hitting sets
• Planning in artificial intelligence
• Landmarks in hierarchical planning
• Landmark-enhanced abstraction heuristics
• Cost-optimal planning, delete relaxation, approximability, and heuristics
• Cost optimal planning with multi-valued landmarks
• scientific article; zbMATH DE number 2243372 (Why is no real title available?)
• Decomposed planning guided by landmark counting heuristic

This page was built for publication: Sound and complete landmarks for and/Or graphs

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