BDD ordering heuristics for classical planning
From MaRDI portal
Recommendations
- State-set branching: leveraging BDDs for heuristic search
- scientific article; zbMATH DE number 1946864
- Symbolic heuristic search using decision diagrams
- Genetic algorithms for the variable ordering problem of binary decision diagrams
- 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)