ROUTE END NODE SERIES PREPARING SYSTEM OF NAVIGATION APPARATUS

Abstract: 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.

Description: This invention relates to a navigation apparatus. Navigation apparatus are known which are used to guide a driver who does not know a particular region well to his destination in that region by selecting a suitable course leading thereto. From DE-A-3609288 there is known a navigation apparatus comprising map memory means storing map data including information about roads and intersections between roads; input means enabling input of a starting point and a destination point relative to roads included in said map data; means for retrieving from said memory means a starting intersection nearest said starting point and a destination intersection nearest said destination point; and route searching means for forming a route between intersections from said starting intersection to said destination intersection. The invention concerns an apparatus of this kind. In this and other conventionally known navigation apparatus, a course along which a driver will be led to his destination is set on the basis of a starting point and a destination point input before the driver starts travelling. The driver navigates along the course thereby set. There are various systems of designating a desired course during navigation, such as one in which a map is displayed on a CRT screen and an image of the course is superposed on the map, or in which information on an intersection where the driver needs to turn the vehicle in accordance with a predetermined course is displayed which information includes numerals or a graph indicating the distance remaining until the intersection is reached and a picture showing certain features of the intersection, and one which makes use of speech output as an auxiliary means. Ordinarily, in a road system, a plurality of courses which connect a starting point and a destination point could in theory be selected. For this reason, various methods of searching for a shortest-time or shortest-distance course (shortest course) between a desired starting point and destination point have been proposed for application to navigation apparatus. One example of such a method has been reported in which an intersection such as that shown in Fig.9 is represented by eight nodes and sixteen directional links to express left and right turns, straight-ahead travel and U-turns, and in which each of the roads connecting the intersections are represented by a pair of directional links. In another example (such as the one disclosed in Japanese Patent Laid-Open No. 62-91811), the shortest course found by searching each time is compared with data on courses along which travel is prohibited, and is removed if it includes one of the latter courses, thereby allowing one of the shortest courses which includes no impassable section to be found. Generally speaking, when inputting starting points and destinations in such a navigation apparatus, the points to be inputted are limited to intersections and some particular points which are specified. Accordingly, the driver must move to such a specified point and input the point as the starting point before he can be guided through navigation. As described above, it is not possible with conventional navigation apparatus to set points other than intersections and some particular points as the starting point or destination. Consequently, a driver who is at a position which does not belong to such specified points has to move to the nearest guidable point such as an intersection for himself without being guided. It is accordingly an object of this invention to enable a driver who is at a point other than particular ones such as intersections to be guided through navigation. Another object of this invention is to make it possible to freely select a starting point and a destination when deciding on a course. In accordance with the invention, these objects are achieved in an apparatus of the kind initially referred to which is characterised in that said map memory means further includes information about nodes, said nodes representing points on said roads between intersections; and that said route searching means further includes route end node searching means for retrieving from said memory means a starting node nearest to said input starting point, a destination node nearest to said input destination point, and starting and destination node sequences comprising sequences of nodes between said starting node and said starting intersection and between said destination intersection and said destination node respectively, and means for combining said route between intersections and said starting and destination node sequences to provide a composite guidance route extending between said starting and destination points. Still other objects, preferred features, and advantages of the invention will be apparent from the following description and the subordinate claims. BRIEF DESCRIPTION OF THE DRAWINGS Fig.1 is a block diagram of a node series preparing system of a navigation apparatus which represents an embodiment of the present invention; Fig. 2(a) is a diagram of a road system; Figs. 2(b) to 2(d) are tables of intersection data, road data and node series data; Fig. 3 shows an example of destination setting and the data therefor; Fig. 4 shows examples of intersection series data and node series data; Fig. 5 is a flow chart illustrating the operation of preparing a route end node series; Fig. 6 is a flow chart of route search processing; Fig. 7 is a flow chart of connecting road search subroutine; Fig. 8 is a flow chart of optimum course condition setting subroutine; Fig. 9 is a fow chart of completion condition confirmation subroutine; Fig. 10 is a flow chart of processing of extracting a series of intersections and a series of nodes; and Fig. 11 is a diagram of intersection information constituted by nodes and diectional links, illustrating a conventional route search method. An embodiment of the present invention will be described below with reference to the accompanying drawings. Referring to Fig. 1, a route end node preparing system has an input section 1, an input control section 2, a route end node series preparing section 3, node data 4, intersection data 5, road data 6, a route search processing section 7, a node series and intersection series preparing section 8, intersection series and node series data 9, and a navigation section 10. In the input section 1, a starting point and a destination as well as data instructions such as instructions to start navigation are input through display touching or key manipulation. The information input at the input section 1 is decoded at the input control section 2 for the purpose of controlling the execution of route search or navigation. In setting a course, it tranmits the information regarding the starting point or the destination to the route end node preparing section 3 and the route search processing section 7 so as to control them. When executing navigation, it controls the navigation section 10. The navigation section 10 represents the principal part of the navigation apparatus and is equipped with data processing means, display means and audio output means. It serves to read out during travel the intersection series and node series data 6 of the course set as the optimum one. As shown in Fig. 2(d), the node data 4 is composed of positional information and attribute information with respect to the roads concerned. The intersection data 5 is composed of information on intersections, as shown in Fig. 2(b), and the road data 6 is composed of information regarding inter-road connection and road characteristics, as shown in Fig. 2(c). Data on the road network includes groups of data items: intersection data items such as those shown in Fig. 2(b); road data items such as those shown in Fig. 2(c); and node data items such as those shown in Fig. 2(d) if the road network is represented by intersection numbers I to IV and road numbers 1 ○ to 8 ○, as shown in Fig. 2(a). That is, as shown in Fig. 2(b), the intersection data is constituted by, in correspondence with intersection numbers I to IV, intersection names, numbers each of which is the smallest of road numbers designating roads starting from the corresponding one of the intersections I to IV, numbers each of which is the smallest of road numbers designating roads terminating at the corresponding one of intersections I to IV, and values each representing existence or absence of traffic signals. As shown in Fig. 2(c), the road data is constituted by, in correspondence with road numbers 1 ○ to 8 ○, starting and terminal points indicated by intersection numbers I to IV, numbers each of which corresponds to the second of road numbers designating roads having the same starting point, numbers each of which corresponds to the second of road numbers designating roads having the same terminal point, the widths of the roads, prohibition information, free-of-guidance information, photograph numbers, the numbers of nodes, top addresses of node series data, and the lengths of the roads. The node data is constituted by east longitudes, north latitudes and attributes, as shown in Fig. 2(d). As is apparent from the road data, the unit road indicated by each road number is defined by a plurality of nodes. That is, the node data relates to points on the roads. If something connecting a pair of nodes is called an arc, a road can be expressed by connecting, with an arc, each of adjacent pairs of nodes constituting a series of a plurality of nodes. For example, with respect to road number 1 ○, the number of nodes is 15 and the top address of the corresponding node data items is 100. The road number 1 ○ therefore designates a series of fifteen nodes represented by node data items with addresses 100 to 114. On the basis of the above-described network data, with respect to a course starting from, for example, intersection number I, a road number 1 ○ is first found from starting point information of the intersection data, and road number 7 ○ is then found in "second of road numbers designating roads having same starting point" of the road data. Conversely, from the corresponding information relating to road number 7 ○, road number 1 ○ is found, thereby determining that there is no connecting roads represented by other road numbers. Data items relating to terminal points can be read out in a similar manner. With respect to the road number 5 ○ in the road data, the road number 6 ○ designates prohibition. Correspondingly, in the network shown in Fig. 2(a), travel along a course indicated by the road numbers 5 ○ and 6 ○ through the intersection indicated by the intersection number IV is prohibited due to the existence of no-left/right-turn inhibition. Only travel along a course indicated by the road number 8 ○ is allowed. In practice, there is no need for guidance in the direction of road number 8 ○. Thus, the road data has road numbers designating entrance prohibition such as no-left/right-turn as well as road numbers designating cases where there is no need for guidance, thereby enabling a reduction in the information memory capacity and facilitating route searching. The route end node series preparing section 3 serves to prepare node series leading from a starting point and a destination to the respective nearest intersection. It prepares node series by successively performing node search from the nearest intersection to the node which is most akin to the positional information on the starting point or destination. Fig. 3 shows the case where the destination is set between intersections. When, for example, the destination A is input and set between the intersections I and II through coordinate specification which is not directly related to the road therebetween, as shown in Fig. 3 (a), the destination data in this case can be expressed as: connecting intersections I, II, 135 degrees of east longitude and 35 degrees of north latitude. When as shown in Fig. 3(b), the destination A is input and set between the intersections I and II, with the distance form one of the intersections being specified, the destination data can be specified as: connecting intersections I, II, 50m from the connecting intersection I. Accordingly, a node series of the nodes between the connecting intersection to this destination A or those between the connecting intersection and the nearest node. The route search processing section 7 is equipped with a connecting road search subroutine for finding out connecting roads from an intersection, excluding inhibit roads such as those in which turning to the right or left is inhibited, an optimum route condition setting subroutine for setting the conditions required for calculating an optimum route such as the road width, whether guidance is needed or not, and termination condition subroutine for judging route search termination. This route search processing section 7 performs the search of an optimum route from the specified starting point to the destination between the nearest intersections. The intersection series and node series preparing section 8 serves to prepare the data on the intersection series and the node series between the intersections which are nearest to the starting point and the destination along the optimum route found out by the route search processing section 4. Connected to the ends of the data thus prepared are the node series prepared by the route end node series preparing section 3, thus preparing the intersection series and node series data 9, a construction example of which is shown in Fig. 4. On the basis of this intersection series and node series data, the navigation section 10 performs navigation. Fig. 5 illustrates the process conducted by the route end node series preparing section 3 for the destination setting shown in Fig. 3. It is examined first whether or not the destination setting is specified in coordinates as shown in Fig. 3(b). When the result is affirmative, the coordinate specifying operation below is conducted. When the result is negative, it means that the destination setting is distance-specified, so the distance specification processing below is to be effected. (A) Coordinate specification processing; Fig. 5(a) 1 ○ The node of the connecting intersection I is set as N. 2 ○ The node of the destination is set as N o and the linear distance between the connecting intersection I and the destination D = NN o is calculated to be stored in the memory. 3 ○ The distance D is stored in the memory. 4 ○ It is examined whether or not the node N is the connecting intersection II. When the result is affirmative, it means that the destination coincides with the connecting intersection II, so the process is ended by stroing the node N in the memory. This cannot happen in the initial processing. It only occurs when the procedures 3 ○ through are repeated for the nodes up to the connecting intersection II, without attaining the termination conditions. When the result is negative, the following procesure 5 ○ is performed. 5 ○ The node following the node N is set as N′. 6 ○ The partition constant t is set as 0. 7 ○ The following equations are set regarding the coordinates N x , N y of the node N: N x = (1 - t) N x + tN x ′ N y = (1 - t) N y + tN y ′ 8 ○ It is examined whether or not the distance D is greater than the distance NN o in coordinates obtained through the procedure 7 ○, i.e., the distance from the point obtained by dividing the section between the nodes N and N′ by the partition constant t to the node N o of the destination. If the result is affirmative, the following procedure 9 ○ is performed. Since the result implies that the present point is nearer to the destination than the previous one, the point is further shifted. When the result is negative, it implies that the present point is farther from the destination than the previous one. Accordingly, the section between the node N and the next node N′ at this time is nearest to the destination. Consequently, the node series may be prepared from this section to the connecting intersection. 9 ○The distance D is replaced by NN o . The partition constant t is added to by 0.1, i.e., the partition point is shifted by 10%. It is examined whether or not the partition constant t has exceeded 1. When the result is affirmative, the following procedure is performed. The node N is then replaced by the next node N′ and the procedure 3 ○ is repeated. The affirmative result implies that the partition point has moved from the node N to the next node N′ by being shifted by 0.1. Accordingly, the node is shifted by 1 in the procedure . When the result is negative, the procedure 7 ○ is repeated. Since in this case the partition point is between the node N and the next node N′, the procedures 7 ○ and thereafter are repeated. (B) Distance specification processing; Fig. 5(b) 1 ○The node of the connecting intersection I is set as N. 2 ○ The distance D is set as 0. 3 ○ The distance D is stored in the memory. 4 ○ It is examined whether or not the node N is the connecting intersection II. When the result is affirmative, the node N of the connecting intersection II is stored in the memory to end the processing. When the result is negative, the following procesure 5 ○ is performed. 5 ○ The node following the node N is set as N′. 6 ○ The partition constant t is set as 0. 7 ○ The following equations are set regarding the cooridates N x ″, N y ″ of the partition point by the partition position constant t: N x ″ = (1 - t) N x + tN x ′ N y ″ = (1 - t) N y + tN y ′ 8 ○ It is examined whether or not the distance obtained by adding the distance NN″ to the point N″ of the coordinates N x ″, N y ″ calculated in the procedure 7 ○ to the distance D is greater than the distance from the destination input to the connecting intersection I. If the result is affirmative, the coordinates N x , N y are stored in the memory to end the procedure. The affirmative result implies in this case that the present point is situated farther from the destination than the previous one, so that the section between node N at this time and the next node N′ is nearest to the destination. Accordingly, the node series may be prepared from this section to the connecting intersection. If the result is negative, the following procedure 9 ○ is performed. Since the negative result in this case implies that the present point is nearer to the destination than the previous one, the point is further shifted. 9 ○ The partition constant t is added to by 0.1, i.e., the partition point is shifted by 10%. It is examined whether or not the partition constant t has exceeded 1. When the result is affirmative, the following procedure is performed. The node N is then replaced by the next node N′. Further, the distance NN″ is added to the distance D. The former D is replaced by the sum obtained, and then the procedure 3 ○ is repeated. The affirmative result implies that the partition point has moved from the node N to the next node′ N′ by being shifted by 0.1. Accordingly, the node is shifted by 1 in the procedure . When the result is negative, the procedure 7 ○ is repeated. Since in this case the partition point is between the node N and the next node N′, the procedures 7 ○ and thereafter are repeated. The flow of route search processing based on the above-described network data will be described below with reference to Fig. 6. In the flow chart of Fig. 6, c represents the intersection number; L(c), the distance; F(c), flag; R(c), a road number designating a traveled road; s o and s l , intersection numbers designating intersections adjacent to a starting point; and e o and e l , intersection numbers designating intersections adjacent to a destination. F(c) = 0 indicates the unsearched state, F(c) = 1 indicates searching, and F(c) = 2 indicates completion of searching. 1 ○ With respect to all intersections distance L(c) is set to infinite (∞), and flag F(c) is set to "0" (unsearched state). The initialization is thus performed, so that all the intersections are regarded as unsearched and the distance between the starting point and each intersection as infinite. 2 ○ The distances from the starting point are substituted for distances L(s o ) and L(s l ) corresponding to intersection numbers s o and s l adjacent to the starting point, flags F(s o ) and F(s l ) corresponding to intersection numbers s o and s l adjacent to the starting point are set to "1", and the road number indicating the route from the starting point is set as the road number designating the passed route is set to t. 3 ○ Intersection numbers are searched to find intersection number c o which satisfies the condition that flag F is not "2" and the distance L(c) is minimum. 4 ○ The connecting road search subroutine is executed to search connecting roads starting from intersection number c o . 5 ○ Whether or not there is any connecting road is examined. In the case of YES, the process proceeds to the next step 6 ○. In the case of NO, the process proceeds to step 11. 6 ○ The optimum route condition setting subroutine is executed to set road circumstances and other conditions for searching for the optimum road. 7 ○ The intersection number corresponding to the terminal end of the present road is set to c l and the length of the road is set a ℓ. 8 ○ The distance P to the terminal end of the present road is calculated: P = L(c₀) + ℓ where L(c o ) is the distance between the starting point and the intersection and P is the distance from the intersection number c). P is obtained as the distance through which the terminal end of the road (examined for searching) corresponding to the intersection number cℓ is reached via the same road. 9 ○ Whether or not the condition that P < L(cℓ) and F(cℓ) ≠ 2 is satisfied is examined. In the case of YES, the process proceeds to the next step . In the case of NO, the process returns to step 4 ○. The distance between the starting point and the intersection corresponding to intersection number cℓ is set to P, corresponding flag F(cℓ) is set to "1", and road number R(cℓ) indicating the route traveled until the intersection corresponding to intersection number cℓ is reached is set as the road number of the route examined for searching. If NO in step 5 ○, F(c o ) is set to "2". The completion condition confirmation subroutine is executed. Whether or not the processing has been completed is examined. In the case of NO, the process proceeds to step 3. In the case of YES, the processing is ended. As a result of this processing, with respect to each intersection number, the road number indicating the optimum course from the starting point to the intersection corresponding to each intersection number is set. The connecting road search subroutine in step 4 ○ is conducted in accordance with the flow shown in Fig. 4, as described below. 1 ○ Whether or not the present searching is initial searching is examined. In the case of YES, the process proceeds to step 2 ○. In the case of NO, the process proceeds to step 6 ○. 2 ○ A road number indicating a route starting from the present intersection c o is extracted from the intersection data shown in Fig. 2(b) and is stored. 3 ○ A road number indicating a prohibited road connected to the intersection c o examined for searching is read out from the road data shown in Fig. 2(c). 4 ○ Whether or not the newly-extracted road corresponds to the prohibited road is examined. In the case of YES, the process proceeds to step 6 ○. In the case of NO, the process proceeds to step 5 ○. 5 ○ The newly-extracted road is stored as a connecting road and the process returns (to step 5 ○ of Fig. 3(a)). 6 ○ A road number which indicates a road having the road previously found and which is next to the road number indicating the previously-found road is extracted from the road data. 7 ○Whether or not the previously-found road and the newly-extracted road are the same is examined. In the case of YES, the process proceeds to the next step 8 ○. In the case of NO, the process returns to step 3 ○. 8 ○A determination that there is no connecting road is made and then the process returns. The optimum route condition setting subroutine in step 6 ○ of Fig. 6 is conducted in accordance with the flow such as that shown in Fig. 8, as described below. 1 ○ The dimension W and the length ℓ of each connecting road are read from the road data. 2 ○ Whether or not the dimension W of each connecting road is equal to or smaller than 1 is examined. In the case of YES, the process proceeds to step 3 ○. In the case of NO, the process proceeds to step 4 ○. 3 ○ The value of ℓ is multiplied by a . That is, if a road having a dimension larger than 1 is regarded as an ordinary wide road while a road having a dimension equal to or smaller than 1 is regarded as a narrow road, the narrow road is rated at a value in terms of distance ª times higher than that of the wide road. The number ª is therefore larger than 1. 4 ○ Free-of-guidance data relating to the road traveled to the intersection presently examined for searching is read from the road data. 5 ○ Whether or not there is any connecting road in correspondence with the free-of-guidance data is examined. In the case of YES, the process returns. In the case of NO, the process proceeds to step 6 ○. 6 ○ b m is added to ℓ to set another new value of ℓ, and the process returns. That is, an intersection at which guidance for, for example, left or right turn is required is rated at a value larger than the guidance-free intersection by b in terms of distance. In the completion condition confirmation subroutine, as shown in Fig. 9, whether or not intersection number c o indicating the intersection examined for searching and one of the intersection numbers indicating adjacent intersections of the destination coincide with each other is examined, and a completion flag, for example, is set on condition that coincidence is found. As described above, in the route searching in accordance with the present invention, the distance between intersections is weighted in consideration of the dimension of the connecting road and travel conditions relating to the need for guidance, thus searching for the shortest route. As a result, items of road number information in coincidence with the optimum course can be obtained with respect to the intersections. It is therefore possible to prepare data on a series of intersections and series of nodes in accordance with the processing flow of Fig. 7 on the basis of the results of searching, as described below. 1 ○ The intersection number indicating one of the intersections which has been examined for searching is stored in the memory. 2 ○ The starting end of the road extending from that intersection is stored in the memory. 3 ○ Whether or not the intersection coincides with one of the intersections adjacent to the starting point is examined. In the case of YES, the process proceeds to the next step 4 ○. In the case of NO, the process returns to step 2 ○. 4 ○ A starting number and a destination number are placed in front and at the rear of the stored series of intersection numbers, thereby forming a series of intersections. 5 ○ Data on a series of nodes between intersections is extracted from the road data to form the series of nodes. 6 ○ Guidance-free intersections are removed from the series of intersections by using the free-of-guidance data. Fig. 4 shows examples of items of data on the series of intersections and the series of nodes obtained as described above. As shown in Fig.4(a), the intersection series data is constituted by various items including intersection names, intersection numbers, photograph numbers indicating photographs of specific views of intersections, turning angles and distances. As shown in Fig. 8(b), the node series information is constituted by east longitudes and north latitudes representing the positions of nodes, intersection numbers, attributes, angles and distances. These items of data are provided only for intersections where guidance is needed except for guidance-free intersections. During navigation, therefore, it is sufficient to read out and output these items of data in correspondence with the predetermined positions. As described above, searching is conducted while the left/right turn prohibition data is checked, thereby searching for courses which include no section where the driver is stopped from traveling by left or right turn prohibition. The present invention should not be construed as restricted to the above embodiment. Various modifications are possible within the scope of invention. For example, while in the above embodiment the navigation course is prepared from data series composed of a node series and an intersection series, only one of the two types of series, i.e., either a node series or an intersection series will serve the purpose of performing navigation. When only an intersection series is employed, it goes without saying that the respective data in the intersectin series are equipped with necessary information such as photographs for navigation or guidance information. Further, when performing navigation using intersection series data, navigation can be conducted by a simple operation by providing push-button switches. The driver may then manipulate the push-button switches each time he passes an intersection to read out the data on the next intersection. While in the above embodiment the route search is started at a starting point, it may also be started at a destination. Further, while in the above embodiment the route search is terminated when the destination is reached, it may be continued until all the flags F (c) become 2, i.e., it may be continued for all the intersections. In particular, when the route search is started at the destination, optimum course information leading to the destination can be prepared for all the intersections, so that even if the driver gets out of his course on the way, he can prepare an intersection series and a node series from the nearest intersection without having to perform the route search again. As will be appreciated from the above description, in the system in accordance with this invention, a node series leading to the point nearest to the starting point or the destination is prepared at a particular point such as an intersection, without inputting the starting point or the destination, so that the driver can recognize his position and be guided through the route from the starting point to the destination. Accordingly, an arbitrary point can be set as a starting point or a destination, based upon the information on the distance from the destination to the connecting intersection, the coordinates of the area around the connecting intersection or the like, which makes it possible to conduct perfect course guidance from the starting point to the destination. Furthermore, the intersection data, the road data and the node data are previously stored in memory means such as a CD-ROM, the route search being performed while making sure at each intersection whether or not turning is inhibited, based upon the data read out onto an RAM or the like prior the route search, whereby the route search is expedited compared to conventional systems. In addition, since the turning inhibition data is contained in the road data, the amount of data, and consequently, the memory capacity, can be smaller. Furthermore, since there is provided guidance-free data, in accordance with which it is judged whether to go straight or turn to the right or left, the search for the least-time-consuming route can be performed with data in a smaller amount. Further, it becomes easier to recognize the go-straight intersections from the guidance-free data and remove them from the intersection node in order to prepare intersection data containing turning intersections only.

Claims: A navigation apparatus comprising: map memory means (4,5,6) storing map data including information about roads and intersections between roads; input means (1) enabling input of a starting point and a destination point relative to roads included in said map data; means for retrieving from said memory means (5) a starting intersection nearest said starting point and a destination intersection nearest said destination point; and route searching means (3,7,8,9) for forming a route between intersections from said starting intersection to said destination intersection; characterised in that said map memory means further includes information (4) about nodes, said nodes representing points on said roads between intersections; and that said route searching means further includes route end node searching means (3) for retrieving from said memory means (4) a starting node nearest to said input starting point, a destination node nearest to said input destination point, and starting and destination node sequences comprising sequences of nodes between said starting node and said starting intersection and between said destination intersection and said destination node respectively, and means (9) for combining said route between intersections and said starting and destination node sequences to provide a composite guidance route extending between said starting and destination points. A navigation apparatus according to Claim 1, characterised in that the arrangement is such that said input means (1) is arranged to receive data defining a starting or destination point (A) in terms of map coordinates, and that said route searching means is arranged to store for each input point (A) data identifying the said coordinates and the two nearest intersections (I,II) between which the input point is located. A navigation apparatus according to Claim 1 or 2, characterised in that the arrangement is such that said input means (1) is arranged to receive data defining a starting or destination point (A) in terms of two adjacent intersections (I,II) and a distance of the point (A) from one of said intersections. A navigation apparatus according to any one of Claims 1-3, characterised in that said route end node searching means (3) is arranged to detect a starting or destination node by progressively comparing the positions of consecutive nodes with the position of said starting or destination point, moving from an intersection nearest to said point, in a direction towards the point. A navigation apparatus according to Claim 4, characterised in that said route end node searching means (3) is arranged to make said comparison by retrieving or computing the distance of said point from said nearest intersection to provide a stored distance value, and progressively incrementing a comparison value in accordance with the distances between consecutive nodes away from said neareast intersection. A navigation apparatus according to Claim 5, characterised in that, said route end node searching means (3) is arranged to increment said comparison value in steps less than the distances between nodes in each case by a predetermined factor determined by the distance between the last compared node and the next adjacent node. A navigation apparatus according to any one of Claims 1-6, characterised in that said route searching means further includes means (8) for forming a sequence of nodes along said route between said starting intersection and said destination intersection. A navigation apparatus according to any one of Claims 1-7, characterised in that said map memory means comprises an intersection database (5) including information about intersections, a road database (6) including information about roads, and a node database (4) including information about nodes.

Inventors: YAMADA, TAKASHI C/O AISIN AW CO., LTD.
Applicants: AISIN AW CO., LTD., KABUSHIKI KAISHA SHINSANGYOKAIHATSU
Application year: 1988
Main classification: G06F15
IPC codes: G01C21, G06F17, G08G1