DETERMINATION OF THE OPTIMAL TRAJECTORY OF THE MOVEMENT OF AIRCRAFT IN AREAS WITH COMPLEX TERRAIN UNDER THE CONTROL OF THE ENEMY

Nadir Aghayev, Namig Kalbiyev, Sabina Aghazade
{"title":"DETERMINATION OF THE OPTIMAL TRAJECTORY OF THE MOVEMENT OF AIRCRAFT IN AREAS WITH COMPLEX TERRAIN UNDER THE CONTROL OF THE ENEMY","authors":"Nadir Aghayev, Namig Kalbiyev, Sabina Aghazade","doi":"10.25045/jpit.v15.i1.04","DOIUrl":null,"url":null,"abstract":"One of the main issues in the controlling of aircraft in difficult terrain during wartime is to ensure normal movement, but also to fulfill the requirements of evading enemy control. This paper proposes an improved ant swarm algorithm that makes it possible to pre-determine and optimize the trajectory of aircraft in such areas. When applying this method, a special parameter is included in the probability of choosing a movement trajectory – the height of the terrain above sea level, so that each ant does not enter territory controlled by the enemy. Using a 2D-H digital elevation map, the rectangular area under study is divided into 90 m × 90 m squares. To take into account the variability of the terrain, the heuristic function of the ant swarm algorithm takes into account the parameters of distance, height and smooth surface. Additionally, to reduce the number of iterations and computations, the ants are divided in half by number and released from the start and end points simultaneously. As a result, it allows you to choose the shortest and minimum trajectory among various calculated trajectories. To verify the effectiveness of the proposed scheme, a number of computational experiments were conducted. Experimental results on various simulated and real terrain maps show that this algorithm can be used to select an initial reference trajectory in difficult terrain.","PeriodicalId":419916,"journal":{"name":"Problems of Information Technology","volume":"76 2","pages":""},"PeriodicalIF":0.0000,"publicationDate":"2024-01-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Problems of Information Technology","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.25045/jpit.v15.i1.04","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

Abstract

One of the main issues in the controlling of aircraft in difficult terrain during wartime is to ensure normal movement, but also to fulfill the requirements of evading enemy control. This paper proposes an improved ant swarm algorithm that makes it possible to pre-determine and optimize the trajectory of aircraft in such areas. When applying this method, a special parameter is included in the probability of choosing a movement trajectory – the height of the terrain above sea level, so that each ant does not enter territory controlled by the enemy. Using a 2D-H digital elevation map, the rectangular area under study is divided into 90 m × 90 m squares. To take into account the variability of the terrain, the heuristic function of the ant swarm algorithm takes into account the parameters of distance, height and smooth surface. Additionally, to reduce the number of iterations and computations, the ants are divided in half by number and released from the start and end points simultaneously. As a result, it allows you to choose the shortest and minimum trajectory among various calculated trajectories. To verify the effectiveness of the proposed scheme, a number of computational experiments were conducted. Experimental results on various simulated and real terrain maps show that this algorithm can be used to select an initial reference trajectory in difficult terrain.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
确定飞机在敌方控制的复杂地形区的最佳运动轨迹
战时在复杂地形控制飞机的主要问题之一是既要保证飞机的正常飞行,又要满足躲避敌方控制的要求。本文提出了一种改进的蚁群算法,可以预先确定和优化飞机在此类区域的飞行轨迹。在应用这种方法时,选择运动轨迹的概率中包含了一个特殊参数--地形的海拔高度,这样每只蚂蚁就不会进入敌方控制的区域。利用 2D-H 数字高程图,将研究的矩形区域划分为 90 米×90 米的方格。考虑到地形的多变性,蚁群算法的启发式函数考虑了距离、高度和光滑表面等参数。此外,为了减少迭代和计算次数,蚂蚁按数量分成两半,同时从起点和终点释放。这样,就可以在各种计算轨迹中选择最短和最小的轨迹。为了验证所提方案的有效性,我们进行了一系列计算实验。在各种模拟地形图和真实地形图上的实验结果表明,该算法可用于在困难地形中选择初始参考轨迹。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
IMPROVED PARALLEL BIG DATA CLUSTERING BASED ON K-MEDOIDS AND K-MEANS ALGORITHMS CYBERSECURITY RISKS MANAGEMENT OF INDUSTRIAL CONTROL SYSTEMS: A REVIEW PREDICTING THE RELIABILITY OF SOFTWARE SYSTEMS USING RECURRENT NEURAL NETWORKS: LSTM MODEL SUPPORT VECTOR MACHINES FOR FORECASTING NON-SCHEDULED PASSENGER AIR TRANSPORTATION DATA GOVERNANCE IN GAMING INDUSTRY
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1