首页 | 官方网站   微博 | 高级检索  
     

基于神经动态规划算法的最优路径选择
引用本文:李菲,肖洪祥.基于神经动态规划算法的最优路径选择[J].桂林工学院学报,2009,29(1):154-157.
作者姓名:李菲  肖洪祥
作者单位:桂林工学院,电子与计算机系,广西,桂林,541004
摘    要:针对传统动态规划算法在计算大规模路网的优化问题时所表现出来的计算时间长、存储空间大等缺点,引入了一种神经动态规划算法:它将传统的动态规划和BP神经网络结合起来,通过逼近Q学习算法来寻求一种最优策略,最终达到路径优化的目的。将此算法应用于一个交通路网,且用Matlab软件进行仿真,试验表明:该方法的实时性、并行性和全局性都优于传统动态规划,在城市交通流系统中能切实起到路径诱导的作用。

关 键 词:神经动态规划  最优路径  神经网络  逼近Q学习

Optimal Route Choice Based on Neuro-Dynamic Programming
LI Fei,XIAO Hong-xiang.Optimal Route Choice Based on Neuro-Dynamic Programming[J].Journal of Guilin University of Technology,2009,29(1):154-157.
Authors:LI Fei  XIAO Hong-xiang
Affiliation:Department of Electronic and Computer Science;Guilin University of Technology;Guilin 541004;China
Abstract:Neuro-dynamic programming is introduced to deal with traditional dynamic programming with large storage space and long computing time for optimal route in a gigantic traffic network.By synthesizing the dynamic programming and BP neural network to seek an optimal strategy through the approximate Q-learning algorithm,the purpose of optimizing the path is ultimately achieved.Matlab simulation experiments show that this method of real-time,parallel and the overall situation is superior to the traditional path p...
Keywords:neuro-dynamic programming  optimal route  neural networks  approximate Q-learning  
本文献已被 CNKI 维普 万方数据 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司    京ICP备09084417号-23

京公网安备 11010802026262号