【作者】 张静；

【导师】 陈宜金；

【作者基本信息】 中国矿业大学（北京） ， 地图制图学与地理信息工程， 2009， 博士

【摘要】 随着城市规模的扩大和交通信息的发展,城市道路网越来越庞大,为了能在大数据量情况下快速准确地计算出合理的最优路径,本文根据道路网络的复杂性本质,基于“分而治之”的循环细分策略,设计了基于层-块道路网络数据模型的路径规划算法；定义了层-块道路网络和复合层-块道路网络的概念,讨论了划分规则,研究了层-块网络间的逻辑一致性和拓扑一致性问题；提出了确定网络权值的层次体系模型,并给出了各影响因素的无量纲化标准函数；基于几何学基本原理,提出了基于最小夹角的双向A*算法,设计了前向和后向启发式搜索的切换标准,并通过试验证明了该算法的实用性和有效性；基于层-块道路网络数据模型,详细论述了分层分块的道路网络路径规划算法的设计思想,并给出了具体实现步骤。对比试验证明,该方法能够优先寻找最近的主干道路,符合驾驶者优先选择主干道,避开交通不太方便的次要道路的思路,因而能够有效地减小搜索空间,提高计算效率,使得路径选择更为合理。更多还原

【Abstract】 With the expansion of cities and the development of transportation, the road network of urban is getting huger and huger. In order to get the reasonable path quickly and accurately in the amount of network data, the thesis discusses the complexity of road network in natrue, proposes a "divide and rule" strategy, and designs a route planning algorithm based on the layer-block network data model. The concepts of layer-block network and complex layer-block network are defined. Some problems such as the layer-blocks’ rules, logical uniformity, topological uniformity are discussed. Based on AHP (Analytic Hierarchy Process), the hierarchy architecture of network weights determination is proposed and the standard function of influencing factors is presented. With the basic principles of geometry, the bidirection A* algorithm considering minimum angle and switch search is proposed. The experimental results show that the algorithm is useful and efficient. The design idea and concrete implementation steps of the layer-block route planning algorithm are discussed in detail. Comparative experiment results prove that the algorithm can give priority to find the nearest main road, reduce the search space, improve computational efficiency, and get the reasonable path efficiently.更多还原