Failure driven dynamic search control for partial order planners: an explanation based approach

DOI10.1016/S0004-3702(96)00005-7zbMath0907.68176OpenAlexW2133772054MaRDI QIDQ1391908

Suresh Katukam, Yong Qu, Subbarao Kambhampati

Publication date: 23 July 1998

Published in: Artificial Intelligence (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0004-3702(96)00005-7

zbMATH Keywords

explanation based learningfailure driven learningpartial order planningsearch control

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)

Related Items (3)

State space search nogood learning: online refinement of critical-path dead-end detectors in planning ⋮ Discovering hidden structure in factored MDPs ⋮ On the relations between intelligent backtracking and failure-driven explanation-based learning in constraint satisfaction and planning

Uses Software

• UCPOP

Cites Work

• Acquiring search-control knowledge via static analysis
• A unified framework for explanation-based generalization of partially ordered and partially instantiated plans
• Partial-order planning: Evaluating possible efficiency gains
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Failure driven dynamic search control for partial order planners: an explanation based approach