Car mounted navigation system

• US 5,204,817 A
• Filed: 02/08/1991
• Issued: 04/20/1993
• Est. Priority Date: 02/15/1990
• Status: Expired due to Fees

• Current Assignee: Clarion Co., Ltd. (Faurecia SA)
• Original Assignee: Clarion Co., Ltd. (Faurecia SA)
• Inventors: Yoshida, Motomasa
• Primary Examiner(s): Chin, Gary
• Application Number:
  US07/652,879
• Time in Patent Office: 802 Days
• Field of Search: 364/443, 364/444, 364/449, 73/178 R, 340/988, 340/990, 340/995
• US Class Current: 701/209
• 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/0969 having a display in the form of a map

Abstract

A car mounted navigation system uses map data of polygons defined by roads of a predetermined rank or more of significance, connects a starting polygon containing a starting point to a destination polygon containing a destination with a chain of polygons adjoining at common sides of each pair of adjoining polygons and arranged between the starting and destination polygons to compute a plurality of routes extending from the starting point to the destination polygon, each route including a combination of sides of the chain polygons, the starting polygon and the destination polygon. A car operator selects an appropriate route from the computed routes. The system requires neither need for a great amount of database-made map data nor need for an entry of map data with a digitizer.

Claims

1. A navigation system comprising:

a map data base comprising a plurality of polygons each side of each of said polygons corresponding to a road of a predetermined rank;

a display;

a first means coupled to said display for reading said map data base and for providing on said display at least a selected portion of said map data base and for providing on said display a straight line in said map data base connecting a first point in the selected portion of said map data base to a second point in said map data base;

a second means for selecting from said plurality of polygons in said map data base a chain of polygons disposed about said straight line, said chain of polygons connecting a first terminal polygon to a second terminal polygon wherein a first side of said first terminal polygon includes said first point and a first side of said second terminal polygon includes said second point with each polygon in said chain of polygons having at least one side common to an adjacently disposed polygon and wherein the second means provides a perpendicular line from a center point of each of the polygons in said chain of polygons to said straight line and said second means determines which one of said polygons have the shortest perpendicular line between said center points and said straight line; and

a third means for selecting predetermined ones of the sides of said polygons in said chain of polygons, each of said selected sides being connected to at least one other selected side to provide at least one continuous route from said first point to said second point and for computing a distance between said first point and second point along each of a plurality of the routes and for determining a most appropriate route based on at least said computed distances.

2. The navigation system of claim 1 wherein:

said first point in said map data base corresponds to a starting point;

said second point in said map data base corresponds to a destination point; and

said second means provides said chain of polygons by selecting a first polygon and by selecting a second polygon having a first side adjoining a first side of said first polygon and wherein said second means selects subsequent polygons one by one until such selected polygons form said chain of polygons connecting said first terminal polygon to said second terminal polygon.

3. The navigation system of claim 2 wherein said second means, when selecting said polygons to provide said chain of polygons, excludes a polygon which has been previously selected as an alternative polygon when selecting a next polygon.

4. The navigation system of claim 3 further comprising:

an integrated circuit card having said map data base digitally stored thereon; and

wherein said integrated circuit card is disposed in said first means and said first means reads said digital map data base from said integrated circuit card.

5. The navigation system as recited in claim 1, wherein when the at least one route from the first point to the second point comprises a road having a first predetermined rank connecting a third point to a fourth point and said third means determines a road having a second, more significant predetermined rank connecting said third point to said fourth point, said third means replaces the road having the first predetermined rank with the road having the second, more significant predetermined rank.

6. The navigation system as recited in claim 1, wherein when a car having the navigation system disposed therein travels on a road out of the computed route and the out-of-the-computed-route road corresponds to a side of a polygon in said chain of polygons, the third means computes a new route to the second point wherein a current position of the car provides a new first point.

7. The navigation system as recited in claim 1, further comprising a direction indicator coupled to said third means wherein when a car having the navigation system therein goes to a road out of a selected route and the out-of-the-selected-route road fails to correspond to a side of a polygon in said chain of polygons, the direction indicator indicates a travel direction to direct the car to a road in the selected route.

8. A method of determining a route between a first point and a second point in a map data base said method comprising the steps of:

reading the map data base, said map data base provided by a plurality of polygons each side of said polygons corresponding to a road having a predetermined rank;

providing a straight line in said map data base from the first point in said map data to the second point in said map data base;

selecting from said plurality of polygons a chain of polygons disposed about said straight line, said chain of polygons connecting a first terminal polygon to a second terminal polygon wherein a first side of said first terminal polygon includes said first point and a first side of said second terminal polygon includes said second point with each of said polygons in said chain of polygons having at least one side common to an adjacently disposed polygon on said chain;

providing, with a second means, a perpendicular line from a center point of each of the polygons in said chain of polygons to said straight line;

determining, with the second means, which one of said polygons have the shortest perpendicular line between said center points and said straight line;

selecting, with a third means, at least one route between said first and second points with said route comprised of at least one side of each of said polygons in said chain of polygons;

computing, with said third means, a distance of each of the routes selected; and

determining, in response to at least said step of computing, a most appropriate route of said selected routes between said first point and said second point based on said computed distances.

9. The method of claim 8 wherein:

said first point in said map data corresponds to a starting point;

said second point in said map data corresponds to a destination point; and

the step of selecting said chain of polygons comprises the steps of;

selecting a first polygon having a first side adjacent a first side of a first one of said first and second terminal polygons;

selecting a second polygon having a first side adjoining a first side of said first polygon; and

selecting subsequent polygons one by one until such selected polygons form said chain of polygons connecting said first terminal polygon to said second terminal polygon.

10. The method of claim 9 wherein said step of selecting a next polygon to provide said chain of polygons includes the step of excluding a polygon which has been previously selected as an alternative polygon in said chain of polygons.

11. The method of claim 10 wherein the step of reading said map data base includes the step of reading said map data base from an integrated circuit card.