透過您的圖書館登入
IP:18.116.40.177
  • 學位論文

大規模行人模擬及其於災害疏散之應用

Large-Scale Pedestrian Simulation and Its Application on Disaster Evacuation

指導教授 : 朱致遠

摘要


臺灣地區地理環境型態具地狹人稠之特性,由於土地利用的限制,水庫之興建往往位於人口稠密區域之上游地帶,水庫潰壩情形一旦發生,所影響範圍極廣,需疏散之人數甚眾。本研究針對水庫潰壩發生之下游地區進行行人之疏散模擬,以地面場細胞自動機模式為基礎,發展出一套可隨水庫潰壩情勢有所反饋之調整式地面場細胞自動機行人疏散模式,行人依循水庫潰壩情勢之改變而調整疏散之決策行為。本研究依水庫潰壩模擬數據建構行人模擬之空間變化,並延續水庫潰壩之研究,建立水庫潰壩下游之緊急應變行人疏散模擬模式。水庫潰壩屬於影響範圍較大之災難型態,本研究將地面場細胞自動機模式進行空間軸的調整,改變空間地面場計算方式,以提升整體模式運作效率。而針對水庫潰壩情勢的時依性,本研究調整模式之時間軸,空間中之障礙物可隨時間的推移有所變動,改變地面場值進而影響行人之移動決策。本研究採用兩套不同之地面場計算方式,分別以路網模式以及時空網路搭配依時性最短路徑演算法建構水庫潰壩行人模擬之地面場,以依時性最短路徑演算法建構具預測性之行人疏散行為,並加以比較其模擬行為之差異。

並列摘要


This research proposes a large-scale pedestrian simulation model which considers the evacuation due to dam breaks. To improve the simulation efficiency, a modified floor field cellular automata (FFCA) model is developed. Different from the traditional cellular automata models, in the research the simulation environment will change by time. Two methods are used to construct the floor field in the FFCA: time-independent and time-dependent. A static network is used to construct the time-independent floor field. The technique of time-space networks is applied to calculate the time-dependent floor field. The time-dependent shortest path algorithm is used to calculate the values of the time-dependent floor field. In this research, the two methods are compared and the results show that the time-dependent method leads to a better large-scale pedestrian simulation model.

參考文獻


Blue, V.J., Adler, J.L., 1998. Emergent fundamental pedestrian flows from cellular automata microsimulation. Transportation Research Record 1644, 29–36.
Blue, V.J., Adler, J.L., 2001. Cellular automata microsimulation for modeling bi-directional pedestrian walkways. Transportation Research Part B: Methodological 35, 293–312.
Burstedde, C., Klauck, K., Schadschneider, A. & Zittartz, J., 2001. Simulation of pedestrian dynamics using a two-dimensional cellular automaton, Physica A, 295, 507–
Chabini, I., 1998. Discrete dynamic shortest path problems in transportation applications: complexity and algorithms with optimal run time. Transportation Research Record 1645, 170–175.

延伸閱讀