A DeepLearning Framework for Dynamic Estimation of Origin-Destination Sequence

• URL: http://arxiv.org/abs/2307.05623v1
• Date: Tue, 11 Jul 2023 04:58:45 GMT
• Title: A DeepLearning Framework for Dynamic Estimation of Origin-Destination Sequence
• Authors: Zheli Xiong, Defu Lian, Enhong Chen, Gang Chen and Xiaomin Cheng
• Abstract summary: This paper proposes an integrated method, which uses deep learning methods to infer the structure of OD sequence and uses structural constraints to guide traditional numerical optimization. Our experiments show that the neural network can effectively infer the structure of the OD sequence and provide practical constraints for numerical optimization to obtain better results.
• Score: 63.70447384033326
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: OD matrix estimation is a critical problem in the transportation domain. The principle method uses the traffic sensor measured information such as traffic counts to estimate the traffic demand represented by the OD matrix. The problem is divided into two categories: static OD matrix estimation and dynamic OD matrices sequence(OD sequence for short) estimation. The above two face the underdetermination problem caused by abundant estimated parameters and insufficient constraint information. In addition, OD sequence estimation also faces the lag challenge: due to different traffic conditions such as congestion, identical vehicle will appear on different road sections during the same observation period, resulting in identical OD demands correspond to different trips. To this end, this paper proposes an integrated method, which uses deep learning methods to infer the structure of OD sequence and uses structural constraints to guide traditional numerical optimization. Our experiments show that the neural network(NN) can effectively infer the structure of the OD sequence and provide practical constraints for numerical optimization to obtain better results. Moreover, the experiments show that provided structural information contains not only constraints on the spatial structure of OD matrices but also provides constraints on the temporal structure of OD sequence, which solve the effect of the lagging problem well.

Related papers

• Large-Scale OD Matrix Estimation with A Deep Learning Method [70.78575952309023]
  The proposed method integrates deep learning and numerical optimization algorithms to infer matrix structure and guide numerical optimization. We conducted tests to demonstrate the good generalization performance of our method on a large-scale synthetic dataset.
  arXiv  Detail & Related papers  (2023-10-09T14:30:06Z)
• Dimensionality Collapse: Optimal Measurement Selection for Low-Error Infinite-Horizon Forecasting [3.5788754401889022]
  We solve the problem of sequential linear measurement design as an infinite-horizon problem with the time-averaged trace of the Cram'er-Rao lower bound (CRLB) for forecasting as the cost. By introducing theoretical results regarding measurements under additive noise from natural exponential families, we construct an equivalent problem from which a local dimensionality reduction can be derived. This alternative formulation is based on the future collapse of dimensionality inherent in the limiting behavior of many differential equations and can be directly observed in the low-rank structure of the CRLB for forecasting.
  arXiv  Detail & Related papers  (2023-03-27T17:25:04Z)
• Learning Discretized Neural Networks under Ricci Flow [51.36292559262042]
  We study Discretized Neural Networks (DNNs) composed of low-precision weights and activations. DNNs suffer from either infinite or zero gradients due to the non-differentiable discrete function during training.
  arXiv  Detail & Related papers  (2023-02-07T10:51:53Z)
• Entropic Neural Optimal Transport via Diffusion Processes [105.34822201378763]
  We propose a novel neural algorithm for the fundamental problem of computing the entropic optimal transport (EOT) plan between continuous probability distributions. Our algorithm is based on the saddle point reformulation of the dynamic version of EOT which is known as the Schr"odinger Bridge problem. In contrast to the prior methods for large-scale EOT, our algorithm is end-to-end and consists of a single learning step.
  arXiv  Detail & Related papers  (2022-11-02T14:35:13Z)
• ODformer: Spatial-Temporal Transformers for Long Sequence Origin-Destination Matrix Forecasting Against Cross Application Scenario [18.241804329382543]
  Origin-Destination (OD) record directional flow data between pairs of OD regions. Most of the related methods are designed for very short sequence time series forecasting in specific application scenarios. We propose a Transformer-like model named ODformer, with two salient characteristics.
  arXiv  Detail & Related papers  (2022-08-17T10:58:46Z)
• Truncated tensor Schatten p-norm based approach for spatiotemporal traffic data imputation with complicated missing patterns [77.34726150561087]
  We introduce four complicated missing patterns, including missing and three fiber-like missing cases according to the mode-drivenn fibers. Despite nonity of the objective function in our model, we derive the optimal solutions by integrating alternating data-mputation method of multipliers.
  arXiv  Detail & Related papers  (2022-05-19T08:37:56Z)
• Online Metro Origin-Destination Prediction via Heterogeneous Information Aggregation [99.54200992904721]
  We propose a novel neural network module termed Heterogeneous Information Aggregation Machine (HIAM) to jointly learn the evolutionary patterns of OD and DO ridership. An OD modeling branch estimates the potential destinations of unfinished orders explicitly to complement the information of incomplete OD matrices. A DO modeling branch takes DO matrices as input to capture the spatial-temporal distribution of DO ridership. Based on the proposed HIAM, we develop a unified Seq2Seq network to forecast the future OD and DO ridership simultaneously.
  arXiv  Detail & Related papers  (2021-07-02T10:11:51Z)
• Low-Rank Hankel Tensor Completion for Traffic Speed Estimation [7.346671461427793]
  We propose a purely data-driven and model-free solution to the traffic state estimation problem. By imposing a low-rank assumption on this tensor structure, we can approximate characterize both global patterns and the unknown complex local dynamics. We conduct numerical experiments on both synthetic simulation data and real-world high-resolution data, and our results demonstrate the effectiveness and superiority of the proposed model.
  arXiv  Detail & Related papers  (2021-05-21T00:08:06Z)
• A Nonconvex Low-Rank Tensor Completion Model for Spatiotemporal Traffic Data Imputation [13.48205738743634]
  Missing data imputation is common in intemporal traffic data collected from various sensing systems. We present an efficient algorithm to obtain the optimal solution for each variable. The proposed model also outperforms other baseline models in extreme missing scenarios.
  arXiv  Detail & Related papers  (2020-03-23T13:27:01Z)

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.