Voir la notice de l'article provenant de la source Math-Net.Ru
[1] Timofeev A.V., Adaptivnye robototekhnicheskie kompleksy, Mashinostroenie, L., 1988.
[2] Khedli Dzh., Nelineinoe i dinamicheskoe programmirovanie, Mir, M., 1967
[3] Bellman R., Dinamicheskoe programmirovanie, Izd-vo inostr. lit., M., 1960 | MR
[4] Vakhrushev V.A., Makhova A.V., Ushakov V.N., “Odin iz algoritmov resheniya zadachi ob obkhode prepyatstvii”, Izv. RAN TiSU, 2000, no. 1, 101–109 | MR
[5] Vakhrushev V.A., Tarasev A.M., Ushakov V.N., “Algoritmy peresecheniya i ob'edineniya mnozhestv na ploskosti”, Upravlenie s garantirovannym rezultatom: Sb. nauch. tr., UNTs AN SSSR, Sverdlovsk, 1987, 28–36
[6] Matviichuk A.R., Ushakov V.N., Zadacha ob optimalnom po bystrodei- stvi upravlenii podvizhnym ob'ektom na ploskosti pri nalichii prepyatstvii, Dep. v VINITI 21.01.03, # 125-B2003, IMM UrO RAN, Ekaterinburg, 2003
[7] Khripunov A.P., Ushakov V.N., “Postroenie integralnykh voronok differentsialnykh vklyuchenii”, Zhurn. vychisl. matematiki i mat. fiziki, 34:7 (1994) | MR | Zbl
[8] Guseinov Kh.G., Moiseev A.N., Ushakov V.N., “Ob approksimatsii oblastei dostizhimosti upravlyaemykh sistem”, Prikladnaya matematika i mekhanika, 65:2 (1998)