Dynamic search in convex domains
Fundamentalʹnaâ i prikladnaâ matematika, Tome 4 (1998) no. 2, pp. 785-790
Voir la notice de l'article provenant de la source Math-Net.Ru
The dynamic search problem with the simple movement of objects in the limited convex domain of the $n$-dimentional Euclidean space is reduced to the similar problem in another domain includes the original one. As an application of the obtained result, the construction of the search trajectory on a plane is presented.
@article{FPM_1998_4_2_a25,
author = {A. A. Skvortsov},
title = {Dynamic search in convex domains},
journal = {Fundamentalʹna\^a i prikladna\^a matematika},
pages = {785--790},
publisher = {mathdoc},
volume = {4},
number = {2},
year = {1998},
language = {ru},
url = {http://geodesic.mathdoc.fr/item/FPM_1998_4_2_a25/}
}
A. A. Skvortsov. Dynamic search in convex domains. Fundamentalʹnaâ i prikladnaâ matematika, Tome 4 (1998) no. 2, pp. 785-790. http://geodesic.mathdoc.fr/item/FPM_1998_4_2_a25/