Anchor uncertainty and space-time prisms on road networks

被引:67
作者
Kuijpers, Bart [1 ]
Miller, Harvey J. [2 ]
Neutens, Tijs [3 ]
Othman, Walied [1 ]
机构
[1] Hasselt Univ, Theoret Comp Sci Grp, B-3590 Diepenbeek, Belgium
[2] Univ Utah, Dept Geog, Salt Lake City, UT 84112 USA
[3] Univ Ghent, Dept Geog, B-9000 Ghent, Belgium
关键词
moving objects; uncertainty; space-time prisons; road networks; GIS; movement modeling; quantifying uncertainty; MOVING-OBJECTS; ACCESSIBILITY; BEHAVIOR; GIS;
D O I
10.1080/13658810903321339
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
Space-time prisms capture all possible locations of a moving person or object between two known locations and times given the maximum travel velocities in the environment. These known locations or 'anchor points' can represent observed locations or mandatory locations because of scheduling constraints. The classic space-time prism as well as more recent analytical and computational versions in planar space and networks assume that these anchor points are perfectly known or fixed. In reality, observations of anchor points can have error, or the scheduling constraints may have some degree of pliability. This article generalizes the concept of anchor points to anchor regions: these are bounded, possibly disconnected, subsets of space-time containing all possible locations for the anchor points, with each location labelled with an anchor probability. We develop two algorithms for calculating network-based space-time prisms based on these probabilistic anchor regions. The first algorithm calculates the envelope of all space-time prisms having an anchor point within a particular anchor region. The second algorithm calculates, for any space-time point, the probability that a space-time prism with given anchor regions contains that particular point. Both algorithms are implemented in Mathematica to visualize travel possibilities in case the anchor points of a space-time prism are uncertain. We also discuss the complexity of the procedures, their use in analysing uncertainty or flexibility in network-based prisms and future research directions.
引用
收藏
页码:1223 / 1248
页数:26
相关论文
共 44 条
[1]  
EGENHOFER M, 2003, P SPADAGIS WORKSH SP
[2]   Space-time accessibility under conditions of uncertain travel times: Theory and numerical simulations [J].
Ettema, Dick ;
Timmermans, Harry .
GEOGRAPHICAL ANALYSIS, 2007, 39 (02) :217-240
[3]  
Hagerstraand T., 1970, PAP REG SCI, V24, P7, DOI 10.1007/BF01936872
[4]  
HAGERSTRAND T, 1957, P MIGR SWED S 1954 U
[5]   TRAVEL OUTCOME AND PERFORMANCE - THE EFFECT OF UNCERTAINTY ON ACCESSIBILITY [J].
HALL, RW .
TRANSPORTATION RESEARCH PART B-METHODOLOGICAL, 1983, 17 (04) :275-290
[6]  
HAMMAND A, 2004, TELEGEOINFORMATICS L
[7]  
Hendricks MD, 2003, LECT NOTES COMPUT SC, V2825, P75
[8]  
Hood J, 2006, LECT NOTES COMPUT SC, V4197, P168
[9]   Modeling moving objects over multiple granularities [J].
Hornsby, K ;
Egenhofer, MJ .
ANNALS OF MATHEMATICS AND ARTIFICIAL INTELLIGENCE, 2002, 36 (1-2) :177-194
[10]  
Jacquez G.M., 2005, J GEOGR SYST, V7, P7, DOI DOI 10.1007/S10109-005-0147-6