Heuristics: intelligent search strategies for computer problem solving
Heuristics: intelligent search strategies for computer problem solving
Depth-first iterative-deepening: an optimal admissible tree search
Artificial Intelligence
Principles of artificial intelligence
Principles of artificial intelligence
BS*: an admissible bidirectional staged heuristic search algorithm
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
An Improved Bidirectional Heuristic Search Algorithm
Journal of the ACM (JACM)
Bidirectional Heuristic Search Again
Journal of the ACM (JACM)
Fundamentals of Computer Alori
Fundamentals of Computer Alori
Bi-directional and heuristic search in path problems
Bi-directional and heuristic search in path problems
Admissibility Proofs for the LCS* Algorithm
IBERAMIA-SBIA '00 Proceedings of the International Joint Conference, 7th Ibero-American Conference on AI: Advances in Artificial Intelligence
Toward the next generation public traffic information system using Internet
HPC-ASIA '97 Proceedings of the High-Performance Computing on the Information Superhighway, HPC-Asia '97
Hi-index | 0.00 |
For more than two decades there has been consensus that bidirectional heuristic search is afflicted by the problem of search wavefronts missing each other. However, our results indicate that a different problem appears to be of primary importance. The fronts typically meet rather early even without using waveshaping techniques. Especially when aiming for optimal solutions, however, much effort has to be spent for subsequently improving the solution quality, and finally for proving that there is indeed no better solution possible. Therefore, only slightly relaxing the requirements on the solution quality already leads to strong improvements in efficiency. We describe several new e-admissible bidirectional search algorithms which do not use wave-shaping techniques. The most efficient of these use a novel termination criterion designed to address the suspected primary problem of bidirectional heuristic search. We prove E-admissibility and a dominance result based on this termination criterion. In summary, we show that and how bidirectional best-first search can be more efficient than the corresponding unidirectional counterpart without using computationally very demanding waveshaping techniques.