Remarks on the \(\mathrm A^{\ast\ast}\) algorithm (Q2254543): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
ReferenceBot (talk | contribs) Changed an Item |
||
(2 intermediate revisions by 2 users not shown) | |||
Property / MaRDI profile type | |||
Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Property / full work available at URL | |||
Property / full work available at URL: https://doi.org/10.1515/ausi-2015-0003 / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W2204472266 / rank | |||
Normal rank | |||
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