行人微观模拟中的动态分配
Dynamic Assignment in Microsimulations of Pedestrians
摘要:
介绍了一种通用的动态配流方法,并结合行人动力学微观仿真进行了研究。因为行人-不像车辆-不在网络上移动,而是在原则上可以在无限数量的路线中选择的区域上移动。要应用分配算法,必须为每个OD对选择有限(实际上是小)数量的相关代表从这些路线。这个几何任务是这方面的贡献的主要重点。主要任务是为OD对找到与常用分配方法一起使用的相关路线。该方法被证明为一个单一的OD对,并举例说明了一个例子。
英文摘要:
A generic method for dynamic assignment used with microsimulation of pedestrian dynamics is introduced. As pedestrians - unlike vehicles - do not move on a network, but on areas they in principle can choose among an infinite number of routes. To apply assignment algorithms one has to select for each OD pair a finite (realistically a small) number of relevant representatives from these routes. This geometric task is the main focus of this contribution. The main task is to find for an OD pair the relevant routes to be used with common assignment methods. The method is demonstrated for one single OD pair and exemplified with an example.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。