Generalized best-first search strategies and the optimality of A*
Journal of the ACM (JACM)
Graph-Based Algorithms for Boolean Function Manipulation
IEEE Transactions on Computers
Planning as search: a quantitative approach
Artificial Intelligence
Principles of artificial intelligence
Principles of artificial intelligence
Finding the Optimal Variable Ordering for Binary Decision Diagrams
IEEE Transactions on Computers
The (n2-1)-puzzle and related relocation problems
Journal of Symbolic Computation
Efficient implementation of a BDD package
DAC '90 Proceedings of the 27th ACM/IEEE Design Automation Conference
Logic synthesis for programmable gate arrays
DAC '90 Proceedings of the 27th ACM/IEEE Design Automation Conference
Technology mapping for electrically programmable gate arrays
DAC '91 Proceedings of the 28th ACM/IEEE Design Automation Conference
Efficient memory-bounded search methods
ECAI '92 Proceedings of the 10th European conference on Artificial intelligence
A new approach to dynamic weighting
ECAI '92 Proceedings of the 10th European conference on Artificial intelligence
Linear-space best-first search
Artificial Intelligence
Reduction of OBDDs in linear time
Information Processing Letters
Memory-bounded bidirectional search
AAAI'94 Proceedings of the twelfth national conference on Artificial intelligence (vol. 2)
Improving the Variable Ordering of OBDDs Is NP-Complete
IEEE Transactions on Computers
Dynamic variable ordering for ordered binary decision diagrams
ICCAD '93 Proceedings of the 1993 IEEE/ACM international conference on Computer-aided design
Logic synthesis for large pass transistor circuits
ICCAD '97 Proceedings of the 1997 IEEE/ACM international conference on Computer-aided design
Symbolic algorithms for layout-oriented synthesis of pass transistor logic circuits
Proceedings of the 1998 IEEE/ACM international conference on Computer-aided design
Automatic OBDD-based generation of universal plans in non-deterministic domains
AAAI '98/IAAI '98 Proceedings of the fifteenth national/tenth conference on Artificial intelligence/Innovative applications of artificial intelligence
A complete anytime algorithm for number partitioning
Artificial Intelligence
Wave steering in YADDs: a novel non-iterative synthesis and layout technique
Proceedings of the 36th annual ACM/IEEE Design Automation Conference
Efficient Algorithms for Shortest Paths in Sparse Networks
Journal of the ACM (JACM)
Worst case examples for operation on OBDDs
Information Processing Letters
Algorithm 360: shortest-path forest with topological ordering [H]
Communications of the ACM
On-the-fly layout generation for PTL macrocells
Proceedings of the conference on Design, automation and test in Europe
Artificial Intelligence - Special issue on heuristic search in artificial intelligence
The nonapproximability of OBDD minimization
Information and Computation
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
Symbolic Heuristic Search Using Decision Diagrams
Proceedings of the 5th International Symposium on Abstraction, Reformulation and Approximation
Unifying SAT-based and Graph-based Planning
IJCAI '99 Proceedings of the Sixteenth International Joint Conference on Artificial Intelligence
Memory-Bounded A* Graph Search
Proceedings of the Fifteenth International Florida Artificial Intelligence Research Society Conference
Divide-and-Conquer Frontier Search Applied to Optimal Sequence Alignment
Proceedings of the Seventeenth National Conference on Artificial Intelligence and Twelfth Conference on Innovative Applications of Artificial Intelligence
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
SetA*: an efficient BDD-based heuristic search algorithm
Eighteenth national conference on Artificial intelligence
Multiple sequence alignment using anytime A*
Eighteenth national conference on Artificial intelligence
Annals of Mathematics and Artificial Intelligence
Sweep A*: Space-Efficient Heuristic Search in Partially Ordered Graphs
ICTAI '03 Proceedings of the 15th IEEE International Conference on Tools with Artificial Intelligence
Journal of the ACM (JACM)
Anytime search in dynamic graphs
Artificial Intelligence
An improved search algorithm for optimal multiple-sequence alignment
Journal of Artificial Intelligence Research
Journal of Artificial Intelligence Research
Bidirectional heuristic search reconsidered
Journal of Artificial Intelligence Research
Efficient implementation of the plan graph in STAN
Journal of Artificial Intelligence Research
An improved algorithm for optimal bin packing
IJCAI'03 Proceedings of the 18th international joint conference on Artificial intelligence
IJCAI'03 Proceedings of the 18th international joint conference on Artificial intelligence
Heuristic search + symbolic model checking = efficient conformant planning
IJCAI'01 Proceedings of the 17th international joint conference on Artificial intelligence - Volume 1
Planning in nondeterministic domains under partial observability via symbolic model checking
IJCAI'01 Proceedings of the 17th international joint conference on Artificial intelligence - Volume 1
Studies in Semi-Admissible Heuristics
IEEE Transactions on Pattern Analysis and Machine Intelligence
Symbolic generalization for on-line planning
UAI'03 Proceedings of the Nineteenth conference on Uncertainty in Artificial Intelligence
Technology mapping for TLU FPGAs based on decomposition of binary decision diagrams
IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems
Using lower bounds during dynamic BDD minimization
IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems
BDS: a BDD-based logic optimization system
IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems
An improved branch and bound algorithm for exact BDD minimization
IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems
Combining ordered best-first search with branch and bound for exact BDD minimization
IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems
Effect of improved lower bounds in dynamic BDD reordering
IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems
Parallel suboptimal heuristic search for finding a w-admissible solution. performance analysis
ICANCM'11/ICDCC'11 Proceedings of the 2011 international conference on applied, numerical and computational mathematics, and Proceedings of the 2011 international conference on Computers, digital communications and computing
Algorithms for generating ordered solutions for explicit and/or structures
Journal of Artificial Intelligence Research
Goal distance estimation for automated planning using neural networks and support vector machines
Natural Computing: an international journal
Algorithms for generating ordered solutions for explicit AND/OR structures: extended abstract
IJCAI'13 Proceedings of the Twenty-Third international joint conference on Artificial Intelligence
A hierarchical approach for primitive-based motion planning and control of autonomous vehicles
Robotics and Autonomous Systems
Hi-index | 0.00 |
The A^* algorithm is a well-known heuristic best-first search method. Several performance-accelerated extensions of the exact A^* approach are known. Interesting examples are approximate algorithms where the heuristic function used is inflated by a weight (often referred to as weighted A^*). These methods guarantee a bounded suboptimality. As a technical contribution, this paper presents the previous results related to weighted A^* from authors like Pohl, Pearl, Kim, Likhachev and others in a more condensed and unifying form. With this unified view, a novel general bound on suboptimality of the result is derived. In the case of avoiding any reopening of expanded states, for @e0, this bound is (1+@e)^@?^N^2^@? where N is an upper bound on an optimal solution length. Binary Decision Diagrams (BDDs) are well-known to AI, e.g. from set-based exploration of sparse-memory and symbolic manipulation of state spaces. The problem of exact or approximate BDD minimization is introduced as a possible new challenge for heuristic search. Like many classical AI domains, this problem is motivated by real-world applications. Several variants of weighted A^* search are applied to problems of BDD minimization and the more classical domains like blocksworld and sliding-tile puzzles. For BDD minimization, the comparison of the evaluated methods also includes previous heuristic and simulation-based methods such as Rudell's hill-climbing based sifting algorithm, Simulated Annealing and Evolutionary Algorithms. A discussion of the results obtained in the different problem domains gives our experiences with weighted A^*, which is of value for the AI practitioner.