Method for segmenting and computing the pattern of a road

• US 8,111,917 B2
• Filed: 03/31/2005
• Issued: 02/07/2012
• Est. Priority Date: 05/12/2004
• Status: Active Grant

• Current Assignee: Robert Bosch GmbH
• Original Assignee: Robert Bosch GmbH
• Inventors: Vogt, Wilhelm, Kersken, Ulrich, Varchmin, Axel
• Primary Examiner(s): PATEL, KANJIBHAI B
• Application Number:
  US11/579,233
• Publication Number:
  US 20080247645A1
• Time in Patent Office: 2,504 Days
• Field of Search: 382/113, 382/173, 382/181, 382/312, 382/305, 701/200, 701/201, 701/206, 701/208, 701/209, 701/212, 345/584, 345/587
• US Class Current: 382/173
• CPC Class Codes: G01C 21/3819 Road shape data, e.g. outline of a route
• CPC Class Codes: G06T 11/203 Drawing of straight lines or curves

Abstract

The present invention relates to a method for subdividing the road pattern in digital road maps into segments, in which, starting from the digital road maps in which the road pattern is subdivided into successive segments, new segment borders are established via new segment starting points and segment end points, by selecting the segment starting points and the segment end points in such a way that the shape of the segments between the segment starting points and the segment end points does not change. The invention also relates to the computation of the road pattern with the aid of digital road maps, in which the road is subdivided into successive segments, to each of which one segment starting point and one segment end point is assigned. The shape of the segment is established and, from its relative position, its pattern is computed with the aid of the number of support points situated between the segment starting points and the segment end points, and/or with the aid of transition conditions between the segments and/or the consideration of attributes.

Claims

1. A method for subdividing a road pattern in digital road maps into segments, the method comprising:

using a navigation system to perform the following steps;

starting from digital road maps in which the road pattern is subdivided into successive segments,

establishing new segment borders via new segment starting points and segment end points by selecting the segment starting points and the segment end points in such a way that the shape of the segments between the segment starting points and the segment end points does not change.

3. The method as recited in claim 1, wherein the segment pattern is computed while additionally taking into consideration a position of support points and the position of the segment starting points and the segment end points.

4. The method as recited in claim 1, wherein in response to errors of a support point, the segment is established as a straight line.

5. The method as recited in claim 1, wherein the segment is established as a circular arc via only one support point.

6. The method as recited in claim 1, wherein the segment is established as a clothoid via two support points.

7. The method as recited in claim 1, wherein the support points are provided with attributes which distinguish them from segment starting points and segment end points.

8. The method as recited in claim 1, wherein the segment starting points and the segment end points are computed anew based on present, digital road maps.

9. The method as recited in claim 1, wherein a segment end point of a segment is used as the segment starting point of the segment immediately subsequent to it.

10. The method as recited in claim 1, wherein the segment starting point, the segment end point and the support points that are present are used for the computation of the pattern of the segment.

11. The method as recited in claim 1, wherein the road pattern is established via additional conditions with respect to the transition between the segments or via attributes at the segments.

2. A method for computing a road pattern with the aid of digital road maps, the method comprising:

using a navigation system to perform the following steps;

subdividing a road into successive segments to each of which one segment starting point and one segment end point is assigned; and

establishing wherein the shape of the segment and computing its pattern with the support points situated between the segment starting points and the segment end points, and/or transition conditions between the segments and/or of an attribute.

12. The method as recited in claim 2, wherein in response to errors of a support point, the segment is established as a straight line, wherein the support points are provided with attributes which distinguish them from segment starting points and segment end points, and wherein the segment starting points and the segment end points are computed anew based on present, digital road maps.

13. The method as recited in claim 2, wherein the segment is established as a circular arc via only one support point, wherein the support points are provided with attributes which distinguish them from segment starting points and segment end points, and wherein the segment starting points and the segment end points are computed anew based on present, digital road maps.

14. The method as recited in claim 2, wherein the segment is established as a clothoid via two support points, wherein the support points are provided with attributes which distinguish them from segment starting points and segment end points, and wherein the segment starting points and the segment end points are computed anew based on present, digital road maps.

15. The method as recited in claim 2, wherein the support points are provided with attributes which distinguish them from segment starting points and segment end points, wherein the segment starting points and the segment end points are computed anew based on present, digital road maps, and wherein a segment end point of a segment is used as the segment starting point of the segment immediately subsequent to it.

16. The method as recited in claim 2, wherein the support points are provided with attributes which distinguish them from segment starting points and segment end points, wherein the segment starting points and the segment end points are computed anew based on present, digital road maps, and wherein the segment starting point, the segment end point and the support points that are present are used for the computation of the pattern of the segment.

17. The method as recited in claim 2, wherein the support points are provided with attributes which distinguish them from segment starting points and segment end points, wherein the segment starting points and the segment end points are computed anew based on present, digital road maps, and wherein the road pattern is established via additional conditions with respect to the transition between the segments or via attributes at the segments.

18. A non-transitory computer readable medium having a computer program, which is executable by a processor, comprising:

a program code arrangement having program code for computing a road pattern with the aid of digital road maps, by performing the following;

subdividing a road into successive segments to each of which one segment starting point and one segment end point is assigned; and

establishing the shape of the segment and computing its pattern with the support points situated between the segment starting points and the segment end points, and/or with-transition conditions between the segments and/or of an attribute.

19. The non-transitory computer readable medium as recited in claim 18, wherein in response to errors of a support point, the segment is established as a straight line, wherein the support points are provided with attributes which distinguish them from segment starting points and segment end points, and wherein the segment starting points and the segment end points are computed anew based on present, digital road maps.

20. The non-transitory computer readable medium as recited in claim 18, wherein the segment is established as a circular arc via only one support point, wherein the support points are provided with attributes which distinguish them from segment starting points and segment end points, and wherein the segment starting points and the segment end points are computed anew based on present, digital road maps.

21. The non-transitory computer readable medium as recited in claim 18, wherein the segment is established as a clothoid via two support points, wherein the support points are provided with attributes which distinguish them from segment starting points and segment end points, and wherein the segment starting points and the segment end points are computed anew based on present, digital road maps.

22. The non-transitory computer readable medium as recited in claim 18, wherein the support points are provided with attributes which distinguish them from segment starting points and segment end points, wherein the segment starting points and the segment end points are computed anew based on present, digital road maps, and wherein a segment end point of a segment is used as the segment starting point of the segment immediately subsequent to it.

23. The non-transitory computer readable medium as recited in claim 18, wherein the support points are provided with attributes which distinguish them from segment starting points and segment end points, wherein the segment starting points and the segment end points are computed anew based on present, digital road maps, and wherein the segment starting point, the segment end point and the support points that are present are used for the computation of the pattern of the segment.

24. The non-transitory computer readable medium as recited in claim 18, wherein the support points are provided with attributes which distinguish them from segment starting points and segment end points, wherein the segment starting points and the segment end points are computed anew based on present, digital road maps, and wherein the road pattern is established via additional conditions with respect to the transition between the segments or via attributes at the segments.