TRIP PLANNER OVER PROBABILISTIC TIME-DEPENDENT ROAD NETWORKS
Abstract
In recent times, the
management of transportation systems has
turn into increasingly important in many
real applications such as location-based
services, traffic control, and so on. These
applications usually absorb queries over
spatial road networks with energetically
changing and complex traffic conditions. In
this paper, we proposed such a network by a
probabilistic time-dependent graph referred
as PT-Graph, whose edges are connected
with uncertain delay functions. In this paper
we propose a functional query in the PTGraph,
known as trip planner query (TPQ),
which retrieves trip plans that traverse a set
of query points in PT-Graph. To tackle the
efficiency issue, we proposed the pruning
methods which include time interval pruning
and probabilistic pruning to effectively rule
out false alarms of trip plans.
Downloads
Author(s) and co-author(s) jointly and severally represent and warrant that the Article is original with the author(s) and does not infringe any copyright or violate any other right of any third parties, and that the Article has not been published elsewhere. Author(s) agree to the terms that the IJRDO Journal will have the full right to remove the published article on any misconduct found in the published article.
