Analysis of Fastest and Shortest Paths in an Urban City Using Live Vehicle Data from a Vehicle-to-Infrastructure Architecture
@inproceedings{Miller2009AnalysisOF, title={Analysis of Fastest and Shortest Paths in an Urban City Using Live Vehicle Data from a Vehicle-to-Infrastructure Architecture}, author={Jeffrey Miller}, booktitle={International Conference on Collaboration Technologies and Systems}, year={2009} }
Abstract – In this paper, I perform an analysis of the time to traverse different paths from a source to a destination in an urban city based on data gathered by a vehicle-to-infrastructure (V2I) intelligent transportation system (ITS) architecture. Vehicle tracking devices have been installed in 15 vehicles that frequent the University of Alaska, Anchorage on a daily basis. This data has been analyzed using FreeSim ( http://www.freewaysimulator.com ) to determine the fastest path from the…
Figures and Tables from this paper
4 Citations
On Software-based Remote Vehicle Monitoring for Detection and Mapping of Slippery Road Sections
- Computer ScienceInt. J. Intell. Transp. Syst. Res.
- 2017
This project first focuses on identifying dangerous road sections typically caused by, but not limited to, ice patches using vehicle slippage detection using a custom vehicular interface and networking device called CANOPNR (CAN-BUS OBD Programmable-expandable Network-enabled Reader).
Functional Regions Discovery and Evaluation using Spatial and Semantic Data
- Computer ScienceICMLC
- 2020
This work proposes an LDA based topic model to discover regions with different functions in a city, based on the semantic and spatial information, User Check-in Records and Point-of-Interests (POIs), respectively, which infers the thematic meaning of each region.
Discovering Functional Regions in Modern Cities by Using User Check-in Records and POIs
- Computer Science2019 IEEE International Conference on Robotics and Biomimetics (ROBIO)
- 2019
An LDA based topic model is proposed to discover regions with different functions in a city using user check-in records and Point-of-Interests and infer the functions of each region using the proposed model, which regards a region as a document, a function as a topic, categories of POIs and check- in frequency as words.
On Software-based Remote Vehicle Monitoring for Detection and Mapping of Slippery Road Sections
- Computer ScienceInternational Journal of Intelligent Transportation Systems Research
- 2016
This project first focuses on identifying dangerous road sections typically caused by, but not limited to, ice patches using vehicle slippage detection using a custom vehicular interface and networking device called CANOPNR (CAN-BUS OBD Programmable-expandable Network-enabled Reader).
References
SHOWING 1-10 OF 24 REFERENCES
Algorithms for real-time gathering and analysis of continuous-flow traffic data
- Computer Science2006 IEEE Intelligent Transportation Systems Conference
- 2006
Using cellular technology, the speed and location of each vehicle can be gathered in real-time over a continuous flow, which will allow more novel applications, such as incident identification and probabilities of an incident occurring, to be developed.
Vehicle-to-vehicle-to-infrastructure (V2V2I) intelligent transportation system architecture
- Computer Science2008 IEEE Intelligent Vehicles Symposium
- 2008
The super vehicle detection (SVD) algorithm for how a vehicle can find or become a super vehicle of a zone and how super vehicles can aggregate the speed and location data from all of the vehicles within their zone to still ensure an accurate representation of the network are described.
Reliable Pretrip Multipath Planning and Dynamic Adaptation for a Centralized Road Navigation System
- Computer ScienceIEEE Transactions on Intelligent Transportation Systems
- 2007
In this paper, an integrated approach combining offline precomputation of optimal candidate paths with online path retrieval and dynamic adaptation is proposed for a dynamic navigation system in a…
Accurate estimation of travel times from single-loop detectors 1 1 Funding for this research was pro
- Computer Science
- 1998
ON A ROUTING PROBLEM
- Mathematics
- 1958
Given a set of N cities, with every two linked by a road, and the times required to traverse these roads, the functional equation technique of dynamic programming and approximation in policy space yield an iterative algorithm which converges after at most (N-1) iterations.
Determining Traffic-Flow Characteristics by Definition for Application in ITS
- Computer ScienceIEEE Transactions on Intelligent Transportation Systems
- 2007
Its accuracy and the fundamental relationship are guaranteed by applying a generalized definition of traffic-flow characteristics, and Inputs to the method are time-stamped traffic counts which happen to be the strength of most ITS systems.
FreeSim - a free real-time freeway traffic simulator
- Computer Science2007 IEEE Intelligent Transportation Systems Conference
- 2007
FreeSim is a fully-customizable macroscopic and microscopic freeflow traffic simulator that allows for multiple freeway systems to be easily represented and loaded into the simulator as a graph data structure with edge weights determined by the current speeds.
VATSIM: a Vehicle And Traffic SIMulator
- Computer ScienceProceedings 199 IEEE/IEEJ/JSAI International Conference on Intelligent Transportation Systems (Cat. No.99TH8383)
- 1999
We have implemented a road and vehicle simulation software package that is suitable for evaluating the modeling and control issues that arise in automated highway and intelligent transportation…
The PeMS algorithms for accurate, real-time estimates of g-factors and speeds from single-loop detectors
- Computer ScienceITSC 2001. 2001 IEEE Intelligent Transportation Systems. Proceedings (Cat. No.01TH8585)
- 2001
This study suggests that real-time speed and travel time estimates derived from single-loop detector data assuming a common g-factor for all detectors in the district can be in error by 50 percent, and so they are of little value to travelers.
Efficient Algorithms for Shortest Paths in Sparse Networks
- Computer ScienceJ. ACM
- 1977
Algorithms for finding shortest paths are presented which are faster than algorithms previously known on networks which are relatively sparse in arcs, and a class of “arc set partition” algorithms is introduced.