Adaptive Travel-Time Estimation: A Case for Custom Predicate Selection

Robert Waury, Christian S. Jensen, K. Torp
{"title":"Adaptive Travel-Time Estimation: A Case for Custom Predicate Selection","authors":"Robert Waury, Christian S. Jensen, K. Torp","doi":"10.1109/MDM.2018.00026","DOIUrl":null,"url":null,"abstract":"Travel-time estimation for paths in a road network often relies on pre-computed histograms that are usually available on a road segment level. Then the pre-computed histograms of the segments of a path are convolved to obtain a histogram that estimates the travel time. With the growing sizes of trajectory datasets, it becomes possible to compute histograms for increasingly longer sub-paths. Since pre-computation is infeasible for all sub-paths in a road network, we propose computing histograms on-the-fly, i.e., during routing. Such an on-the-fly method must filter the underlying trajectory dataset by spatio-temporal predicates to obtain the relevant trajectories and offers the opportunity to apply additional filtering predicates to the trajectories with little overhead. We report on a study showing that considerable improvements in accuracy of the histograms obtained for paths can be obtained by choosing filtering predicates that not only adapt to the intended start of a trip, but also to the driver and the weather. We also make the cases for a sub-path partitioning based on segment categories since there are significant differences between road types when applying our on-the-fly method.","PeriodicalId":205319,"journal":{"name":"2018 19th IEEE International Conference on Mobile Data Management (MDM)","volume":"49 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2018-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"6","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2018 19th IEEE International Conference on Mobile Data Management (MDM)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/MDM.2018.00026","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 6

Abstract

Travel-time estimation for paths in a road network often relies on pre-computed histograms that are usually available on a road segment level. Then the pre-computed histograms of the segments of a path are convolved to obtain a histogram that estimates the travel time. With the growing sizes of trajectory datasets, it becomes possible to compute histograms for increasingly longer sub-paths. Since pre-computation is infeasible for all sub-paths in a road network, we propose computing histograms on-the-fly, i.e., during routing. Such an on-the-fly method must filter the underlying trajectory dataset by spatio-temporal predicates to obtain the relevant trajectories and offers the opportunity to apply additional filtering predicates to the trajectories with little overhead. We report on a study showing that considerable improvements in accuracy of the histograms obtained for paths can be obtained by choosing filtering predicates that not only adapt to the intended start of a trip, but also to the driver and the weather. We also make the cases for a sub-path partitioning based on segment categories since there are significant differences between road types when applying our on-the-fly method.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
自适应旅行时间估计:自定义谓词选择的一个案例
道路网络中路径的行程时间估计通常依赖于预先计算的直方图,这些直方图通常在路段级别上可用。然后对预先计算的路径段直方图进行卷积,得到一个估计行程时间的直方图。随着轨迹数据集的不断增长,计算越来越长的子路径的直方图成为可能。由于预先计算对于道路网络中的所有子路径都是不可行的,因此我们建议动态计算直方图,即在路由过程中。这种动态方法必须通过时空谓词对底层轨迹数据集进行过滤,以获得相关的轨迹,并提供了在很少开销的情况下对轨迹应用额外过滤谓词的机会。我们报告了一项研究,该研究表明,通过选择过滤谓词,不仅可以适应预定的旅行起点,还可以适应驾驶员和天气,可以获得路径直方图准确性的显著提高。我们还提出了基于路段类别的子路径划分的案例,因为在应用我们的实时方法时,道路类型之间存在显着差异。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
FMS: Managing Crowdsourced Indoor Signals with the Fingerprint Management Studio Stochastic Shortest Path Finding in Path-Centric Uncertain Road Networks Concept for Evaluation of Techniques for Trajectory Distance Measures VIPTRA: Visualization and Interactive Processing on Big Trajectory Data DCount - A Probabilistic Algorithm for Accurately Disaggregating Building Occupant Counts into Room Counts
×
引用
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