Predicting Traffic Dmitriy Bespalov.

Slides:



Advertisements
Similar presentations
ADAPTIVE FASTEST PATH COMPUTATION ON A ROAD NETWORK: A TRAFFIC MINING APPROACH Hector Gonzalez, Jiawei Han, Xiaolei Li, Margaret Myslinska, John Paul Sondag.
Advertisements

VTrack: Accurate, Energy-Aware Road Traffic Delay Estimation Using Mobile Phones Arvind Thiagarajan, Lenin Ravindranath, Katrina LaCurts, Sivan Toledo,
T-Drive : Driving Directions Based on Taxi Trajectories Microsoft Research Asia University of North Texas Jing Yuan, Yu Zheng, Chengyang Zhang, Xing Xie,
CS 333 Introduction to Operating Systems Class 12 - Virtual Memory (2) Jonathan Walpole Computer Science Portland State University.
Chapter 5. Database Aspects of Location-Based Services Lee Myong Soo Mobile Data Engineering Lab. Dept. of.
Dieter Pfoser, LBS Workshop1 Issues in the Management of Moving Point Objects Dieter Pfoser Nykredit Center for Database Research Aalborg University, Denmark.
What is a GIS? 4 A geographic information system (GIS) = a computer- based tool for analyzing (and mapping) spatial or, geographic information (2D or 3D).
Route Planning Vehicle navigation systems, Dijkstra’s algorithm, bidirectional search, transit-node routing.
Face Processing System Presented by: Harvest Jang Group meeting Fall 2002.
Security and Digital Recording System Students: Gadi Marcu, Tomer Alon Number:D1123 Supervisor: Erez Zilber Semester:Spring 2004 Final Presentation.
CS333 Intro to Operating Systems Jonathan Walpole.
Exposure In Wireless Ad-Hoc Sensor Networks Seapahn Meguerdichian Computer Science Department University of California, Los Angeles Farinaz Koushanfar.
Exposure In Wireless Ad-Hoc Sensor Networks Seapahn Meguerdichian Computer Science Department University of California, Los Angeles Farinaz Koushanfar.
CS910: Foundations of Data Analytics Graham Cormode Time Series Analysis.
CHAPTER 09 Compiled by: Dr. Mohammad Omar Alhawarat Sorting & Searching.
The Science of Prediction Location Intelligence Conference April 4, 2006 How Next Generation Traffic Services Will Impact Business Dr. Oliver Downs, Chief.
Data Mining Chapter 1 Introduction -- Basic Data Mining Tasks -- Related Concepts -- Data Mining Techniques.
2005 Epocrates, Inc. All rights reserved. Integrating XML with legacy relational data for publishing on handheld devices David A. Lee Senior member of.
CONTACT INFORMATION Győző Gidófalvi: KTH Royal Institute of Technology – Geodesy and Geoinformatics – Manohar Kaul: Uppsala.
Implementation of Travel Time in the CHART ATMS ITS America Annual Conference May 3, 2010 Scott Dalrymple.
1 Data Naming in Vehicle-to-Vehicle Communications HU Yao Goto Lab
Assessment and Refinement of Real-Time Travel Time Algorithms for Use in Practice April 11, 2007.
DMBS Internals I. What Should a DBMS Do? Store large amounts of data Process queries efficiently Allow multiple users to access the database concurrently.
Physical Database Design Purpose- translate the logical description of data into the technical specifications for storing and retrieving data Goal - create.
Capstone Project Fall Course Information Instructor Ye Zhao –Office: MSB 220 – Fall 2015 (MSB162) –Time: Tue, Thu 10:45am.
I-270/MD 355 Simulator: An Intelligent Online Traffic Management System Dr. Gang-Len Chang Nan Zou Xiaorong Lai University of Maryland Saed Rahwanji Maryland.
February 4, Location Based M-Services Soon there will be more on-line personal mobile devices than on-line stationary PCs. Location based mobile-services.
School of Systems, Engineering, University of Reading rkala.99k.org April, 2013 Motion Planning for Multiple Autonomous Vehicles Rahul Kala Congestion.
1 Travel Times from Mobile Sensors Ram Rajagopal, Raffi Sevlian and Pravin Varaiya University of California, Berkeley Singapore Road Traffic Control TexPoint.
DMBS Internals I. What Should a DBMS Do? Store large amounts of data Process queries efficiently Allow multiple users to access the database concurrently.
September 2003, 7 th EDG Conference, Heidelberg – Roberta Faggian, CERN/IT CERN – European Organization for Nuclear Research The GRACE Project GRid enabled.
DOiT Dynamic Optimization in Transportation Ragnhild Wahl, SINTEF (Per J. Lillestøl SINTEF)
Main Memory CSSE 332 Operating Systems Rose-Hulman Institute of Technology.
NetFlow Analyzer Best Practices, Tips, Tricks. Agenda Professional vs Enterprise Edition System Requirements Storage Settings Performance Tuning Configure.
Introduction to Algorithms
Lessons learned from Metro Vancouver
Hierarchical Clustering: Time and Space requirements
T-Share: A Large-Scale Dynamic Taxi Ridesharing Service
Database Management System
Lecture 16: Data Storage Wednesday, November 6, 2006.
Network Analysis with ArcGIS Online
What is TDTIMS? & Why Do We Do It?
Los Angeles County Traffic Analysis
Mean Value Analysis of a Database Grid Application
Jim Henricksen, MnDOT Steve Ruegg, WSP
Modeling of Traffic Patterns on Highways
Mining Spatio-Temporal Reachable Regions over Massive Trajectory Data
Macroscopic Speed Characteristics
Lecture 11: DMBS Internals
Chapter 8: Main Memory.
MLP Based Feedback System for Gas Valve Control in a Madison Symmetric Torus Andrew Seltzman Dec 14, 2010.
Latent Space Model for Road Networks to Predict Time-Varying Traffic
Dynamic Programming.
Efficient Evaluation of k-NN Queries Using Spatial Mashups
Finding Fastest Paths on A Road Network with Speed Patterns
The HCM and MAP-21 Performance Requirements: Opportunities
Computer Architecture
TUGS Jason Higuchi && Julia Yefimenko && Raudel mayorga
AWS Cloud Computing Masaki.
Lecture 3: Main Memory.
Short term forecast model
Showcasing work by Jing Yuan, Yu Zheng, Xing Xie, Guangzhou Sun
INCIDENT ANALYSIS USING PROBE DATA
Introduction to Algorithms
Data Warehouse.
CSC 380: Design and Analysis of Algorithms
Topological Signatures For Fast Mobility Analysis
A section-based queueing-theoretical traffic model for congestion and travel time analysis in networks Sandro Huber
Real-time Microscopic Estimation of Freeway Vehicle Positions from the Behaviors of Probe Vehicles Noah J. Goodall, P.E. Research Scientist, Virginia Center.
Approximate Mean Value Analysis of a Database Grid Application
Presentation transcript:

Predicting Traffic Dmitriy Bespalov

Imagine… You are driving on a highway Congestion Ahead! GPS Congestion Ahead! Faster route found! Take next exit!

Imagine… You are sitting in your cubicle Receive a regular alert from Traffic.com: If you leave now, you will spend 30 min driving If you leave in 30 minutes: 45 minutes If you leave in 1 hour: 60 minutes Better go now, dude!

? Predicting Traffic Sensor Network History of road conditions real-time data history data ? Predicting Server predictions

Predicting Traffic 37 min Data Locations + + How long? Belmont How long? + 12 min 37 min I-476 Need to predict travel times on smallest granularity roads’ segments – Data Locations

Predicting Traffic For single road’s segment (Data Location): Record delay values for one day: Perform same process for multiple days: Delay (min) Time of day (hours) 6 am 12 pm 6 pm 12 am Historical Data

Last 20 minutes’ travel-times Predicting Traffic For single road’s segment (Data Location): Historical Data Find similar pattern Last 20 minutes’ travel-times Prediction Length Predicted Delay Match!

How Predictions Are Made Storing historical data takes a lot of space: One reading every minute: 1440 per day 90 days of readings for historical data set And this is for one segment! Philadelphia has about 430 such segments Total: 55,728,000 readings to store And simply storing data is not enough: Need to query historical data efficiently Otherwise no use for real-time system

How Predictions Are Made Compression required to reduce data size Used piece-wise linear data fitting Points were replaced with line segments While closely fitting original data 14 points for 1 day of readings (1440 before)

How Predictions Are Made

How Predictions Are Made

How Predictions Are Made delay Historical Data time Find similar pattern Last 20 minutes’ travel-times

How Predictions Are Made Historical Data Last 20 minutes Data Location 2 Better Match! Data Location 1 Data Location 3 time

How Predictions Are Made For every match, assign distance measure Sort all matches based on distance Extract k-closest matches For each of k matches produce prediction Combine k predictions for final answer

Prediction Accuracy The predictions are nearly perfect…

Prediction Accuracy The predictions are nearly perfect…

Prediction Accuracy The predictions are nearly perfect…

Prediction Accuracy The predictions are nearly perfect…

Prediction Accuracy The predictions are nearly perfect…

Prediction Accuracy The predictions are nearly perfect…

Prediction Accuracy … yeah, right…

Prediction Accuracy … yeah, right…

Prediction Accuracy … yeah, right…

Prediction Accuracy Average prediction error: 0.17 minutes Standard deviation: 0.67 minutes Average relative accuracy: 75%

Demo

How to Improve Accuracy? Use better similarity measure for patterns Classify historical data: Traffic on Mondays is usually similar Traffic on Sundays is usually not the same as on Mondays Don’t need to search Sundays if today is Monday Learn accuracy adjusting functions Function will attempt to correct predicted values Learn these functions in the background of Predicting Engine: Using real and predicted pairs Learn separate functions for various classes of incidents: No incidents, rain, snow, accident, road work, etc

Other R&D Efforts Predicting model can be used: Effective traffic data-mining tool Compression of traffic data Querying/matching capabilities “Probe” data integration project

Other R&D Efforts “Probes” are actual moving vehicles GPS data: latitude, longitude, heading, speed Proposed new algorithm for travel-times Calculus-based Can handle constantly moving sensors Coverage by “probes” is very sparse e.g. average 6 “probes” / 20 min on entire I-76

Other R&D Efforts Try to build “general trend” function Assume traffic is periodic delay time Monday #4 Monday #3 Monday #2 Monday #1

Q&A

Are These Patterns Similar? time delay time delay (x4,y4) (x2,y2) (x1,y1) (x3,y3)

Are These Patterns Similar? time delay time delay time delay distance = area between two pattern plots

Data & CPU Requirements For Philadelphia: Predicting time: Using 3 months of historical data, prediction update takes less than 5 seconds to compute System Memory: Predicting engine with 3 months of history can fit in less than 100 Mb DB Storage: 3 months of history needs ~ 50 Mb of DB storage

Predicting Engine’s Architecture Traffic Data History Collector Prediction Models Database Traffic Server Metro map with predicted values Save Prediction Model Real-time traffic data Predicting Engine Predicting Server (Philadelphia) Traffic Conditions History Prediction Model Pre-saved Predicting Server (Philadelphia) Predicting Server (New York) Prediction Model Interface Predicting Server (Los Angeles) Prediction Model Implementation

Mondays of August 2005

Mondays of August 2005

Mondays of August 2005