BDD ordering heuristics for classical planning

DOI10.1613/JAIR.4586MaRDI QIDQ2938478zbMATH OpenOpenAlexWikidataFDO

Authors Peter Kissmann, J. Hoffmann

Publication date 14 January 2015

Published in Journal of Artificial Intelligence Research (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1613/jair.4586

zbMATH Keywords

BDDsclassical planningvariable ordering

Mathematics Subject Classification ID

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

Recommendations

• State-set branching: leveraging BDDs for heuristic search
• scientific article; zbMATH DE number 1946864
• scientific article; zbMATH DE number 2086969
• Foundations of Genetic Algorithms
• On the effect of local changes in the variable ordering of ordered decision diagrams

Cited in

(8)

• Performance heuristics for GR(1) synthesis and related algorithms
• State-set branching: leveraging BDDs for heuristic search
• BDD-Based Incremental Heuristic Search
• Efficient symbolic search for cost-optimal planning
• Efficient problem solving on tree decompositions using binary decision diagrams
• scientific article; zbMATH DE number 1946864 (Why is no real title available?)
• A review of decision diagrams in system reliability modeling and analysis
• Symbolic search for cost-optimal planning with expressive model extensions

This page was built for publication: BDD ordering heuristics for classical planning

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