期刊文献+

交通场景下基于深度强化学习的感知型路径分配算法 被引量:2

Perceptual path allocation algorithm based on deep reinforcement learning in traffic scene
下载PDF
导出
摘要 路径分配问题是交通数字孪生系统的重要研究方向之一,其重点是综合考量行驶需求的动态变化以及路网信息的实时改变,实现高效合理的路径规划。现阶段一些经典的分配算法如粒子群、Dijkstra等算法及其优化模型仅能达到全局静态最优,忽略了现实交通中的复杂变化。而逐渐推出的各种深度学习算法虽能进行全面的时空预测,但受限于海量历史数据的归纳分析以及较高的运算成本,难以大规模应用。鉴于此,提出了一种静态分配算法与深度强化学习算法结合的感知型路径分配算法,在行驶中依据实时路网信息和车辆当前状态,实现全局路径动态再分配及更新,相关算法的精度和效率在仿真实验中得到验证。 Path allocation problem is one of the important research directions of traffic digital twin system.Its focus is to comprehensively consider the dynamic changes of driving demand and the real-time changes of road network information,so as to realize efficient and reasonable path planning.At present,some classical allocation algorithms such as particle swarm optimization,Dijkstra and their optimization models can only achieve global static optimization,ignoring the complex changes in real traffic.Although various depth learning algorithms gradually introduced can carry out comprehensive spatio-temporal prediction,they are difficult to be applied on a large scale due to the inductive analysis of massive historical data and high operation cost.In view of this,this paper proposes a perceptual path allocation algorithm based on the combination of static allocation algorithm and deep reinforcement learning algorithm.During driving,the global path is dynamically redistributed and updated according to the real-time road network information and the current state of vehicles.The accuracy and efficiency of the proposed algorithm are verified in the simulation experiment.
作者 曹欢 Cao Huan(School of Information Science and Technology,University of Science and Technology of China,Hefei 230026,China)
出处 《信息技术与网络安全》 2022年第6期43-49,共7页 Information Technology and Network Security
关键词 路径分配 深度强化学习 路网 路况感知 path allocation deep reinforcement learning road network traffic perception
  • 相关文献

参考文献1

二级参考文献13

  • 1翁敏,毋河海,杜清运,李林燕.基于道路网络知识的启发式层次路径寻找算法[J].武汉大学学报(信息科学版),2006,31(4):360-363. 被引量:15
  • 2武雪玲,李清泉,任福.基于分层分块数据组织的双向A^*算法[J].测绘信息与工程,2006,31(6):1-3. 被引量:9
  • 3Sacerdoti E D. Planning in a hierarchy of abstraction spaces [ J ]. Artificial Intelligence, 1974, 5 ( 2 ) : 115-135.
  • 4Korf R E. Planning as search: A quantitative approach [ J ]. Artificial Intelligence, 1987, 33 (1): 65-88.
  • 5Jung S, Pramanik S. An efficient path computation model for hierarchically structured topographical road maps [ J ]. Knowledge and Data Engineering, IEEE Transactions on. 2002. 14(5): 1029-1046.
  • 6Jagadeesh G, Srikanthan T, Quek K. Heuristic techniquesfor accelerating hierarchical routing on road networks [ J]Intelligent Transportation Systems, IEEE Transactions on, 2002, 3(4): 301-309.
  • 7Chou Y L, Romeijn H E, Smith R L. Approximating shortest paths in large-scale networks with an application to intelligent transportation systems [ J ]. INFORMS Journal on Computing, 1998, 10 (2) : 163-179.
  • 8Liu B. Route finding by using knowledge about the road network[ J]. Systems, Man and Cybernetics, Part A: Systems and Humans, IEEE Transactions on, 1997, 27(4) : 436-448.
  • 9Car A, Frank A. General principles of hierarchical spatial reasoning: the case of wayfinding[ C]. 1994: 646 -664.
  • 10杨扬.基于实时交通信息的最优路径规划问题的研究[D].上海交通大学,2009.

共引文献14

同被引文献35

引证文献2

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部