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
Beam Search with Dynamic Pruning for Artificial Intelligence Hard Problems
2013-11-01
133623 byte
Aufsatz (Konferenz)
Elektronische Ressource
Englisch
Pruning and Quantization for Deeper Artificial Intelligence (AI) Model Optimization
Springer Verlag | 2023
|Artificial Intelligence Search Algorithms for Dynamic Traffic Routing
Transportation Research Record | 1999
|Artificial Intelligence Search Algorithms for Dynamic Traffic Routing
British Library Conference Proceedings | 1999
|Artificial Intelligence Search Algorithms for Dynamic Traffic Routing
Online Contents | 1999
|