Best-first search

Known as: Best first search, Greedy best-first search, Pure heuristic search 
Best-first search is a search algorithm which explores a graph by expanding the most promising node chosen according to a specified rule. Judea Pearl… (More)
Wikipedia

Topic mentions per year

Topic mentions per year

1977-2017
024619772017

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2017
2017
Best-first search algorithms such as A* need to apply tie-breaking strategies in order to decide which node to expand when… (More)
  • figure 1.1
  • figure 1.2
  • table 3.1
  • figure 3.1
  • figure 3.2
Is this relevant?
2017
2017
Best-first search can be regarded as anytime scheme for producing lower bounds on the optimal solution, a characteristic that is… (More)
  • table 1
  • figure 1
  • table 2
  • figure 2
  • figure 3
Is this relevant?
2015
2015
There are two major paradigms for linear-space heuristic search: iterative deepening (IDA*) and recursive best-first search (RBFS… (More)
  • table 1
  • figure 3
Is this relevant?
2014
2014
Greedy Best-First Search (GBFS) is a powerful algorithm at the heart of many state of the art satisficing planners. One major… (More)
  • figure 1
  • figure 2
  • table 1
  • figure 3
  • table 2
Is this relevant?
2011
2011
Best-first search is one of the most fundamental techniques for planning. A heuristic function is used in best-first search to… (More)
  • figure 1
Is this relevant?
2011
2011
Greedy best-first search (GBFS) is a popular and effective algorithm in satisficing planning and is incorporated into high… (More)
  • figure 1
  • figure 2
  • figure 3
  • table 1
  • table 5
Is this relevant?
Review
2007
Review
2007
Finding the exact treewidth of a graph is central to many operations in a variety of areas, including probabilistic reasoning and… (More)
  • figure 1
  • figure 2
  • table 1
  • figure 3
Is this relevant?
Highly Cited
2004
Highly Cited
2004
Best-first search is limited by the memory needed to store the Open and Closed lists, primarily to detect duplicate nodes… (More)
  • figure 1
  • figure 2
  • table 1
  • table 2
  • table 3
Is this relevant?
Highly Cited
1993
Highly Cited
1993
 
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
1993
1993
Best-first search (BFS) expands the fewest nodes among all admissible algorithms using the same cost function, but typically… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 5
  • figure 4
Is this relevant?