Planning unobstructed paths in traffic-aware spatial networks

Route planning and recommendation have received significant attention in recent years. In this light, we study a novel problem of planning unobstructed paths in traffic-aware spatial networks (TAUP queries) to avoid potential traffic congestions. We propose two probabilistic TAUP queries: (1) a time-threshold query like what is the path from the check-in desk to the flight SK 1217 with the minimum congestion probability to take at most 45 minutes?, and (2) a probability-threshold query like what is the fastest path from the check-in desk to the flight SK 1217 whose congestion probability is less than 20 %?. These queries are mainly motivated by indoor space applications, but are also applicable in outdoor spaces. We believe that these queries are useful in some popular applications, such as planning unobstructed paths for VIP bags in airports and planning convenient routes for travelers. The TAUP queries are challenged by two difficulties: (1) how to model the traffic awareness in spatial networks practically, and (2) how to compute the TAUP queries efficiently under different query settings. To overcome these challenges, we construct a traffic-aware spatial network G (t a) (V, E) by analyzing uncertain trajectories of moving objects. Based on G (t a) (V, E), two efficient algorithms are developed to compute the TAUP queries. The performances of TAUP queries are verified by extensive experiments on real and synthetic spatial data.