An improvement algorithm based on local approximation of reachable set
Matematičeskoe modelirovanie, Tome 13 (2001) no. 6, pp. 23-26
Cet article a éte moissonné depuis la source Math-Net.Ru
It is proposed an improvement algorithm based on the approximate representation of reachable set by using a solution of Bellman's equation. In comparison with [2] it is considered another type of reachable set approximation. The algorithm efficiency is illustrated on a text example.
@article{MM_2001_13_6_a4,
author = {V. A. Baturin and E. V. Goncharova and N. V. Pochinskaya},
title = {An improvement algorithm based on local approximation of reachable set},
journal = {Matemati\v{c}eskoe modelirovanie},
pages = {23--26},
year = {2001},
volume = {13},
number = {6},
language = {ru},
url = {http://geodesic.mathdoc.fr/item/MM_2001_13_6_a4/}
}
TY - JOUR AU - V. A. Baturin AU - E. V. Goncharova AU - N. V. Pochinskaya TI - An improvement algorithm based on local approximation of reachable set JO - Matematičeskoe modelirovanie PY - 2001 SP - 23 EP - 26 VL - 13 IS - 6 UR - http://geodesic.mathdoc.fr/item/MM_2001_13_6_a4/ LA - ru ID - MM_2001_13_6_a4 ER -
V. A. Baturin; E. V. Goncharova; N. V. Pochinskaya. An improvement algorithm based on local approximation of reachable set. Matematičeskoe modelirovanie, Tome 13 (2001) no. 6, pp. 23-26. http://geodesic.mathdoc.fr/item/MM_2001_13_6_a4/