| 释义 |
A* search A* search (algorithm)A graph search algorithm. A* is guaranteed tofind a minimal solution path before any other solution paths,if a solution exists, in other words, it is an "admissible"search algorithm. Each path is assigned a value based on thecost of the path (e.g. its length) and an (under)estimate ofthe cost of completing the path, i.e. the cost of a path fromthe end of the current path to a solution. |