Heuristics: intelligent search strategies for computer problem solving
Heuristics: intelligent search strategies for computer problem solving
Generalized best-first search strategies and the optimality of A*
Journal of the ACM (JACM)
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
Heuristic search in restricted memory (research note)
Artificial Intelligence
Artificial Intelligence
Efficient memory-bounded search methods
ECAI '92 Proceedings of the 10th European conference on Artificial intelligence
Artificial Intelligence
Artificial intelligence: a modern approach
Artificial intelligence: a modern approach
ITS: an efficient limited-memory heuristic tree search algorithm
AAAI'94 Proceedings of the twelfth national conference on Artificial intelligence (vol. 2)
Memory-bounded bidirectional search
AAAI'94 Proceedings of the twelfth national conference on Artificial intelligence (vol. 2)
BIDA: an improved perimeter search algorithm
Artificial Intelligence
An Improved Bidirectional Heuristic Search Algorithm
Journal of the ACM (JACM)
Bidirectional Heuristic Search Again
Journal of the ACM (JACM)
Enhanced Iterative-Deepening Search
IEEE Transactions on Pattern Analysis and Machine Intelligence
Searching with Pattern Databases
AI '96 Proceedings of the 11th Biennial Conference of the Canadian Society for Computational Studies of Intelligence on Advances in Artificial Intelligence
How to use limited memory in heuristic search
IJCAI'95 Proceedings of the 14th international joint conference on Artificial intelligence - Volume 1
Finding optimal solutions to the twenty-four puzzle
AAAI'96 Proceedings of the thirteenth national conference on Artificial intelligence - Volume 2
Dynamic improvements of heuristic evaluations during search
AAAI'96 Proceedings of the thirteenth national conference on Artificial intelligence - Volume 1
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
Graphical user interface of an interactive system for schemes design, used in distance learning
CompSysTech '04 Proceedings of the 5th international conference on Computer systems and technologies
The Journal of Supercomputing
Journal of the ACM (JACM)
Heuristic shortest path algorithms for transportation applications: state of the art
Computers and Operations Research
Combining speed-up techniques for shortest-path computations
Journal of Experimental Algorithmics (JEA)
Discovering correlated spatio-temporal changes in evolving graphs
Knowledge and Information Systems
Goal-directed shortest-path queries using precomputed cluster distances
Journal of Experimental Algorithmics (JEA)
Weighted A∗ search -- unifying view and application
Artificial Intelligence
Dual search in permutation state spaces
AAAI'06 proceedings of the 21st national conference on Artificial intelligence - Volume 2
Journal of Artificial Intelligence Research
Switching from bidirectional to unidirectional search
IJCAI'99 Proceedings of the 16th international joint conference on Artificial intelligence - Volume 2
Speed-up techniques for shortest-path computations
STACS'07 Proceedings of the 24th annual conference on Theoretical aspects of computer science
Efficient modified bidirectional algorithm for optimal route-finding
IEA/AIE'07 Proceedings of the 20th international conference on Industrial, engineering, and other applications of applied intelligent systems
SARA'07 Proceedings of the 7th International conference on Abstraction, reformulation, and approximation
Heuristic perimeter search: first results
CAEPIA'05 Proceedings of the 11th Spanish association conference on Current Topics in Artificial Intelligence
Crowd-scale interactive formal reasoning and analytics
Proceedings of the 26th annual ACM symposium on User interface software and technology
Forward perimeter search with controlled use of memory
IJCAI'13 Proceedings of the Twenty-Third international joint conference on Artificial Intelligence
Fast approximation of betweenness centrality through sampling
Proceedings of the 7th ACM international conference on Web search and data mining
Hi-index | 0.00 |
The assessment of bidirectional heuristic search has been incorrect since it was first published more than a quarter of a century ago. For quite a long time, this search strategy did not achieve the expected results, and there was a major misunderstanding about the reasons behind it. Although there is still wide-spread belief that bidirectional heuristic search is afflicted by the problem of search frontiers passing each other, we demonstrate that this conjecture is wrong. Based on this finding, we present both a new generic approach to bidirectional heuristic search and a new approach to dynamically improving heuristic values that is feasible in bidirectional search only. These approaches are put into perspective with both the traditional and more recently proposed approaches in order to facilitate a better overall understanding. Empirical results of experiments with our new approaches show that bidirectional heuristic search can be performed very efficiently and also with limited memory. These results suggest that bidirectional heuristic search appears to be better for solving certain difficult problems than corresponding unidirectional search. This provides some evidence for the usefulness of a search strategy that was long neglected. In summary, we show that bidirectional heuristic search is viable and consequently propose that it be reconsidered.