|
Preprints of the Keldysh Institute of Applied Mathematics, 1997, 044
(Mi ipmp1432)
|
|
|
|
This article is cited in 1 scientific paper (total in 1 paper)
Investigation of Efficiency of Path Finding Algorythms in Uncertainty. 2. Atlas of Singular Situations and Atlas of 'Unstable Domination'
A. A. Kiril’chenko
Abstract:
The investigation results of path finding algorithms in uncertainty are presented. The classifications of path finding algorithms and obstacles structures are given. The atlas of singular situations and the atlas of 'unstable domination' for path finding algorithms in uncertainty are presented (case 2D). Singular situation is used for illustration of some type of moving point qualitative behaviour by small variation of some problem parameters (for example, initial and final points). 'Unstable domination' is characterized by the fact that domination function of one algorithm over another changes its sign by small variation of problem parameters.
Citation:
A. A. Kiril’chenko, “Investigation of Efficiency of Path Finding Algorythms in Uncertainty. 2. Atlas of Singular Situations and Atlas of 'Unstable Domination'”, Keldysh Institute preprints, 1997, 044
Linking options:
https://www.mathnet.ru/eng/ipmp1432 https://www.mathnet.ru/eng/ipmp/y1997/p44
|
Statistics & downloads: |
Abstract page: | 73 | Full-text PDF : | 6 |
|