Mining GPS Data to Learn Driver's Route Patterns

E. Necula
{"title":"Mining GPS Data to Learn Driver's Route Patterns","authors":"E. Necula","doi":"10.1109/SYNASC.2014.43","DOIUrl":null,"url":null,"abstract":"Over the last few years, GPS guidance systems have become increasingly more popular. GPS-equipped devices like smart phones become more common and larger amounts of GPS data become available to geographic applications. Having precise information about the routes of a driver during a period of time can be useful to learn and estimate both the traffic and the driver's intent at specific moment of time. With our solution we want to go a step further to the existing GPS navigation systems by designing a mechanism that is capable to learn driver's routes. We could offer in the future a point-to-point concept for an environmentally friendly routing mechanism anywhere within a selected road network based on our HMM-method and a training process. Our study is based on real data collected from various local drivers and can be easily applied in modern intelligent traffic systems. The system comes with a user interface that displays the GPS routes on the map for a specific driver. These routes can be analyzed using parameters like time, distance, height and speed. Also we developed a tool that manages to compute the maximum-likelihood using the Viterbi algorithm in order to validate the next route segment election for a sampled road network.","PeriodicalId":150575,"journal":{"name":"2014 16th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing","volume":null,"pages":null},"PeriodicalIF":0.0000,"publicationDate":"2014-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"4","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2014 16th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/SYNASC.2014.43","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 4

Abstract

Over the last few years, GPS guidance systems have become increasingly more popular. GPS-equipped devices like smart phones become more common and larger amounts of GPS data become available to geographic applications. Having precise information about the routes of a driver during a period of time can be useful to learn and estimate both the traffic and the driver's intent at specific moment of time. With our solution we want to go a step further to the existing GPS navigation systems by designing a mechanism that is capable to learn driver's routes. We could offer in the future a point-to-point concept for an environmentally friendly routing mechanism anywhere within a selected road network based on our HMM-method and a training process. Our study is based on real data collected from various local drivers and can be easily applied in modern intelligent traffic systems. The system comes with a user interface that displays the GPS routes on the map for a specific driver. These routes can be analyzed using parameters like time, distance, height and speed. Also we developed a tool that manages to compute the maximum-likelihood using the Viterbi algorithm in order to validate the next route segment election for a sampled road network.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
挖掘GPS数据学习驾驶员路线模式
在过去的几年里,GPS制导系统变得越来越流行。配备GPS的设备,如智能手机变得越来越普遍,地理应用程序可以获得大量的GPS数据。掌握驾驶员在一段时间内行驶路线的精确信息,有助于了解和估计特定时刻的交通状况和驾驶员的意图。通过我们的解决方案,我们希望通过设计一种能够学习驾驶员路线的机制,在现有GPS导航系统的基础上更进一步。在未来,我们可以根据我们的hmm方法和培训过程,在选定的道路网络中提供点对点的环保路由机制概念。我们的研究基于从各种本地司机那里收集的真实数据,可以很容易地应用于现代智能交通系统。该系统附带了一个用户界面,可以在地图上显示特定驾驶员的GPS路线。这些路线可以使用时间、距离、高度和速度等参数进行分析。此外,我们还开发了一个工具,可以使用Viterbi算法计算最大似然,以验证采样路网的下一个路线段选择。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Evaluating Weighted Round Robin Load Balancing for Cloud Web Services Lipschitz Bounds for Noise Robustness in Compressive Sensing: Two Algorithms Open and Interoperable Socio-technical Networks Computing Homological Information Based on Directed Graphs within Discrete Objects Automated Synthesis of Target-Dependent Programs for Polynomial Evaluation in Fixed-Point Arithmetic
×
引用
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