顾及地标与道路分支的行人导航路径选择算法  

Landmark and Branch-based Pedestrian Route Complexity and Selection Algorithm

作　　者：张星[1] 李清泉[1,2] 方志祥[2] 黄玲[3] 

机构地区：[1]深圳大学深圳市空间信息智能感知与服务重点实验室,深圳市南海大道3688号518060 [2]武汉大学测绘遥感信息工程国家重点实验室,武汉市珞喻路129号430079 [3]国家科技部高技术研究发展中心,北京市三里河路1号100044

出　　处：《武汉大学学报（信息科学版）》2013年第10期1239-1242,1252,共5页Geomatics and Information Science of Wuhan University

基　　金：国家自然科学基金资助项目(40971233;60872132;40830530);国家教育部博士点专项基金资助项目(20070486001)

摘　　要：提出顾及地标与道路分支的行人导航路径选择算法。该算法能够利用地标降低导航路径的复杂程度,帮助视觉正常的行人确认当前位置以及是否偏离了当前路径。实验表明,本算法能够较好地平衡导航路径的三种优化目标:行程距离、路径复杂度以及路径地标数量。与最短路径算法相比,该算法选择的路径具有较低的复杂度与较高的路径地标密度。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 algo- rithm, in which landmarks are included to reduce the complexity of route and help people to confirm route choice decisions. Results show that this algorithm can balance the three objectives： travel dis- tance, 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.

关 键 词：行人导航 基于位置服务 路径选择 地标 

分 类 号：P208[天文地球—地图制图学与地理信息工程]