{"title":"导航中任意因子与距离的积分:安全快速行走","authors":"Yizhou Zhao, Yuetian Xie, S. Ahvar","doi":"10.1109/EDOCW.2019.00026","DOIUrl":null,"url":null,"abstract":"With the popularization of personal navigation systems and mobile devices, multifarious location-based services and datasets are being advanced. In this paper, we propose a new method for navigating based on combination of any factor (e.g. safety, enjoyment, air quality, etc.) with distance. A data structure based on intensity of the factor is introduced. This data structure can be extended easily to cover different sources of data (e.g. government open data, users' feedback). Any kind of shortest path algorithm can be used in proposed method. We apply this method to a situation where travelers are seeking safer routes. The incoming traffic data of each station from Paris in 2017 is utilized to model a location-based safety status of the city. The shortest route is then modulated to a safer route to help pedestrians bypass unsafe zones in the city, thereby reducing the risk of encountering incidents. As a proof-of-concept, we produce a web application based on Google Maps API, which illustrates the performance of our method and application.","PeriodicalId":246655,"journal":{"name":"2019 IEEE 23rd International Enterprise Distributed Object Computing Workshop (EDOCW)","volume":"98 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2019-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"On Integration of Any Factor with Distance for Navigation : Walk Safely and Fast Enough\",\"authors\":\"Yizhou Zhao, Yuetian Xie, S. Ahvar\",\"doi\":\"10.1109/EDOCW.2019.00026\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"With the popularization of personal navigation systems and mobile devices, multifarious location-based services and datasets are being advanced. In this paper, we propose a new method for navigating based on combination of any factor (e.g. safety, enjoyment, air quality, etc.) with distance. A data structure based on intensity of the factor is introduced. This data structure can be extended easily to cover different sources of data (e.g. government open data, users' feedback). Any kind of shortest path algorithm can be used in proposed method. We apply this method to a situation where travelers are seeking safer routes. The incoming traffic data of each station from Paris in 2017 is utilized to model a location-based safety status of the city. The shortest route is then modulated to a safer route to help pedestrians bypass unsafe zones in the city, thereby reducing the risk of encountering incidents. As a proof-of-concept, we produce a web application based on Google Maps API, which illustrates the performance of our method and application.\",\"PeriodicalId\":246655,\"journal\":{\"name\":\"2019 IEEE 23rd International Enterprise Distributed Object Computing Workshop (EDOCW)\",\"volume\":\"98 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2019-10-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2019 IEEE 23rd International Enterprise Distributed Object Computing Workshop (EDOCW)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/EDOCW.2019.00026\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2019 IEEE 23rd International Enterprise Distributed Object Computing Workshop (EDOCW)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/EDOCW.2019.00026","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
On Integration of Any Factor with Distance for Navigation : Walk Safely and Fast Enough
With the popularization of personal navigation systems and mobile devices, multifarious location-based services and datasets are being advanced. In this paper, we propose a new method for navigating based on combination of any factor (e.g. safety, enjoyment, air quality, etc.) with distance. A data structure based on intensity of the factor is introduced. This data structure can be extended easily to cover different sources of data (e.g. government open data, users' feedback). Any kind of shortest path algorithm can be used in proposed method. We apply this method to a situation where travelers are seeking safer routes. The incoming traffic data of each station from Paris in 2017 is utilized to model a location-based safety status of the city. The shortest route is then modulated to a safer route to help pedestrians bypass unsafe zones in the city, thereby reducing the risk of encountering incidents. As a proof-of-concept, we produce a web application based on Google Maps API, which illustrates the performance of our method and application.