公共交通网络中的人员流动预测与无障碍路线规划

Shuo Shang, Danhuai Guo, Jiajun Liu, Kuien Liu
{"title":"公共交通网络中的人员流动预测与无障碍路线规划","authors":"Shuo Shang, Danhuai Guo, Jiajun Liu, Kuien Liu","doi":"10.1109/MDM.2014.66","DOIUrl":null,"url":null,"abstract":"With the increasing availability of human-tracking data (e.g., Public transport IC card data, trajectory data, etc.), human mobility prediction is increasingly important. In this paper, we study a novel problem of using human-tracking data to predict human mobility and to detect over-crowded stations in public transport networks, and then finding unobstructed routes to go around these over-crowded stations. We believe that this study can bring significant benefits to users in many popular mobile applications such as route planning and recommendation, urban computing, and location based services in general. This problem is challenged by two difficulties: (1) how to detect crowded stations effectively, and (2) how to find unobstructed routes in public transport networks efficiently. To overcome these difficulties, we propose three human-mobility prediction methods based on uniform distribution, standard normal distribution, and priority ranking, respectively, to predict human mobility and to detect over-crowded stations. Then, we develop an efficient algorithm based on network expansion to find unobstructed routes in public transport networks. The performance of the developed algorithms has been verified by extensive experiments.","PeriodicalId":322071,"journal":{"name":"2014 IEEE 15th International Conference on Mobile Data Management","volume":"36 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2014-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"23","resultStr":"{\"title\":\"Human Mobility Prediction and Unobstructed Route Planning in Public Transport Networks\",\"authors\":\"Shuo Shang, Danhuai Guo, Jiajun Liu, Kuien Liu\",\"doi\":\"10.1109/MDM.2014.66\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"With the increasing availability of human-tracking data (e.g., Public transport IC card data, trajectory data, etc.), human mobility prediction is increasingly important. In this paper, we study a novel problem of using human-tracking data to predict human mobility and to detect over-crowded stations in public transport networks, and then finding unobstructed routes to go around these over-crowded stations. We believe that this study can bring significant benefits to users in many popular mobile applications such as route planning and recommendation, urban computing, and location based services in general. This problem is challenged by two difficulties: (1) how to detect crowded stations effectively, and (2) how to find unobstructed routes in public transport networks efficiently. To overcome these difficulties, we propose three human-mobility prediction methods based on uniform distribution, standard normal distribution, and priority ranking, respectively, to predict human mobility and to detect over-crowded stations. Then, we develop an efficient algorithm based on network expansion to find unobstructed routes in public transport networks. The performance of the developed algorithms has been verified by extensive experiments.\",\"PeriodicalId\":322071,\"journal\":{\"name\":\"2014 IEEE 15th International Conference on Mobile Data Management\",\"volume\":\"36 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2014-07-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"23\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2014 IEEE 15th International Conference on Mobile Data Management\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/MDM.2014.66\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2014 IEEE 15th International Conference on Mobile Data Management","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/MDM.2014.66","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 23

摘要

随着人类跟踪数据(如公共交通IC卡数据、轨迹数据等)的可用性越来越高,人类移动预测变得越来越重要。本文研究了一个新的问题,即利用人类跟踪数据来预测人类的流动性,并检测公共交通网络中过度拥挤的站点,然后找到绕过这些过度拥挤站点的无障碍路线。我们相信这项研究可以为许多流行的移动应用程序(如路线规划和推荐、城市计算和基于位置的服务)的用户带来显著的好处。这一问题面临两个难题:一是如何有效地检测拥挤站点;二是如何有效地在公共交通网络中找到畅通的路线。为了克服这些困难,我们提出了三种基于均匀分布、标准正态分布和优先级排序的人员流动性预测方法,分别用于预测人员流动性和检测过度拥挤站点。然后,我们开发了一种基于网络扩展的高效算法来寻找公共交通网络中的无障碍路线。通过大量的实验验证了所开发算法的性能。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Human Mobility Prediction and Unobstructed Route Planning in Public Transport Networks
With the increasing availability of human-tracking data (e.g., Public transport IC card data, trajectory data, etc.), human mobility prediction is increasingly important. In this paper, we study a novel problem of using human-tracking data to predict human mobility and to detect over-crowded stations in public transport networks, and then finding unobstructed routes to go around these over-crowded stations. We believe that this study can bring significant benefits to users in many popular mobile applications such as route planning and recommendation, urban computing, and location based services in general. This problem is challenged by two difficulties: (1) how to detect crowded stations effectively, and (2) how to find unobstructed routes in public transport networks efficiently. To overcome these difficulties, we propose three human-mobility prediction methods based on uniform distribution, standard normal distribution, and priority ranking, respectively, to predict human mobility and to detect over-crowded stations. Then, we develop an efficient algorithm based on network expansion to find unobstructed routes in public transport networks. The performance of the developed algorithms has been verified by extensive experiments.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术文献互助群
群 号:604180095
Book学术官方微信