摘要
本研究针对城市综合体应急疏散中的路径规划与协调问题,考虑以道路长度、道路等级、拥堵情况为路阻,提出了一种能够避开路线冲突、同时规划适用于逃生人群和救援队的行进路径方法。基于天网工程、Faster R-CNN图像识别算法计算可选路段的交通拥挤度,应用改进的Dijkstra算法规划以通行时间为导向的动态最优路径,为逃生人群和救援队伍提供行进方向互不冲突的时间最短路径。本研究旨在解决因拥堵、路线冲突造成的救援滞缓问题,推动智慧救援的发展。
This study aims at the path planning and coordination problems in the emergency evacuation of urban complexes.Considering the road length,road grade and congestion as road obstacles,this study proposes a route planning method that can avoid route conflicts and simultaneously plan suitable paths for escape crowd and rescue teams.Based on the Skynet project and Faster R-CNN image recognition algorithm,the traffic congestion degree of the optional road section is calculated.The improved Dijkstra algorithm is applied to plan the dynamic optimal path guided by travel time to provide the shortest time path with non-conflicting travel directions for the escape crowd and the rescue team.This study aims to solve the problem of rescue delays caused by congestion and route conflicts,which promotes the development of smart rescue.
作者
张梦烁
朱怡洁
ZHANG Meng-shuo;ZHU Yi-jie(School of Infrastructure Engineering,Dalian University of Technology)
出处
《智能建筑与智慧城市》
2024年第5期16-18,共3页
Intelligent Building & Smart City
关键词
城市火灾
路线冲突
室外疏散
双向最优路径
urban fire
route conflict
outdoor evacuation
two-way optimal path