合作與競爭賽局策略下之行人模擬;The Strategy of Pedestrian Simulation Use the Cooperation and Competition Game

NCU Institutional Repository > 工學院 > 土木工程研究所 > 博碩士論文 > Item 987654321/53583

請使用永久網址來引用或連結此文件: http://ir.lib.ncu.edu.tw/handle/987654321/53583

題名:	合作與競爭賽局策略下之行人模擬;The Strategy of Pedestrian Simulation Use the Cooperation and Competition Game
作者:	陳展維;Chen,Jhan-wei
貢獻者:	土木工程研究所
關鍵詞:	賽局理論;行人模擬;整數規劃;時空網路;time-space networks;integer programming;game theory;pedestrian simulation
日期:	2012-06-15
上傳時間:	2012-09-11 18:02:53 (UTC+8)
出版者:	國立中央大學
摘要:	行人移動電腦模擬可用於評估建築物之防災設計與規劃，因此近年來已成為土木防災的相關重要研究領域之一，目前行人模擬的研究大多著重於行人對於其他行人與障礙物之個別反應行為，對於較複雜的行人互動行為(如：等待、禮讓、迴避等)則多未予考量，為增進行人模擬之真實性以及效益，本研究之主要目的為建立納入上述行人互動行為之行人模擬模式。本研究以時空網路描述行人位置的時間與空間變化過程，並使用賽局理論作為行人移動策略的理論依據，賽局理論依照行人是否有合作的觀念或行人間是否有協議可分為合作賽局與競爭賽局兩種，「合作賽局」之求解方式是使用數學規劃，而由於行人是不可分割的整體，必須使用求解較困難的整數規劃以保證行人不被分割，而「競爭賽局」則是先使用「K 最短路徑」演算法找出個別行人的賽局策略，再利用演算法找出有衝突的行人策略，接著求算Pareto 解與納許均衡解。本研究最後假設多個案例來分析評估合作賽局與競爭賽局的行人模擬，整體而言本研究所提出的兩種行人模擬可有效表達不同情境下的行人互動，可提昇行人模擬之真實性，並對於建築物之防災規劃設計有所助益。Computer models for pedestrian movement can be used to evaluate and support the evacuation designs for buildings. Therefore, the development of pedestrian models has become an important field in civil engineering. In the literature, the related studies have focused on the responses of an individual pedestrian to other pedestrians and obstacles. The more complicated interactions between pedestrians such as waiting, yielding, and detour are rarely considered. To improve the accuracy of pedestrian models, the objective of this research is to include the above behaviors in the pedestrian models in order to reproduce more realistic pedestrian movements.In this study, the temporal and spatial relationships between pedestrians are described with time-space networks. The game theory is chosen as the decision-making mechanism for pedestrians. When an agreement exists between pedestrians, cooperative games are used to simulation pedestrian behaviors. On the other hand, competitive games are adopted if such agreement does not exist. In this study, the cooperative games are solved using mathematical programming. Because the pedestrians are inseparable, integer programming must be used to ensure that pedestrians are considered as a whole. For competitive games, K shortest path algorithm is adopted to find out each pedestrian’s strategies. An algorithm is developed to identify the strategy pairs with conflicts. Next, Pareto solutions and Nash equilibrium solutions for the pedestrian movement strategies are found. Finally, various scenarios are tested to understand the capability of the proposed approach for simulating pedestrians. Overall, the proposed simulation approach simulates pedestrian interactions under different assumptions effectively and could be useful for improving the evacuation designs for buildings.
顯示於類別:	[土木工程研究所] 博碩士論文

文件中的檔案:

檔案	描述	大小	格式	瀏覽次數
index.html		0Kb	HTML	476	檢視/開啟

在NCUIR中所有的資料項目都受到原著作權保護.

社群 sharing

資料載入中.....