Easy Tracker EasyTracker: Automatic Transit Tracking, Mapping, and - - PowerPoint PPT Presentation

easy tracker
SMART_READER_LITE
LIVE PREVIEW

Easy Tracker EasyTracker: Automatic Transit Tracking, Mapping, and - - PowerPoint PPT Presentation

Easy Tracker EasyTracker: Automatic Transit Tracking, Mapping, and Arrival Time Prediction Using Smartphones Presentation: Rafa Hryciuk Department of Computer Science University of Illinois at Chicago: James Biagioni, Tomas Gerlich, Timothy


slide-1
SLIDE 1

Easy Tracker

EasyTracker: Automatic Transit Tracking, Mapping, and Arrival Time Prediction Using Smartphones Presentation: Rafał Hryciuk Department of Computer Science University of Illinois at Chicago: James Biagioni, Tomas Gerlich, Timothy Merrifield, Jakob Eriksson

slide-2
SLIDE 2

Introduction

  • Real Time Tracking, Arrival Time Prediction
  • Transit agencies can dramatically improve the

transit user experience.

  • Using commercial solution can be costly.
  • The Chicago Transit Authority budgeted $24M to

install bus tracking in 1000–1500 vehicles.

slide-3
SLIDE 3

Minimum requirements

  • In-vehicle device using GPS
  • The back-office component - a central server that

processes the incoming time-ordered sequences of locations and typically provides a live tracking website for the public as well as status monitoring for dispatch purposes.

slide-4
SLIDE 4

Additional External Information

  • A route shape file containing the road segments

traversed by each route, for matching a vehicle’s current GPS location to a location along the route.

  • A list of stops for each route in traversal order, for

producing trip directions.

slide-5
SLIDE 5

Additional External Information

  • The planned schedule for each route and stop, to

handle corner-cases such as the first and last trip

  • f the day.
  • The route driven by each active vehicle at all

times, to know where each vehicle is going next.

slide-6
SLIDE 6

Easy Tracker

  • Easy Tracker requires no manual input.
  • No technical experience needed.
slide-7
SLIDE 7

System parts

  • Smartphone (an automatic vehicle location system
  • r tracking device).
  • Batch processing on a back-end server which turns

stored vehicle trajectories into route maps, schedules, and prediction parameters.

slide-8
SLIDE 8

System parts

  • Online processing on a back-end server which

uses the real-time location of a vehicle to produce arrival time predictions.

  • User interface that allows a user to access current

vehicle locations and predicted arrival times.

slide-9
SLIDE 9
slide-10
SLIDE 10

Route Extraction

  • Turning unlabeled GPS traces into the set of

service route shapes.

slide-11
SLIDE 11

Why not to use existing road map?

  • A completely accurate road map may not be freely

available for the service area.

  • Because transit vehicles may use limited-access

service roads, or exclusive right-of-way transit lanes.

  • A complete road map contains many roads not

typically traveled by the transit vehicles.

slide-12
SLIDE 12

Raw Data Pre-Processing

  • Each GPS location is accompanied by a MAC

address (identifying the vehicle) and a timestamp.

  • Sequence of time-ordered GPS locations with the

same MAC address is a trace.

slide-13
SLIDE 13

Raw Data Pre-Processing

  • Each trace is broken up into several drives,

separated by long (10 minute) intervals without location reports. Such intervals typically indicate a parked vehicle, making them a natural delimiter.

slide-14
SLIDE 14

Raw Data Pre-Processing

  • Sparse representation of the traveled path is

preferred, as extra points along an edge gives no advantage, and incurs additional computational

  • verhead.
slide-15
SLIDE 15

Raw Data Pre-Processing

  • They thin the trace to produce a linear density of

locations in each direction of one point for every 20 meters. This value was selected empirically, to balance between sufficient data density and reasonable runtime.

slide-16
SLIDE 16

Map Generation

  • The literature on map generation from GPS traces

describes at least eleven distinct algorithms for map generation. We have implemented and evaluated three representative algorithms, and found J. J. Davies, A. R. Beresford, and A. Hopper algorithm to produce the best results for our route extraction purposes

slide-17
SLIDE 17

Route Extraction

slide-18
SLIDE 18

Route Extraction

slide-19
SLIDE 19

Route Extraction

slide-20
SLIDE 20

Route Extraction

slide-21
SLIDE 21

Route Extraction

slide-22
SLIDE 22

CDF of distance between generated route and ground truth, per route.

slide-23
SLIDE 23

Stop Extraction

slide-24
SLIDE 24

Stop Extraction

slide-25
SLIDE 25

Stop Extraction

slide-26
SLIDE 26

Schedule Extraction

slide-27
SLIDE 27

Schedule Extraction

slide-28
SLIDE 28

Schedule Extraction

slide-29
SLIDE 29

Schedule Extraction

slide-30
SLIDE 30

Schedule Extraction

slide-31
SLIDE 31

Route Classification - Simple Approach

  • Vehicles may serve multiple routes in a single

drive.

  • Vehicles may change between in-service and out-
  • f-service within a single drive.
  • Vehicles may occasionally detour around closed

roads or accident sites.

slide-32
SLIDE 32

Hidden Markov Model

slide-33
SLIDE 33

Route Classification

slide-34
SLIDE 34

Arrival Time Prediction

  • No vehicle is present on the route.
  • Vehicle is present on the route
slide-35
SLIDE 35

Arrival Time Prediction

slide-36
SLIDE 36

System weak points

  • Spurious stop location
  • Lack of stop and route labels

We need manual input !