Beam stack search
Beam Stack Search[1] is a search algorithm that combines chronological backtracking (that is, depth-first search) with beam search and is similar to Depth-First Beam Search.[2] Both search algorithms are anytime algorithms that find good but likely sub-optimal solutions quickly, like beam search, then backtrack and continue to find improved solutions until convergence to an optimal solution.
Implementation
Beam Stack Search uses the beam stack as a data structure to integrate chronological backtracking with beam search and can be combined with the divide and conquer algorithm technique, resulting in divide-and-conquer beam-stack search.
Alternatives
Beam Search Using Limited Discrepancy Backtracking[2] (BULB) is a search algorithm that combines limited discrepancy search with beam search and thus performs non-chronological backtracking, which often outperforms the chronological backtracking done by Beam Stack Search and Depth-First Beam Search.
References
- ^ Zhou, Rong; Hansen, Eric (2005). "Beam-Stack Search: Integrating Backtracking with Beam Search". CiteSeerX 10.1.1.71.4147.
{{cite journal}}: Cite journal requires|journal=(help) - ^ a b Furcy, David. Koenig, Sven. "Limited Discrepancy Beam Search". 2005. "Archived copy" (PDF). Retrieved 2007-12-22.
 | This algorithms or data structures-related article is a stub. You can help Wikipedia by expanding it. |