Method for creating appendices that clearly reference the location of an object

• US 8,060,496 B2
• Filed: 09/29/2001
• Issued: 11/15/2011
• Est. Priority Date: 11/07/2000
• Status: Expired due to Fees

• Current Assignee: Robert Bosch GmbH
• Original Assignee: Robert Bosch GmbH
• Inventors: Buecher, Andreas, Hahlweg, Cornelius, Pfeiffer, Heinz-Werner, Hessling, Matthias, Brandes, Henry
• Primary Examiner(s): LIE, ANGELA M
• Application Number:
  US10/415,700
• Publication Number:
  US 20040059745A1
• Time in Patent Office: 3,699 Days
• Field of Search: 707/102, 707/4, 707/722, 707/769, 707/770, 707/919, 707/920
• US Class Current: 707/722
• CPC Class Codes: G01C 21/3874 Structures specially adapted for data searching and retrieval
• CPC Class Codes: G08G 1/092 Coding or decoding of the information
• CPC Class Codes: G08G 1/093 Data selection, e.g. prioritizing information, managing message queues, selecting the information to be output

Abstract

To generate appendices which uniquely reference an object geographically, a tree of possible paths is generated. The paths are evaluated in accordance with predefined criteria, which are suited for use as termination criteria, at the time the paths are formed. Of the remaining paths, at least that one is coded as an appendix which best fulfills at least one of the criteria.

Claims

1. A method for generating appendices which uniquely reference an object geographically, comprising:

generating a tree of a plurality of possible travel paths starting from the object, wherein the possible paths are ascertained from a plurality of map sources;

evaluating the plurality of possible paths in accordance with predefined criteria, the predefined criteria being suited for use as termination criteria at the time the paths are generated; and

selecting one of the plurality of possible paths as an appendix of the object, wherein the path selected as the appendix best fulfills at least one of the predefined criteria, and wherein the appendix is selected from the plurality of possible paths based on at least one of the following criteria;

a) whether a path leads out from the object, from a road or street network having a low classification into one having a higher classification;

b) whether a path has a unique geometry in nearby geographic surroundings;

c) whether a path represents a navigable path at least one of toward the object and away from the object; and

d) whether a path has a small length.

2. The method of claim 1, wherein the path selected as an appendix also best fulfills at least one other criteria.

3. The method of claim 1, wherein coordinate chains are used as the possible paths, and wherein the coordinate chains lie at least partially on traffic routes for the paths, the coordinate chains being contained in a receiver database and include characteristic properties of parts of a traffic route network.

4. The method of claim 1, wherein vector maps are used for selecting the paths, and data pertaining to geographic objects and routes are prepared in advance in the form of vector maps.

5. The method of claim 4, wherein the data includes printed map material.

6. The method of claim 1, wherein the termination criteria include whether a return path to a street has a lower classification, and whether a directional specification does not indicate the object.

7. The method of claim 6, further comprising:

evaluating at least one of the following criteria to determine the geometric uniqueness;

a) whether a sum of amounts of angular changes over a path exceeds a predefined threshold;

b) whether point sets, when analyzed using the least squares method, belong to a same classification or street; and

c) whether a path being considered correlates with a path in a generating database.

8. The method of claim 7, wherein the criteria to determine geometric uniqueness are scaled.

9. The method of claim 8, wherein the criteria to determine geometric uniqueness are scaled in accordance with requirements of a receiver database.

10. The method of claim 8, wherein scaling of the criteria to determine geometric uniqueness is dynamically carried out in an iterative process.

11. The method of claim 9, further comprising:

determining whether the path being considered correlates with a path in the receiver database.

12. The method of claim 1, wherein the appendix is referenced from the object to a point where a predefined representative of an object class known to a receiver database is reached.

13. The method of claim 1, wherein the path selected is the most accessible path.