Table of Contents
Fetching ...

TrajRoute: Rethinking Routing with a Simple Trajectory-Based Approach -- Forget the Maps and Traffic!

Maria Despoina Siampou, Chrysovalantis Anastasiou, John Krumm, Cyrus Shahabi

TL;DR

As the number of trajectories covering the road network increases, TrajRoute produces increasingly accurate travel time and route length estimates while gradually eliminating the need to downgrade to the road network, highlighting the potential of simpler, data-driven pipelines for routing, offering lower maintenance alternatives to conventional systems.

Abstract

The abundance of vehicle trajectory data offers a new opportunity to compute driving routes between origins and destinations. Current graph-based routing pipelines, while effective, involve substantial costs in constructing, maintaining, and updating road network graphs to reflect real-time conditions. In this study, we propose a new trajectory-based routing paradigm that bypasses current workflows by directly utilizing raw trajectory data to compute efficient routes. Our method, named TrajRoute, uniquely "follows" historical trajectories from a source to a destination, constructing paths that reflect actual driver behavior and implicit preferences. To supplement areas with sparse trajectory data, the road network is also incorporated into TrajRoute's index, and tunable parameters are introduced to control the balance between road segments and trajectories, ensuring a unified and adaptable routing approach. We experimentally verify our approach by comparing it to an existing online routing service. Our results demonstrate that as the number of trajectories covering the road network increases, TrajRoute produces increasingly accurate travel time and route length estimates while gradually eliminating the need to downgrade to the road network. This highlights the potential of simpler, data-driven pipelines for routing, offering lower-maintenance alternatives to conventional systems.

TrajRoute: Rethinking Routing with a Simple Trajectory-Based Approach -- Forget the Maps and Traffic!

TL;DR

As the number of trajectories covering the road network increases, TrajRoute produces increasingly accurate travel time and route length estimates while gradually eliminating the need to downgrade to the road network, highlighting the potential of simpler, data-driven pipelines for routing, offering lower maintenance alternatives to conventional systems.

Abstract

The abundance of vehicle trajectory data offers a new opportunity to compute driving routes between origins and destinations. Current graph-based routing pipelines, while effective, involve substantial costs in constructing, maintaining, and updating road network graphs to reflect real-time conditions. In this study, we propose a new trajectory-based routing paradigm that bypasses current workflows by directly utilizing raw trajectory data to compute efficient routes. Our method, named TrajRoute, uniquely "follows" historical trajectories from a source to a destination, constructing paths that reflect actual driver behavior and implicit preferences. To supplement areas with sparse trajectory data, the road network is also incorporated into TrajRoute's index, and tunable parameters are introduced to control the balance between road segments and trajectories, ensuring a unified and adaptable routing approach. We experimentally verify our approach by comparing it to an existing online routing service. Our results demonstrate that as the number of trajectories covering the road network increases, TrajRoute produces increasingly accurate travel time and route length estimates while gradually eliminating the need to downgrade to the road network. This highlights the potential of simpler, data-driven pipelines for routing, offering lower-maintenance alternatives to conventional systems.

Paper Structure

This paper contains 22 sections, 10 equations, 11 figures, 3 algorithms.

Figures (11)

  • Figure 1: Example of TrajRoute generating a route from Fisherman's Wharf to the Mission District.
  • Figure 2: Comparison of pipelines: (a) current routing services and (b) our proposed pipeline.
  • Figure 3: Density of spatial coverage for San Fransisco in our dataset. A darker color indicates a higher coverage for the segment.
  • Figure 4: Results for different $r_{\text{penalty}}$ values $\in$ [0, 4].
  • Figure 5: Results for different $rw$ values $\in$ [0, 1].
  • ...and 6 more figures

Theorems & Definitions (3)

  • Definition 3.1: Trajectory
  • Definition 3.2: Road Segment
  • Definition 3.3: Routing Path