Depth-first iterative-deepening: an optimal admissible tree search
Artificial Intelligence
Linear-space best-first search
Artificial Intelligence
Stochastic node caching for memory-bounded search
AAAI '98/IAAI '98 Proceedings of the fifteenth national/tenth conference on Artificial intelligence/Innovative applications of artificial intelligence
Theoretical Computer Science - Special issue: Genome informatics
A linear space algorithm for computing maximal common subsequences
Communications of the ACM
Enhanced Iterative-Deepening Search
IEEE Transactions on Pattern Analysis and Machine Intelligence
A Divide and Conquer Bidirectional Search: First Results
IJCAI '99 Proceedings of the Sixteenth International Joint Conference on Artificial Intelligence
A* with Partial Expansion for Large Branching Factor Problems
Proceedings of the Seventeenth National Conference on Artificial Intelligence and Twelfth Conference on Innovative Applications of Artificial Intelligence
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
Memory-efficient A* heuristics for multiple sequence alignment
Eighteenth national conference on Artificial intelligence
Journal of the ACM (JACM)
Breadth-first heuristic search
Artificial Intelligence
Externalizing the Multiple Sequence Alignment Problem with Affine Gap Costs
KI '07 Proceedings of the 30th annual German conference on Advances in Artificial Intelligence
Linear-time disk-based implicit graph search
Journal of the ACM (JACM)
Weighted A∗ search -- unifying view and application
Artificial Intelligence
Best-first frontier search with delayed duplicate detection
AAAI'04 Proceedings of the 19th national conference on Artifical intelligence
A breadth-first approach to memory-efficient graph search
AAAI'06 proceedings of the 21st national conference on Artificial intelligence - Volume 2
Cost-algebraic heuristic search
AAAI'05 Proceedings of the 20th national conference on Artificial intelligence - Volume 3
Taming numbers and durations in the model checking integrated planning system
Journal of Artificial Intelligence Research
An improved search algorithm for optimal multiple-sequence alignment
Journal of Artificial Intelligence Research
Breadth-first heuristic search
Artificial Intelligence
Artificial intelligence search algorithms
Algorithms and theory of computation handbook
A two-tiered global path planning strategy for limited memory mobile robots
Robotics and Autonomous Systems
Evaluations of hash distributed A* in optimal sequence alignment
IJCAI'11 Proceedings of the Twenty-Second international joint conference on Artificial Intelligence - Volume Volume One
Hi-index | 0.00 |
We describe a framework for reducing the space complexity of graph search algorithms such as A* that use Open and Closed lists to keep track of the frontier and interior nodes of the search space. We propose a sparse representation of the Closed list in which only a fraction of already expanded nodes need to be stored to perform the two functions of the Closed List - preventing duplicate search effort and allowing solution extraction. Our proposal is related to earlier work on search algorithms that do not use a Closed list at all [Korf and Zhang, 2000]. However, the approach we describe has several advantages that make it effective for a wider variety of problems.