A Reduced Ordered Binary Decision Diagram (BDD) is a symbolic data structure introduced to the model checking community by Bryant in 1986 to help verify properties of systems with very large state spaces. Recently, BDDs have been used in heuristic search algorithms as an approach to representing and solving search problems with very large state spaces. However, these algorithms are still not memory efficient. This thesis presents a symbolic heuristic search algorithm that uses BDDs in a memory efficient way by performing bidirectional breadthirst heuristic search. The approach is evaluated empirically against existing symbolic methods and is shown to provide a significant improvement in performance
We show how to use symbolic model-checking techniques in heuristic search algorithms for both deter...
Binary decision diagrams (BDDs) are the state-of-the-art core technique for the symbolic representat...
In this paper we propose a new algorithm for solving general two-player turn-taking games that perfo...
In this article, we present a framework called state-set branching that combines symbolic search bas...
In this paper we propose refinements for optimal search with symbolic pattern databases in determini...
A promising approach to solving large state-space search problems is to integrate heuristic search w...
Symbolic search with BDDs has shown remarkable performance for cost-optimal deterministic planning b...
Symbolic search, using Binary Decision Diagrams (BDDs) to represent sets of states, is a competitive...
A promising approach to solving large state-space search problems is to integrate heuristic search w...
Symbolic search allows saving large amounts of memory compared to regular explicit-state search algo...
Symbolic search with binary decision diagrams (BDDs) often saves huge amounts of memory and computat...
Symbolic search using BDDs usually saves huge amounts of memory, while in some domains its savings a...
AbstractIn this article, we present a framework called state-set branching that combines symbolic se...
Reduced ordered Binary Decision Diagrams (BDDs) are frequently used in logic synthesis. In this pape...
In this paper we combine the goal directed search of A * with the ability of BDDs to traverse an exp...
We show how to use symbolic model-checking techniques in heuristic search algorithms for both deter...
Binary decision diagrams (BDDs) are the state-of-the-art core technique for the symbolic representat...
In this paper we propose a new algorithm for solving general two-player turn-taking games that perfo...
In this article, we present a framework called state-set branching that combines symbolic search bas...
In this paper we propose refinements for optimal search with symbolic pattern databases in determini...
A promising approach to solving large state-space search problems is to integrate heuristic search w...
Symbolic search with BDDs has shown remarkable performance for cost-optimal deterministic planning b...
Symbolic search, using Binary Decision Diagrams (BDDs) to represent sets of states, is a competitive...
A promising approach to solving large state-space search problems is to integrate heuristic search w...
Symbolic search allows saving large amounts of memory compared to regular explicit-state search algo...
Symbolic search with binary decision diagrams (BDDs) often saves huge amounts of memory and computat...
Symbolic search using BDDs usually saves huge amounts of memory, while in some domains its savings a...
AbstractIn this article, we present a framework called state-set branching that combines symbolic se...
Reduced ordered Binary Decision Diagrams (BDDs) are frequently used in logic synthesis. In this pape...
In this paper we combine the goal directed search of A * with the ability of BDDs to traverse an exp...
We show how to use symbolic model-checking techniques in heuristic search algorithms for both deter...
Binary decision diagrams (BDDs) are the state-of-the-art core technique for the symbolic representat...
In this paper we propose a new algorithm for solving general two-player turn-taking games that perfo...