A case study of developing personalized spatial cognitive road network and raster capable route finding algorithm for pedestrian evacuation behavior simulation

Lei Wu, Hui Lin
{"title":"A case study of developing personalized spatial cognitive road network and raster capable route finding algorithm for pedestrian evacuation behavior simulation","authors":"Lei Wu, Hui Lin","doi":"10.1109/GEOINFORMATICS.2009.5293451","DOIUrl":null,"url":null,"abstract":"Agent modeling simulation had been widely applied in pedestrian behavior study. However, different to vehicles that behave on linear vector road networks, the pedestrians should be considered as active dots that behave in two-dimensional raster road space during outdoor activities. Since taking into account a large number of cells in the raster space equally forming one link in the vector space, it is hardly efficient to apply traditional algorithms of path finding that aim to find a shortest path to simulations in raster spaces. In addition, the author argued that the assumption implicitly contained in those shortest route algorithms that the agents could search throughout the entire road network to obtain results could not be solid in real event. Therefore, two issues for pedestrian behavior simulation were addressed including an appropriately limited road network according to pedestrian finite spatial knowledge and the route finding algorithm under raster space conditions. In this paper, a field survey was conducted in a real event covering the involved area. By reviewing the survey, the author proposed to personalize the road network based on individual spatial cognition of participant respectively. All the roads in the study area were graded according to their perception of the participants involved in the event through the interview; the more often the road was identified by pedestrians participated, the higher level it was. Each pedestrian derived his own road network from the roads selected from different levels consisted with personal characteristics. The pedestrian agents acted in these separately independent road networks when performing a simulation. In this way, two adjacent agents probably could have different understandings of “shortest route” leading to the same destination, which better represented the diversity of the public in the real world. In the second part, the author attempted to develop a raster capable route finding algorithm utilizing the personalized spatial cognitive road network to simulate the pedestrian behavior. This algorithm profited by the essentials of the classic algorithms and served as a gateway from vector to raster. Two layers, cognition and implementation layers were constructed. On the cognition layer, the pedestrian agents recognized the roads as vector links. They searched their corresponding personalized spatial cognitive road network to find a route to the destination according to their spatial knowledge and behave pattern. The route probably consisted of several roads and several intersections. The intersections performed as check points on the agents' journey to the destinations. While detailing to the implementation layer, the intersections transformed from vector points to a cluster of raster cells. The pedestrian agents figured out the action route from current cell to a particular available intersection cell. Since the search was limited in a section of one road, the process could be practical acceptable in terms of the calculation time cost on a desktop PC. Through this paper, the author expected to make a step that the pedestrian behavior simulation will advance on integrating the human cognition from theoretical precision.","PeriodicalId":121212,"journal":{"name":"2009 17th International Conference on Geoinformatics","volume":"46 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2009-10-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2009 17th International Conference on Geoinformatics","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/GEOINFORMATICS.2009.5293451","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 2

Abstract

Agent modeling simulation had been widely applied in pedestrian behavior study. However, different to vehicles that behave on linear vector road networks, the pedestrians should be considered as active dots that behave in two-dimensional raster road space during outdoor activities. Since taking into account a large number of cells in the raster space equally forming one link in the vector space, it is hardly efficient to apply traditional algorithms of path finding that aim to find a shortest path to simulations in raster spaces. In addition, the author argued that the assumption implicitly contained in those shortest route algorithms that the agents could search throughout the entire road network to obtain results could not be solid in real event. Therefore, two issues for pedestrian behavior simulation were addressed including an appropriately limited road network according to pedestrian finite spatial knowledge and the route finding algorithm under raster space conditions. In this paper, a field survey was conducted in a real event covering the involved area. By reviewing the survey, the author proposed to personalize the road network based on individual spatial cognition of participant respectively. All the roads in the study area were graded according to their perception of the participants involved in the event through the interview; the more often the road was identified by pedestrians participated, the higher level it was. Each pedestrian derived his own road network from the roads selected from different levels consisted with personal characteristics. The pedestrian agents acted in these separately independent road networks when performing a simulation. In this way, two adjacent agents probably could have different understandings of “shortest route” leading to the same destination, which better represented the diversity of the public in the real world. In the second part, the author attempted to develop a raster capable route finding algorithm utilizing the personalized spatial cognitive road network to simulate the pedestrian behavior. This algorithm profited by the essentials of the classic algorithms and served as a gateway from vector to raster. Two layers, cognition and implementation layers were constructed. On the cognition layer, the pedestrian agents recognized the roads as vector links. They searched their corresponding personalized spatial cognitive road network to find a route to the destination according to their spatial knowledge and behave pattern. The route probably consisted of several roads and several intersections. The intersections performed as check points on the agents' journey to the destinations. While detailing to the implementation layer, the intersections transformed from vector points to a cluster of raster cells. The pedestrian agents figured out the action route from current cell to a particular available intersection cell. Since the search was limited in a section of one road, the process could be practical acceptable in terms of the calculation time cost on a desktop PC. Through this paper, the author expected to make a step that the pedestrian behavior simulation will advance on integrating the human cognition from theoretical precision.
个性化空间认知道路网络与栅格寻路算法在行人疏散行为模拟中的应用研究
智能体建模仿真在行人行为研究中得到了广泛应用。然而,与车辆在线性矢量道路网络上的行为不同,行人在户外活动时应被视为在二维栅格道路空间中行为的活动点。由于考虑到栅格空间中的大量单元在向量空间中平均形成一个链接,传统的寻径算法以寻找栅格空间中的最短路径为目标,很难有效地进行模拟。此外,作者认为,在这些最短路径算法中隐含的假设,即智能体可以在整个路网中搜索以获得结果,在实际事件中是站不住脚的。因此,研究了行人行为仿真的两个问题,即根据行人有限的空间知识选择合适的道路网络和栅格空间条件下的寻路算法。本文在涉及区域的一个真实事件中进行了实地调查。在回顾调查结果的基础上,提出了基于参与者个体空间认知的道路网络个性化方案。研究区域内的所有道路都是根据他们对参与事件的参与者的感知通过访谈进行分级的;行人参与识别道路的频率越高,等级越高。每个行人从不同层次选择的道路中得出自己的道路网,这些道路具有个人特征。在执行模拟时,行人代理在这些独立的道路网络中行动。这样,两个相邻的agent可能会对通往同一目的地的“最短路线”有不同的理解,这更好地代表了现实世界中公众的多样性。在第二部分中,作者试图利用个性化空间认知道路网络来模拟行人行为,开发具有栅格功能的寻路算法。该算法吸取了经典算法的精华,是从矢量到栅格的门户。构建了认知层和实现层。在认知层,行人代理将道路识别为向量链接。他们根据自己的空间知识和行为模式,搜索相应的个性化空间认知路网,找到通往目的地的路线。这条路线可能由几条路和几个十字路口组成。这些十字路口是代理人前往目的地旅程中的检查点。在细化到实现层时,交点从矢量点转换为一组栅格单元。行人智能体计算出从当前单元到特定可用的交叉单元的动作路线。由于搜索仅限于一条道路的一段,因此就桌面PC上的计算时间成本而言,该过程实际上是可以接受的。通过本文的研究,笔者希望行人行为仿真能够从理论的精确性向整合人类认知的方向迈出一步。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信