Abstract 1 Introduction 2 Towards a definition of visit probability in space-time prisms 3 When is visit probability a probability? References

Visit Probability in Space-Time Prisms for Moving Object Data

Arthur Jansen111Corresponding author ORCID Hasselt University, Databases and Theoretical Computer Science Group and
Data Science Institute (DSI), Agoralaan, Building D, 3590 Diepenbeek, Belgium
Bart Kuijpers ORCID Hasselt University, Databases and Theoretical Computer Science Group and
Data Science Institute (DSI), Agoralaan, Building D, 3590 Diepenbeek, Belgium
Abstract

Space-time prisms have been extensively studied as a model to describe the uncertainty of the spatio-temporal location of a moving object in between measured space-time locations. In many applications, the desire has been expressed to provide an internal structure to these prisms, that includes what has been called “visit probability”. Although several proposals have been studied in the past decades, a precise definition of this concept has been missing. The contribution of this paper is to provide such a specification by means of a formal framework for visit probability. Once this concept is established, we are able to derive on which parts of a prism, visit probability can be seen to give rise to a probability space.

Keywords and phrases:
Spatio-temporal databases, moving object databases, space-time prisms, probability spaces
Category:
Short Paper
Funding:
Arthur Jansen: Bijzonder Onderzoeksfonds (BOF22OWB06) from UHasselt
Copyright and License:
[Uncaptioned image] © Arthur Jansen and Bart Kuijpers; licensed under Creative Commons License CC-BY 4.0
2012 ACM Subject Classification:
Information systems Spatial-temporal systems
; Mathematics of computing Probability and statistics
Editors:
Thierry Vidal and Przemysław Andrzej Wałęga

1 Introduction

In a wide range of applications that deal with moving objects (such as people, animals or vehicles), time-stamped location data are collected using location-aware devices (such as GPS) and these data are stored and managed in moving object databases (MODs) [3]. The actual space-time trajectories of the moving object may be reconstructed or estimated from these measured space-time locations (called anchor points) using, for example, linear interpolation [11]. Space-time prisms, originating from the field of time geography [1, 4, 7], are used in Geographical Information Systems (GIS) [9] and MODs [2, 5] to model the movement uncertainty of a moving object between anchor points, based on a known speed bound on the object’s movement. For spatio-temporal anchor points (p,t) and (p+,t+), with t<t+, and a speed bound vmax, the prism with these and anchors and speed bound is denoted 𝒫(p,t,p+,t+,vmax). Figure 1 depicts space-time prisms for movement in a two- and a one-dimensional space, respectively. As shown in the figure, prisms can be seen there to be the intersection of a future and past cone. The spatial projection of the prism, also called the potential path area, is an envelope of the spatial whereabouts of the moving object between the measured spatial locations.

Figure 1: Part (a) of the figure shows the space-time prism (in green) for movement in the plane as the intersection of the past cone 𝖢+ (in red) and the future cone 𝖢 (in blue). Part (b) of the figure shows a prism for movement in a one-dimensional space.

In its basic form, a space-time prism lacks any internal structure and can be seen as a homogeneous geometric object, meaning that no two space-time points can be distinguished as more or less likely to have been visited. Conceptually, an infinite number of velocity-bound trajectories can be imagined within a prism and each point inside a prism is visited by infinitely many of them (except for some boundary points). This means that there is no a-priori reason to distinguish between space-time points inside the prism. Still, in many applications, such as animal or human movement [8], it is plausible that certain points in a prism, such as those on a linear interpolation path, should be considered more likely than other space-time points that are more towards the boundary of the prism (since they require a considerable detour). The notion of probability distributions in space-time prisms has become known as visit probability and has been studied extensively in the past decades (see e.g., [10, 12]). Several proposals have been made to assign probability values to space-time points or regions within a prism, thus providing the prism with an internal structure that expresses the unequal movement opportunities within the prism. Many of these proposals take an, often ad-hoc, approach towards the problem of establishing a visit probability for a particular application and each approach necessarily depends on a series of assumptions, which often remain obscure to a certain extend and the resulting visit probability therefore directly reflects these assumptions (in the best case, in a transparent way).

In this paper, we develop a general framework (or theory) of visit probability in the context of space-time prisms. In this approach, we start from the clear understanding that any definition of visit probability assumes a probability distribution on the possible velocity-bound trajectories within a prism. Once a probability space is defined on the set of trajectories (including a σ-algebra and a probability function), we can clearly determine for which parts of a space-time prims a visit probability can be derived. We also specify which conditions the σ-algebra on the set of trajectories must satisfy in order to be able to speak about a visit probability of certain classes of subsets of interest in the prism. Next, we address the question that asks on which subsets of a prism on which the derived visit probability is really a probability. We give a characterization of exactly those subsets of a prism for which this is the case. These sets are what we call “singleton-separators” and they are a wider class of subsets than just time slices of prisms. In the above mentioned literature, it is often the case that some notion of visit probability that has been defined is only considered on time slices of a prism. Our result shows that in fact it can be considered a probability on a wider class of subsets.

2 Towards a definition of visit probability in space-time prisms

In this section, we investigate how we can define the notion of “visit probability” on space-time prisms, thus providing some internal structure to an otherwise homogeneous prisms. Let 𝒫=𝒫(p,t,p+,t+,vmax) be a space-time prism with anchors (p,t),(p+,t+) and speed bound vmax0. A vmax-trajectory in the prism 𝒫 is a (differentiable) mapping γ from the time interval [t,t+] to space, that connects the anchor points and whose velocity vector is bounded in size by vmax at all time. The set of vmax-trajectories in the prism 𝒫 is denoted by Γ𝒫. Space-time prisms are homogeneous in the sense that a-priori no higher likelihood can be assigned to a point (p,t) in a space-time prism 𝒫=𝒫(p,t,p+,t+,vmax) as compared to another point (p,t) in 𝒫. In general, the sets of vmax-trajectories passing through these points have the same cardinality (only points on the “rim” of a prism are exceptions [6]). Only by assigning a probability (or probability distribution) to the set of vmax-trajectories Γ𝒫, we are be able to indicate certain points or parts of a prism as more likely than others. To obtain such a probability space on Γ𝒫, we need to specify a σ-algebra 𝒢 of subsets of Γ𝒫 and to define a probability function P on this σ-algebra.

Once such a probability space (Γ𝒫,𝒢,P) has been specified, we can start working towards specifying a “visit probability”: for a subset A of 𝒫, for which Γ𝒫(A), which is the subset of vmax-trajectories that intersect A, belongs to 𝒢, we define the visit probability of A (relative to the given probability P on Γ𝒫) as P(Γ𝒫(A)) and we denote it by 𝗏𝗉P(A).

However, the fact that Γ𝒫(A) belongs to the σ-algebra 𝒢 is not guaranteed. Indeed, a σ-algebra 𝒢 on 𝒫 can range from very “poor” (or 𝒢={,Γ𝒫}) to very “rich” (or 𝒢=2𝒫). In the former case, we can derive the visit probability of very few subsets of the prism, whereas in the latter case, we can derive it for all subsets. When we are interested in knowing the visit probability of a certain class of subsets of the prism 𝒫, we can only obtain this visit probability when for F, we have that Γ𝒫(F) belongs to the σ-algebra 𝒢.

We turn to a visit probability for parts of the potential path area (PPA) of a prism. The following definition of visit probability of a part A of the the PPA reflects the idea that a moving object has visited A if at some point in time it has visited A. For a subset A of the PPA, we denote the cylindrical subset (A×)𝒫 of 𝒫 by 𝖢𝗒𝗅𝒫(A) and when Γ𝒫(𝖢𝗒𝗅𝒫(A))𝒢, we can define the probability of visiting the part A of the the PPA as 𝗏𝗉P(𝖢𝗒𝗅𝒫(A)).

3 When is visit probability a probability?

In this section, we determine in which circumstances the definition of visit probability on a prism, as given above, gives rise to a probability space within the prism. When we have a prism 𝒫=𝒫(p,t,p+,t+,vmax) and consider the time slices 𝒫t1 and 𝒫t2 at two different moments tt1<t2t+, then we clearly have 𝗏𝗉P(𝒫t1)=1 and 𝗏𝗉P(𝒫t2)=1, since every vmax-trajectory must intersect a time slice (that is Γ𝒫(𝒫t1)=Γ𝒫(𝒫t2)=Γ𝒫). Since t1 and t2 are different, we have that the time slices 𝒫t1 and 𝒫t2 are disjoint subsets of 𝒫. For disjoint unions, we would expect 𝗏𝗉P(𝒫t1𝒫t2) to be 𝗏𝗉P(𝒫t1)+𝗏𝗉P(𝒫t2), but since this is 1+1=2, that cannot be the case. This simple example shows that 𝗏𝗉P is not a probability on the complete prism 𝒫. This raises the question: are there subsets of a prism on which the visit probability of Section 2 is a probability? The main contribution of this paper is a characterisation exactly those subsets of a prism for which this is the case. These subsets are “singleton-separators” in a prims, which are illustrated in Figure 2 for one-dimensional movement. A subset S of 𝒫 is called a singleton-separator, if for any vmax-trajectory γ^Γ𝒫, we have that the cardinality of γ^S equals one.

Figure 2: The subsets S1 and S2 are examples of singleton-separators, S3 is not.

For a subset S of 𝒫, we define M𝒢(S):={ASΓ𝒫(A)𝒢} and we have as a first result that S is a singleton-separator if and only if for every σ-algebra 𝒢 on Γ𝒫 we have that M𝒢(S) is a σ-algebra on S.

This means that the only subsets of a prism for which we can hope to obtain a probability space are the singleton-separators. The following theorem states how this probability space looks like.

Theorem 1.

Let 𝒫=𝒫(p,t,p+,t+,vmax) be a space-time prism and let S be a singleton-separator in 𝒫. Then a probability space (Γ𝒫,𝒢,P) on the set of all vmax-trajectories induces a probability space (S,M𝒢(S),𝗏𝗉P) on S, when 𝗏𝗉P(A) is defined as P(Γ𝒫(A)) for AM𝒢(S).

References

  • [1] L. Burns. Transportation, Temporal, and Spatial Components of Accessibility. Lexington Books, Lexington, MA, 1979.
  • [2] Max J. Egenhofer. Approximation of geospatial lifelines. In Elisa Bertino and Leila De Floriani, editors, SpadaGIS, Workshop on Spatial Data and Geographic Information Systems. University of Genova, 2003.
  • [3] R. Güting and M. Schneider. Moving Object Databases. Morgan Kaufmann, 2005.
  • [4] T. Hägerstrand. What about people in regional science? Papers of the Regional Science Association, 24:7–21, 1970.
  • [5] Kathleen Hornsby and Max J. Egenhofer. Modeling moving objects over multiple granularities. Ann. Math. Artif. Intell., 36(1-2):177–194, 2002. doi:10.1023/A:1015812206586.
  • [6] Bart Kuijpers and Walied Othman. Trajectory databases: data models, uncertainty and complete query languages. J. Comput. Syst. Sci., 76(7):538–560, 2010. doi:10.1016/j.jcss.2009.10.002.
  • [7] B. Lenntorp. Paths in Space-Time Environments: A Time-Geographic Study of the Movement Possibilities of Individuals. Number 44 in Series B. Lund Studies in Geography, 1976.
  • [8] Jed A. Long. Modeling movement probabilities within heterogeneous spatial fields. Journal of Spatial Information Science, 16:85–116, 2018. doi:10.5311/JOSIS.2018.16.372.
  • [9] H.J. Miller. A measurement theory for time geography. Geographical Analysis, 2005. doi:10.1111/j.1538-4632.2005.00575.x.
  • [10] Ying Song and Harvey J. Miller. Simulating visit probability distributions within planar space-time prisms. International Journal of Geographical Information Science, 28(1):104–125, January 2014. doi:10.1080/13658816.2013.830308.
  • [11] G. Trajcevski, O. Wolfson, K. Hinrichs, and S. Chamberlain. Managing uncertainty in moving objects databases. ACM Trans. Database Syst., 29(3):463–507, 2004. doi:10.1145/1016028.1016030.
  • [12] Stephan Winter and Zhang Cai Yin. Directed movements in probabilistic time geography. International Journal of Geographical Information Science, 2010.