| 一种面向室内导航的通行区域模型及其自动提取算法 |
| |
| 引用本文： | 游天,王光霞,吕晓华,孙卫新,张寅宝.一种面向室内导航的通行区域模型及其自动提取算法[J].武汉大学学报(信息科学版),2019,44(2):177-184. |
| |
| 作者姓名： | 游天 王光霞 吕晓华 孙卫新 张寅宝 |
| |
| 作者单位： | 1.信息工程大学地理空间信息学院, 河南 郑州, 450001 |
| |
| 基金项目： | 国家863计划2013AA12A202国家自然科学基金41371383 |
| |
| 摘 要： | 面向室内位置服务中路径规划与导航的应用需求，提出一种基于栅格空间的通行区域模型及其自动提取算法。首先，在栅格模型基础上引入了相邻栅格和途经栅格，结合具体示例阐述了通行区域模型的基本原理；然后，根据室内地图数据特征，通过室内栅格模型初始化、通行区域初次提取和邻域融合，设计了通行区域的自动提取算法；最后，选取西单大悦城一楼室内地图数据进行了不同栅格尺度的通行区域自动提取和路径规划试验。结果表明，该算法针对走廊内存在障碍等复杂室内环境具有较好的适用性，并且通行区域模型相比网络模型的路径规划结果更加符合复杂室内环境的路径行走特征。
|
| 关 键 词： | 室内导航 位置服务 路径规划 通行区域 自动提取 |
| 收稿时间： | 2017-04-14 |
Traversable Region Model and Its Automatic Extraction Algorithm for Indoor Navigation |
| |
| Affiliation: | 1.Institute of Geospatial Information, Information Engineering University, Zhengzhou 450001, China2.61243 Troops, Urumqi 830006, China |
| |
| Abstract: | For the application requirement of route planning and navigation in indoor Location-based-service, we propose a traversable region model based on grid space and its automatic extraction algorithm. Firstly, this paper introduces adjoin grid and traversing grids based on grid model, expounds the basic principle of traversable region model through specific example. Then, according to the characteristics of indoor map data, through indoor grid model initialization, traversable region preliminary extraction and adjoin region merge, it designs traversable region automatic extraction algorithm. Finally, taking Xidan Joy City first floor indoor map data as an example, we perform different grid scale traversable region automatic extraction and route planning experiment. Results show that the automatic extraction algorithm has preferable applicability to deal with complex indoor environment which has barrier in the corridor and so on. Compared with network model, the route planning results of traversable region model are more conformed to the route walking feature of complex indoor environment. |
| |
| Keywords: | |
| 本文献已被 CNKI 等数据库收录！ |
| 点击此处可从《武汉大学学报(信息科学版)》浏览原始摘要信息 |
|
点击此处可从《武汉大学学报(信息科学版)》下载全文 |
|
