论文标题
轨迹流图:基于图的方法,用于分析大型城市网络中总交通流的时间演变
Trajectory Flow Map: Graph-based Approach to Analysing Temporal Evolution of Aggregated Traffic Flows in Large-scale Urban Networks
论文作者
论文摘要
本文提出了一种基于图表的方法来表示时空轨迹数据,该数据允许有效地可视化和表征全市范围的交通动态。随着传感器,移动和物联网(IoT)技术的发展,车辆和乘客轨迹越来越大规模地收集,并且正在成为对交通模式和旅行者行为的关键来源。为了利用此类轨迹数据以更好地了解大型城市网络中的流量动态,本研究开发了一种基于轨迹的网络流量分析方法,该方法将单个轨迹数据转换为一系列图表,这些序列会随着时间的流逝而演变(被称为动态图或时间浏览图),并在稳定的图形和信息图中分析网络范围的流量综合范围。首先,我们根据单个轨迹中数据点的空间分布将整个网络分为一组单元,其中细胞代表可以测量聚集的交通流之间的空间区域。接下来,移动对象的动态流表示为时间不断变化的图,其中区域是图形顶点,并且它们之间的流动为加权的有向边。给定一组固定的顶点,可以在每个时间步长插入或删除边缘,具体取决于给定时间窗口的两个区域之间的交通流量。一旦构建了动态图,我们将应用图挖掘算法来检测时间点,该算法表示该图在其整体结构中显示出显着变化的时间点,因此,对应于整天全天的全市移动性模式(例如,峰值和山峰期之间的全球过渡点)的变化点。
This paper proposes a graph-based approach to representing spatio-temporal trajectory data that allows an effective visualization and characterization of city-wide traffic dynamics. With the advance of sensor, mobile, and Internet of Things (IoT) technologies, vehicle and passenger trajectories are being increasingly collected on a massive scale and are becoming a critical source of insight into traffic pattern and traveller behaviour. To leverage such trajectory data to better understand traffic dynamics in a large-scale urban network, this study develops a trajectory-based network traffic analysis method that converts individual trajectory data into a sequence of graphs that evolve over time (known as dynamic graphs or time-evolving graphs) and analyses network-wide traffic patterns in terms of a compact and informative graph-representation of aggregated traffic flows. First, we partition the entire network into a set of cells based on the spatial distribution of data points in individual trajectories, where the cells represent spatial regions between which aggregated traffic flows can be measured. Next, dynamic flows of moving objects are represented as a time-evolving graph, where regions are graph vertices and flows between them are treated as weighted directed edges. Given a fixed set of vertices, edges can be inserted or removed at every time step depending on the presence of traffic flows between two regions at a given time window. Once a dynamic graph is built, we apply graph mining algorithms to detect change-points in time, which represent time points where the graph exhibits significant changes in its overall structure and, thus, correspond to change-points in city-wide mobility pattern throughout the day (e.g., global transition points between peak and off-peak periods).