Beam stack search: Difference between revisions

Revision as of 12:27, 21 November 2005

Revision as of 22:31, 23 November 2005

Line 1:

'''Beam Stackstack Searchsearch''' 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, Mississippi State]] during the 15th International Conference on Automated Planning and Scheduling ,in [[Monterey, CACalifornia]].

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

Line 10:

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

==External link==

The following web page has the original paper submitted by Zhou and Hansen.

*[http://www.cs.msstate.edu/~hansen/papers/icaps05beam.pdf Zhou and Hansen's original paper]

{{compu-stub}}

by Rakesh Gosangi

[e-mail]