A Unified Framework for Online Trip Destination Prediction

• URL: http://arxiv.org/abs/2101.04520v1
• Date: Tue, 12 Jan 2021 14:45:27 GMT
• Title: A Unified Framework for Online Trip Destination Prediction
• Authors: Victor Eberstein, Jonas Sj\"oblom, Nikolce Murgovski, Morteza Haghir Chehreghani
• Abstract summary: Trip destination prediction is an area of increasing importance in many applications such as trip planning and autonomous driving. We present a unified framework for trip destination prediction in an online setting, which is suitable for both online training and online prediction.
• Score: 7.34084539365505
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Trip destination prediction is an area of increasing importance in many applications such as trip planning, autonomous driving and electric vehicles. Even though this problem could be naturally addressed in an online learning paradigm where data is arriving in a sequential fashion, the majority of research has rather considered the offline setting. In this paper, we present a unified framework for trip destination prediction in an online setting, which is suitable for both online training and online prediction. For this purpose, we develop two clustering algorithms and integrate them within two online prediction models for this problem. We investigate the different configurations of clustering algorithms and prediction models on a real-world dataset. By using traditional clustering metrics and accuracy, we demonstrate that both the clustering and the entire framework yield consistent results compared to the offline setting. Finally, we propose a novel regret metric for evaluating the entire online framework in comparison to its offline counterpart. This metric makes it possible to relate the source of erroneous predictions to either the clustering or the prediction model. Using this metric, we show that the proposed methods converge to a probability distribution resembling the true underlying distribution and enjoy a lower regret than all of the baselines.

Related papers

• Scalable Offline Metrics for Autonomous Driving [12.613436727986652]
  Extrapolating from offline model performance to online settings remains a challenge.<n>In these settings, seemingly minor errors can compound and result in test-time infractions or collisions.<n>Based on analysis in simulation, we find an even worse correlation between offline and online settings than reported by prior studies.
  arXiv  Detail & Related papers  (2025-10-09T17:59:57Z)
• Adaptive Conformal Prediction Intervals Over Trajectory Ensembles [50.31074512684758]
  Future trajectories play an important role across domains such as autonomous driving, hurricane forecasting, and epidemic modeling.<n>We propose a unified framework based on conformal prediction that transforms sampled trajectories into calibrated prediction intervals with theoretical coverage guarantees.
  arXiv  Detail & Related papers  (2025-08-18T21:14:07Z)
• Graph-Structured Feedback Multimodel Ensemble Online Conformal Prediction [14.188004615463742]
  We propose a novel multi-model online conformal prediction algorithm.<n>It identifies a subset of effective models at each time step by collecting feedback from a bipartite graph.<n>A model is then selected from this subset to construct the prediction set, resulting in reduced computational complexity and smaller prediction sets.
  arXiv  Detail & Related papers  (2025-06-26T00:06:11Z)
• OPUS: Occupancy Prediction Using a Sparse Set [64.60854562502523]
  We present a framework to simultaneously predict occupied locations and classes using a set of learnable queries. OPUS incorporates a suite of non-trivial strategies to enhance model performance. Our lightest model achieves superior RayIoU on the Occ3D-nuScenes dataset at near 2x FPS, while our heaviest model surpasses previous best results by 6.1 RayIoU.
  arXiv  Detail & Related papers  (2024-09-14T07:44:22Z)
• Enhancing Traffic Prediction with Textual Data Using Large Language Models [0.0]
  The study investigates two types of special scenarios: regional-level and node-level. For regional-level scenarios, textual information is represented as a node connected to the entire network. For node-level scenarios, embeddings from the large model represent additional nodes connected only to corresponding nodes. This approach shows a significant improvement in prediction accuracy according to our experiment of New York Bike dataset.
  arXiv  Detail & Related papers  (2024-05-10T03:14:26Z)
• Unifying Lane-Level Traffic Prediction from a Graph Structural Perspective: Benchmark and Baseline [21.37853568400125]
  We present the first systematic classification framework for lane-level traffic prediction, offering a structured taxonomy and analysis of existing methods.<n>We construct three representative datasets from two real-world road networks, covering both regular and irregular lane configurations.<n>This unified framework enables consistent evaluation across datasets and modeling paradigms.
  arXiv  Detail & Related papers  (2024-03-22T04:21:40Z)
• Is Ego Status All You Need for Open-Loop End-to-End Autonomous Driving? [84.17711168595311]
  End-to-end autonomous driving has emerged as a promising research direction to target autonomy from a full-stack perspective. nuScenes dataset, characterized by relatively simple driving scenarios, leads to an under-utilization of perception information in end-to-end models. We introduce a new metric to evaluate whether the predicted trajectories adhere to the road.
  arXiv  Detail & Related papers  (2023-12-05T11:32:31Z)
• OneNet: Enhancing Time Series Forecasting Models under Concept Drift by Online Ensembling [65.93805881841119]
  We propose textbfOnline textbfensembling textbfNetwork (OneNet) to address the concept drifting problem. OneNet reduces online forecasting error by more than $mathbf50%$ compared to the State-Of-The-Art (SOTA) method.
  arXiv  Detail & Related papers  (2023-09-22T06:59:14Z)
• Bridging the Gap Between Multi-Step and One-Shot Trajectory Prediction via Self-Supervision [2.365702128814616]
  Accurate vehicle trajectory prediction is an unsolved problem in autonomous driving. We propose a middle-ground where multiple trajectory segments are chained together. Our proposed Multi-Branch Self-Supervised Predictor receives additional training on new predictions starting at intermediate future segments.
  arXiv  Detail & Related papers  (2023-06-06T02:46:28Z)
• LOPR: Latent Occupancy PRediction using Generative Models [49.15687400958916]
  LiDAR generated occupancy grid maps (L-OGMs) offer a robust bird's eye-view scene representation. We propose a framework that decouples occupancy prediction into: representation learning and prediction within the learned latent space.
  arXiv  Detail & Related papers  (2022-10-03T22:04:00Z)
• End-to-End Trajectory Distribution Prediction Based on Occupancy Grid Maps [29.67295706224478]
  In this paper, we aim to forecast a future trajectory distribution of a moving agent in the real world, given the social scene images and historical trajectories. We learn the distribution with symmetric cross-entropy using occupancy grid maps as an explicit and scene-compliant approximation to the ground-truth distribution. In experiments, our method achieves state-of-the-art performance on the Stanford Drone dataset and Intersection Drone dataset.
  arXiv  Detail & Related papers  (2022-03-31T09:24:32Z)
• Test-time Collective Prediction [73.74982509510961]
  Multiple parties in machine learning want to jointly make predictions on future test points. Agents wish to benefit from the collective expertise of the full set of agents, but may not be willing to release their data or model parameters. We explore a decentralized mechanism to make collective predictions at test time, leveraging each agent's pre-trained model.
  arXiv  Detail & Related papers  (2021-06-22T18:29:58Z)
• Online Co-movement Pattern Prediction in Mobility Data [1.5790464310310084]
  We provide an accurate solution to the problem of Online Prediction of Co-movement patterns. In order to calculate the accuracy of our solution, we propose a co-movement pattern similarity measure. The accuracy of our solution is demonstrated experimentally over a real dataset from the maritime domain.
  arXiv  Detail & Related papers  (2021-02-17T17:01:32Z)
• Online Paging with a Vanishing Regret [6.520803851931362]
  This paper considers a variant of the online paging problem, where the online algorithm has access to multiple predictors, each producing a sequence of predictions for the page arrival times. The predictors may have occasional prediction errors and it is assumed that at least one of them makes a sublinear number of prediction errors in total. Our main result states that this assumption suffices for the design of a randomized online algorithm whose time-average regret with respect to the optimal offline algorithm tends to zero as the time tends to infinity.
  arXiv  Detail & Related papers  (2020-11-18T18:17:49Z)
• TPNet: Trajectory Proposal Network for Motion Prediction [81.28716372763128]
  Trajectory Proposal Network (TPNet) is a novel two-stage motion prediction framework. TPNet first generates a candidate set of future trajectories as hypothesis proposals, then makes the final predictions by classifying and refining the proposals. Experiments on four large-scale trajectory prediction datasets, show that TPNet achieves the state-of-the-art results both quantitatively and qualitatively.
  arXiv  Detail & Related papers  (2020-04-26T00:01:49Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.