An optimum vehicular path algorithm for traffic network based on hierarchical spatial reasoning

Human beings' intellection is the characteristic of a distinct hierarchy and can be taken to construct a heuristic in the shortest path algorithms.It is detailed in this paper how to utilize the hierarchical reasoning on the basis of greedy and directional strategy to establish a spatial heuristic,so as to improve running efficiency and suitability of shortest path algorithm for traffic network.The authors divide urban traffic network into three hierarchies and set forward a new node hierarchy division rule to avoid the unreliable solution of shortest path.It is argued that the shortest path,no matter distance shortest or time shortest,is usually not the favorite of drivers in practice.Some factors difficult to expect or quantify influence the drivers' choice greatly.It makes the drivers prefer choosing a less shortest,but more reliable or flexible path to travel on.The presented optimum path algorithm,in addition to the improvement of the running efficiency of shortest path algorithms up to several times,reduces the emergence of those factors,conforms to the intellection characteristic of human beings,and is more easily accepted by drivers.Moreover,it does not require the completeness of networks in the lowest hierarchy and the applicability and fault tolerance of the algorithm have improved.The experiment result shows the advantages of the presented algorithm.The authors argued that the algorithm has great potential application for navigation systems of large-scale traffic networks.     

加权路网分层的最优路径计算

为了弥补传统分层算法在平面最短路径计算中对出行者出行习惯考虑不充分的缺陷,该文提出了一种分层算法的优化策略,即加权路网分层:首先运用层次分析法计算选定的道路属性的权值,对道路属性权值进行组合相加,进而确定道路权值,然后根据确定的分层阈值对路网进行分层,最后运用双向A*算法进行试验,并与传统的分层路网计算结果进行比较。实验结果表明,加权分层策略充分考虑了出行者的出行习惯,能够适用于路径导航中的最优路径计算,具有可行性与实用性。     

基于层次空间推理的交通网络行车最优路径算法

讨论了如何在贪心策略及方向策略的基础上,利用人类思维的层次空间推理方法建立空间启发式搜索策略,以提高交通网络最短路径算法的效率和适用性,并使行车最优路径的选择更符合人类的思维特点。     

层次空间推理的机制及其在路径寻找方面的应用

人类对所处的客观世界的认识,具有很明显的空间层次特征,每一层次包含了解决特定问题的必要信息,而层次空间推理是人类在解决具有空间特征问题时常采用的一种方法。本文在探讨了层次空间推理的定义、一般性框架的基础上,重点描述了它在道路网络的路径寻找中的应用。     

动态城市交通网络优化模型研究及算法设计

在城市交通网络中,行车路线所耗时间是用户关心的关键因素之一.本文构建了基于时间因素的城市交通网络模型,为反映交通网络随时间动态变化的特性,网络模型中弧的权重是和时间统计变量相关.本文设计了交通网络模型算法,并对算法进行了详细的论述.针对实际交通网络的行驶线路选择人群中乐观型、保守型和折中型,给出了路线选择的简化模型.文...     

基于典型事例推理的路径规划方法研究

Case-based reasoning is an AI technique in which the previous solutions are stored for future use. People are used to guiding themselves according to those routes that are stored in their memories and have been used by them before. It is just based on people’s preference to familiar routes, which are gained through the study of the cognitive activities. We propose to apply the intelligent method based on the case reasoning to path planning. It is impossible for a case base to store all the solutions to all the shortest paths; therefore, part of them should be stored. However, which routes should be stored and which should not be? How do we adapt the cases that have already been stored and how do we acquire the shortest route based on them? All these issues need to be explained by integrating knowledge of the network on account of case-based reasoning techniques. This paper suggests the case-based reasoning in another point. This means finding some irreplaceable links on the basis of the complete analysis of the problems space, which are called the must_be_passed link between the source and destination. Merely compute the shortest path case from those best exit/entry nodes of the grids to the irreplaceable links, and then add them into the case base storing for future use. This method is based on case-based reasoning technique and completely considers the properties of the problem space. In addition to the use of knowledge of the natural grid in the route network, this method is more efficient than existing algorithms on computing efficiency.     

层次空间推理机制及其在路径寻找方面的应用

Human beings use hierarchies to simplify their conceptual models of reality and to perform reasoning more efficiently. Hierarchical structures are conceptually imposed on space and allow performance of complex tasks in very large contexts easily. Hierarchical spatial reasoning is an important method for solving spatial problems. This paper briefly discusses the definition and frame of hierarchical spatial reasoning and its application to way-finding of road networks.     

结合地理国情普查和监测数据的交通网络发展空间格局监测研究

交通通达指数是表征一个区域交通网络空间格局的重要指标。本研究立足于地理国情普查和监测中交通要素等相关数据成果,开展了基于交通网络密度和交通便捷度交通的通达指数测算相关研究,引入了一套核密度分析、欧氏距离分析、吸引力分析等交通通达指数计算方法,并以杭州市为试验区,开展交通网络空间格局监测。     

A fewest-turn-and-shortest path algorithm based on breadth-first search

Many cognitive studies have indicated that the path simplicity may be as important as its distance travelled. However, the optimality of paths for current navigation system is often judged purely on the distance travelled or time cost, and not the path simplicity. To balance these factors, this paper presented an algorithm to compute a path that not only possesses fewest turns but also is as short as possible by utilizing the breadth-first-search strategy. The proposed algorithm started searching from a starting point, and expanded layer by layer through searching zero-level reachable points until the endpoint is found, and then deleted unnecessary points in the reverse direction. The forward searching and backward cleaning strategies were presented to build a hierarchical graph of zero-level reachable points, and form a fewest-turn-path graph (G*). After that, a classic Dijkstra shortest path algorithm was executed on the G* to obtain a fewest-turn-and-shortest path. Comparing with the shortest path in Baidu map, the algorithm in this work has less than half of the turns but the nearly same length. The proposed fewest-turn-and-shortest path algorithm is proved to be more suitable for human beings according to human cognition research.     

一种公交换乘路线智能选择的新方法

公交换乘问题是公共交通信息查询的重要内容,本文首先叙述了经典Dijkstra算法,并分析了其不适合公交网络最优路径选择的原因。然后提出了一种改进的Dijkstra算法,该算法将求解最短路径获得的站点作为搜索站点,并将这些站点及经过这些站点的线路构成换乘矩阵,结合换乘次数的要求,给出了基于Dijkstra的智能选择换乘线路的实现算法。最后通过一个实际算例说明改进的Dijkstra算法在公交换乘路线选择中应用的可行性。     

PATHCLUST在聚落遗址空间模式研究中的应用

本文主要讨论PATHCLUST算法的原理和方法,给出了聚类分析选择最优算法应注意的问题;以郑州地区仰韶文化聚落遗址空间模式研究为例,讨论了PATHCLUST算法在聚落遗址空间模式研究中的应用。结果表明,此算法可有效揭示聚落遗址的空间分布结构规律。     

面向大规模道路网的最短路径近似算法

节点重要性对大规模道路网下最短路径的计算有着重要影响。本文提出了顾及节点重要性的最短路径估计方法,该方法基于Critic方法与复杂网络理论评价节点的重要性,结合限制策略实现网络划分,通过层次结构网络的构建,实现大规模道路网数据的有效化简和最短路径的快速有效计算。试验结果表明,该方法能够使中心节点均衡地分布于网络,更好地均衡划分后子网络的规模;随着限制参数的增大,网络规模逐渐降低,查询精度最高达到1.026,相比于单一指标和无限制参数的方法,本文方法显著降低了网络的规模,在最短路径的近似计算上保持了较高的准确性,为大规模复杂网络的近似分析提供分析思路。     

网络最短路径的地图代数栅格算法

在阐述网络分析和最短路径算法的现状的基础上,以地图代数为理论支撑,介绍了地图代数对于网络元素的表达,探讨另外一种途径的网络最短路径分析—基于栅格数据的最短路径分析,重点讨论了基于地图代数的网络数据模型、栅格路径距离计算方法,在此基础上论述了求取最短路径的栅格方法的具体过程。最后,通过算例证明栅格途径的网络分析有其独特的优势。     

基于道路标线布设方案的交通路网数据库构建研究

道路标线是交通规则的载体,它们布设在物理道路网络上为交通参与者分配路权,并规范其行为。通常,称这种加载了交通规则的物理道路网络为交通路网。本文首先提出了物理道路网络的表示模型;然后结合线性参考技术,以物理道路网络为基础,构建了基于的GIS道路标线布设方案数据模型;最后,本文选取示范路网,运用道路标线布设方案数据库,进行路网交通规则的推导,构建了基于车道级路网数据模型的交通路网数据库,为交通路网数据库的构建提供了一种参考。     

基于电子地图和Dijkstra算法路径规划的实现

随着城市化水平的提高,人们在道路选择问题上可能需要考虑的并非仅仅是"空间距离"的最短,还有"时间最短",本文应用Dijkstra算法解决城市中出行交通道路选择的问题,对距离最短和时间最短路径分别进行讨论,用VB语言实现算法,并且在电子地图上绘制出所求出的路径,以便人们更直接地观看到结果,基本上解决了道路选择问题。     

石家庄市交通网络空间发展特征研究

文章根据空间句法理论结合GIS空间分析功能对石家庄市交通网络进行定量化描述,并利用量化后的交通网络形态分析变量对其发展特征进行分析评价.结果表明,从1981年到2011年,集成核呈现向城市边缘地区扩散的趋势;在智能度方面,石家庄市整体空间被局部空间感知的能力较高.并在此形态分析基础上,总结了道路交通网络的空间形态发展特征和规律,提出优化建议,为城市的空间扩展提供参考依据.     

改进Dijkstra算法的城市道路最短路径仿真研究

本文在分析Dijkstra算法基础上,考虑城市路网的特点及该算法在路径优化中的不足,提出一种基于双向搜索的Dijkstra改进算法,它可以减少路网节点的搜索范围和计算复杂度.仿真结果表明,改进算法在最短路径搜索中可使候选节点数减少15％～25％,当节点越多这种减少越明显,可提高搜索路径的实时性.     

引入导航网格的室内路径规划算法

随着社会、经济的不断发展进步,室内导航定位越来越重要,其导航定位精度、准确性倍受业界关注,而路径规划是该研究方向的重要组成部分。针对传统的基于节点的拓扑模型无法较好解决室内空间"路网"的模糊性问题,该文分析了室内外导航定位的差异,并对传统路径规划算法的局限性进行了分析,提出将基于Delaunay三角剖分导航网格的A*算法应用于室内导航路径规划中。通过算例验证了该方法的有效性,具有较好的实用价值。     

基于Delaunay三角网的空间邻近关系推理

空间邻近关系是一种重要的空间关系,对这种关系的识别是任何空间建模系统所必须的。Delaunay三角网是根据最小角最大规则建立的一种三角剖分,可以较好地表达空间目标之间的邻近关系。利用Delaunay三角网对空间邻近关系进行了描述,在此基础上提出了空间邻近关系推理方法。     

基于空间网络分析的高速公路网一类调查观测站布设技术

在数量适度的情况下,合理布设高速公路交通量调查观测站点,使观测数据准确反映路网运行特征是高速公路交通量调查与信息服务体系构建的重要支撑。文中运用GIS空间网络分析技术,结合"两阶段"宏观布设法和OD反推布设法,开发交通量调查观测站布设软件。当缺少历史流量数据时,用"两阶段"宏观布设法以路段累计重要度代替路段流量,并进行累计重要度计算。最后以江苏省高速公路网一类调查观测站布设为例进行验证,结果表明,软件可基本实现科学、高效的高速公路一类调查观测站布设。