A* Algorithm [chapter]

<span title="">2013</span> <i title="Springer US"> Encyclopedia of Operations Research and Management Science </i> &nbsp;
A heuristic search procedure that selects a node in its search tree for expansion such that the selected node has minimum value of the sum of the cost to reach the node plus a heuristic cost value for that node, where the heuristic cost underestimates the true minimum cost of completion.
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/978-1-4419-1153-7_200001">doi:10.1007/978-1-4419-1153-7_200001</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/pqhbvw2wtjefrdr64yendafiya">fatcat:pqhbvw2wtjefrdr64yendafiya</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20180725225929/https://link.springer.com/content/pdf/10.1007%2F978-1-4419-1153-7_200001.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/50/82/5082606a68ad967761f6f1265f112cf40f75d93d.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/978-1-4419-1153-7_200001"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> springer.com </button> </a>