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
Validation with guided search of the state space
DAC '98 Proceedings of the 35th annual Design Automation Conference
Model checking
Symbolic guided search for CTL model checking
Proceedings of the 37th Annual Design Automation Conference
Symbolic Model Checking
KI '98 Proceedings of the 22nd Annual German Conference on Artificial Intelligence: Advances in Artificial Intelligence
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
OBDD-based universal planning for synchronized agents in non-deterministic domains
Journal of Artificial Intelligence Research
Local search topology in planning benchmarks: an empirical analysis
IJCAI'01 Proceedings of the 17th international joint conference on Artificial intelligence - Volume 1
Using heuristic search for finding deadlocks in concurrent systems
Information and Computation
DELFIN+: An efficient deadlock detection tool for CCS processes
Journal of Computer and System Sciences
State-set branching: Leveraging BDDs for heuristic search
Artificial Intelligence
Automated Creation of Pattern Database Search Heuristics
Model Checking and Artificial Intelligence
Partial Symbolic Pattern Databases for Optimal Sequential Planning
KI '08 Proceedings of the 31st annual German conference on Advances in Artificial Intelligence
Scaling Search with Pattern Databases
Model Checking and Artificial Intelligence
Survey on Directed Model Checking
Model Checking and Artificial Intelligence
Weighted A∗ search -- unifying view and application
Artificial Intelligence
A breadth-first approach to memory-efficient graph search
AAAI'06 proceedings of the 21st national conference on Artificial intelligence - Volume 2
Taming numbers and durations in the model checking integrated planning system
Journal of Artificial Intelligence Research
Bounded search and symbolic inference for constraint optimization
IJCAI'05 Proceedings of the 19th international joint conference on Artificial intelligence
Using heuristic search for finding deadlocks in concurrent systems
Information and Computation
I/O efficient directed model checking
VMCAI'05 Proceedings of the 6th international conference on Verification, Model Checking, and Abstract Interpretation
Experiments with multiple abstraction heuristics in symbolic verification
SARA'05 Proceedings of the 6th international conference on Abstraction, Reformulation and Approximation
BDDRPA*: an efficient BDD-Based incremental heuristic search algorithm for replanning
AI'06 Proceedings of the 19th Australian joint conference on Artificial Intelligence: advances in Artificial Intelligence
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 paper we combine the goal directed search of A* with the ability of BDDs to traverse an exponential number of states in polynomial time. We introduce a new algorithm, SetA*, that generalizes A* to expand sets of states in each iteration. SetA* has substantial advantages over BDDA*, the only previous BDD-based A* implementation we are aware of. Our experimental evaluation proves SetA* to be a powerful search paradigm. For some of the studied problems it outperforms BDDA*, A*, and BDD-based breadth-first search by several orders of magnitude. We believe exploring sets of states to be essential when the heuristic function is weak. For problems with strong heuristics, SetA* efficiently specializes to single-state search and consequently challenges single-state heuristic search in general.