Beam Search with Dynamic Pruning for Artificial Intelligence Hard Problems

The "Beam" search algorithm is derived from the classical Artificial Intelligence discipline and it searches under the strategy of "Space-states-operators", guided by heuristics. Although “Beam” is better than the “Breadth” search strategy, it suffers of some drawbacks. In this paper we propose and describe two innovative dynamic pruning variants of the "Beam" search algorithm. In the experiments that we performed with our two variants we obtained that they were consistently more efficient than the original algorithm, maintaining the solution quality. In particular we observed very significant reductions in the number of states required to reach the problem solution, and consequently reducing the response time.

[1]  Robert Puers,et al.  A review of focused ion beam applications in microsystem technology , 2001 .

[2]  Tony R. Martinez,et al.  Optimization by varied beam search in Hopfield networks , 2002, Proceedings of the 2002 International Joint Conference on Neural Networks. IJCNN'02 (Cat. No.02CH37290).

[3]  Muhammad Torabi Dashti,et al.  Extended beam search for non-exhaustive state space analysis , 2012, J. Log. Algebraic Methods Program..

[4]  Charles Elkan,et al.  Beam search algorithms for multilabel learning , 2013, Machine Learning.

[5]  Robert H. Gross,et al.  BEAM: A Beam Search Algorithm for the Identification of Cis-Regulatory Elements in Groups of Genes , 2006, J. Comput. Biol..

[6]  Patrick Henry Winston,et al.  Lisp , 1981, Reihe Künstliche Intelligenz.

[7]  Feng Liu,et al.  The research on accuracy optimization of beam search algorithm , 2006, 2006 7th International Conference on Computer-Aided Industrial Design and Conceptual Design.

[8]  Nils J. Nilsson,et al.  Artificial Intelligence , 1974, IFIP Congress.

[9]  Puneet Gupta,et al.  Beam search for feature selection in automatic SVM defect classification , 2002, Object recognition supported by user interaction for service robots.

[10]  Xiang Song,et al.  A beam search implementation for the irregular shape packing problem , 2010, J. Heuristics.

[11]  Mhand Hifi,et al.  A beam search algorithm for the circular packing problem , 2009, Comput. Oper. Res..

[12]  Shiji Song,et al.  A New Beam Search Algorithm for the Large-Scale Permutation FSP , 2006, 2006 International Conference on Machine Learning and Cybernetics.

[13]  G. Feng,et al.  Application of Beam Search for the decoding of one class of LDPC codes , 2008 .

[14]  S.L. Ho,et al.  A modified ant colony optimization algorithm modeled on tabu-search methods , 2006, IEEE Transactions on Magnetics.

[15]  Alan Fern,et al.  Learning Linear Ranking Functions for Beam Search with Application to Planning , 2009, J. Mach. Learn. Res..