Remarks on the \(\mathrm A^{\ast\ast}\) algorithm (Q2254543): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: Generalized best-first search strategies and the optimality of A* / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q4382151 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: On the complexity of admissible search algorithms / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q3929076 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q4843187 / rank | |||
Normal rank | |||
Latest revision as of 15:33, 9 July 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Remarks on the \(\mathrm A^{\ast\ast}\) algorithm |
scientific article |
Statements
Remarks on the \(\mathrm A^{\ast\ast}\) algorithm (English)
0 references
5 February 2015
0 references
path-finding problem
0 references
graph-search algorithms
0 references
heuristic function
0 references
\(\mathrm A^{\ast\ast}\) algorithm
0 references
