Voir la notice de l'article provenant de la source Math-Net.Ru
[1] Formalskii A.M., Upravlyaemost i ustoichivost sistem s ogranichennymi resursami, Nauka, M., 1974 | MR
[2] Chernousko F.L., Ovseevich A.I., “Ellipsoidal bounds of reachable sets: overview and new results”, J. Optimiz. Theory and Appl, 38:2 (2004), 223–246 | DOI
[3] Ushakov V.A., “Postroenie i approksimatsiya oblastei dostizhimosti: obzor suschestvuyuschikh reshenii i vybor programmnogo obespecheniya”, Sb. tr. mezhreg. konf. i Sankt-Peterburgskoi mezhdunar. konf. “Informatsionnaya bezopasnost regionov Rossii. Regionalnaya informatika (RI-2018)” (Sankt-Peterburg, 24–26 oktyabrya 2018 g.), Sankt-Peterburgskoe obschestvo informatiki, vychislitelnoi tekhniki, sistem svyazi i upravleniya, SPb., 2018, 253–257
[4] Patsko V., Fedotov A., “Three-dimensional reachable set for the Dubins car: Foundation of analytical description”, Communs Optimiz. Theory, 23 (2022), 1–42 | MR
[5] Allen R.E., Clark A.A., Starek J.A., Pavone M., “A machine learning approach for real-time reachability analysis”, 2014 IEEE/RSJ Int. Conf. on Intelligent Robots and Systems (Chicago, IL, USA, 2014), 2014, 2202–2208
[6] Bugrov D.I., Formalskii A.M., “Zavisimost ot vremeni oblastei dostizhimosti sistem tretego poryadka”, Prikl. matem. i mekhan, 81:2 (2017), 154–164 | Zbl
[7] Polyak B.T., Scherbakov P.S., Robastnaya ustoichivost i upravlenie, Nauka, M., 2002
[8] Zubov V.I., Kolebaniya v nelineinykh i upravlyaemykh sistemakh, SUDPROMGIZ, L., 1962
[9] Zhermolenko V.N., “Predelnye tsikly na fazovoi ploskosti”, Zadacha Bulgakova o maksimalnom otklonenii i ee primenenie, Izd-vo MGU, M., 1993, 35–47 | Zbl
[10] Aleksandrov V.V., Bugrov D.I., Zhermolenko V.N., Konovalenko I.S., “Mnozhestvo dostizhimosti i robastnaya ustoichivost vozmuschaemykh kolebatelnykh sistem”, Vestn. Mosk. un-ta. Matem. Mekhan, 2021, no. 1, 67–71 | Zbl