检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
机构地区:[1]长沙理工大学交通运输工程学院,湖南长沙410114
出 处:《公路交通科技》2014年第11期116-122,共7页Journal of Highway and Transportation Research and Development
基 金:国家自然科学基金项目(71071024);湖南省自然科学基金项目(12JJ2025);长沙市科技局重点项目(K1106004-11)
摘 要:为改善交叉口排队长度管理,避免交叉口某个方向排队长度过长,采用强化学习理论建立了以平均排队长度差最小为优化目标的在线Q学习模型。针对控制性能指标相对于邻近的配时方案不敏感的特点,提出了以平均排队长度差作为基本单位重新构造奖励函数,目的是拉大各行为对应的Q值差距,提高模型的收敛速度和鲁棒性。集成Excel VBA,Vissim,Matlab建立了在线仿真平台,作为计算环境对算例进行了计算。算例中利用GPS数据对Vissim软件中车辆加减速度曲线进行了标定。计算结果表明以平均排队长度差作为优化目标能够提高各个方向排队长度的平衡性,优化整个交叉口的时空资源;建立的在线Q模型具有学习能力和较快的计算速度,模型能否收敛受到周期取值和可选行为数量的影响。In order to improve the management of queue length and avoid long queue of a certain direction at intersection, we built an on-line Q learning model for minimizing average queue length difference by using reinforcement learning theory. Because the control performance indicator is insensitive to the adjacent signal timing scheme, we put forward a method of restructuring reward function using average queue length difference as the basic unit to increase the gap between the corresponding Q values of different behaviours to improve the convergence rate and robustness of the model. We built an on-line simulation platform by integrating Excel VBA, Vissim and Matlab. Using this platform, we analyzed some examples, in which we calibrated the acceleration and deceleration curves of vehicle in Vissim using GPS data. The calculation result shows that ( 1 ) the optimization goal of minimizing average queue length difference can improve the balance of queue lengths in different directions and optimize time and space resources of an intersection; (2) the established on-line Q model has learning ability and fast computation speed, and the convergence possibility of the Q model is influenced by cycle value and ootional behaviour quantity.
分 类 号:U491[交通运输工程—交通运输规划与管理]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.74