非欧氏空间中最佳路径算法研究  

The Research on Optimum Route Algorithm in Non-Euclidean Distance Space

作　　者：张开广[1] 孟红玲[1,2] 巴明廷[1] 孙艳敏[1] 

机构地区：[1]郑州师范学院3S研究所,河南郑州450044 [2]华东师范大学课程与教学研究所,上海200062

出　　处：《测绘科学技术学报》2013年第1期83-86,共4页Journal of Geomatics Science and Technology

基　　金：河南省自然科学基金项目(122102310379)

摘　　要：基于时间距离的城市道路交通测度空间是一个非欧氏距离空间。根据城市道路交通的实际情况,设计了基于非欧氏距离空间的最佳路径选择算法。因为道路路口的转向时间消耗是路径时间消耗的重要组成部分,算法在路径经过的道路路口处,根据离开路口的方位角定义了路口的虚拟状态。合并考虑路段和路口转向的时间消耗,通过计算起点到虚拟状态的累计时间,完成了最佳路径的选择。算法是一个多阶段决策过程,通过递推方法来实现;并通过一个实例证明了算法的有效性。The measuring space of city streets traffic on consuming time is an non-Euclidean distance space. From the condition of city traffic condition, an optimum route algorithm based on non-Euclidean time distance space was designed. For the turn consuming time on the streets intersection being the major section of the route using time, the virtual nodes were defined according to the azimuths of leaving the streets intersection. Considered the consuming time passing through street sections and streets intersections, the algorithm was completed by calculating the accumulated time from the start point to the virtual node. The algorithm was a de- cision-making course with some phases and realized by recursive methods. Finally, the feasibility was proved through an example.

关 键 词：最佳路径 非欧氏距离空间 时间测度 虚拟状态 决策图 

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