Abstract
Route evaluation and optimization have received significant attention in recent years. In this light, we propose and investigate a novel problem of estimating the travel time (TTE query) for a user specified path by considering the related traffic conditions. Given a query path and a departure time, TTE query finds the estimated travel time along this path. We believe that this type of query may bring important benefits to users in many popular applications, such as travel route evaluation and optimization, and route planning and recommendation. To address the TTE problem in a convincing approach, we construct a traffic-aware spatial network G <sub xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">pt</sub> (V, E) by analysing uncertain trajectory data of moving objects. Based on G <sub xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">pt</sub> (V, E), we define two novel types of TTE queries: TTE <sub xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">ep</sub> for an exact query path, and TTE <sub xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">lp</sub> for a loose query path. The performance of the construction of traffic-aware spatial network is verified by extensive experiments based on real and synthetic spatial data sets.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
