IP Library › Granted Patent US 11,604,079
Granted Patent B1
US 11,604,079 · App. 17/102,971 · Granted Mar 14, 2023

Apparatus and method for adaptive Markov chain processing over map matching of vehicle trip GPS data

Inventor: Bilge Kaan Karamete (Vienna, VA)
Assignee: Kinetica DB, Inc.
G01C21/3844G01C21/3446G01S19/42
View Patent ↗
Loading inventors, assignments & file history…
Monitor This Case
Get email alerts when status or documents change.
Order Certified Copies
Most orders are placed with the USPTO same day — all within 24 business hours.
Order via The Patent Place →
Pre-filled with this patent's details
Quick Facts
Patent No.
US 11,604,079
App. No.
17/102,971
Granted
Mar 14, 2023
Kind
B1
Abstract

A non-transitory computer readable storage medium has instructions executed by a processor to adaptively increase Markov chain kernel window width while processing global positioning system (gps) samples as a function of the ratio between geodesic distances of a current route to an actual geodesic distance between pairs of gps samples. The total cost of different kernel sequences is found based on an aggregated sum of shortest path runs through graph edges within different kernel sequences. Road weights are modified based on relative distance of prospective snap locations of road segments to the gps points, so that the shortest path runs with respect to all possible snap locations are selected. Selected kernel sequences are presented as a proposed mapped vehicle route.

Claims (8)

1. A non-transitory computer readable storage medium with instructions executed by a processor to:

adaptively increase Markov chain kernel window width while processing global positioning system (gps) samples as a function of the ratio between geodesic distances of a current route to an actual geodesic distance between pairs of gps samples;

find the total cost of different kernel sequences based on an aggregated sum of shortest path runs through graph edges within different kernel sequences, wherein road weights are modified based on relative distance of prospective snap locations of road segments to the gps points, so that the shortest path runs with respect to all possible snap locations are selected; and

present selected kernel sequences as a proposed mapped vehicle route.

2. The non-transitory computer readable storage medium of claim 1 further comprising instructions executed by the processor to apply road constraints as filters on the different kernel sequences.

3. The non-transitory computer readable storage medium of claim 1 further comprising instructions executed by the processor to remove noisy data from the gps samples.

4. The non-transitory computer readable storage medium of claim 1 further comprising instructions executed by the processor to apply a Gaussian filter to remove noisy data from the gps samples.

5. The non-transitory computer readable storage medium of claim 1 further comprising instructions executed by the processor to filter folding vertex paths in the gps samples.

Assignments (1)
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded Nov 24, 2020
From: KARAMETE, BILGE KAAN
To: KINETICA DB, INC.
Reel/Frame 054462/0648 →
Continuity (1)
Provisional Application 62970845 · Feb 6, 2020
Cited By (2)
US 12,246,718 US 12,644,715