An \(\mathrm{AO}^{*}\) based exact algorithm for the Canadian traveler problem (Q2806869)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: An AO^* based exact algorithm for the Canadian traveler problem |
scientific article; zbMATH DE number 6582452
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | An \(\mathrm{AO}^{*}\) based exact algorithm for the Canadian traveler problem |
scientific article; zbMATH DE number 6582452 |
Statements
19 May 2016
0 references
path planning
0 references
Canadian traveler problem
0 references
Markov decision process
0 references
\(\mathrm{AO}^{*}\) search
0 references
0 references
0 references
An \(\mathrm{AO}^{*}\) based exact algorithm for the Canadian traveler problem (English)
0 references
0.8132027387619019
0 references
0.8122836351394653
0 references
0.8010578155517578
0 references
0.7895395755767822
0 references
0.7798731923103333
0 references
