|
|
| Line 1: |
Line 1: |
| {{Tree search algorithm}}
| | His name is Maurice Crunk yet it is not essentially the most masucline name out over there. Hiring is what she does in her day procedure. What he really enjoys doing is collecting kites but he doesn't have the time a short time ago. My family lives in South carolina. You can find my website here: http://www.omeglegirls69.com/ |
| '''Best-first search''' is a [[search algorithm]] which explores a [[graph (data structure)|graph]] by expanding the most promising node chosen according to a specified rule.
| |
| | |
| [[Judea Pearl]] described best-first search as estimating the promise of node ''n'' by a "heuristic evaluation function <math>f(n)</math> which, in general, may depend on the description of ''n'', the description of the goal, the information gathered by the search up to that point, and most important, on any extra knowledge about the problem domain."<ref>[[Judea Pearl|Pearl, J.]] ''Heuristics: Intelligent Search Strategies for Computer Problem Solving''. Addison-Wesley, 1984. p. 48.</ref><ref name="RN03">{{Russell Norvig 2003}}. pp. 94 and 95 (note 3).</ref>
| |
| | |
| Some authors have used "best-first search" to refer specifically to a search with a [[Heuristic function|heuristic]] that attempts to predict how close the end of a path is to a solution, so that paths which are judged to be closer to a solution are extended first. This specific type of search is called '''[[Greedy algorithm|greedy]] best-first search'''.<ref name="RN03"/>
| |
| | |
| Efficient selection of the current best candidate for extension is typically implemented using a [[priority queue]].
| |
| | |
| The [[A* search algorithm]] is an example of best-first search, as is [[B*]]. Best-first algorithms are often used for path finding in [[combinatorial search]].
| |
| | |
| ==Algorithm <ref>http://www.macs.hw.ac.uk/~alison/ai3notes/subsubsection2_6_2_3_2.html Best First Search</ref>==
| |
| <source lang="html4strict">
| |
| OPEN = [initial state]
| |
| while OPEN is not empty or until a goal is found
| |
| do
| |
| 1. Remove the best node from OPEN, call it n.
| |
| 2. If n is the goal state, backtrace path to n (through recorded parents) and return path.
| |
| 3. Create n's successors.
| |
| 4. Evaluate each successor, add it to OPEN, and record its parent.
| |
| done
| |
| </source>
| |
| Note that this version of the algorithm is not ''complete'', i.e. it does not always find a possible path between two nodes, even if there is one. For example, it gets stuck in a loop if it arrives at a dead end, that is a node with the only successor being its parent. It would then go back to its parent, add the dead-end successor to the <code>OPEN</code> list again, and so on.
| |
| | |
| The following version extends the algorithm to use an additional <code>CLOSED</code> list, containing all nodes that have been evaluated and will not be looked at again. As this will avoid any node being evaluated twice, it is not subject to infinite loops.
| |
| <source lang="html4strict">
| |
| OPEN = [initial state]
| |
| CLOSED = []
| |
| while OPEN is not empty
| |
| do
| |
| 1. Remove the best node from OPEN, call it n, add it to CLOSED.
| |
| 2. If n is the goal state, backtrace path to n (through recorded parents) and return path.
| |
| 3. Create n's successors.
| |
| 4. For each successor do:
| |
| a. If it is not in CLOSED and it is not in OPEN: evaluate it, add it to OPEN, and record its parent.
| |
| b. Otherwise, if this new path is better than previous one, change its recorded parent.
| |
| i. If it is not in OPEN add it to OPEN.
| |
| ii. Otherwise, adjust its priority in OPEN using this new evaluation.
| |
| done
| |
| </source>
| |
| Also note that the given pseudo code of both versions just terminates when no path is found. An actual implementation would of course require special handling of this case.
| |
| | |
| ==Greedy BFS==
| |
| | |
| Using a [[greedy algorithm]], expand the first successor of the parent. After a successor is generated:<ref>http://www.cs.cmu.edu/afs/cs/project/jair/pub/volume28/coles07a-html/node11.html#modifiedbestfs Greedy Best-First Search when EHC Fails, Carnegie Mellon</ref>
| |
| | |
| # If the successor's heuristic is better than its parent, the successor is set at the front of the queue (with the parent reinserted directly behind it), and the loop restarts.
| |
| # Else, the successor is inserted into the queue (in a location determined by its heuristic value). The procedure will evaluate the remaining successors (if any) of the parent.
| |
| | |
| ==See also==
| |
| *[[Beam search]]
| |
| *[[A* search algorithm]]
| |
| *[[Dijkstra's algorithm]]
| |
| | |
| ==References==
| |
| <references />
| |
| | |
| ==External links==
| |
| * [[wikibooks:Artificial Intelligence/Search/Heuristic search/Best-first search|Wikibooks: Artificial Intelligence: Best-First Search]]
| |
| | |
| [[Category:Search algorithms]]
| |
His name is Maurice Crunk yet it is not essentially the most masucline name out over there. Hiring is what she does in her day procedure. What he really enjoys doing is collecting kites but he doesn't have the time a short time ago. My family lives in South carolina. You can find my website here: http://www.omeglegirls69.com/