Method for calculating the encounter probability in network space

Abstract

AbstractProbabilistic time geography (PTG) can be used to measure the probability of random encounters between two moving objects. Available PTG methods are based on homogeneous space, while the network space is typically heterogeneous, which constrains individuals to the network. Therefore, the PTG of the network must consider the geographic network. Based on this, we put forward a method for calculating the encounter probability of objects that are moving in a network by considering network constraints on movement. These constraints not only restrict the space‐time accessibility of the moving objects, but also affect the probability of them visiting locations or encountering other objects in space and time. Therefore, in network space, our method improves measures of the likelihood of encounters between moving objects, thereby enabling more accurate predictions of encounter events and their probabilities. Finally, the performance of the method is experimentally evaluated. In the experiment, campus road network data and simulated trip data are used to calculate the encounter probabilities of two moving objects and to determine when and where two moving objects meet with the highest probability.