ORSUP:基于用户偏好的最优路径搜索

Qun Jiang, Wei-Yi Teng, Yubao Liu
{"title":"ORSUP:基于用户偏好的最优路径搜索","authors":"Qun Jiang, Wei-Yi Teng, Yubao Liu","doi":"10.1109/MDM.2019.00-33","DOIUrl":null,"url":null,"abstract":"Route planning has received great attention from researchers with the dramatic development of mobile localization technology and the emerging location based services. It is a trend to consider users' preferences and the budget limit for the shortest path problem. The optimal route search with user's preferences focuses on finding an optimal route from a source to a target with the given keywords and the budget constraint, such that the route can maximally satisfy the user's needs on weighted preferences. We solve the NP-hard problem by proposing an A* based route search algorithm with some effective pruning strategies and present ORSUP, a website for visual query and route display. We describe the details and functions of the system interface and demonstrate the efficiency of proposed algorithm and effectiveness on solving the route search problem via a common scenario.","PeriodicalId":241426,"journal":{"name":"2019 20th IEEE International Conference on Mobile Data Management (MDM)","volume":"2 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2019-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":"{\"title\":\"ORSUP: Optimal Route Search with Users' Preferences\",\"authors\":\"Qun Jiang, Wei-Yi Teng, Yubao Liu\",\"doi\":\"10.1109/MDM.2019.00-33\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Route planning has received great attention from researchers with the dramatic development of mobile localization technology and the emerging location based services. It is a trend to consider users' preferences and the budget limit for the shortest path problem. The optimal route search with user's preferences focuses on finding an optimal route from a source to a target with the given keywords and the budget constraint, such that the route can maximally satisfy the user's needs on weighted preferences. We solve the NP-hard problem by proposing an A* based route search algorithm with some effective pruning strategies and present ORSUP, a website for visual query and route display. We describe the details and functions of the system interface and demonstrate the efficiency of proposed algorithm and effectiveness on solving the route search problem via a common scenario.\",\"PeriodicalId\":241426,\"journal\":{\"name\":\"2019 20th IEEE International Conference on Mobile Data Management (MDM)\",\"volume\":\"2 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2019-06-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"2\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2019 20th IEEE International Conference on Mobile Data Management (MDM)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/MDM.2019.00-33\",\"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 20th IEEE International Conference on Mobile Data Management (MDM)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/MDM.2019.00-33","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 2

摘要

随着移动定位技术的迅猛发展和基于位置的服务的兴起,路径规划受到了研究人员的广泛关注。在最短路径问题中考虑用户偏好和预算限制是一种趋势。带用户偏好的最优路径搜索是在给定关键字和预算约束下,寻找从源到目标的最优路径,使该路径在加权偏好上最大满足用户的需求。我们提出了一种基于A*的路径搜索算法和一些有效的修剪策略来解决NP-hard问题,并提出了一个用于可视化查询和路径显示的网站ORSUP。我们描述了系统接口的细节和功能,并通过一个常见的场景演示了所提出算法的效率和解决路径搜索问题的有效性。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
ORSUP: Optimal Route Search with Users' Preferences
Route planning has received great attention from researchers with the dramatic development of mobile localization technology and the emerging location based services. It is a trend to consider users' preferences and the budget limit for the shortest path problem. The optimal route search with user's preferences focuses on finding an optimal route from a source to a target with the given keywords and the budget constraint, such that the route can maximally satisfy the user's needs on weighted preferences. We solve the NP-hard problem by proposing an A* based route search algorithm with some effective pruning strategies and present ORSUP, a website for visual query and route display. We describe the details and functions of the system interface and demonstrate the efficiency of proposed algorithm and effectiveness on solving the route search problem via a common scenario.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术官方微信