IETO: An Improved Exponential–Trigonometric Optimisation Algorithm for Dynamic 3D UAV Trajectory Planning

IF 1.9 Q3 COMPUTER SCIENCE, INFORMATION SYSTEMS
IET Networks Pub Date : 2026-08-20 DOI:10.1049/ntw2.70035
Baofeng Ji, Chuyang Li, Ji Zhang, Shizhong Wei, Huitao Fan
{"title":"IETO: An Improved Exponential–Trigonometric Optimisation Algorithm for Dynamic 3D UAV Trajectory Planning","authors":"Baofeng Ji,&nbsp;Chuyang Li,&nbsp;Ji Zhang,&nbsp;Shizhong Wei,&nbsp;Huitao Fan","doi":"10.1049/ntw2.70035","DOIUrl":null,"url":null,"abstract":"<p>Three-dimensional unmanned aerial vehicle (UAV) path planning in cluttered terrain requires a planner to search a continuous waypoint space, whereas the actual safety of a candidate can be assessed only after decoding the waypoint vector into a flight path. The decoded path must satisfy clearance, no-fly-zone, altitude, segment-length and turning constraints, which makes the practical fitness landscape nonconvex, nonsmooth and strongly affected by narrow feasible corridors. This paper therefore studies UAV trajectory generation through a finite-budget derivative-free planning framework. An improved Exponential–Trigonometric Optimisation algorithm (IETO) is proposed for this real-coded UAV waypoint model. The method combines optimised Latin hypercube sampling for initial spatial coverage, adaptive exploration–exploitation control for search-radius regulation and probabilistic local refinement for terminal path improvement. Candidate paths are ranked by a nonsmooth exterior-penalty fitness and are finally accepted only after explicit decoded-path feasibility checks. Benchmark tests and deterministic, uncertain and long-range UAV scenarios show that IETO produces high-quality feasible trajectories and achieves the lowest mean planning fitness in the reported main UAV comparison under the same evaluation budget.</p>","PeriodicalId":46240,"journal":{"name":"IET Networks","volume":"15 1","pages":""},"PeriodicalIF":1.9000,"publicationDate":"2026-08-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://onlinelibrary.wiley.com/doi/epdf/10.1049/ntw2.70035","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"IET Networks","FirstCategoryId":"1085","ListUrlMain":"https://onlinelibrary.wiley.com/doi/10.1049/ntw2.70035","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q3","JCRName":"COMPUTER SCIENCE, INFORMATION SYSTEMS","Score":null,"Total":0}
引用次数: 0

Abstract

Three-dimensional unmanned aerial vehicle (UAV) path planning in cluttered terrain requires a planner to search a continuous waypoint space, whereas the actual safety of a candidate can be assessed only after decoding the waypoint vector into a flight path. The decoded path must satisfy clearance, no-fly-zone, altitude, segment-length and turning constraints, which makes the practical fitness landscape nonconvex, nonsmooth and strongly affected by narrow feasible corridors. This paper therefore studies UAV trajectory generation through a finite-budget derivative-free planning framework. An improved Exponential–Trigonometric Optimisation algorithm (IETO) is proposed for this real-coded UAV waypoint model. The method combines optimised Latin hypercube sampling for initial spatial coverage, adaptive exploration–exploitation control for search-radius regulation and probabilistic local refinement for terminal path improvement. Candidate paths are ranked by a nonsmooth exterior-penalty fitness and are finally accepted only after explicit decoded-path feasibility checks. Benchmark tests and deterministic, uncertain and long-range UAV scenarios show that IETO produces high-quality feasible trajectories and achieves the lowest mean planning fitness in the reported main UAV comparison under the same evaluation budget.

一种改进的三维无人机动态轨迹规划的指数-三角优化算法
复杂地形下的三维无人机路径规划需要规划者搜索连续的航点空间,而候选飞行器的实际安全性只有在将航点向量解码为飞行路径后才能进行评估。解码路径必须满足间隙、禁飞区、高度、段长和转弯等约束,使得实际适应度景观非凸、非平滑,且受狭窄可行廊道的影响较大。因此,本文通过有限预算无导数规划框架研究无人机轨迹生成。针对这种实数编码无人机航路点模型,提出了一种改进的指数-三角优化算法。该方法结合了初始空间覆盖的优化拉丁超立方体采样,搜索半径调节的自适应勘探开发控制和终端路径改进的概率局部细化。候选路径通过非光滑的外部惩罚适应度进行排序,并且只有在明确的解码路径可行性检查后才最终被接受。基准测试和确定性、不确定性和远程无人机场景表明,在相同评估预算下,IETO在报告的主要无人机比较中产生高质量的可行轨迹并获得最低的平均规划适应度。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
IET Networks
IET Networks COMPUTER SCIENCE, INFORMATION SYSTEMS-
CiteScore
5.00
自引率
0.00%
发文量
41
审稿时长
33 weeks
期刊介绍: IET Networks covers the fundamental developments and advancing methodologies to achieve higher performance, optimized and dependable future networks. IET Networks is particularly interested in new ideas and superior solutions to the known and arising technological development bottlenecks at all levels of networking such as topologies, protocols, routing, relaying and resource-allocation for more efficient and more reliable provision of network services. Topics include, but are not limited to: Network Architecture, Design and Planning, Network Protocol, Software, Analysis, Simulation and Experiment, Network Technologies, Applications and Services, Network Security, Operation and Management.
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术官方微信
小红书