SParTSim: A Space Partitioning Guided by Road Network for Distributed Traffic Simulations

Distributed Simulation and Real Time Applications(2012)

引用 21|浏览15
暂无评分
摘要
Traffic simulation can be very computationally intensive, especially for microscopic simulations of large urban areas (tens of thousands of road segments, hundreds of thousands of agents) and when real-time or better than real-time simulation is required. For instance, running a couple of what-if scenarios for road management authorities/police during a road incident: time is a hard constraint and the size of the simulation is relatively high. Hence the need for distributed simulations and for optimal space partitioning algorithms, ensuring an even distribution of the load and minimal communication between computing nodes. In this paper we describe a distributed version of SUMO, a simulator of urban mobility, and SParTSim, a space partitioning algorithm guided by road network for distributed simulations. It outperforms classical uniform space partitioning in terms of road segment cuts and load-balancing.
更多
查看译文
关键词
distributed algorithms,network theory (graphs),resource allocation,road traffic,traffic engineering computing,SParTSim,SUMO,distributed traffic simulation,load balancing,load distribution,microscopic simulation,optimal space partitioning algorithm,road management authority,road management police,road network,road segment cut,urban mobility simulator,Graph Partitioning,Parallel and Distributed Simulation,Road Network,Space Partitioning,Traffic Simulation
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络
Chat Paper
正在生成论文摘要