限制搜索区域的分层路径规划新算法  

A New Algorithm of Hierarchical Route Planning with Restricted Search Area

作　　者：苏海滨[1] 张继涛[2] 

机构地区：[1]华北水利水电学院电力学院,郑州450011 [2]河南工业职业技术学院,河南南阳473009

出　　处：《河南大学学报（自然科学版）》2008年第1期81-84,共4页Journal of Henan University:Natural Science

基　　金：科技部创新基金项目(04C26224101278)

摘　　要：依据城市路网独特的空间分布特性及不同道路等级特性,提出一种以源节点和目的节点为椭圆焦点的限制搜索区域分层路径规划算法.通过对小型网格模型统计及回归分析,建立了一个鲁棒性椭圆形搜索区域模型参数,可以满足道路交通路径规划的要求.结合路径规划算法在实时车辆诱导系统中的实际应用,给出该算法的一个应用实例,对实验结果的分析验证了其有效性.According to the special spatial distribution feature of the road network, and the different hierarchical feature of the road segments in the road network, a hierarchal route planning algorithm with the restricted search area is proposed, while source note and destination note are out of focus. By analyzing characteristic of sta＇tistics and regress of small net model, a robust ellipse research area model parameter is established for meeting the demand of road planning. Combining with its practical application in real-time vehicle navigation system, one of its examples is given, and its validity is obtained by an analysis of the experimental results.

关 键 词：车辆诱导系统 路径规划 限制搜索区域 道路分层 

分 类 号：TP301.6[自动化与计算机技术—计算机系统结构]