检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
作 者:李进燕[1] 朱征宇[1] 刘琳[1] 崔明[1] 刘微[1]
出 处:《系统工程理论与实践》2013年第5期1289-1297,共9页Systems Engineering-Theory & Practice
基 金:国家科技支撑计划重点项目(2011BAH25B04)
摘 要:针对目前多步行程时间预测方法研究较少,存在未来一段时间内的观测值不能及时得到的问题,提出基于简化路网模型的卡尔曼滤波多步行程时间预测模型和算法.综合运用上游路段、当前路段的实时和历史行程时间数据,从历史数据中寻找与当前日期交通状况最接近的历史日期,解决卡尔曼滤波未来一段时间内没有观测值而无法进行多步预测的问题.实验表明,算法能够合理地预测未来几个时段的路段行程时间,有效地避免了时滞性.同时,多步行程时间预测算法的精度高(尤其是4步以内,均等系数达到0.9以上),是一种可行的预测方法.Multi-step travel time prediction is more reasonable in reality than one-step travel time pre- diction method, but it was done research in by few scholars. Meanwhile, the real-time travel time in future several time sections cannot be detected. In this paper, multi-step travel time estimation model and algorithm based on Kalman filtering (KF) were presented. This model took real-time and history travel time of the upper road and road itself into account. The algorithm found the nearest time in history data away from today. They can solve the problem that travel time in future are not be detected, and travel time in future several time sections can be predicted reasonably. Meanwhile, the time lag was solved effectively. Results of experiments show that the accuracy of several-step prediction algorithm is great, and it is meaningful in practical application.
关 键 词:智能交通系统 行程时间预测 卡尔曼滤波 多步预测 滞后性
分 类 号:TP39[自动化与计算机技术—计算机应用技术]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.15