Anchor uncertainty and space-time prisms on road networks

摘要: Space-time prisms capture all possible locations of a moving person or object between two known and times given the maximum travel velocities in environment. These 'anchor points' can represent observed mandatory because scheduling constraints. The classic space-time prism as well more recent analytical computational versions planar space networks assume that these anchor points are perfectly fixed. In reality, observations have error, constraints may some degree pliability. This article generalizes concept to regions: bounded, possibly disconnected, subsets containing for points, with each location labelled an probability. We develop algorithms calculating network-based based on probabilistic regions. first algorithm calculates envelope having point within particular region. second calculates, any point, probability regions contains point. Both implemented Mathematica visualize possibilities case uncertain. also discuss complexity procedures, their use analysing uncertainty flexibility future research directions.