<?xml version="1.0" encoding="UTF-8"?>
<!DOCTYPE article PUBLIC "-//NLM//DTD JATS (Z39.96) Journal Publishing DTD v1.3 20210610//EN" "JATS-journalpublishing1-3.dtd">
<article article-type="research-article" dtd-version="1.3" xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xml:lang="ru"><front><journal-meta><journal-id journal-id-type="publisher-id">caht</journal-id><journal-title-group><journal-title xml:lang="ru">Научный вестник МГТУ ГА</journal-title><trans-title-group xml:lang="en"><trans-title>Civil Aviation High Technologies</trans-title></trans-title-group></journal-title-group><issn pub-type="ppub">2079-0619</issn><issn pub-type="epub">2542-0119</issn><publisher><publisher-name>Moscow State Technical University of Civil Aviation (MSTU CA)</publisher-name></publisher></journal-meta><article-meta><article-id pub-id-type="doi">10.26467/2079-0619-2026-29-4-8-28</article-id><article-id custom-type="elpub" pub-id-type="custom">caht-2794</article-id><article-categories><subj-group subj-group-type="heading"><subject>Research Article</subject></subj-group><subj-group subj-group-type="section-heading" xml:lang="ru"><subject>ТРАНСПОРТНЫЕ СИСТЕМЫ</subject></subj-group><subj-group subj-group-type="section-heading" xml:lang="en"><subject>TRANSPORTATION SYSTEMS</subject></subj-group></article-categories><title-group><article-title>Метод определения маршрута обхода воздушным судном динамически изменяющейся зоны грозовой деятельности</article-title><trans-title-group xml:lang="en"><trans-title>Method for determining an aircraft avoidance route around a dynamically changing thunderstorm activity area</trans-title></trans-title-group></title-group><contrib-group><contrib contrib-type="author" corresp="yes"><name-alternatives><name name-style="eastern" xml:lang="ru"><surname>Коваленко</surname><given-names>Г. В.</given-names></name><name name-style="western" xml:lang="en"><surname>Kovalenko</surname><given-names>G. V.</given-names></name></name-alternatives><bio xml:lang="ru"><p>Коваленко Геннадий Владимирович, доктор технических наук, профессор, профессор кафедры летной эксплуатации и безопасности полетов в гражданской авиации,</p><p>Санкт-Петербург.</p></bio><bio xml:lang="en"><p>Gennadiy V. Kovalenko, Doctor of Technical Sciences, Professor, Professor of the Flight Operations and Flight Safety in Civil Aviation Chair, </p><p>St. Petersburg.</p></bio><email xlink:type="simple">kgvf@inbox.ru</email><xref ref-type="aff" rid="aff-1"/></contrib><contrib contrib-type="author" corresp="yes"><name-alternatives><name name-style="eastern" xml:lang="ru"><surname>Ядров</surname><given-names>И. А.</given-names></name><name name-style="western" xml:lang="en"><surname>Yadrov</surname><given-names>I. A.</given-names></name></name-alternatives><bio xml:lang="ru"><p>Ядров Илья Александрович, аспирант кафедры летной эксплуатации и безопасности полетов в гражданской авиации,</p><p>Санкт-Петербург.</p></bio><bio xml:lang="en"><p>Ilya A. Yadrov, Postgraduate Student of the Flight Operations and Flight Safety in Civil Aviation Chair,</p><p>St. Petersburg.</p></bio><xref ref-type="aff" rid="aff-1"/></contrib></contrib-group><aff-alternatives id="aff-1"><aff xml:lang="ru"><institution>Санкт-Петербургский государственный университет гражданской авиации имени Главного маршала авиации А.А. Новикова</institution><country>Россия</country></aff><aff xml:lang="en"><institution>St. Petersburg State University of Civil Aviation named after Chief Marshal of Aviation A.A. Novikov</institution><country>Russian Federation</country></aff></aff-alternatives><pub-date pub-type="collection"><year>2026</year></pub-date><pub-date pub-type="epub"><day>03</day><month>09</month><year>2026</year></pub-date><volume>29</volume><issue>4</issue><fpage>8</fpage><lpage>28</lpage><permissions><copyright-statement>Copyright &amp;#x00A9; Коваленко Г.В., Ядров И.А., 2026</copyright-statement><copyright-year>2026</copyright-year><copyright-holder xml:lang="ru">Коваленко Г.В., Ядров И.А.</copyright-holder><copyright-holder xml:lang="en">Kovalenko G.V., Yadrov I.A.</copyright-holder><license xml:lang="ru" license-type="creative-commons-attribution" xlink:href="https://creativecommons.org/licenses/by/4.0/" xlink:type="simple"><license-p>Данная работа распространяется под лицензией Creative Commons Attribution 4.0.</license-p></license><license xml:lang="en" license-type="creative-commons-attribution" xlink:href="https://creativecommons.org/licenses/by/4.0/" xlink:type="simple"><license-p>This work is licensed under a Creative Commons Attribution 4.0 License.</license-p></license></permissions><self-uri xlink:href="https://avia.mstuca.ru/jour/article/view/2794">https://avia.mstuca.ru/jour/article/view/2794</self-uri><abstract><p>В статье представлен метод построения маршрута обхода динамически изменяющейся зоны грозовой деятельности, основанный на использовании взвешенного динамического графа с фиксированным множеством вершин и изменяющимся множеством ребер. Предложенный подход позволяет учитывать пространственно-временную изменчивость грозовых ячеек, а также способствует снижению вычислительной сложности задачи планирования и повышению безопасности маршрута обхода при наличии прогностической информации о развитии грозовых очагов в сверхкраткосрочном периоде. Также представлены результаты разработки алгоритма оптимизации маршрута на основе графа видимости, обеспечивающего сокращение длины маршрута без потери корректности обхода. Проведен статистический анализ, подтвердивший эффективность метода и сопоставимость его результатов с базовым подходом при меньших вычислительных затратах. Практическая значимость работы заключается в возможности интеграции разработанного метода в состав интеллектуальных систем поддержки принятия решений и автоматизированных систем планирования траектории полета при обходе опасных метеоявлений, что может способствовать повышению безопасности и экономичности полетов.</p></abstract><trans-abstract xml:lang="en"><p>The paper presents a method for plotting an avoidance route around a dynamically changing thunderstorm area, based on the use of a weighted dynamic graph with a fixed set of nodes and a changing set of edges. The proposed approach allows for accounting for the spatiotemporal variability of thunderstorm cells and also contributes to reducing the computational complexity of the planning task and enhancing the safety of the avoidance route when predictive information on the development of thunderstorm cells in the very short term is available. The results of developing a route optimization algorithm based on a visibility graph, which ensures a reduction in route length without loss of avoidance correctness, are also presented. A statistical analysis was conducted, confirming the method effectiveness and the comparability of its results with the baseline approach at lower computational costs. The practical significance of the work lies in the possibility of integrating the developed method into intelligent decision support systems and automated flight trajectory planning systems for circumventing hazardous weather phenomena, which can contribute to enhanced flight safety and efficiency.</p></trans-abstract><kwd-group xml:lang="ru"><kwd>авиация</kwd><kwd>безопасность полетов</kwd><kwd>оптимизация</kwd><kwd>обход грозы</kwd><kwd>динамический граф</kwd><kwd>планирование маршрута</kwd><kwd>траекторное управление полетом</kwd></kwd-group><kwd-group xml:lang="en"><kwd>aviation</kwd><kwd>flight safety</kwd><kwd>optimization</kwd><kwd>thunderstorm avoidance</kwd><kwd>dynamic graph</kwd><kwd>route planning</kwd><kwd>flight trajectory management</kwd></kwd-group></article-meta></front><back><ref-list><title>References</title><ref id="cit1"><label>1</label><citation-alternatives><mixed-citation xml:lang="ru">Lui G.N., Hon K.K., Liem R.P. Weather impact quantification on airport arrival on-time performance through a Bayesian statistics modeling approach [Электронный ресурс] // Transportation Research Part C: Emerging Technologies. 2022. Vol. 143. ID: 103811. DOI: 10.1016/j.trc.2022.103811 (дата обращения: 10.10.2025).</mixed-citation><mixed-citation xml:lang="en">Lui, G.N., Hon, K.K., Liem, R.P. (2022). Weather impact quantification on airport arrival on-time performance through a Bayesian statistics modeling approach. Transportation Research Part C: Emerging Technologies , vol. 143, ID: 103811. DOI: 10.1016/j.trc.2022.103811 (accessed: 10.10.2025).</mixed-citation></citation-alternatives></ref><ref id="cit2"><label>2</label><citation-alternatives><mixed-citation xml:lang="ru">DeLaura R. Modeling convective weather avoidance in en-route airspace / R. DeLaura, M. Robinson, M. Pawlak, J. Evans [Электронный ресурс] // 13th Conference on Aviation, Range, and Aerospace Meteorology. AMS, LA, New Orleans, 2008. 12 p. URL: https://skybrary.aero/sites/default/files/bookshelf/4574.pdf (дата обращения: 10.10.2025).</mixed-citation><mixed-citation xml:lang="en">DeLaura, R., Robinson, M., Pawlak, M., Evans, J. (2008). Modeling convective weather avoidance in enroute airspace. In: 13th Conference on Aviation, Range, and Aerospace Meteorology. AMS, New Orleans, LA, 12 p. Available at: https://skybrary.aero/sites/default/files/bookshelf/4574.pdf (accessed: 10.10.2025).</mixed-citation></citation-alternatives></ref><ref id="cit3"><label>3</label><citation-alternatives><mixed-citation xml:lang="ru">Sharman R., Williams J.K. The complexities of thunderstorm avoidance due to turbulence and implications for traffic flow management // Aviation, range and aerospace meteorology special symposium on weather-air traffic management integration, 2009. 10 p. URL: https://ams.confex.com/ams/89annual/techprogram/paper_149843.htm (дата обращения: 10.10.2025).</mixed-citation><mixed-citation xml:lang="en">Sharman R., Williams J.K. (2009). The complexities of thunderstorm avoidance due to turbulence and implications for traffic flow management. In: Aviation, range and aerospace meteorology special symposium on weather-air traffic management integration , 10 p. Available at: https://ams.confex.com/ams/89annual/techprogram/paper_149843.htm (accessed: 10.10.2025).</mixed-citation></citation-alternatives></ref><ref id="cit4"><label>4</label><citation-alternatives><mixed-citation xml:lang="ru">Franco A. A probabilistic storm avoidance concept for en-route flight / A. Franco, A. Valenzuela, D. Rivas, D. Sacher, J. Lang, T. Hauf [Электронный ресурс] // Proceedings of the 10th SESAR Innovation Days. SESAR Joint Undertaking, 2020. 8 p. URL: https://idus.us.es/server/api/core/bitstreams/162d9edd-e5e7-471d-8b6c-fdcbd6a95878/content (дата обращения: 10.10.2025).</mixed-citation><mixed-citation xml:lang="en">Franco, A., Valenzuela, A., Rivas, D., Sacher, D., Lang, J., Hauf, T. (2020). A probabilistic storm avoidance concept for enroute flight. In: Proceedings of the 10th SESAR Innovation Days. SESAR Joint Undertaking, 8 p. Available at: https://idus.us.es/server/api/core/bitstreams/162d9edd-e5e7-471d-8b6c-fdcbd6a95878/content (accessed: 10.10.2025).</mixed-citation></citation-alternatives></ref><ref id="cit5"><label>5</label><citation-alternatives><mixed-citation xml:lang="ru">Deng X. Multi-obstacle path planning and optimization for mobile robot / X. Deng, R. Li, L. Zhao, K. Wang, X. Gui [Электронный ресурс] // Expert Systems with Applications. 2021. Vol. 183. ID: 115445. DOI: 10.1016/j.eswa.2021.115445 (дата обращения: 10.10.2025).</mixed-citation><mixed-citation xml:lang="en">Deng, X., Li, R., Zhao, L., Wang, K., Gui, X. (2021). Multi-obstacle path planning and optimization for mobile robot. Expert Systems with Applications , vol. 183, ID: 115445. DOI: 10.1016/j.eswa.2021.115445 (accessed: 10.10.2025).</mixed-citation></citation-alternatives></ref><ref id="cit6"><label>6</label><citation-alternatives><mixed-citation xml:lang="ru">Luo J., Wang Z.X., Pan K.L. Reliable path planning algorithm based on improved artificial potential field method [Электронный ресурс] // IEEE Access. 2022. Vol. 10. Pp. 108276–108284. DOI: 10.1109/ACCESS.2022.3212741 (дата обращения: 10.10.2025).</mixed-citation><mixed-citation xml:lang="en">Luo, J., Wang, Z.X., Pan, K.L. (2022). Reliable path planning algorithm based on improved artificial potential field method. IEEE Access , vol. 10, pp. 108276–108284. DOI: 10.1109/ACCESS.2022.3212741 (accessed: 10.10.2025).</mixed-citation></citation-alternatives></ref><ref id="cit7"><label>7</label><citation-alternatives><mixed-citation xml:lang="ru">Rosenow J., Lindner M., Scheiderer J. Advanced flight planning and the benefit of inflight aircraft trajectory optimization [Электронный ресурс] // Sustainability. 2021. Vol. 13, iss. 3. ID: 1383. DOI: 10.3390/su13031383 (дата обращения: 10.10.2025).</mixed-citation><mixed-citation xml:lang="en">Rosenow, J., Lindner, M., Scheiderer, J. (2021). Advanced flight planning and the benefit of in-flight aircraft trajectory optimization. Sustainability , vol. 13, issue 3. ID: 1383. DOI: 10.3390/su13031383 (accessed: 10.10.2025).</mixed-citation></citation-alternatives></ref><ref id="cit8"><label>8</label><citation-alternatives><mixed-citation xml:lang="ru">Lu L., Liu C. Research on trajectory planning in thunderstorm weather based on dynamic window algorithm during approach segment [Электронный ресурс] // Scientific Programming. 2022. ID: 7031928. 10 p. DOI: 10.1155/2022/7031928 (дата обращения: 10.10.2025).</mixed-citation><mixed-citation xml:lang="en">Lu, L., Liu, C. (2022). Research on trajectory planning in thunderstorm weather based on dynamic window algorithm during approach segment. Scientific Programming , ID: 7031928, 10 p. DOI: 10.1155/2022/7031928 (accessed: 10.10.2025).</mixed-citation></citation-alternatives></ref><ref id="cit9"><label>9</label><citation-alternatives><mixed-citation xml:lang="ru">Costas P., de Oliveira I.R. Advancing operational efficiency: airspace users' perspective on trajectory-based operations // Systems and Control. 2024. DOI: 10.48550/arXiv.2412.08783 (дата обращения: 10.10.2025).</mixed-citation><mixed-citation xml:lang="en">Costas, P., de Oliveira, I.R. (2024). Advancing operational efficiency: airspace users' perspective on trajectory-based operations. Systems and Control . DOI: 10.48550/arXiv.2412.08783 (accessed: 10.10.2025).</mixed-citation></citation-alternatives></ref><ref id="cit10"><label>10</label><citation-alternatives><mixed-citation xml:lang="ru">Коваленко Г.В., Ядров И.А. Способ определения маршрута обхода воздушным судном грозы методом нахождения кратчайшего пути на графе // Crede Experto: транспорт, общество, образование, язык. 2025. № 3 (46). С. 35–55. DOI: 10.51955/23121327_2025_3_35</mixed-citation><mixed-citation xml:lang="en">Kovalenko, G.V., Yadrov, I.A. (2025). Method for determining an aircraft route to avoid a thunderstorm using the shortest path on a graph. Crede Experto: Transport, Society, Education, Language , no. 3 (46), pp. 35–55. DOI: 10.51955/2312-1327_2025_3_35 (in Russian)</mixed-citation></citation-alternatives></ref><ref id="cit11"><label>11</label><citation-alternatives><mixed-citation xml:lang="ru">Agarwal D., Bharti P.S. A review on comparative analysis of path planning and collision avoidance algorithms // International Journal of Industrial and Manufacturing Engineering. 2018. Vol. 12, no. 6. Pp. 608–624.</mixed-citation><mixed-citation xml:lang="en">Agarwal, D., Bharti, P.S. (2018). A review on comparative analysis of path planning and collision avoidance algorithms. International Journal of Industrial and Manufacturing Engineering , vol. 12, no. 6, pp. 608–624.</mixed-citation></citation-alternatives></ref><ref id="cit12"><label>12</label><citation-alternatives><mixed-citation xml:lang="ru">Xu J. A concave hull algorithm for scattered data and its applications / J. Xu, Z. Zheng, Y. Feng, X. Qing // 2010 3rd International Congress on Image and Signal Processing. IEEE, 2010. No. 5. Pp. 2430–2433. DOI: 10.1109/CISP.2010.5648277</mixed-citation><mixed-citation xml:lang="en">Xu, J., Zheng, Z., Feng, Y., Qing, X. (2010). A concave hull algorithm for scattered data and its applications. In: 2010 3rd International Congress on Image and Signal Processing. IEEE , no. 5, pp. 2430–2433. DOI: 10.1109/CISP.2010.5648277</mixed-citation></citation-alternatives></ref><ref id="cit13"><label>13</label><citation-alternatives><mixed-citation xml:lang="ru">Saalfeld A. Topologically consistent line simplification with the Douglas-Peucker algorithm // Cartography and Geographic Information Science. 1999. Vol. 26, iss. 1. Pp. 7–18. DOI: 10.1559/152304099782424901</mixed-citation><mixed-citation xml:lang="en">Saalfeld, A. (1999). Topologically consistent line simplification with the DouglasPeucker algorithm. Cartography and Geographic Information Science , vol. 26, issue 1, pp. 7–18. DOI: 10.1559/152304099782424901</mixed-citation></citation-alternatives></ref><ref id="cit14"><label>14</label><citation-alternatives><mixed-citation xml:lang="ru">Rachmawati D., Gustin L. Analysis of Dijkstra’s algorithm and A* algorithm in shortest path problem [Электронный ресурс] // Journal of Physics: Conference Series, 2020. Vol. 1566. ID: 012061. DOI: 10.1088/17426596/1566/1/012061 (дата обращения: 10.10.2025).</mixed-citation><mixed-citation xml:lang="en">Rachmawati, D., Gustin, L. (2020). Analysis of Dijkstra’s algorithm and A* algorithm in shortest path problem. Journal of Physics: Conference Series , vol. 1566, ID: 012061. DOI: 10.1088/1742-6596/1566/1/012061 (accessed: 10.10.2025).</mixed-citation></citation-alternatives></ref><ref id="cit15"><label>15</label><citation-alternatives><mixed-citation xml:lang="ru">Crouch M.S., McGregor A., Stubbs D. Dynamic graphs in the sliding-window model. In book: Algorithms. Springer, Berlin, Heidelberg, 2013. Pp. 337–348. DOI: 10.1007/978-3-64240450-4_29</mixed-citation><mixed-citation xml:lang="en">Crouch, M.S., McGregor, A., Stubbs, D. (2013). Dynamic graphs in the sliding-window model. In book: Algorithms . Springer, Berlin, Heidelberg, pp. 337–348. DOI: 10.1007/978-3642-40450-4_29</mixed-citation></citation-alternatives></ref><ref id="cit16"><label>16</label><citation-alternatives><mixed-citation xml:lang="ru">Aubian G., Brunelli F., Dragan F.F. и др. On the complexity of computing a fastest temporal path in interval temporal graphs [Электронный ресурс] // 2025. 16 p. URL: https://inria.hal.science/hal-04863343v1/document (дата обращения: 10.10.2025).</mixed-citation><mixed-citation xml:lang="en">Aubian, G., Brunelli, F., Dragan, F.F. et al. (2025). On the complexity of computing a fastest temporal path in interval temporal graphs, 16 p. Available at: https://inria.hal.science/hal04863343v1/document (accessed: 10.10.2025).</mixed-citation></citation-alternatives></ref><ref id="cit17"><label>17</label><citation-alternatives><mixed-citation xml:lang="ru">Dinas S., Banon J.M. A review on Delaunay triangulation with application on computer vision // International Journal of Computer Science and Engineering. 2014. Vol. 3, iss. 2. Pp. 10–18.</mixed-citation><mixed-citation xml:lang="en">Dinas, S., Banon, J.M. (2014). A review on Delaunay triangulation with application on computer vision. International Journal of Computer Science and Engineering , vol. 3, issue 2, pp. 10–18.</mixed-citation></citation-alternatives></ref><ref id="cit18"><label>18</label><citation-alternatives><mixed-citation xml:lang="ru">Kramer O. K-nearest neighbors. In book: Dimensionality reduction with unsupervised nearest neighbors. Berlin, Heidelberg: Springer Berlin Heidelberg, 2013. Vol. 51. Pp. 13–23. DOI: 10.1007/978-3-642-38652-7_2</mixed-citation><mixed-citation xml:lang="en">Kramer, O. (2013). K-nearest neighbors. In book: Dimensionality reduction with unsupervised nearest neighbors . Berlin, Heidelberg: Springer Berlin Heidelberg, vol. 51, pp. 13–23. DOI: 10.1007/978-3-642-38652-7_2</mixed-citation></citation-alternatives></ref><ref id="cit19"><label>19</label><citation-alternatives><mixed-citation xml:lang="ru">Langenberg B. A tutorial on using the paired t test for power calculations in repeated measures ANOVA with interactions / B. Langenberg, M. Janczyk, V. Koob, R. Kliegl, A. Mayer // Behavior Research Methods. 2023. Vol. 55. Pp. 2467–2484. DOI: 10.3758/s13428022-01902-8</mixed-citation><mixed-citation xml:lang="en">Langenberg, B., Janczyk, M., Koob, V., Kliegl, R., Mayer, A. (2023). A tutorial on using the paired t test for power calculations in repeated measures ANOVA with interactions. Behavior Research Methods , vol. 55, pp. 2467–2484. DOI: 10.3758/s13428-022-01902-8</mixed-citation></citation-alternatives></ref><ref id="cit20"><label>20</label><citation-alternatives><mixed-citation xml:lang="ru">Zhou Y., Zhu Y., Wong W.K. Statistical tests for homogeneity of variance for clinical trials and recommendations [Электронный ресурс] // Contemporary clinical trials communications. 2023. Vol. 33. ID: 101119. DOI: 10.1016/j.conctc.2023.101119 (дата обращения: 10.10.2025).</mixed-citation><mixed-citation xml:lang="en">Zhou, Y., Zhu, Y., Wong, W.K. (2023). Statistical tests for homogeneity of variance for clinical trials and recommendations. Contemporary Clinical Trials Communications , vol. 33. ID: 101119. DOI: 10.1016/j.conctc.2023.101119 (accessed: 10.10.2025).</mixed-citation></citation-alternatives></ref><ref id="cit21"><label>21</label><citation-alternatives><mixed-citation xml:lang="ru">González-Estrada E., Villaseñor J.A., Acosta-Pech R. Shapiro-Wilk test for multivariate skew-normality // Computational Statistics. 2022. Vol 37, iss. 4. Pp. 1985–2001. DOI: 10.1007/s00180-021-01188-y</mixed-citation><mixed-citation xml:lang="en">González-Estrada, E., Villaseñor, J.A., Acosta-Pech, R. (2022). Shapiro-Wilk test for multivariate skew-normality. Computational Statistics , vol. 37, issue 4, pp. 1985–2001. DOI: 10.1007/s00180-021-01188-y</mixed-citation></citation-alternatives></ref><ref id="cit22"><label>22</label><citation-alternatives><mixed-citation xml:lang="ru">Thakkar B. Continuous variable analyses: student's t-test, Mann–Whitney U test, Wilcoxon signed-rank test // Translational cardiology. 2025. Pp. 165–167. DOI: 10.1016/B978-0323-91790-2.00052-6</mixed-citation><mixed-citation xml:lang="en">Thakkar, B. (2025). Continuous variable analyses: student's t-test, MannWhitney U test, Wilcoxon signed-rank test. Translational cardiology , pp. 165–167. DOI: 10.1016/B978-0-323-91790-2.00052-6</mixed-citation></citation-alternatives></ref><ref id="cit23"><label>23</label><citation-alternatives><mixed-citation xml:lang="ru">Pembury Smith M.Q.R., Ruxton G.D. Effective use of the McNemar test [Электронный ресурс] // Behavioral Ecology and Sociobiology. 2020. Vol. 74. ID: 133. DOI: 10.1007/s00265-020-02916-y (дата обращения: 10.10.2025).</mixed-citation><mixed-citation xml:lang="en">Pembury Smith, M.Q.R., Ruxton, G.D. (2020). Effective use of the McNemar test. Behavioral Ecology and Sociobiology , vol. 74. ID: 133. DOI: 10.1007/s00265-020-02916-y (accessed: 10.10.2025).</mixed-citation></citation-alternatives></ref><ref id="cit24"><label>24</label><citation-alternatives><mixed-citation xml:lang="ru">Wilf H.S. Algorithms and complexity. 2nd ed. CRC Press, 2002. 232 p. DOI: 10.1201/9780429294921</mixed-citation><mixed-citation xml:lang="en">Wilf, H.S. (2002). Algorithms and Complexity. 2nd ed. CRC Press, 232 p. DOI: 10.1201/9780429294921</mixed-citation></citation-alternatives></ref><ref id="cit25"><label>25</label><citation-alternatives><mixed-citation xml:lang="ru">Jurkiewicz P. Empirical time complexity of generic Dijkstra algorithm / P. Jurkiewicz, E. Biernacka, J. Domżał, R. Wójcik // 2021 IFIP/IEEE International Symposium on Integrated Network Management (IM). France, Bordeaux, 2021. Pp. 594–598.</mixed-citation><mixed-citation xml:lang="en">Jurkiewicz, P., Biernacka, E., Domżał, J., Wójcik, R. (2021). Empirical time complexity of generic Dijkstra algorithm. In: 2021 IFIP/IEEE International Symposium on Integrated Network Management (IM). Bordeaux, France, pp. 594–598.</mixed-citation></citation-alternatives></ref><ref id="cit26"><label>26</label><citation-alternatives><mixed-citation xml:lang="ru">Zhao Y. KD-Box: Line-segment-based KD-tree for interactive exploration of large-scale time-series data / Y. Zhao, Y. Wang, J. Zhang, C.-W. Fu, M. Xu, D. Moritz // IEEE Transactions on Visualization and Computer Graphics. 2021. Vol. 28, iss. 1. Pp. 890–900. DOI: 10.1109/TVCG.2021.3114865</mixed-citation><mixed-citation xml:lang="en">Zhao, Y., Wang, Y., Zhang, J., Fu, C.W., Xu, M., Moritz, D. (2021). KD-Box: Line-segment-based KD-tree for interactive exploration of large-scale time-series data. IEEE Transactions on Visualization and Computer Graphics , vol. 28, issue 1, pp. 890–900. DOI: 10.1109/TVCG.2021.3114865</mixed-citation></citation-alternatives></ref><ref id="cit27"><label>27</label><citation-alternatives><mixed-citation xml:lang="ru">Gu T. The RLR-tree: A reinforcement learning based r-tree for spatial data / T. Gu, K. Feng, G. Cong, C. Long, Z. Wang, S. Wang [Электронный ресурс] // Proceedings of the ACM on Management of Data, 2023. Vol. 1, iss. 1. ID: 63, 26 p. DOI: 10.1145/3588917 (дата обращения: 10.10.2025).</mixed-citation><mixed-citation xml:lang="en">Gu, T., Feng, K., Cong, G., Long, C., Wang, Z., Wang, S. (2023). The RLR-tree: A reinforcement learning based r-tree for spatial data. In: Proceedings of the ACM on Management of Data , vol. 1, issue 1, ID: 63, 26 p. DOI: 10.1145/3588917 (accessed: 10.10.2025).</mixed-citation></citation-alternatives></ref><ref id="cit28"><label>28</label><citation-alternatives><mixed-citation xml:lang="ru">Jiang Y., Fang G. Enhancing the Apriori Algorithm with BitSet Encoding and Hash Prefixes on Spark // 2024 6th International Conference on Electronic Engineering and Informatics (EEI). IEEE, 2024. Pp. 1067–1072. DOI: 10.1109/EEI63073.2024.10696454</mixed-citation><mixed-citation xml:lang="en">Jiang, Y., Fang, G. (2024). Enhancing the Apriori Algorithm with BitSet Encoding and Hash Prefixes on Spark. In: 2024 6th International Conference on Electronic Engineering and Informatics (EEI) , pp. 1067–1072. DOI: 10.1109/EEI63073.2024.10696454</mixed-citation></citation-alternatives></ref><ref id="cit29"><label>29</label><citation-alternatives><mixed-citation xml:lang="ru">Hanauer K., Henzinger M., Schulz C. Recent advances in fully dynamic graph algorithms–a quick reference guide [Электронный ресурс] // ACM Journal of Experimental Algorithmics. 2022. Vol. 27. ID: 1.11. 45 p. DOI: 10.1145/3555806 (дата обращения: 10.10.2025).</mixed-citation><mixed-citation xml:lang="en">Hanauer, K., Henzinger, M., Schulz, C. (2022). Recent advances in fully dynamic graph algorithms–a quick reference guide. ACM Journal of Experimental Algorithmics , vol. 27, ID: 1.11, 45 p. DOI: 10.1145/3555806 (accessed: 10.10.2025).</mixed-citation></citation-alternatives></ref><ref id="cit30"><label>30</label><citation-alternatives><mixed-citation xml:lang="ru">Andrés E. Informed scenario-based RRT∗ for aircraft trajectory planning under ensemble forecasting of thunderstorms / E. Andrés, D. González-Arribas, M. Soler, M. Kamgarpour, M. Sanjurjo-Rivo [Электронный ресурс] // Transportation Research Part C: Emerging Technologies. 2021. Vol. 129. ID: 103232. DOI: 10.1016/j.trc.2021.103232 (дата обращения: 10.10.2025).</mixed-citation><mixed-citation xml:lang="en">Andrés, E., González-Arribas, D., Soler, M., Kamgarpour, M., Sanjurjo-Rivo, M. (2021). Informed scenario-based RRT∗ for aircraft trajectory planning under ensemble forecasting of thunderstorms. Transportation Research Part C: Emerging Technologies , vol. 129, ID: 103232. DOI: 10.1016/j.trc.2021.103232 (accessed: 10.10.2025).</mixed-citation></citation-alternatives></ref><ref id="cit31"><label>31</label><citation-alternatives><mixed-citation xml:lang="ru">Ravankar A.A. HPPRM: hybrid potential based probabilistic roadmap algorithm for improved dynamic path planning of mobile robots / A.A. Ravankar, A. Ravankar, T. Emaru, Y. Kobayashi // IEEE Access. 2020. Vol. 8. Pp. 221743–221766. DOI: 10.1109/ACCESS.2020.3043333 (дата обращения: 10.10.2025).</mixed-citation><mixed-citation xml:lang="en">Ravankar, A.A., Ravankar, A., Emaru, T., Kobayashi, Y. (2020). HPPRM: hybrid potential based probabilistic roadmap algorithm for improved dynamic path planning of mobile robots. IEEE Access , vol. 8, pp. 221743221766. DOI: 10.1109/ACCESS.2020.3043333 (accessed: 10.10.2025).</mixed-citation></citation-alternatives></ref><ref id="cit32"><label>32</label><citation-alternatives><mixed-citation xml:lang="ru">González-Arribas D. Robust aircraft trajectory planning under uncertain convective environments with optimal control and rapidly developing thunderstorms / D. González-Arribas, M. Soler, M. Sanjurjo-Rivo, M. Kamgarpour, J. Simarro // Aerospace Science and Technology. 2019. Vol. 89. Pp. 445–459. DOI: 10.1016/j.ast.2019.03.051</mixed-citation><mixed-citation xml:lang="en">González-Arribas, D., Soler, M., Sanjurjo-Rivo, M., Kamgarpour, M., Simarro, J. (2019). Robust aircraft trajectory planning under uncertain convective environments with optimal control and rapidly developing thunderstorms. Aerospace Science and Technology , vol. 89, pp. 445–459. DOI: 10.1016/j.ast.2019.03.051</mixed-citation></citation-alternatives></ref><ref id="cit33"><label>33</label><citation-alternatives><mixed-citation xml:lang="ru">Коваленко Г.В., Ядров И.А. Применение Seq2seq-моделей для прогнозирования развития грозовой деятельности с целью повышения уровня ситуационной осведомленности пилота в полете // Научный вестник МГТУ ГА. 2025. Т. 28, № 1. С. 20–38. DOI: 10.26467/2079-0619-2025-28-1-20-38</mixed-citation><mixed-citation xml:lang="en">Kovalenko, G.V., Yadrov, I.A. (2025). Application of Seq2Seq models for predicting the development of thunderstorm activity to enenhance the pilot’s situational awareness in flight. Civil Aviation High Technologies , vol. 28, no. 1, pp. 20–38. DOI: 10.26467/2079-06192025-28-1-20-38 (in Russian)</mixed-citation></citation-alternatives></ref><ref id="cit34"><label>34</label><citation-alternatives><mixed-citation xml:lang="ru">Kovalenko G.V., Yadrov I.A., Kuts K.A. Intelligent adaptive flight crew decision support system for thunderstorm avoidance // RusRussian Aeronautics. 2023. Vol. 66. Pp. 552–559. DOI: 10.3103/S1068799823030170</mixed-citation><mixed-citation xml:lang="en">Kovalenko, G.V., Yadrov, I.A., Kuts, K.A. (2023). Intelligent adaptive flight crew decision support system for thunderstorm avoidance. Russian Aeronautics , vol. 66, pp. 552–559. DOI: 10.3103/S1068799823030170</mixed-citation></citation-alternatives></ref></ref-list><fn-group><fn fn-type="conflict"><p>The authors declare that there are no conflicts of interest present.</p></fn></fn-group></back></article>
