Landmark and Branch-based Pedestrian Route Complexity and Selection Algorithm
-
摘要: 提出顾及地标与道路分支的行人导航路径选择算法。该算法能够利用地标降低导航路径的复杂程度,帮助视觉正常的行人确认当前位置以及是否偏离了当前路径。实验表明,本算法能够较好地平衡导航路径的三种优化目标:行程距离、路径复杂度以及路径地标数量。与最短路径算法相比,该算法选择的路径具有较低的复杂度与较高的路径地标密度。Abstract: Pedestrian route is an important part in human wayfinding and navigation tasks. The routes with many decision points and branches will spend pedestrian much time on spatial decisions. This paper proposes a landmark and branch-based pedestrian route complexity and selection algorithm, in which landmarks are included to reduce the complexity of route and help people to confirmroute choice decisions. Results show that this algorithm can balance the three objectives: travel distance, route complexity and the number of landmarks. Compared to the shortest route, the selected route of this algorithm has lower complexity and higher landmark density.
-
Keywords:
- pedestrian navigation /
- LBS /
- route selection /
- landmark
-
-
[1] 张星,李清泉,方志祥. 面向行人导航的地标链生成方法[J]. 武汉大学学报(信息科学版). 2010(10)[2] 方志祥,宋莺. 嵌入式环境基于实时交通信息的多层次路径规划算法[J]. 武汉大学学报(信息科学版). 2008(04)[3] 郑年波,李清泉,徐敬海,宋莺. 基于转向限制和延误的双向启发式最短路径算法[J]. 武汉大学学报(信息科学版). 2006(03)[4] Andrew J. May,Tracy Ross,Steven H. Bayer,Mikko J. Tarkiainen. Pedestrian navigation aids: information requirements and design implications[J]. Personal and Ubiquitous Computing . 2003 (6)
计量
- 文章访问数: 1383
- HTML全文浏览量: 91
- PDF下载量: 734