A* algorithm A member of the class of best-first heuristic search techniques that attempt to find a “best” path from a given start node to a designated goal node in a problem graph. An evaluation function is used to estimate the cost of the (unknown) distance from the current node being explored to the goal and this is then added to the (known) cost of the shortest path from the start node to the current node to give a figure of merit for the current node. At each iteration the node with the best cost figure is used to pursue the search. The operation of the algorithm displays a behavior that is a mixture of depth-first and breadth-first searching.
More From encyclopedia.com
Search , search / sərch/ • v. [intr.] try to find something by looking or otherwise seeking carefully and thoroughly: I searched among the rocks, but there wa… Searching , searching Locating information in a table or file by reference to a special field of each record, called the key. The goal of the search is to discov… Online Information Services , A search engine is an information retrieval system that allows someone to search the vast collection of resources on the Internet and the World Wide… Boundary Current , boundary current The northward- or southward-directed ocean-water current which flows parallel and close to a continental margin. Such currents are c… Rip Current , Rip current A rip current is a narrow, river-like channel of water moving away from the surf (breaking) zone and back toward sea. Rip currents can tr… Cost , Cost In economics, the cost of an event is the highest-valued opportunity necessarily forsaken. The usefulness of the concept of cost is a logical im…
About this article
Updated About encyclopedia.com content Print Article
You Might Also Like