Heuristics: intelligent search strategies for computer problem solving
Heuristics: intelligent search strategies for computer problem solving
Graph-Based Algorithms for Boolean Function Manipulation
IEEE Transactions on Computers
Partial-order planning: evaluating possible efficiency gains
Artificial Intelligence
Algebraic decision diagrams and their applications
ICCAD '93 Proceedings of the 1993 IEEE/ACM international conference on Computer-aided design
Validation with guided search of the state space
DAC '98 Proceedings of the 35th annual Design Automation Conference
Inferring state constraints for domain-independent planning
AAAI '98/IAAI '98 Proceedings of the fifteenth national/tenth conference on Artificial intelligence/Innovative applications of artificial intelligence
Model checking
Symbolic guided search for CTL model checking
Proceedings of the 37th Annual Design Automation Conference
An exact algorithm for solving difficult detailed routing problems
Proceedings of the 2001 international symposium on Physical design
A new partitioning scheme for improvement of image computation
Proceedings of the 2001 Asia and South Pacific Design Automation Conference
Symbolic Model Checking
Algorithms and Data Structures in VLSI Design
Algorithms and Data Structures in VLSI Design
Symbolic Heuristic Search Using Decision Diagrams
Proceedings of the 5th International Symposium on Abstraction, Reformulation and Approximation
KI '98 Proceedings of the 22nd Annual German Conference on Artificial Intelligence: Advances in Artificial Intelligence
On Combining Formal and Informal Verification
CAV '97 Proceedings of the 9th International Conference on Computer Aided Verification
Planning via Model Checking: A Decision Procedure for AR
ECP '97 Proceedings of the 4th European Conference on Planning: Recent Advances in AI Planning
Planning as Heuristic Search: New Results
ECP '99 Proceedings of the 5th European Conference on Planning: Recent Advances in AI Planning
Exhibiting Knowledge in Planning Problems to Minimize State Encoding Length
ECP '99 Proceedings of the 5th European Conference on Planning: Recent Advances in AI Planning
SetA*: an efficient BDD-based heuristic search algorithm
Eighteenth national conference on Artificial intelligence
Weak, strong, and strong cyclic planning via symbolic model checking
Artificial Intelligence - special issue on planning with uncertainty and incomplete information
IEEE Transactions on Computers
OBDD-based universal planning for synchronized agents in non-deterministic domains
Journal of Artificial Intelligence Research
Conformant planning via symbolic model checking
Journal of Artificial Intelligence Research
PDDL2.1: an extension to PDDL for expressing temporal planning domains
Journal of Artificial Intelligence Research
Planning graph heuristics for belief space search
Journal of Artificial Intelligence Research
A symbolic approach to the all-pairs shortest-paths problem
WG'04 Proceedings of the 30th international conference on Graph-Theoretic Concepts in Computer Science
The symbolic OBDD scheme for generating mechanical assembly sequences
Formal Methods in System Design
The BDD-Based Dynamic A* Algorithm for Real-Time Replanning
FAW '09 Proceedings of the 3d International Workshop on Frontiers in Algorithmics
Optimal symbolic planning with action costs and preferences
IJCAI'09 Proceedings of the 21st international jont conference on Artifical intelligence
A model for integrating dialogue and the execution of joint plans
ArgMAS'09 Proceedings of the 6th international conference on Argumentation in Multi-Agent Systems
Computing argumentation in polynomial number of BDD operations: a preliminary report
ArgMAS'10 Proceedings of the 7th international conference on Argumentation in Multi-Agent Systems
Hi-index | 0.00 |
In this article, we present a framework called state-set branching that combines symbolic search based on reduced ordered Binary Decision Diagrams (BDDs) with best-first search, such as A* and greedy best-first search. The framework relies on an extension of these algorithms from expanding a single state in each iteration to expanding a set of states. We prove that it is generally sound and optimal for two A* implementations and show how a new BDD technique called branching partitioning can be used to efficiently expand sets of states. The framework is general. It applies to any heuristic function, evaluation function, and transition cost function defined over a finite domain. Moreover, branching partitioning applies to both disjunctive and conjunctive transition relation partitioning. An extensive experimental evaluation of the two A* implementations proves state-set branching to be a powerful framework. The algorithms outperform the ordinary A* algorithm in almost all domains. In addition, they can improve the complexity of A* exponentially and often dominate both A* and blind BDD-based search by several orders of magnitude. Moreover, they have substantially better performance than BDDA*, the currently most efficient BDD-based implementation of A*.