Route end node series preparing system of navigation apparatus

• US 4,937,753 A
• Filed: 12/27/1988
• Issued: 06/26/1990
• Est. Priority Date: 12/28/1987
• Status: Expired due to Term

• Current Assignee: Aisin AW Company Limited (Aisin Corp.), Kabushiki Kaisha Shinsangyokaihatsu
• Original Assignee: Aisin AW Company Limited (Aisin Corp.), Kabushiki Kaisha Shinsangyokaihatsu
• Inventors: Yamada, Takashi
• Primary Examiner(s): Chin, Gary
• Application Number:
  US07/290,206
• Time in Patent Office: 546 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: G06F 30/15 Vehicle, aircraft or watercraft design
• CPC Class Codes: G06F 30/18 Network design, e.g. design based on topological or interconnect aspects of utility systems, piping, heating ventilation air conditioning [HVAC] or cabling circuit design at the physical level G06F30/39; network planning tools for wireless communication networks H04W16/18

Abstract

Disclosed is a system for preparing a route end node series which is equipped with a route search means 7 for preparing a node series, an intersection series or a combination of both as the data series for navigation, and a route end node series preparing means 3 for preparing the node series from the starting point and the destination to the respective nearest particular points. The route end node series preparing means 3 prepares node series by successively performing node search until the node nearest to the point indicated by the positional information on the starting point or the destination is attained. This construction makes it possible to perform course guidance through navigation based upon the node series between the starting point or the destination and the nearest intersection thereto even if the starting point or the destination is set at a point between intersections when particular points are set as intersections.

Claims

1. A navigation apparatus comprising:

an intersection database including information about intersections;

a road database including information about roads;

a node database including information about nodes, said nodes representing points along said roads between said intersections;

starting point input means for inputting a starting point;

destination input means for inputting a destination;

nearest intersection detecting means for detecting a starting intersection nearest to said starting point and a destination intersection nearest to said destination;

route end node searching means for retrieving from said node database a starting node nearest said input starting point and a destination node nearest said input destination, providing a starting sequence of nodes between said starting node and said starting intersection, and providing a destination sequence of nodes between said destination node and said destination intersection;

route retrieving means for retrieving a route between said starting intersection and said destination intersection based upon the information about said intersections and said roads;

intersections node sequence forming means for forming an intersection sequence of nodes between said starting intersection and said destination intersection based upon said retrieved route; and

node series forming means for providing a series of nodes between said input starting point and said input destination by combining said intersection sequence of nodes with said starting sequence of nodes and said destination sequence of nodes.

2. A navigation apparatus according to claim 1, wherein said route end node searching means extracts two nodes adjacent to said input starting point and a position between said two extracted nodes is used as said input starting point, and said route end node searching means extracts another two nodes adjacent to said input destination and a position between said another two extracted nodes is used as said input destination.

3. A navigation apparatus comprising:

input means for inputting a starting point and destination;

memory means having an intersection database, a road database, and a node database, said intersection database including information about intersections within a road network, said road database including information about roads between said intersections, and said node database including information about nodes corresponding to points along said roads between sais intersections;

navigation means for outputting information about a series of nodes between an input starting point and destination; and

control means for receiving said input starting point and destination and providing said series of nodes to said navigation means;

said control means including;

(a) nearest intersection detecting means for detecting a starting intersection nearest to said input starting point and a destination intersection nearest to said input destination;

(b) route end node searching means for retrieving from said node database a starting node nearest said input starting point and a destination node nearesft said input destination, providing a starting sequence of nodes between said starting node and said starting intersection, and providing a destination sequence of nodes between said destination node and said destination intersection;

(c) route retrieving means for retrieving a route between said starting intersectiona and said destination intersection based upon the information about said intersections and said roads;

(d) intersection node sequence forming means for forming an intersection sequence of nodes between said starting intersection and said destination intersection based upon said retrieved route; and

(e) node series forming means for providing said series of nodes between said input starting point and said input destination by combining said intersection sequence of nodes with said starting sequence of nodes and said destination sequence of nodes.

4. A navigation apparatus according to claim 3, wherein said route end node searching means includes means for extracting two nodes adjacent to said input point, using a position between said two extracted nodes as said input starting point, extracting another two nodes adjacent to said input destination, and using a position between said another two extracted nodes as said input destination.