On the completeness of pruning techniques for planning with conditional effects
From MaRDI portal
Publication:473577
DOI10.1155/2013/398245zbMATH Open1299.90387OpenAlexW2147858171WikidataQ59024434 ScholiaQ59024434MaRDI QIDQ473577FDOQ473577
Authors: Dunbo Cai, Sheng Xu, Tongzhou Zhao, Yanduo Zhang 
Publication date: 24 November 2014
Published in: Mathematical Problems in Engineering (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1155/2013/398245
Recommendations
- scientific article; zbMATH DE number 1560491
- Planning graph heuristics for belief space search
- Improving delete relaxation heuristics through explicitly represented conjunctions
- Optimal planning in the presence of conditional effects: extending LM-cut with context splitting
- Planning as heuristic search
Cites Work
- Fast planning through planning graph analysis
- Title not available (Why is that?)
- Theory and Applications of Satisfiability Testing
- Planning as heuristic search
- The fast downward planning system
- The FF planning system: Fast plan generation through heuristic search
- Planning as constraint satisfaction: Solving the planning graph by compiling it into CSP
- Conformant planning via heuristic forward search: A new approach
- Planning as satisfiability: heuristics
- Temporal planning using subgoal partitioning and resolution in SGPlan
- Using regression-match graphs to control search in planning
- Title not available (Why is that?)
- Approximation of action theories and its application to conformant planning
Cited In (3)
Uses Software
This page was built for publication: On the completeness of pruning techniques for planning with conditional effects
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q473577)
