Affiliation:
1. Hong Kong Polytechnic University
2. Nanyang Technological University
3. Xiamen University
4. University of Science and Technology of China
5. Tencent Co. Ltd.
Abstract
We study route planning that utilizes historical trajectories to predict a realistic route from a source to a destination on a road network at given departure time. Route planning is a fundamental task in many location-based services. It is challenging to capture latent patterns implied by complex trajectory data for accurate route planning. Recent studies mainly resort to deep learning techniques that incur immense computational costs, especially on massive data, while their effectiveness are complicated to interpret.
This paper proposes DRPK, an effective and efficient route planning method that achieves state-of-the-art performance via a series of novel algorithmic designs. In brief, observing that a route planning query (RPQ) with closer source and destination is easier to be accurately predicted, we fulfill a promising idea in DRPK to first detect the key segment of an RPQ by a classification model KSD, in order to split the RPQ into shorter RPQs, and then handle the shorter RPQs by a destination-driven route planning procedure DRP. Both KSD and DRP modules rely on a directed association (DA) indicator, which captures the dependencies between road segments from historical trajectories in a surprisingly intuitive but effective way. Leveraging the DA indicator, we develop a set of well-thought-out key segment concepts that holistically consider historical trajectories and RPQs. KSD is powered by effective encoders to detect high-quality key segments, without inspecting all segments in a road network for efficiency. We conduct extensive experiments on 5 large-scale datasets. DRPK consistently achieves the highest effectiveness, often with a significant margin over existing methods, while being much faster to train. Moreover, DRPK is efficient to handle thousands of online RPQs in a second,
e.g.
, 2768 RPQs per second on a PT dataset,
i.e.
, 0.36 milliseconds per RPQ.
Publisher
Association for Computing Machinery (ACM)
Subject
General Earth and Planetary Sciences,Water Science and Technology,Geography, Planning and Development
Reference44 articles.
1. 2022. Gaya. https://outreach.didichuxing.com/research/opendata/. 2022. Gaya. https://outreach.didichuxing.com/research/opendata/.
2. 2022. OpenStreetMap. https://www.openstreetmap.org/. 2022. OpenStreetMap. https://www.openstreetmap.org/.
3. 2022. Porto Dataset. https://www.kaggle.com/c/pkdd-15-predict-taxi-service-trajectory-i/data. 2022. Porto Dataset. https://www.kaggle.com/c/pkdd-15-predict-taxi-service-trajectory-i/data.
4. Prithu Banerjee Sayan Ranu and Sriram Raghavan. 2014. Inferring Uncertain Trajectories from Partial Observations. In ICDM. 30--39. Prithu Banerjee Sayan Ranu and Sriram Raghavan. 2014. Inferring Uncertain Trajectories from Partial Observations. In ICDM. 30--39.
5. On Lipschitz embedding of finite metric spaces in Hilbert space;Bourgain Jean;Israel Journal of Mathematics,1985