Random encounters in probabilistic time geography

Probabilistic time geography considers the encounter of moving agents to be random; therefore, a quantitative time geography analysis must consider the actual encounter probability. The existing algorithm of encounter probability is oriented over a discrete space and is sensitive to the unit definition of a virtual grid; thus, it is not suitable for continuous space. For this reason, a new method is presented in this paper for the encounter of two moving agents in continuous space. When the encounters are less than a specified distance threshold apart, an encounter event occurs based on the probability of the product, which is calculated by their respective probability density functions over their respective potential location areas. This probability provides a quantitative basis for predicting the likelihood of two agents meeting, as well as the location of this meeting point. Finally, the validity of the proposed model is verified by an experiment, which uses tracking data to calculate the encounter probabilities of three zebras and analyse the distribution characteristics of these probabilities over time and space.