On the completeness of pruning techniques for planning with conditional effects

DOI10.1155/2013/398245zbMath1299.90387OpenAlexW2147858171WikidataQ59024434 ScholiaQ59024434MaRDI QIDQ473577

Dunbo Cai, Yanduo Zhang, Tongzhou Zhao, Sheng Xu

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

Mathematics Subject Classification ID

Search theory (90B40) Approximation methods and heuristics in mathematical programming (90C59)

Uses Software

• MiniSat
• Graphplan

Cites Work

• Planning as satisfiability: heuristics
• Approximation of action theories and its application to conformant planning
• Using regression-match graphs to control search in planning
• Fast planning through planning graph analysis
• Conformant planning via heuristic forward search: A new approach
• Theory and Applications of Satisfiability Testing
• Planning as heuristic search
• Planning as constraint satisfaction: Solving the planning graph by compiling it into CSP
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: On the completeness of pruning techniques for planning with conditional effects