Map display system
US-2015308841-A1 · Oct 29, 2015 · US
US10260900B2 · US · B2
| Field | Value |
|---|---|
| Publication number | US-10260900-B2 |
| Application number | US-201414528198-A |
| Country | US |
| Kind code | B2 |
| Filing date | Oct 30, 2014 |
| Priority date | Oct 30, 2014 |
| Publication date | Apr 16, 2019 |
| Grant date | Apr 16, 2019 |
A practical reading order for non-experts. Skip the full description unless you need deep technical detail.
What the patent document calls the invention.
A short plain-language summary of the technical disclosure.
Who owns or filed the patent and who is credited as inventor.
Filing, priority, publication, and grant dates set the timeline.
The legal scope of protection — read this for what is actually claimed.
Technology tags used to group this patent with similar filings.
Prior art links and similar publications in this corpus.
Official abstract text for this publication.
Provided herein is a method, apparatus and computer program product for the generation of a route. In particular, the method may include receiving a plurality of trace points, where each of the plurality of trace points includes location information, receiving a distance tolerance value for each trace point, generating a first portion of a route using a first subset of the plurality of trace points, generating a second portion of the route using a second subset of the plurality of trace points, and concatenating the first portion of the route with the second portion of the route to generate a route. Generating the first portion of the route or the second portion of the route may optionally include removing a trace point that is less than a proximity tolerance distance away from a trace point immediately preceding the removed trace point in sequence.
Opening claim text (preview).
What is claimed is: 1. A method comprising: receiving a plurality of trace points, wherein each of the plurality of trace points comprises location information generated from a global positioning system of a vehicle having a driver and a timestamp including a time associated with the location information; receiving a distance tolerance value for each trace point; removing, via a processor, at least one first trace point of the plurality of trace points to form a plurality of remaining trace points in response to the at least one first trace point being less than a predetermined distance away from a second trace point of the plurality of trace points immediately preceding the at least one first trace point in sequence; generating by the processor a first portion of a route using a first subset of the plurality of remaining trace points; generating a second portion of the route using a second subset of the plurality of remaining trace points; wherein generating the first portion of the route or the second portion of the route comprises removing at least one third trace point that is at least a predefined distance away from a fourth trace point immediately preceding the removed third trace point in sequence, wherein an amount of time between the timestamp of the third trace point and the timestamp of the fourth trace point is shorter than a predetermined amount of time; concatenating the first portion of the route with the second portion of the route to generate a combined route, wherein concatenating the first portion of the route with the second portion of the route comprises determining an established path that is within a respective distance tolerance value for each trace point; storing the combined route associated with the established path in a memory; and analyzing driver behavior based on the combined route, wherein analyzing driver behavior comprises establishing an overall driver rating based on the combined route representative of driver safety or efficiency for use in quantifying risk posed by the driver that has traversed the combined route. 2. The method of claim 1 , wherein generating the first portion or the second portion of a route comprises removing one or more trace points from the plurality of remaining trace points in response to the one or more trace points resulting in discontinuity in the route. 3. The method of claim 1 , wherein concatenating the first portion of the route with the second portion of the route comprises removing at least a part of the first portion or the second portion in response to determining that the part of the first portion or the second portion comprises a redundant part of the route. 4. The method of claim 1 , wherein in response to determining that an established path is not within a respective distance tolerance value for one or more trace points, generating an updated distance tolerance value for each of the one or more trace points and determining an established path that is within a respective updated distance tolerance value for each of the one or more trace points. 5. An apparatus comprising at least one processor and at least one memory including computer program code, the at least one memory and the computer program code configured to, with the at least one processor, cause the apparatus to: receive a plurality of trace points, wherein each of the plurality of trace points comprises location information generated from a global positioning system of a vehicle having a driver; receive a distance tolerance value for each trace point; remove at least one first trace point of the plurality of trace points to form a plurality of remaining trace points in response to the at least one first trace point being less than a predetermined distance away from a second trace point of the plurality of trace points immediately preceding the at least one first trace point in sequence; generate a first portion of a route using a first subset of the plurality of remaining trace points; generate a second portion of the route using a second subset of the plurality of remaining trace points; wherein causing the apparatus to generate the first portion of the route or the second portion of the route comprises causing the apparatus to remove at least one third trace point that is at least a predefined distance away from a fourth trace point immediately preceding the removed third trace point in sequence, wherein an amount of time between the timestamp of the third trace point and the timestamp of the fourth trace point is shorter than a predetermined amount of time; concatenate the first portion of the route with the second portion of the route to generate a combined route, wherein concatenating the first portion of the route with the second portion of the route comprises determining an established path that is within a respective distance tolerance value for each trace point; store the combined route associated with the established path in a memory; and analyze driver behavior based on the combined route, wherein analyzing driver behavior comprises establishing an overall driver rating based on the combined route representative of driver safety or efficiency for use in quantifying risk posed by the driver. 6. The apparatus of claim 5 , wherein causing the apparatus to generate a first portion of the route or the second portion of the route comprises causing the apparatus to remove one or more trace points from the plurality of remaining trace points in response to the one or more trace points resulting in discontinuity in the route. 7. The apparatus of claim 5 , wherein causing the apparatus to concatenate the first portion of the route with the second portion of the route comprises causing the apparatus to remove at least a part of the first portion or the second portion in response to determining that the part of the first portion or the second portion comprises a redundant part of the route. 8. The apparatus of claim 5 , wherein in response to the apparatus being caused to determine that an established path is not within a respective distance tolerance value for one or more trace points, causing the apparatus to generate an updated distance tolerance value for each of the one or more trace points and causing the apparatus to generate an established path that is within a respective updated distance tolerance value for each of the one or more trace points. 9. A computer program product comprising at least one non-transitory computer-readable storage medium having computer executable program code instructions stored therein, the computer executable program code instructions comprising: program code instructions to receive a plurality of trace points, wherein each of the plurality of trace points comprises location information generated from a global positioning system of a vehicle having a driver; program code instructions to receive a distance tolerance value for each trace point; program code instructions to remove at least one first trace point of the plurality of trace points to form a plurality of remaining trace points in response to the at least one first trace point being less than a predetermined distance away from a second trace point of the plurality of trace points immediately preceding the at least one first trace point in sequence; program code instructions to generate a first portion of a route using a first subset of the plurality of trace points; program code instructions to generate a second portion of the route using a second subset of the plurality of trace points; wherein the program code instructions to generate the first portion of the route or the second portion of the route comprises program code instructions to remove at least one third trace point that is at least a
Map- or contour-matching · CPC title
using mutual or relative location information between multiple location based services [LBS] targets or of distance thresholds · CPC title
Details of route searching algorithms, e.g. Dijkstra, A*, arc-flags or using precalculated routes · CPC title
Special cost functions, i.e. other than distance or default speed limit of road segments · CPC title
using point of interest [POI] information, e.g. a route passing visible POIs · CPC title
Related publications grouped by family.
Answers are generated from the same data shown on this page.