Generating Concise and Robust Driving Directions

S. Funke, C. Haag, Sabine Storandt
{"title":"Generating Concise and Robust Driving Directions","authors":"S. Funke, C. Haag, Sabine Storandt","doi":"10.1145/3139958.3140010","DOIUrl":null,"url":null,"abstract":"We consider the problem of generating concise and robust driving directions that avoid overly detailed turn-by-turn instructions as long as one is not too close to the final destination. Our approach is based on a deliberate selection of cities as landmarks that are likely to appear on road signs along the route. For a route from Stuttgart to Flensburg, the route description could read \"Go towards Frankfurt, then Kassel, then Hanover, then Hamburg\". Apart from being more compact, such driving directions are also more robust against wrong turns taken. While an implementation based on Dijkstra's algorithm takes on the order of several seconds to generate such driving directions, a careful instrumentation of speed-up techniques reduces this to fractions of a second required, e.g., for a web service.","PeriodicalId":270649,"journal":{"name":"Proceedings of the 25th ACM SIGSPATIAL International Conference on Advances in Geographic Information Systems","volume":"32 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2017-11-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings of the 25th ACM SIGSPATIAL International Conference on Advances in Geographic Information Systems","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1145/3139958.3140010","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 1

Abstract

We consider the problem of generating concise and robust driving directions that avoid overly detailed turn-by-turn instructions as long as one is not too close to the final destination. Our approach is based on a deliberate selection of cities as landmarks that are likely to appear on road signs along the route. For a route from Stuttgart to Flensburg, the route description could read "Go towards Frankfurt, then Kassel, then Hanover, then Hamburg". Apart from being more compact, such driving directions are also more robust against wrong turns taken. While an implementation based on Dijkstra's algorithm takes on the order of several seconds to generate such driving directions, a careful instrumentation of speed-up techniques reduces this to fractions of a second required, e.g., for a web service.
生成简洁和稳健的驾驶方向
我们考虑生成简洁和鲁棒的驾驶方向的问题,只要不太接近最终目的地,就可以避免过于详细的转弯指示。我们的方法是基于有意选择的城市作为路标,这些路标可能会出现在路线沿线的路标上。对于从斯图加特到弗伦斯堡的路线,路线描述可以是“先去法兰克福,然后去卡塞尔,然后去汉诺威,然后去汉堡”。除了更紧凑之外,这种驾驶方向也更坚固,防止错误转弯。虽然基于Dijkstra算法的实现需要几秒钟的时间来生成这样的驾驶方向,但仔细使用加速技术将其减少到所需的几分之一秒,例如,对于web服务。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
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学术官方微信