Experiments on route choice set generation using a large GPS trajectory set

• URL: http://arxiv.org/abs/2006.04536v1
• Date: Fri, 22 May 2020 13:44:49 GMT
• Title: Experiments on route choice set generation using a large GPS trajectory set
• Abstract summary: In this paper, different path generation algorithms are evaluated using a large GPS trajectory dataset. An initial analysis is performed by generating a single route based on the shortest path. A modified link penalty method, which accounts for preference of using higher hierarchical roads, provides a route set with 97% coverage.
• Score: 9.139729923546247
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Several route choice models developed in the literature were based on a relatively small number of observations. With the extensive use of tracking devices in recent surveys, there is a possibility to obtain insights with respect to the traveler's choice behavior. In this paper, different path generation algorithms are evaluated using a large GPS trajectory dataset. The dataset contains 6,000 observations from Tel-Aviv metropolitan area. An initial analysis is performed by generating a single route based on the shortest path. Almost 60% percent of the 6,000 observations can be covered (assuming a threshold of 80% overlap) using a single path. This result significantly contrasts previous literature findings. Link penalty, link elimination, simulation and via-node methods are applied to generate route sets, and the consistency of the algorithms are compared. A modified link penalty method, which accounts for preference of using higher hierarchical roads, provides a route set with 97% coverage (80% overlap threshold). The via-node method produces route set with satisfying coverage, and generates routes that are more heterogeneous (in terms number of links and routes ratio).

Related papers

• Disagree to Explore, Agree to Commit: Routing-Guided Test-Time Scaling for Software Agents [60.650808962786364]
  We study whether native MoE router traces can guide steering and selection without an external judge or selection-time test execution.<n>Our analysis shows that routing provides a robust behavioral role signal; token-granular readouts and decision-matched comparison sets turn it into effective control.<n>We evaluate on SWE-bench Verified using open-weight sparse MoE agents across scales and reasoning-effort settings.
  arXiv  Detail & Related papers  (2026-08-23T03:07:03Z)
• GLD-Road:A global-local decoding road network extraction model for remote sensing images [7.430139032391173]
  Road networks are crucial for mapping, autonomous driving, and disaster response.<n>We propose GLD-Road, a two-stage model combining global efficiency and local precision.<n> Experiments show GLD-Road outperforms state-of-the-art methods.
  arXiv  Detail & Related papers  (2025-06-11T09:36:25Z)
• Multimodal Trajectory Prediction for Autonomous Driving on Unstructured Roads using Deep Convolutional Network [15.950227451262919]
  The application of autonomous driving in open-pit mining has garnered increasing attention for achieving safe and efficient transportation. A method is proposed to predict multiple possible trajectories and their probabilities of the target vehicle. The method underwent offline testing on a dataset specifically designed for autonomous driving scenarios in open-pit mining.
  arXiv  Detail & Related papers  (2024-09-27T02:29:02Z)
• Finding Transformer Circuits with Edge Pruning [71.12127707678961]
  We propose Edge Pruning as an effective and scalable solution to automated circuit discovery. Our method finds circuits in GPT-2 that use less than half the number of edges compared to circuits found by previous methods. Thanks to its efficiency, we scale Edge Pruning to CodeLlama-13B, a model over 100x the scale that prior methods operate on.
  arXiv  Detail & Related papers  (2024-06-24T16:40:54Z)
• NLP-enabled Trajectory Map-matching in Urban Road Networks using a Transformer-based Encoder-decoder [1.3812010983144802]
  This study introduces a data-driven, deep learning-based map-matching framework, formulating the task as machine translation, inspired by NLP. A transformer-based encoder-decoder model learns contextual representations of noisy GPS points to infer trajectory behavior and road structures in an end-to-end manner. Experiments on synthetic trajectories show that this approach outperforms conventional methods by integrating contextual awareness.
  arXiv  Detail & Related papers  (2024-04-18T18:39:23Z)
• Road Graph Generator: Mapping roads at construction sites from GPS data [0.0]
  We propose a new method for inferring roads from GPS trajectories to map construction sites. This task presents a unique challenge due to the erratic and non-standard movement patterns of construction machinery. Our proposed method first identifies intersections in the road network that serve as critical decision points, and then connects them with edges to produce a graph.
  arXiv  Detail & Related papers  (2024-02-15T12:53:25Z)
• Radio Map Estimation -- An Open Dataset with Directive Transmitter Antennas and Initial Experiments [49.61405888107356]
  We release a dataset of simulated path loss radio maps together with realistic city maps from real-world locations and aerial images from open datasources. Initial experiments regarding model architectures, input feature design and estimation of radio maps from aerial images are presented.
  arXiv  Detail & Related papers  (2024-01-12T14:56:45Z)
• Road Rutting Detection using Deep Learning on Images [0.0]
  Road rutting is a severe road distress that can cause premature failure of road incurring early and costly maintenance costs. This paper proposes a novel road rutting dataset comprising of 949 images and provides both object level and pixel level annotations. Object detection models and semantic segmentation models were deployed to detect road rutting on the proposed dataset.
  arXiv  Detail & Related papers  (2022-09-28T16:53:05Z)
• GraphWalks: Efficient Shape Agnostic Geodesic Shortest Path Estimation [93.60478281489243]
  We propose a learnable network to approximate geodesic paths on 3D surfaces. The proposed method provides efficient approximations of the shortest paths and geodesic distances estimations.
  arXiv  Detail & Related papers  (2022-05-30T16:22:53Z)
• A Metaheuristic Algorithm for Large Maximum Weight Independent Set Problems [58.348679046591265]
  Given a node-weighted graph, find a set of independent (mutually nonadjacent) nodes whose node-weight sum is maximum. Some of the graphs airsing in this application are large, having hundreds of thousands of nodes and hundreds of millions of edges. We develop a new local search algorithm, which is a metaheuristic in the greedy randomized adaptive search framework.
  arXiv  Detail & Related papers  (2022-03-28T21:34:16Z)
• SPIN Road Mapper: Extracting Roads from Aerial Images via Spatial and Interaction Space Graph Reasoning for Autonomous Driving [64.10636296274168]
  Road extraction is an essential step in building autonomous navigation systems. Using just convolution neural networks (ConvNets) for this problem is not effective as it is inefficient at capturing distant dependencies between road segments in the image. We propose a Spatial and Interaction Space Graph Reasoning (SPIN) module which when plugged into a ConvNet performs reasoning over graphs constructed on spatial and interaction spaces projected from the feature maps.
  arXiv  Detail & Related papers  (2021-09-16T03:52:17Z)
• The Oxford Road Boundaries Dataset [27.619657696700283]
  The Oxford Road Boundaries dataset is designed for training and testing machine-learning-based road-boundary detection and inference approaches. We have hand-annotated two of the 10 km-long forays from the Oxford Robotcar dataset and generated from other forays several thousand further examples with semi-annotated road-boundary masks.
  arXiv  Detail & Related papers  (2021-06-16T17:23:34Z)
• Partitioned Graph Convolution Using Adversarial and Regression Networks for Road Travel Speed Prediction [0.0]
  We propose a framework for predicting road segment travel speed histograms for dataless edges. The framework achieves an accuracy of 71.5% intersection and 78.5% correlation on predicting travel speed histograms. Experiments show that partitioning the dataset into clusters increases the performance of the framework.
  arXiv  Detail & Related papers  (2021-02-26T22:16:48Z)
• Detecting 32 Pedestrian Attributes for Autonomous Vehicles [103.87351701138554]
  In this paper, we address the problem of jointly detecting pedestrians and recognizing 32 pedestrian attributes. We introduce a Multi-Task Learning (MTL) model relying on a composite field framework, which achieves both goals in an efficient way. We show competitive detection and attribute recognition results, as well as a more stable MTL training.
  arXiv  Detail & Related papers  (2020-12-04T15:10:12Z)

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.