Aircraft trajectory planning under wind uncertainties

Karim Legrand, S. Puechmorel, D. Delahaye, Yao Zhu
{"title":"Aircraft trajectory planning under wind uncertainties","authors":"Karim Legrand, S. Puechmorel, D. Delahaye, Yao Zhu","doi":"10.1109/DASC.2016.7777955","DOIUrl":null,"url":null,"abstract":"Wind optimal trajectory planning is a critical issue for airlines in order to save fuel for all their flights. This planning is difficult due to the uncertainties linked to wind data. Based on the current weather situation, weather forecast institutes compute wind maps prediction with a given level of confidence. Usually, 30-50 wind maps prediction can be produced. Based on those predictions, airlines have to compute trajectory planning for their aircraft in an efficient way. Such planning has to propose robust solutions which take into account wind variability for which average and standard deviation have to be taken into account. It is then better to plan trajectories in areas where wind has low standard deviation even if some other plannings induce less fuel consumption but with a higher degree of uncertainty. In this paper, we propose an efficient wind optimal algorithm based on two phases. The first phase considers the wind map predictions and computes for each of them the associated wind optimal trajectory also called geodesic. Such geodesics are computed with a classical Bellman algorithm on a grid covering an elliptical shape projected on the sphere. This last point enable the algorithm to address long range flights which are the most sensitive to wind direction. At the end of this first phase, we get a set of wind optimal trajectories. The second phase of the algorithm extract the most robust geodesic trajectories by the mean of a new trajectory clustering algorithm. This clustering algorithm is based on a new mathematical distance involving continuous deformation approach. In order to measure this mathematical distance between two trajectories, a continuous deformation between them is first built. This continuous deformation is called homotopy. For any homotopy, one can measure the associated energy used to shift from the first trajectory to the second one. The homotopy with the minimum energy is then computed, for which the associated energy measure the mathematical distance between trajectories. Based on this new distance, an EM clustering algorithm has been used in order to identify the larger clusters which correspond to the most robust wind optimal trajectories. This new approach avoids the main drawback of the classical approach which uses the mean of the trajectories issued from the first phase. This algorithm has been successfully applied to north Atlantic flights.","PeriodicalId":340472,"journal":{"name":"2016 IEEE/AIAA 35th Digital Avionics Systems Conference (DASC)","volume":"8 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2016-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"6","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2016 IEEE/AIAA 35th Digital Avionics Systems Conference (DASC)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/DASC.2016.7777955","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 6

Abstract

Wind optimal trajectory planning is a critical issue for airlines in order to save fuel for all their flights. This planning is difficult due to the uncertainties linked to wind data. Based on the current weather situation, weather forecast institutes compute wind maps prediction with a given level of confidence. Usually, 30-50 wind maps prediction can be produced. Based on those predictions, airlines have to compute trajectory planning for their aircraft in an efficient way. Such planning has to propose robust solutions which take into account wind variability for which average and standard deviation have to be taken into account. It is then better to plan trajectories in areas where wind has low standard deviation even if some other plannings induce less fuel consumption but with a higher degree of uncertainty. In this paper, we propose an efficient wind optimal algorithm based on two phases. The first phase considers the wind map predictions and computes for each of them the associated wind optimal trajectory also called geodesic. Such geodesics are computed with a classical Bellman algorithm on a grid covering an elliptical shape projected on the sphere. This last point enable the algorithm to address long range flights which are the most sensitive to wind direction. At the end of this first phase, we get a set of wind optimal trajectories. The second phase of the algorithm extract the most robust geodesic trajectories by the mean of a new trajectory clustering algorithm. This clustering algorithm is based on a new mathematical distance involving continuous deformation approach. In order to measure this mathematical distance between two trajectories, a continuous deformation between them is first built. This continuous deformation is called homotopy. For any homotopy, one can measure the associated energy used to shift from the first trajectory to the second one. The homotopy with the minimum energy is then computed, for which the associated energy measure the mathematical distance between trajectories. Based on this new distance, an EM clustering algorithm has been used in order to identify the larger clusters which correspond to the most robust wind optimal trajectories. This new approach avoids the main drawback of the classical approach which uses the mean of the trajectories issued from the first phase. This algorithm has been successfully applied to north Atlantic flights.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
风不确定条件下飞机轨迹规划
风的最优轨迹规划是航空公司为所有航班节省燃料的关键问题。由于风力数据的不确定性,这种规划是困难的。天气预报机构根据当前的天气情况,以给定的置信度计算风图预测。通常,可以产生30-50个风图预测。基于这些预测,航空公司必须以有效的方式计算飞机的轨迹规划。这样的规划必须提出可靠的解决方案,考虑到平均和标准偏差必须考虑的风的可变性。因此,最好在风力标准偏差较低的地区规划轨迹,即使其他一些规划会导致较少的燃料消耗,但不确定性程度较高。本文提出了一种基于两阶段的高效风力优化算法。第一阶段考虑风图预测,并为每个预测计算相关的风最优轨迹,也称为测地线。这种测地线是用经典的Bellman算法在球面上投影的椭圆形网格上计算的。最后一点使算法能够解决对风向最敏感的远程飞行。在第一阶段结束时,我们得到一组风的最佳轨迹。第二阶段采用新的轨迹聚类算法提取最鲁棒的测地线轨迹均值。该聚类算法基于一种新的涉及连续变形的数学距离方法。为了测量两个轨迹之间的数学距离,首先建立了它们之间的连续变形。这种连续的变形称为同伦。对于任何同伦,我们都可以测量从第一轨道到第二轨道的相关能量。然后计算具有最小能量的同伦,其相关能量度量轨迹之间的数学距离。在此基础上,采用了EM聚类算法来识别与最稳健的风最优轨迹相对应的较大聚类。这种新方法避免了经典方法的主要缺点,即使用从第一阶段发出的轨迹的平均值。该算法已成功应用于北大西洋航线。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Trajectory optimisation for avionics-based GNSS integrity augmentation system Modeling standard for distributed control systems: IEC 61499 from industrial automation to aerospace Ontological knowledge representation for avionics decision-making support Conflict resolution for wind-optimal aircraft trajectories in North Atlantic oceanic airspace with wind uncertainties Flexible open architecture for UASs integration into the airspace: Paparazzi autopilot system
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1