Construct · 1 fields · 1 citations

A search*: a standalone construct

One name. One construct. A landmark on the map.

● anchor · a standalone construct Nearest construct by meaning·not indexed

A single standalone construct; nearby constructs are located against it in the Collider. Tap a field for its definition, unit, and measures.

Computer science

a best-first graph search that ranks paths by cost so far plus a heuristic estimate, finding optimal paths when the heuristic never overestimates.

In computer science, A* search refers to a best-first graph search that ranks paths by cost so far plus a heuristic estimate, finding optimal paths when the heuristic never overestimates. This meaning comes from Hart (1968) in IEEE Transactions on Systems Science and Cybernetics.[1]

Unit
Recovery means
Measured by

Run it through the Collider, or take the citations with you.

See how A* search sits against neighbouring constructs in the Collider, or export every reference on this page in one click.

Open in Collider Export BibTeX Report this entry

Nearby constructs

heuristic4 fields · 4 citationsjingle · one word, four constructs cost4 fields · 4 citationsjingle · one word, four constructs search4 fields · 7 citationsjingle · one word, four constructs

References

Hart, P., Nilsson, N., & Raphael, B. (1968). A Formal Basis for the Heuristic Determination of Minimum Cost Paths. IEEE Transactions on Systems Science and Cybernetics, 4(2), 100-107. https://doi.org/10.1109/tssc.1968.300136

Cited on this page?

Confirm your construct, or correct us.

If your work is cited behind one of these entries, you know better than we do whether we captured the meaning right. Confirm it, suggest an edit, or dispute it, and your name goes on the entry as an author who has checked it, linked to your ORCID.

Claim your construct