Method for processing measurement data of a vehicle in order to determine the start of a search for a parking space and computer program product

• US 10,417,907 B2
• Filed: 12/22/2016
• Issued: 09/17/2019
• Est. Priority Date: 06/26/2014
• Status: Active Grant

• Current Assignee: Bayerische Motoren Werke AG
• Original Assignee: Bayerische Motoren Werke AG
• Inventors: Belzner, Heidrun, Kotzor, Daniel
• Primary Examiner(s): Mahne, Kevin P
• Application Number:
  US15/388,404
• Publication Number:
  US 20170103649A1
• Time in Patent Office: 999 Days
• Field of Search: None
• CPC Class Codes: G01C 21/34 Route searching; Route guidance
• CPC Class Codes: G01C 21/3407 specially adapted for specific applications
• CPC Class Codes: G01C 21/3415 Dynamic re-routing, e.g. recalculating the route when the user deviates from calculated route or after detecting real-time traffic data or accidents
• CPC Class Codes: G01C 21/3446 Details of route searching algorithms, e.g. Dijkstra, A*, arc-flags, using precalculated routes
• CPC Class Codes: G08G 1/0112 from the vehicle, e.g. floating car data [FCD]
• CPC Class Codes: G08G 1/0129 for creating historical data or processing based on historical data
• CPC Class Codes: G08G 1/0133 for classifying traffic situation
• CPC Class Codes: G08G 1/096827 where the route is computed onboard
• CPC Class Codes: G08G 1/14 indicating individual free spaces in parking areas
• CPC Class Codes: G08G 1/143 inside the vehicles
• CPC Class Codes: G08G 1/147 where the parking area is within an open public zone, e.g. city centre

Abstract

Processing position data relating to a vehicle, in order to determine the start of a search for a parking space, includes determining an end position and determining at least one inefficiency value by comparing at least part of a drive with at least one linear distance to the end position, wherein the at least one inefficiency value identifies an inefficiency of the drive. The process further includes determining at least one route inefficiency value based on position data from a map to verify an identified inefficiency for at least one position for which an inefficiency has been identified. Parking space search traffic can then be output, as detected, if there is a route inefficiency.

Claims

1. A method for generating a parking-space-search-traffic data object identifying the start of a search for a parking space, wherein the method comprises:

generating, via a global positioning system unit, drive position data corresponding to a sequence of positions of the vehicle from a pre-end position along an actually driven path to an end position;

identifying, via a processor, the pre-end position as inefficient by determining, from the drive position data, an inefficiency value for the pre-end position, wherein the inefficiency value is determined by comparing a cumulative distance to the end position with a linear distance to the end position, wherein the cumulative distance is the sum of straight-line distances between each successive position from the pre-end position to the end position, and the linear distance is the straight-line distance between the pre-end position and the end position;

verifying, via the processor, the pre-end position as inefficient by comparing the cumulative distance with a route distance, the route distance being the distance of an efficient driving route from the pre-end position to the end position, as determined by a navigation unit;

generating, via the processor, the parking-space-search-traffic data object, in response to verifying the pre-end position as inefficient, the parking-space-search-traffic data object identifying the pre-end position as the start of the search for parking; and

outputting the parking-space-search-traffic data object for use in automatically identifying available parking for vehicles.

2. The method as claimed in claim 1, wherein determining the inefficiency value includes calculating an inefficiency curve as a function of each position and, determining that a maximum value for the inefficiency curve is exceeded at the first drive position.

3. The method as claimed in claim 1, wherein, determining the inefficiency value comprises calculating a quotient of:

a difference between the cumulative distance and the linear distance, on one hand, and the cumulative distance, on the other hand.

4. The method as claimed in claim 2, wherein, determining the inefficiency value comprises calculating a quotient of:

a difference between the cumulative distance and the linear distance, on one hand, and the cumulative distance, on the other hand.

5. The method as claimed in claim 1, wherein, verifying the pre-end position as inefficient comprises calculating a quotient of:

a difference between the cumulative distance and the route distance, on one hand, and the cumulative distance, on the other hand.

6. The method as claimed in claim 2, wherein, verifying the pre-end position as inefficient comprises calculating a quotient of:

a difference between the cumulative distance and the route distance, on one hand, and the cumulative distance, on the other hand.

7. The method as claimed in claim 1, wherein only the first position in the sequence for which an inefficiency has been identified, is verified.

8. The method as claimed in claim 1, wherein, prior to comparing the cumulative distance with the linear distance, the position data are filtered by checking their respective affiliation with a defined region.

9. The method as claimed in claim 8, wherein only continuous position data in the defined region are used for the comparison.

10. The method as claimed in claim 9, wherein the region is defined as a rectangle and the rectangle is defined around a current position of the vehicle.

11. The method as claimed in claim 1, wherein the method of claim 1 is performed during the drive of the vehicle and the end position corresponds to a destination of the drive.

12. The method as claimed in claim 1, wherein the method of claim 1 is performed after the conclusion of the drive of the vehicle and the end position corresponds to an actual parking position.

13. A computer program product, comprising:

a non-transitory processor-readable medium having processor executable code embodied therein to process position data relating to a vehicle in order to identify the start of a search for a parking space, the processor readable medium having processor executable code to;

generate, via a global positioning system unit, the position data corresponding to a sequence of positions of the vehicle from a pre-end position along an actually driven path to an end position;

identify the pre-end position as inefficient by determining, from the drive position data, an inefficiency value for the pre-end position, wherein the inefficiency value is determined by comparing a cumulative distance to the end position with a linear distance to the end position, wherein the cumulative distance is the sum of straight-line distances between each successive position from the pre-end position to the end position, and the linear distance is the straight-line distance between the pre-end position and the end position;

verify, via the processor, the pre-end position as inefficient by comparing the cumulative distance with a route distance, the route distance being the distance of an efficient driving route from the pre-end position to the end position, as determined by a navigation unit;

generate, via the processor, the parking-space-search-traffic data object, in response to verifying the pre-end position as inefficient, the parking-space-search-traffic data object identifying the pre-end position as the start of the search for parking; and

output the parking-space-search-traffic data object for use in automatically identifying available parking for vehicles.