检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
作 者:龙琼[1] 曾革[1,2] 张谨帆[1] 张蕾[1]
机构地区:[1]湖南城市学院土木工程学院,湖南益阳413000 [2]长沙理工大学交通运输工程学院,湖南长沙410004
出 处:《中南大学学报(自然科学版)》2013年第5期2124-2129,共6页Journal of Central South University:Science and Technology
基 金:湖南省科技厅资助项目(2012GK3069);湖南省自然科学基金资助项目(07jj6093)
摘 要:基于物理规划的思想,研究面向驾驶员个性化需求的动态路径诱导方法。首先,分析个性化动态路径诱导问题,构建路段交通阻抗的个性化评价指标体系;然后,基于物理规划思想,进行个性化动态路径诱导:面向驾驶员对道路的"可行性"需求动态确定交通路网搜索的几何空间;面向驾驶员对道路的"偏好性"需求,对几何空间内的交通路网阻抗进行个性化评价;面向驾驶员对道路的"最优性"需求,基于Dijkstra算法在动态交通路网中进行最优路径搜索;当路网中的交通阻抗发生变化时,及时更新路网信息,重新搜索从车辆当前位置到目的地的最优路径。研究结果表明:该方法既能体现驾驶员的个性化需求;仿真算例验证了该方法的有效性和可行性。A dynamic route guidance method facing the driver's individual demand was advanced based on physical programming theory. Firstly, the personalized dynamic route guidance problem was analyzed and the individualized evaluation index system of road traffic impedance was constructed. Then, based on physical programming theory, the method of individual dynamic route guidance was studied as follows: Aiming at the driver's feasibility demand on the road, the dynamic traffic road network geometry space for searching was determined. Aiming at the driver's preference demand on the road, the evaluation of the traffic network impedance in the geometry space was individualized. Aiming at the driver's optimality demand on the road, the optimal path was searched on Dijkstra algorithm in dynamic transportation network. When the traffic network impedance changed, the new optimal path from the current position of the vehicle to the destination would be re-searched by updating network information. The results show that the method can fully reflect the driver's personal demands. Simulation examples validate the feasibility and effectiveness of the method.
关 键 词:交通工程 动态路径诱导 物理规划 个性化需求 驾驶偏好 DIJKSTRA算法
分 类 号:U491.4[交通运输工程—交通运输规划与管理]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.31