State-set branching: leveraging BDDs for heuristic search
From MaRDI portal
Publication:2389616
DOI10.1016/J.ARTINT.2007.05.009zbMATH Open1182.68248OpenAlexW2122000203MaRDI QIDQ2389616FDOQ2389616
Authors: Rune Møller Jensen, Manuela M. Veloso, Randal E. Bryant 
Publication date: 17 July 2009
Published in: Artificial Intelligence (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.artint.2007.05.009
Recommendations
Cites Work
- Title not available (Why is that?)
- Graph-Based Algorithms for Boolean Function Manipulation
- Planning as heuristic search
- STRIPS: A new approach to the application of theorem proving to problem solving
- Branching Programs and Binary Decision Diagrams
- Weak, strong, and strong cyclic planning via symbolic model checking
- Binary Decision Diagrams
- Interpolants and Symbolic Model Checking
- Title not available (Why is that?)
- Graph-Theoretic Concepts in Computer Science
- Planning graph heuristics for belief space search
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- AI 2003: Advances in Artificial Intelligence
- Title not available (Why is that?)
- Partial-order planning: Evaluating possible efficiency gains
- Tools and Algorithms for the Construction and Analysis of Systems
Cited In (9)
- BDD-Based Incremental Heuristic Search
- Boosting optimal symbolic planning: operator-potential heuristics
- Star-topology decoupled state space search
- Title not available (Why is that?)
- Title not available (Why is that?)
- Efficient symbolic search for cost-optimal planning
- The BDD-Based Dynamic A* Algorithm for Real-Time Replanning
- BDD ordering heuristics for classical planning
- AI 2003: Advances in Artificial Intelligence
Uses Software
This page was built for publication: State-set branching: leveraging BDDs for heuristic search
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2389616)
