×

Map-matching for low-sampling-rate GPS trajectories

  • US 10,288,433 B2
  • Filed: 02/25/2010
  • Issued: 05/14/2019
  • Est. Priority Date: 02/25/2010
  • Status: Active Grant
First Claim
Patent Images

1. A computer-implemented method comprising:

  • collecting, from a global positioning system (GPS) of a computing device, GPS location data comprising a plurality of sampling points each corresponding to a location of the computing device;

    receiving a GPS trajectory comprising the plurality of sampling points;

    determining a first set of candidate projection points for a first sampling point of the plurality of sampling points corresponding to a first location of the computing device based on a first geometric shape that encompasses the first sampling point;

    determining a second set of candidate projection points for a second sampling point of the plurality of sampling points corresponding to a second location of the computing device based on a second geometric shape that encompasses the second sampling point, wherein at least one of the first set of candidate projection points or the second set of candidate projection points comprises two or more candidate projection points;

    performing a spatial analysis and a temporal analysis on the first set of candidate projection points, wherein the temporal analysis for a first pair of candidate projection points with one candidate projection point from the first set and one candidate projection point from the second set is based upon an average speed determined between the first sampling point of the plurality of sampling points corresponding to the first location of the computing device and the second sampling point of the plurality of sampling points corresponding to the second location of the computing device, and a speed constraint value of a road segment associated with one of the candidate projection points of the first pair of candidate projection points;

    constructing a candidate graph based upon results of the spatial analysis and the temporal analysis, the candidate graph including more than one path between the candidate projection points of the first set and the candidate projection points of the second set;

    evaluating the paths of the candidate graph to determine a preferred path between the candidate projection points of the first set and the candidate projection points of the second set; and

    causing the preferred path between the candidate projection points of the first set and the candidate projection points of the second set to be presented at a graphical user interface.

View all claims
  • 2 Assignments
Timeline View
Assignment View
    ×
    ×