Time series clustering of weather observations in predicting climb phase of aircraft trajectories

S. Ayhan, H. Samet
{"title":"Time series clustering of weather observations in predicting climb phase of aircraft trajectories","authors":"S. Ayhan, H. Samet","doi":"10.1145/3003965.3003968","DOIUrl":null,"url":null,"abstract":"Reliable trajectory prediction is paramount in Air Traffic Management (ATM) as it can increase safety, capacity, and efficiency, and lead to commensurate fuel savings and emission reductions. Inherent inaccuracies in forecasting winds and temperatures often result in large prediction errors when a deterministic approach is used. A stochastic approach can address the trajectory prediction problem by taking environmental uncertainties into account and training a model using historical trajectory data along with weather observations. With this approach, weather observations are assumed to be realizations of hidden aircraft positions and the transitions between the hidden segments follow a Markov model. However, this approach requires input observations, which are unknown, although the weather parameters overall are known for the pertinent airspace. We address this problem by performing time series clustering on the current weather observations for the relevant sections of the airspace. In this paper, we present a novel time series clustering algorithm that generates an optimal sequence of weather observations used for accurate trajectory prediction in the climb phase of the flight. Our experiments use a real trajectory dataset with pertinent weather observations and demonstrate the effectiveness of our algorithm over time series clustering with a k-Nearest Neighbors (k-NN) algorithm that uses Dynamic Time Warping (DTW) Euclidean distance.","PeriodicalId":376984,"journal":{"name":"Proceedings of the 9th ACM SIGSPATIAL International Workshop on Computational Transportation Science","volume":"27 6 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2016-10-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"23","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings of the 9th ACM SIGSPATIAL International Workshop on Computational Transportation Science","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1145/3003965.3003968","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 23

Abstract

Reliable trajectory prediction is paramount in Air Traffic Management (ATM) as it can increase safety, capacity, and efficiency, and lead to commensurate fuel savings and emission reductions. Inherent inaccuracies in forecasting winds and temperatures often result in large prediction errors when a deterministic approach is used. A stochastic approach can address the trajectory prediction problem by taking environmental uncertainties into account and training a model using historical trajectory data along with weather observations. With this approach, weather observations are assumed to be realizations of hidden aircraft positions and the transitions between the hidden segments follow a Markov model. However, this approach requires input observations, which are unknown, although the weather parameters overall are known for the pertinent airspace. We address this problem by performing time series clustering on the current weather observations for the relevant sections of the airspace. In this paper, we present a novel time series clustering algorithm that generates an optimal sequence of weather observations used for accurate trajectory prediction in the climb phase of the flight. Our experiments use a real trajectory dataset with pertinent weather observations and demonstrate the effectiveness of our algorithm over time series clustering with a k-Nearest Neighbors (k-NN) algorithm that uses Dynamic Time Warping (DTW) Euclidean distance.
预测飞机轨迹爬升阶段的天气观测时间序列聚类
可靠的轨迹预测在空中交通管理(ATM)中至关重要,因为它可以提高安全性、容量和效率,并导致相应的燃料节约和排放减少。当使用确定性方法时,预测风和温度的固有不准确性常常导致较大的预测误差。随机方法可以通过考虑环境不确定性和使用历史轨迹数据以及天气观测来训练模型来解决轨迹预测问题。使用这种方法,假定天气观测是隐藏飞机位置的实现,隐藏段之间的转换遵循马尔可夫模型。然而,这种方法需要输入观测,这是未知的,尽管有关空域的总体天气参数是已知的。我们通过对空域相关部分的当前天气观测数据进行时间序列聚类来解决这个问题。在本文中,我们提出了一种新的时间序列聚类算法,该算法生成最优的天气观测序列,用于飞行爬升阶段的精确轨迹预测。我们的实验使用了具有相关天气观测的真实轨迹数据集,并证明了我们的算法在使用动态时间翘曲(DTW)欧几里得距离的k-近邻(k-NN)算法的时间序列聚类上的有效性。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
0.00%
发文量
0
×
引用
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学术文献互助群
群 号:481959085
Book学术官方微信