Beam stack search
From Wikipedia, the free encyclopedia
Beam stack search is a search algorithm which integrates backtracking with beam search.
This search algorithm was put forward by Rong Zhou and Eric A. Hansen, Department of Computer Science and Engineering, Mississippi State University during the 15th International Conference on Automated Planning and Scheduling in Monterey, California.
It could be describes as a method for transforming beam search into a complete search algorithm that is guaranteed to find an optimal solution. It uses a new data structure, called a beam stack, that makes it possible to integrate systematic backtracking with beam search.
The resulting search algorithm is an anytime algorithm that finds a good, sub-optimal solution quickly, like beam search, and then backtracks and continues to find improved solutions until convergence to an optimal solution.
In most respects, the divide-and-conquer technique can be combined with beam-stack search in the same way as with beam search, creating an algorithm that we call divide-andconquer beam-stack search
[edit] External link
 |
This computer-related article is a stub. You can help Wikipedia by expanding it. |
