In computer science, is a heuristic search algorithm used to explore a graph by expanding the most promising nodes in a limited set. An Anytime Beam Search (Extended Version) - arXiv
