Navigation system and method using map data

Abstract: In a navigation system which has sensors for detecting a running distance, an azimuth, etc. of a vehicle, and a memory for storing map data, a probability density of a position of the vehicle is calculated on the basis of the sensor outputs and the map data for each of quantization units with which a probability computation determined by detection accuracies of the sensors and quanti­ zation of the map data can be executed. In addition, a final stage calculation of DP matching between trajectory data obtained from the. on-board sensor data from a start point of the vehicle till a current time and a candidate route estimated from the road map data is iteratively executed, whereby a plurality of estimative vehicular positions and uncertainties (costs) corresponding to the respective estimative positions are iteratively evaluated, and a correct vehicular position is estimated by selecting at least one estimative vehicular position of low uncertainty (cost).

Description: Background of the Invention: Field of the Invention: The present invention relates to a navigation system for vehicles such as automobiles, and more particularly to an information processing system and method which are well suited to estimate the position of a vehicle at high precision by the use of map data. Description of the Prior Art: As stated in, for example, "Nikkei Electronics" dated November 16, 1987, pp. 119 - 130, a prior-art on-board navigation system for a land surface vehicle such as automobile employs a method wherein the position of the vehicle itself, which is estimated by the use of a travel distance detected by a car speed sensor mounted on the vehicle, as well as a current azimuth angle obtained from a steering angle detected by a steering angle sensor or an attitude angle detected by a magnetic sensor similarly mounted, is displayed in superposition on map data. There is also a method wherein, in order to heighten the estimation accuracy of the position of the vehicle itself, a receiver in a GPS (Global Positioning System) or a receiver for location beacons (sign posts), which are radio beacons installed on roads for transmitting the absolute positional information items thereof, is mounted, and the received information of the system or beacon is used in combination with the data of the aforementioned travel distance or current azimuth angle. Further, there has been known a method wherein, in order to prevent an estimated current position from missing a road on a map because of an error, an estimative current position to be displayed is corrected onto the road by the use of the positional information of the road of map data. An example of the method is discussed in the official gazette of Japanese Patent Application Laid-open No. 56910/1986. The first prior-art technique mentioned above is such that, on the basis of the initial position of the vehicle at the start of the travel of the vehicle or at the start of the display of the position of the vehicle, the travel distance and the current azimuth angle detected every moment are integrated to evaluate the current position at each of later points of time. Therefore, it has the disadvantage that the errors of the initial position, travel distance and current azimuth angle diverge accumulatively. Since the second prior-art technique can directly estimate the position of the vehicle by the use of the GPS or the location beacons, a positional error does not diverge with time. Nevertheless, an error of several tens [ m ] to several hundred [m] remains. With the two prior-art techniques, accordingly, there has been the problem that, when the estimated current position is displayed in superposition on the map, the displayed position misses the road in spite of the traveling of the vehicle on the road. In the third prior-art technique, the probability density of the current position at every moment is computed, and it is checked up with a road position in the map data. When a place on the road whose probability exceeds a certain fixed threshold value has been detected, it is displayed as being the current position. Herein, the probability density is assumed to be of a Gaussian distribution, and it is approximated with a small number of parameters. This method has had the problem that actually the probability density falls into a shape different from the Gaussian distribution on account of speed regulation, diversion, etc., so the estimation does not become optimal. Another problem is that, in some ways of selecting the threshold value, the current position is forcibly displayed on the road in a case where the vehicle actually misses the road on which the current position is displayed and where it lies at a position, such as back street, which is not contained in the road information of the map data. EP 0166547 discloses a vehicle navigation system based on deed reckoning, which indicates an associated position probability density. It does not take into account the fact that casting areas on the map have a reduced or zero probability density, eg the area occupied by a building, where a car is less likely or cannot be located. Meanwhile, the positional accuracy of a vehicle has been enhanced by the following method: Road map data recorded on a CD-ROM is displayed on the CRT of a dashboard, and the start point of the vehicle is input on the map of the CRT by a cursor when the vehicle starts traveling. Then, the current position is displayed on the map of the CRT on the basis of a car speed and information on a traveling direction from a terrestrial magnetism sensor. In particular, an estimated trajectory is compared with a route pattern on the map, and the positional information and the map pattern are checked up at the intersection of roads or the bending point of a road, so as to estimate the position of the vehicle believed correct. In this case, however, the errors of the azimuth and the car speed are corrected only at the travel of the vehicle through the featuring point and on each occasion. Accordingly, there has not been considered the problem that, once the vehicle has entered an erroneous route, the correction fails. Further, the above method considers only the local correction on the error of the estimative current position attributed to the accumulation of the errors of the preceding azimuths and car speeds. As another problem, accordingly, there has been such a possibility that the estimated current position on the CRT will miss a road, or that the vehicle will enter a road not leading to a destination, while resorting to the estimated positional information which is different from the actual current position. Summary of the Invention: An object of the present invention is to provide a system and a method which heighten the estimation accuracy of the current position of a vehicle so as to present a display conforming to a road map. Another object of the present invention is to provide an on-board navigation system in which an estimated trajectory based on information items from several sensors is checked up with the shape of a road on a memory device such as CD-ROM, thereby making it possible to sequentially correct an estimative current position and simultaneously to evaluate the certainty of estimation. In order to accomplish the objects, the present invention is constructed as follows: A navigation system as defined in Claim 1 Besides, a navigation system using map data, which has a speed sensor, a current azimuth sensor, a memory for storing the road map data, and a processor, is characterized in that a speed and an azimuth of a vehicle are respectively sensed by said speed sensor and said current azimuth sensor, that estimative current positions of the vehicle are estimated according to DP matching calculations on the basis of the sensed speed and azimuth and the map data, that coordinates of a plurality of places on roads as the estimated current positions are stored together with uncertainties (costs) corresponding to the respective estimated current positions, and that estimative current positions at a next time and uncertainties corresponding to them are evaluated from a speed and an azimuth sensed and the road map data on the basis of the estimated current positions and the uncertainties thereof, whereby the estimative current positions are iteratively updated. Now, the operating principles and functions of the present invention will be elucidated before the description of embodiments. First, in a case where, regarding the calculation units of the map data, current position propability densities are evaluated in respective units obtained by quantizing the calculation units, the following functions are attained: The data processor evaluates the location probability of the vehicle in each place, namely, the probability density of the current position every moment on the basis of the detected values of the travel distance and traveling direction and the map data. A point at which the probability takes the maximum value, is set as the estimative value of the current position. Here, a posterior probability is calculated using the prior probability of the current position which takes the large value on a road given by the map data and small values in the other places, so that the estimative value of the current position does not err to miss the road widely. Moreover, when the respective positions are displayed in superposition on the map data in, for example, different colors in accordance with the probability densities, the user of the navigation system can know the estimated situation of the current positions more precisely every moment, and the risk at which the user is puzzled by an estimation error can be made less than with a method wherein only one current position is displayed. Here, an estimation system for use in the present invention will be described. Let's consider a stochastic process expressed by the following state equation which is obtained through sampling at suitable time intervals: x i+1 = f i ( x i ) + d i (1) (i = 0 , 1 , ... ) where x indicates a state vector of order n, f a vector function of order n, and d i an external force vector of order n. Letter "i" is a suffix denotative of time. It is assumed that the probability density p( x ₀) of x ₀ is given as prior information. On the other hand, it is assumed that observation data on an external force as expressed by the following observation equation is obtained every time: y i = d i + G i w i (2) ( i = 0 , 1 , ... ) where y denotes an observation vector of order n, and w denotes a white noise vector of order n, the probability density p( w ) of which is assumed to be given. Further, it is assumed that a conditioned probability density p( x i+1 | x i ) (i = 0, 1, ...) is given as a restrictive condition. On this occasion, as the first system, there is considered the estimation problem of finding the state x N which maximizes a posterior probability: p ( x N | y ₀, ... , y N-1 ) (3) when the observation data y i (i = 0, ..., N - 1) is given. The solution of this problem is given as stated below. On the basis of the models of Eqs. (1) and (2), Eq. (3) is expressed as follows in accordance with Bayes' rule: p ( x N | y ₀, ... , y N-1 ) = ∫ p ( y N-1 | x N-1 , x N ) · p ( x N | x N-1 ) / p ( y N-1 ) · p ( x N-1 | y ₀, ... , y N-2 ) · d x N-1 (4) Here, for N = 1, the following holds: p ( x i | y ₀) =∫ p ( y ₀| x ₀, x i ) · p ( x i | x ₀) / p ( y ₀) · p ( x ₀) #CDT# d x ₀ (5) Accordingly, p( x ₁| y ₀) can be obtained owing to Eq. (5) on the basis of the models of Eqs. (1) and (2), and p( x N | y ₀, ..., y N-1 ) can be obtained in the ascending series of N owing to Eq. (4) for N ≧ 2. Thus, the estimated values of the desired state vectors are obtained as the states x N which maximize the aforementioned probability for the respective N values. The above is the solution of the estimation problem based on the first system. Next, as the second system, there is considered the estimation problem of finding the state series x i (i = 0, 1, ..., N) which maximizes a posterior probability: p ( x ₀, x ₁, ... , x N | y ₀, ... , y N-1 ) (6) when the observation data y i (i = 0, ..., N - 1) is similarly given. The solution of this problem is given as stated below. On the basis of the models of Eqs. (1) and (2), Eq. (6) is expressed as follows in accordance with Bayes' rule: p ( x ₀, x ₁, ... , x N | y ₀, ... , y N-1 ) = p ( x ₀, x ₁, ... , x N-1 | y ₀, ... , y N-2 ) · p ( x N | x N-1 ) · p ( y N-1 | x N-1 , x N ) / p ( y N-1 ) (7) Both the sides of Eq. (7) are transformed into: I N = I N-1 × C( x N , x N-1 (8) Here, Although the problem is to find the states x ₀, x ₁, ... and x N , maximizing I N , the following maximum value J N ( x N ) with the state x N assumed given shall be considered here: From Eq. (8), the following is obtained: holds. J₁( x ₁) can be computed by Eq. (11) on the basis of the models of Eqs. (1) and (2), and C( x N , x N-1 ) can be computed by Eq. (8), so that J N ( x N ) is evaluated in the ascending series of N from N = 2 by Eq. (10). Assuming that the maximum value J N ( x N ) has been obtained in this way, x N maximizing it becomes the state x N among the desired states x ₀, x ₁, ... and x N maximizing the probability I N , because Eq. (9) is transformed as follows: The states x ₁, ... and x N-1 are obtained by solving Eq. (10) in the descending series of N on the basis of this state x N , and the last state x ₀ is obtained from Eq. (11). The above is the solution of the estimation problem based on the second system. Incidentally, the posterior probability (6) on this occasion is given by: p ( x ₀, x ₁, ... , x N | y ₁, ... , y N ) = I N (13) in view of Eq. (8). According to the above procedure, the probability density is permitted to be precisely computed even when it is not in the shape of the Gaussian distribution. Secondly, as to a case where an estimated current position of low uncertainty (cost) is found from among the plurality of estimated current positions, the operating principles and the functions will be described. Let's consider that a running trajectory estimated from only road data and on-board sensor data as shown in Fig. 23 is matched as the whole trajectory from a start point A to the point of the current time B. The running trajectory and the road data of candidate routes to-be-matched are expressed by the values ϑ v (j) and ϑ r (j) of the running azimuths of unit distances ΔS along the respective routes from the start point A. It is assumed that j = N holds at the point B. Now, the matching between the running trajectory AB and the candidate route is executed by minimizing the following matching cost formula: The second term of the right-hand side of Eq. (14) denotes a cost concerning the transformation of the running trajectory AB, and the first term denotes the degree of disagreement of the transformed route. Letter W indicates the weighting of both the costs, and the degree at which the transformation is allowed heightens as the value W is smaller. Eq. (14) supposes a case where random errors are superposed on the speed data and the running azimuth data which are used for evaluating the running trajectory, and where the error of a travel or running distance is the accumulation of the speed errors. A trajectory transformation data sequence {ε j *} minimizing Eq. (14) gives how to transform the running trajectory AB for the purpose of the matching, and the minimum value J* gives a matching error which remains even in the optimal matching. Besides, where the estimative position B at the current time ought to lie on a road is known from the trajectory transformation data sequence {ε j *} which gives the optimal matching, and the estimative current position B which misses the road can be corrected onto the road B′ in consideration of the whole route. By the way, in a case where the minimum value J* of the matching cost is equal to or greater than a predetermined value, it can be judged that the matching itself is unreasonable. Moreover, when matching costs which are not the minimum but which are close to the minimum are set as J¹, J², ... in the order of smaller values and trajectory transformation data sequences corresponding to them are set as {ε j ¹}, {ε j ²}, ..., quasi-optimal matching operations can be attained together with matching degrees. In the above, there has been considered the case where the running trajectory is matched with the single road having no branch. In contrast, in a case where branches such as the intersection of roads are contained in the road data, all the routes along which the vehicle can run are picked up, whereupon the result of the single optimal matching determined for all the candidate routes and the results of a plurality of quasi-optimal matching operations are obtained. The end point B of the running trajectory stretches with the running of the vehicle, and the distance along the trajectory increases from N to N + 1, .... Also, the optimal trajectory transformation {ε j *} minimizing the matching cost of Eq. (14) is computed every moment with the running of the vehicle, and the corrected (displayed) current position B′ changes every moment. However, the trajectory transformation {ε j *} : j = 1 - N up to the current position of j = N does not always give the preceding N terms of the optimal transformation {ε j *} : j = 1 - M concerning the later position of j = M (M > N). That is, even when the compensation of the position up to a certain point of time is erroneous, the optimal matching of the whole route including the subsequent trajectory is found out, whereby the error might be recovered. In particular, when the matching cost of Eq. (14) is decomposed depending upon the position j along each road as follows: and the matching cost J j * of each position is decided, it is possible to judge the occurrences of the following on the running route: (i) Running deviating from road data (ii) Error of on-board sensor data Meanwhile, the optimal matching which minimizes Eq. (14) can be attained by DP (Dynamic Programming). As illustrated in Fig. 24(a), the positions j along the trajectory and the positions i along the road data are respectively taken on the axes of abscissas and ordinates, thereby to consider lattice points. As indicated in the figure, possible paths are drawn in three directions from each lattice point and are respectively given costs W, O and W, and a cost {ϑ v (i) - ϑ r (j)}² is also afforded onto the lattice point. Letting J*(i, j) denote that one of the operations of matching the position j of the trajectory to the position i of the road data which minimizes the cost of Eq. (14), it is the minimum value of the summation of the costs on the paths in the possible routes from the origin to the lattice point (i, j) in Fig. 24(a) and the cost on the lattice point. ε j is let denote any of -1, 0 and 1. The equation of the DP becomes: Incidentally, the optimal matching cost J* at the point j is In the DP calculations, the minimum values J*(i, j) are obtained successively from the origin J*(0, 0) = 0 in accordance with Eq. (16). Assuming now that the running distance of the vehicle is j = N and that j*(i, N) has been obtained, j*(i, N+1) at the next vehicular position j = N + 1 is evaluated by executing only the calculation of the final stage concerning j = N + 1 in the DP calculations. Thus, the DP calculations can be realized by iterative processing conformed to the running of the vehicle. It is repeatedly stated that the estimated (compensated) vehicular position at j = N is found as the position i*(N) on a road minimizing J*(i, N). Meanwhile, the above calculations spread radiately on a lattice in Fig. 24(b) as the vehicle runs, and the number of points at which J*(i, j) is to be computed increases in proportion to increase in the positions j (the proceeding of the vehicle). Therefore, when the cost J*(i, j) has exceeded a threshold value, the calculation of the route passing the corresponding lattice point is stopped thenceforth so as to omit wasteful calculations and to hold the amount of calculations substantially constant at any time. Accordingly, the start point of the cost computation, namely, the start point of the trajectory to be matched is also shifted in accordance with the running of the vehicle so as to keep a trajectory length constant, and the threshold value for deciding the cost J*(i, j) is also kept at a constant value. In the above way, the vehicular position can be compensated by optimally matching the whole trajectory to the roads data, and the calculations for finding the optimal matching can be executed by the iterative processing of the DP conformed to the running of the vehicle. By the way, although Eq. (14) has been indicated as the example of the matching cost formula on which the DP calculations are based, the present invention is not restricted to this equation. In each of the calculating systems, the positional quantization units with which the probability or cost of the estimative vehicular position is computed are determined by the detection accuracies of the detection means and the quantization of the map data (and the processing speed of the calculation). Here, points on the two-dimensional space of the land surface are quantized in the "probability" system, while points on road segments are quantized in the "DP" system. Besides, positional quantization units in the case of presenting the estimated result of the vehicular position to the user by image display or any other means need not always agree with the quantization units for the computation. The foregoing and other objects, advantages, manner of operation and novel features of the present invention will be understood from the following detailed description when read in connection with the accompanying drawings. Brief Description of the Drawings: Fig. 1 is a general block diagram of an embodiment of an on-board navigation system according to the present invention; Fig. 2 is a diagram showing the display example of a map and a vehicular position; Fig. 3 is a diagram showing the probability density of the vehicular position; Fig. 4 is a diagram showing the geometrical relationship of a running route; Fig. 5 is a diagram showing the initial value of the probability density in a driveway; Fig. 6 is a diagram showing the initial value of the probability density in any other road; Fig. 7 is a diagram showing the conditioned probability density of the vehicular position on the driveway; Fig. 8 is a diagram showing the conditioned probability density of the vehicular position in the presence of the possibility of running which misses a road; Fig. 9 is a diagram showing the conditioned probability density of the vehicular position which lies outside the road; Fig. 10 is a diagram showing a procedure for estimating the probability density of the vehicular position; Fig. 11 is a diagram showing an estimated running route; Fig. 12 is a diagram showing a procedure for estimating the probability density of the vehicular position in another embodiment; Fig. 13 is a diagram showing the format of node data in map data; Fig. 14 is a diagram showing the format of link data in the map data; Fig. 15 is a general block diagram of an embodiment of a vehicular location system according to the present invention; Fig. 16 is a block diagram of on-board devices; Fig. 17 is a block diagram of a center device; Fig. 18 is a block diagram of on-board devices in another embodiment of the vehicular location system; Fig. 19 is a block diagram of a center device in the second embodiment; Fig. 20 is a diagram showing the probability density of a vehicular position in a driveway; Fig. 21 is a diagram showing the probability density of the vehicular position in an urban district; Fig. 22 is a block diagram of an embodiment of an on-board navigation system according to the present invention; Fig. 23 is a diagram for explaining map data and a trajectory; Fig. 24(a) is a diagram for explaining DP matching, while Fig. 24(b) is a diagram for explaining the stop of DP calculations as based on the check of a matching cost; and Figs. 25(a) and 25(b) are diagrams showing map data and the table format thereof, respectively. Detailed Description of the Preferred Embodiments: Now, the embodiments of the present invention will be described with reference to the drawings. Embodiment 1: Fig. 1 is a block diagram of the first embodiment of an on-board navigation system for a vehicle according to the present invention. A data processor 4 computes the probability density of a vehicular position every moment in accordance with a method to be described later, on the basis of running distance data which is the output of running distance detection means 1 for measuring the revolution number of a wheel or the like, vehicular azimuth data which is the output of vehicular azimuth detection means 2 for measuring a steering angle, a terrestrial magnetism or the like, and map data stored in a memory 5. The result of the computation is written into an image memory 6 and displayed on an image display device 7 together with the map data. The driver of the vehicle can know the position of his/her own in a map from the display. Fig. 2 shows a display example on the display device 7. The map data, such as roads, 21 and vehicular position information 22 are displayed on a screen 20. The information is produced from the probability density 30 of the vehicular position as shown in Fig. 3. That is, the display in which the magnitudes of the probability densities of individual points (x, y) can be read is presented. By way of example, the points are displayed at brightnesses or in colors changed according to the magnitudes. Next, there will be described the contents of the vehicular position estimation processing in the data processor 4. Let's consider a geometrical model as shown in Fig. 4. In a map coordinate system 40, the state of the vehicle is defined to be x = (xy) T . The running distance V i and azimuth ϑ i of the vehicle in each of time zones into which a period of time is divided at regular intervals, are respectively afforded by the detection means 1 and 2. On this occasion, a route 41 can be expressed by the following probability equation: x i+1 = x i + d i (17) In addition, an observation equation becomes as follows: y i = d i + G i w i (i = 0, 1, ... ) (18) where Here, w i denotes the detection errors of the quantities V i and ϑ i , which can be regarded as white noise. When the probability density p( x ₀) of the initial value x ₀ of the position of the vehicle at the start of the running of the vehicle or at the start of the vehicular position display is now given, the probability densities p( x i ) of the subsequent states x i can be calculated from Eq. (17). The boundary line of 1 for (i = 1, ...) p(x i ) becomes as indicated by a closed curve 42. Areas enclosed with the closed curves 42 increase with 'i' due to the disturbances w i . That is, the vehicular position becomes indefinite gradually. Here, the probability density p( x ₀) can be given as stated below by way of example. By means of a console 8, the user indicates and inputs the current position of the vehicle judged by himself/herself within the map image which is displayed on the display device 7. The processor 4 evaluates p( x ₀) from the positional information. When the position of the indicative input lies on a road in the map display, p( x ₀) is given as a density distribution 51 centering around the indicated position on the road 50 as illustrated in Fig. 5. In contrast, when the indicative input position does not lie on a road in the map display, p( x ₀) is given as a density function 60 spreading on an (x, y)-plane around the indicated position as illustrated in Fig. 6. The density function is in the shape of, for example, a Gaussian distribution. Besides, in a case where the shape of the density function of x ₀ dependent upon the position in the map is known from the distributions of narrow streets, vacant lots, etc., it may well be given as p( x ₀). Such a functional shape may well be found by deciding the position, the kind of the road, etc. in the processor 4. The estimation of the vehicular position using the map data conforms to the foregoing system in which the posterior probability of Eq. (3) is maximized. Here, restrictive conditions p( x i+1 | x i ) (i = 0, 1, ...) are given as stated below in accordance with the map data. In a case where the current location x i lies on a section, such as driveway, in which the vehicle does not go out of the road, the condition p( x i+1 | x i ) is afforded as a unidimensional probability density 71 which is distributed on the road 70 in the map as shown in Fig. 7. In this case, a condition P( x i+1 | x i ) may well be afforded as a probability density 271 which is uniformly distributed on a road 270 as shown in Fig. 20. On the other hand, in a case where the current location x i lies on the driveway, but where a service area or the like which is not contained in the road data of the map exists near the lower stream of the vehicular running, or in a case where the location x i lies on an urban street or the like and is a spot from which the vehicle can run out of roads in the map, the condition p( x i+1 | x i ) is afforded as a probability density 81 which is distributed in two dimensions around the road 80 in the map as shown in Fig. 8. Further, in a case where the current location x i lies outside a road 90 in the map, namely, where it lies in the service area of the driveway, the narrow street of an urban district, a parking area, or the like, the condition p( x i+1 | x i ) is afforded as a two-dimensional probability density 92 which is distributed in two dimensions near the current location x i 91 as shown in Fig. 9. The condition p( x i+1 | x i ) indicates the probability density of a vehicular position x i+1 which can be assumed at the next point of time with the position x i as a start point, and it can be evaluated from the possible lowest and highest speeds, a diversion probability at a branching point, etc. for each of the cases of the relationship between the road and the location x i . Also in this case, a condition P( x i+1 | x i ) may well be afforded as a probability density 281 which is distributed around a road 280 as shown in Fig. 21. Further, a current vehicular speed may well be estimated from the output of a distance meter or a speedometer carried on the vehicle and be utilized. Now, there are evaluated the time series x ₁, ... and x N of the states which maximize the posterior probability of Eq. (3) for the given state equation (17), observation equation (18), initial probability density p( x ₀) and observation data y i (i = 0, ..., and N - 1). First, for N = 1, probability densities p( x ₁| y ₀) are found for all values which can be taken as x ₁, in accordance with Eq. (5). The x ₁ which takes the maximum value of the probability densities corresponds to the most probable location of the vehicle at this point of time. The probability density p( x ₁| y ₀) is stored in a memory 9 in Fig. 1 so as to be utilized at the next point of time, and it is also sent to the memory 6 so as to be displayed. At the point of time of or after N = 2, as illustrated in Fig. 10, the posterior probability p( x N-1 | y ₀, ..., y N-2 ) 100 evaluated at the preceding point of time is read out of the memory 9, and probability densities p( x N-1 | y ₀, ..., y N-1 ) are obtained for all values which x N can take, in accordance with Eq. (4) and by the use of an observation y N-1 101, the obtained result being written into the memory 9 (103) and being sent to the memory 6 so as to be displayed. The boundary line of 1 for the obtained posterior probabilities becomes as indicated at numeral 110 in Fig. 11, and an area enclosed with the curve 110 becomes smaller than in the case of the curve 42 in Fig. 4. This signifies decrease in the error of the estimation. Thus, the vehicular position at the current time can be read together with the reliability thereof. The point at which the probability becomes the maximum is the expected value of the current position. In a case where a road diverges in Fig. 2 and where significant posterior probability values exist on two or more roads, all the values may be displayed as indicated at numeral 23. Here, the computations need to be performed for all the continuous values x N which can take the posterior probability p( x N | y ₀, ..., y N-1 ). In the actual processing, however, they may be performed for points obtained by sampling the map coordinates at suitable intervals. On this occasion, the integral calculations of Eqs. (4) and (5) become the sums of products. Incidentally, the value of p( y i ) (i = 0, ..., and N - 1) may be found so that the integration of p( x N | y ₀, ..., y N-1 ) with respect to x N may become one. Embodiment 2: The second embodiment consists in substituting the processing contents of the processor 4 which constitutes the first embodiment of the navigation system carried on the vehicle. Here, similarly to the foregoing, the initial probability density p( x ₀) and the conditioned probability density p( x i+1 | x i ) (i = 0, ..., and N - 1) are given beforehand. The processor 4 executes the following processing as indicated in Fig. 12: There are evaluated the series x ₀, x ₁, ... and x N of the states which maximize the posterior probability of Eq. (6) for the given state equation (17), observation equation (18), initial probability density p( x ₀) and observation data y i (i = 0, ..., and N - 1). First, for N = 1, J₁( x ₁) is found for all values which can be taken as x ₁, in accordance with Eq. (11). J₁( x ₁) corresponding to the maximum value of the posterior probability density p( x ₀, x ₁| y ₀) obtained when x ₁ is given, is stored in the memory 9 so as to be utilized at the next point of time. The density p( x ₀, x ₁| y ₀) is sent to the memory 6 so as to be displayed. At the point of time of or after N = 2, as illustrated in Fig. 12, a cost J N-1 ( x N-1 ) 120 which corresponds to the maximum value of the following posterior probability obtained when x N-1 evaluated at the preceding point of time is read out of the memory 9: p ( x ₀, x ₁, ... , x N-1 | y ₀, ... , y N-2 ) C( x N , x N-1 ) is obtained for all values which x N can take, in accordance with Eq. (8) and by the use of an observation y N-1 121, and J N ( x N ) 123 is evaluated from the two in accordance with Eq. (10) and is written into the memory 9 (122). J N ( x N ) is the maximum value of the following posterior probability obtained when x N is given: p ( x ₀, x ₁, ... , x N | y ₀, ... , y N-1 ) It is sent to the memory 6 so as to be displayed. The display may be presented by the same method as in the first embodiment. The posterior probability displayed at each point of time: p ( x ₀, x ₁, ... , x N | y ₀, ... , y N-1 ) indicates the posterior probability in the case where the optimum route is taken in the sense of the maximum posterior probability with the noticed state x N as a terminal end. If a vehicular route 111 in the past is to be known, processing as described below may be executed in the processor 4. Eq. (10) is solved in the descending series of N on the basis of the state x N at the given terminal end point, whereby the states x N of the optimum routes are obtained in the descending series of N. On this occasion, the values d N and ϑ N in the past are required. For this purpose, the outputs of the detection means 1 and 2 may be stored in the memory 9 beforehand so as to read them out at need. Here, J N ( x N ) may be computed for respective points obtained by sampling all the values of x N which can be taken. In addition, a proper fixed value may be given as p( y i ) (i = 0, ..., and N - 1). The posterior probability obtained on this occasion has a value thus subjected to scaling. Embodiment 3: Next, there will be described an embodiment in which a plurality of sorts of devices are disposed as either or each of the running distance detection means 1 and the vehicular azimuth detection means 2, thereby to relieve the influence of the error of the detection data being the output of the detection means and to heighten the estimation accuracy of the current position of the vehicle. The running distance detection means to be added here is, for example, an inertial navigation system. Besides, the vehicular azimuth detection means is means for measuring the difference between the rotational angles of both the right and left wheels, the azimuth of the sun or a specified celestial body, or the like. On this occasion, the processing of the processor 4 may be changed as stated below: Now, letting V i ′ denote the running distance of the vehicle as measured in the i-th time zone by the additional detection means, and ϑ i ′ denote the vehicular azimuth, the following is obtained as an observation equation in addition to Eq. (18): y i ′ = d i + G i ′ w i ′ (18′) where On this occasion, the observation vector y i based on Eq. (18) and the observation vector y i ′ mentioned above are combined to prepare a new 4-dimensional observation vector: whereupon the estimative value of the current position x i which maximizes the posterior probability of Eq. (3) or Eq. (6) may be found by replacing the observation vector y i of Eq. (2) with the new observation vector. Herein, the procedure of the processing is similar to that in the first or second embodiment. However, the number of the dimensions of the observation vector increases. Besides, in a case where an observation vector y i ″ based on the third detection means is obtained, the following 6-dimensional observation vector may be employed: The same applies in cases of observation vectors of more increased dimensions. Here, in the case where the plurality of detection means are disposed, the abnormality of detection data can be sensed as described below: First, in case of the detection means,such as terrestrial magnetism azimuth sensor, which is greatly affected by a disturbance, the output thereof is compared with that of a sensor of high reliability such as gyro, and when the difference between both the outputs is larger than a predetermined threshold value, the output of the terrestrial magnetism azimuth sensor is regarded as being abnormal. Besides, in case of providing at least three sensors, the outputs of the respective sensors are compared, and when one output differs from the two others in excess of a predetermined threshold value, it is regarded as being abnormal. Embodiment 4: Next, there will be described the fourth embodiment in which means 3 for detecting information on the current position of the vehicle is provided in addition to the detection means 1 and 2. Such means includes the GPS and the radio beacons of sign posts, loran etc. A measure in which a flying machine is stayed at a high altitude so as to be used as the radio beacon, and a measure in which the inclination of the body of the vehicle is detected on the basis of the suspension of the wheels or the load of the engine of the vehicle as stated later, correspond also to this means. Herein, the processing of the processor 4 may be changed as follows: According to the detector 3, an observation equation (21) may be formularized: z i = h i ( x i ) + v i (i = 1, 2, ... ) (21) Here, z denotes an observation vector of m-th order, h an m-th order vector function, and v a white noise vector of m-th order, the probability density p( v ) of which is assumed to be given. On this occasion, as to the first embodiment, the observation of Eq. (21) is added instead of Eq. (3), and the following posterior probability is maximized: p ( x N | y ₀, ... , y N-1 , z ₁, ... , z N ) (22) Processing required for obtaining the solution of this problem becomes quite the same as in the foregoing when Eq. (4) is put as: p( x N | y ₀, ... , y N-1 , z ₁, ... , z N ) = ∫ p ( y N-1 | x N-1 , x N )·p( z N | x N )·p( x N | x N-1 ) /p( y N-1 )/p( z N )·p( x N-1 |y₀, ... , y N-2 , z ₁, ... ,z N-1 ) ·d x N-1 (4)′ or Eq. (5) is put as: p( x ₁| y ₀, z ₁) = ∫ p( y ₀| x ₀, x ₁)·p( z N | x N )·p( x ₁| x ₀)/p( y ₀)/p( z ₁) ·p( x ₀)d x ₀ (5)′ As to the second embodiment, the observation of Eq. (21) is added instead of Eq. (8), and the following posterior probability is maximized: p ( x ₀, x ₁, ... , x N | y ₀, ... , y N-1 , z ₁, ... ,z N ) (23) Processing required for obtaining the solution of this problem becomes quite the same as in the foregoing when the following is put in Eq. (8): By the way, in the case where the detection means 3 detects the inclination of the vehicular body, the output of the detector is z i in Eq. (21). In addition, h i ( x i ) denotes the inclination of the road surface of the spot x i , and it may be included in the map data and stored in the memory 5. Besides, in a case where a plurality of position detection means are comprised, an observation vector Z i of large dimensions in which the outputs of the means are arrayed is substituted for z i , and the subsequent handling does not differ at all. Further, in the case of employing the vehicular position detection means 3 as stated above, the output thereof may be used for obtaining the probability density p( x ₀) of the initial vehicular position in accordance with Eq. (21). Embodiment 5: Next, there will be described the embodiment of processing which is executed for the abnormal detector data or map data in the processor 4. In the first embodiment, ∫∫p( y N-1 | x N-1 , ... , x N )·p( x N |x N-1 )·p( x N-1 | y ₀, ... , y N-2 ) ·d x N-1 ·d x N (24) is computed. From Eq. (4), it is transformed into: ∫ p ( x N | y ₀, ... , y N-1 )·p( y N-1 )d x N = p ( y N-1 ) (25) Accordingly, when the value of Eq. (24) is smaller than a predetermined threshold value, it can be decided that detector data y N-1 or map data p( x N | x N-1 ) has been abnormal. When the abnormality has been sensed, it is displayed on the display device 7 by way of example, so as to inform the user to that effect and to urge the user to input the current position information p( x ₀) from the console 8. Then, the vehicular position estimation processing is reset, and it is changed-over to an estimation from the spot x ₀. In the presence of a plurality of detection means, an estimation may well be tried again by the use of the output data of the detection means other than ones decided abnormal. Further, as regards the estimated result p( x N |y₀, ..., y N-1 ), the maximum value for the spot x N is detected. Thus, when the detected value is smaller than a predetermined threshold value, it can be decided whether the sensor detection data y N-1 or the map data p( x N | x N-1 ) has been abnormal, or in spite of the data being normal, the vehicular position has been lost because the running route pattern of the vehicle has no feature. Also in this case, the user may well be informed to that effect so as to reset the vehicular position estimation. Besides, in the case where the vehicular position detection means 3 is provided, an abnormality can be sensed in the following way: The probability density p( x i | z i ) of the position x i is evaluated from the output z i of the detector 3 in accordance with Eq. (21). On the other hand, the probability density p( x i | y ₀, ... , y i-1 ) of the position x i is evaluated without using the output of the detector 3, by the method of the first embodiment. In the absence of a region of x i where both the probability densities simultaneously take significant values greater than a predetermined threshold value, the latter density is regarded as being abnormal, and the position estimation from the current time is started anew with the former density being p( x ₀). Embodiment 6: Next, there will be described an embodiment in the case where the running of the vehicle is limited onto roads in the map data. This is applied to a navigation system which handles only driveways, or a navigation system with which the user receives service, consenting to the running on the roads in the map. In this case, the conditioned probability p( x i+1 | x i ) of the vehicular position for use in the processing of the data processor 4 may be set so as to become zero when either x i or x i+1 does not lie on the road in the map. That is, it is given as indicated at numeral 71 in Fig. 7. In general, Embodiments 1 and 2 give the conditioned probability p( x i+1 | x i ) as a two-dimensional distribution. In contrast, when the user has instructed from the console 8 to the effect that the drive limited onto the roads as stated above is to be performed, the conditioned probability p( x i+1 | x i ) may be changed-over to the unidimensional distribution as mentioned above and be utilized. Here will be described the formats of the map data for use in the navigation system of the present invention and methods of utilizing the map data. Roads contained in the map data are expressed by nodes such as intersection points, branching points and bending points, and the links between the nodes as approximated by straight lines or circular arcs. As indicated in Fig. 13, the data format of the node consists of an identifier 131, an x-ccordinate 132, y-coordinate 133 and z-coordinate 134 in a map coordinate system, an attribute 135, the number of connected links 136, link identifiers 137 in the number of the links, and other auxiliary information 138. As the attribute 135, besides the identifier of the intersection point, branching point or bending point, the user may well additionally write a service area, parking area, gasoline station or the like which is useful for the user to recognize the vehicular position or route. On the other hand, as indicated in Fig. 14, the data format of the link consists of an identifier 140, a start node identifier 141, an end node identifier 142, an attribute 143, the number of lanes 144, a maximum speed limit 145, a minimum speed limit 146, the diversion probabilities of traffic flow 147 at the start node, the diversion probabilities of traffic flow 148 at the end node, and other auxiliary information 149. The user may well additionally write the identifier of a driveway, urban street, suburban street or the like as the attribute 143, and regulation information etc. and other items convenient for the user as the auxiliary information 149. Incidentally, when the up and down directions of a road need not be distinguished, the start point and end point are changed to read as terminal points. In addition, the prior information items of measurement errors dependent upon places, such as the disturbances of a terrestrial magnetic sensor attributed to a railway, a high level road etc., may well be written in the auxiliary information 138 or 149 in terms of, for example, the values of biases or error covariances. Besides, as to sign posts, the error covariances thereof may well be stored in the auxiliary information 138. These map data items are stored in the memory 5. Here, fixed information items among the map data are stored in a read-only memory such as CD-ROM, while additional or variable information items are stored in a rewritable memory such as RAM. Alternatively, both the fixed and variable information items may be stored in an optomagnetic disk, a bubble memory or the like which is rewritable. The map data is utilized as follows by the processor 4: (1) Using the data items of the coordinates and connective relations of nodes and links, a road map in the neighborhood of the current position of the vehicle is displayed on the display device 7. The links may well be selected or distinguished in colors in accordance with the attributes thereof. Besides, the attributes of the nodes serving as marks may well be displayed. (2) There is evaluated the probability density p( x i+1 | x i ) of the position x i+1 of the vehicle at the next point of time in the case where the current vehicular position x i has been given. As referred to in the description of the first embodiment, in a case where x i lies on or near a link, p( x i+1 | x i ) is evaluated by the use of the attribute of the link and the maximum and minimum speed limits thereof. Further, in a case where x i lies on or near a node, p( x i+1 | x i is evaluated by the use of the attribute, diversion probability etc. of the node. Here, the values 147 and 148 in the memory 5 may well be used as the diversion probabilities. However, when the vehicle is navigated along a route leading to a predetermined destination, different values may well be used as described below. (3) The optimum route from a given start point or current position to the destination is calculated according to the connective relations of nodes and links, the distances of the links, speed limits, etc. The calculated route is overlay-displayed on a map by the display device 7, and the selections of courses at the respective nodes are displayed. On this occasion, the probabilities of diversions to the courses are made greater than the values stored in the map data, whereupon p( x i+1 | x i ) is calculated in conformity with the procedure (2). (4) In a case where a sensor for detecting the inclination of a vehicular body is comprised as the sensor 3, the inclination of a noticed link is evaluated from the z-coordinates values of both the end nodes of the link and the distance of the link, and it is checked up with the sensor output by the foregoing method so as to be utilized for the estimation of a vehicular position. (5) In a case where a sign post is employed as the sensor 3, the installation location and error covariance value thereof can be read out from the memory of the map data so as to be utilized for the estimation of a vehicular position. (6) In a case where the vehicular azimuth detection means 2 is one, such as a terrestrial magnetism sensor, which undergoes different disturbances depending upon places, the prior information items of errors, namely, biases, covariances etc. can be read out from the map data memory so as to be utilized for the estimation of a vehicular position. (7) The data items of nodes and links are retrieved using an estimated vehicular position as an index, and the identifiers, attributes, auxiliary information items etc. of the neighboring node and link are displayed and communicated to the user. Embodiment 7: Next, the first embodiment of a location system which adopts the vehicular position estimating system according to the present invention will be described with reference to Figs. 15 - 17. Fig. 15 is a general block diagram of the location system. This system is constructed of at least one on-board device 150 carried on a vehicle, and a single center device 151. Data items are transferred between both the devices by radio communication. Fig. 16 is a block diagram of the device 150. An on-board navigation system 161 is equivalent to that shown in Fig. 1. The estimated result of a vehicular position produced from a processor 4 in the system 161 is sent to the center device 151 through a transponder 162 as well as an antenna 163, together with the identifier of the vehicle. On the other hand, a command etc. sent from the center device 151 are utilized for display etc. by the processor 4 through the antenna 163 as well as the transponder 162. Fig. 17 is a block diagram of the device 151. The identifier of each vehicle and the estimated result of the position thereof as sent from the on-board device 150 are sent to a processor 172 through an antenna 170 as well as a transponder 171, and they are displayed on a display device 173 or are utilized for processing for the service management of the vehicle. A command etc. for the vehicle, which are given from an input device 174 by a service manager or prepared by the processor 172, are sent toward the vehicle through the transponder 171 as well as the antenna 170, together with the identifier of the vehicle. Embodiment 8: Next, the second embodiment of the location system will be described with reference to Figs. 18 and 19. The general arrangement of this system is the same as shown in Fig. 15. Fig. 18 is a block diagram of the on-board device 150. The outputs of detection means 1 thru 3 are sent to the center device 151 through a processor 4, a transponder 181 and an antenna 182 every fixed time, together with the identifier of the vehicle. On the basis of the received sensor outputs and map data, the center device 151 executes processing to be described below and estimates the position of the vehicle. The result is sent to the vehicle together with a command, and it is displayed on a device 7 through the antenna 182, the transponder 181, the processor 4 and a memory 6 so as to be communicated to the user of the system. On this occasion, map data stored in a memory 5 may well be overlay-displayed. Fig. 19 is a block diagram of the center device 151. The identifier and sensor outputs of each vehicle, which are sent from the on-board device 150, are delivered to a processor 192 through an antenna 190 as well as a transponder 191. The processor 192 executes the same processing as that of the processor 4 in Embodiment 1 or 2, and estimates the position of the vehicle. Herein, a memory 193 which stores the map data and an estimated result at the last sampling point of time and which corresponds to the memories 5 and 9 is utilized. The estimated result is displayed on a display device 194, or is utilized for processing for the service management of the vehicle. A command etc. for the vehicle, which are given from an input device 195 by a service manager or prepared by the processor 192, are sent toward the vehicle through the transponder 191 as well as the antenna 190, together with the positional estimation result and the identifier of the vehicle. As compared with the foregoing embodiments, this embodiment has the following features: (1) The load of the on-board processor 4 is lower, and the size thereof can be reduced. (2) The on-board memory 9 is dispensed with, and the map data in the memory 5 may contain only the attributes, connective relations etc. of nodes and links, so the size thereof can be reduced. (3) The memory 5 is also dispensed with when a system in which the center device 151 prepares map image data for display and transmits it to the on-board device 150 is adopted. (4) In the case where the position measurement device based on the GPS is employed as the detection means 3, this means 3 can be miniaturized by adopting a system in which a signal received from a satellite is sent to the center device 151 so as to execute the position calculation processing therein, instead of the on-board processing for calculating the position from the received signal. In consequence, this embodiment can simplify and miniaturize the on-board devcies. It is also a modification to the navigation system. In the navigation system of the present invention, the vehicular position estimated every moment may well be stored in the memory 9 together with the codes of a start point and a destination applied from the exterior 8. In that case, when the vehicle runs between the identical start point and destination after such running, a corresponding route can be guided to the driver in such a way that running spots on the route are read out from the memory 9 and displayed on the display device 7 in accordance with the codes of the start point and destination applied from the exterior 8. Here, x N (N = 0, 1, ...) maximizing Eq. (4), Eq. (12) or Eq. (13) can be used as the vehicular positions to be stored in the memory 9. Although, in each of the foregoing embodiments, the display device 7 has been employed as the means for comminicating the estimated result of the current position of the vehicle to the user, it may well be replaced with a voice synthesizer 10 (in Fig. 1). The sentences of, for example, "You are approaching Intersection --" and "You are near --" are synthesized and communicated as voice in accordance with the probability densities of the estimated results and the coordinates of the nodes and links in the map data. This expedient produces the effect that, when the user is the driver, the burden of seeing the display during running can be avoided. According to the embodiments thus far described, the current position of a vehicle is estimated using map data, and hence, there is the effect that the divergence of an estimation error ascribable to the error of other detector data is suppressed. Moreover, since the probability density of the vehicular position is displayed on a map, there is the effect that the user can know the reliability of an estimated result and prevent a confusion ascribable to an erroneous display. Furthermore, since the estimation system of the present invention can collectively handle various kinds of detector data, there is the effect that the achievement of a high accuracy is facilitated by combining the system with the detector of a GPS or the like. Embodiment 9: Fig. 22 shows an on-board navigation system which adopts the present invention. In beginning the use of the navigation system, a driver (or another occupant) 301 designates a road map including a current position, from a device 302 for inputting the indication of a start map. Then, road data on a CD-ROM 304 is read out by an input device 305 and displayed on an image display device 303. The road data is once stored in a road node table 306 and is converted by picturization means 307 into bit map data, which is sent to the image display device 303. The road data is expressed by the node table which is exemplified in Figs. 25(a) and 25(b). The picturization means 307 evaluates the formulae of straight lines between adjacent nodes for all the nodes, and alters pixel values on the straight lines from background density (color) values into road density (color) values in a write image buffer. When the road image as shown in Fig. 25(a) is displayed on the image display device 303, the driver 301 inputs the current position of a vehicle with a device 308 for inputting the indication of a start point, which is constructed of a cursor moving device, while viewing the display of a cursor on the image display device 303. In conformity with this timing, an azimuth calculator 3011 for ΔS intervals begins to receive a running distance S(t) and a vehicular azimuth ϑ v (t) from a distance sensor 309 and an azimuth sensor 310 constructed of a terrestrial magnetism sensor, respectively, and it delivers running directions ϑ v (j) (j = 0, 1, ...) of the respective fixed distances ΔS in succession. Simultaneously with the input of the indication of the start point, the coordinates of the start point on the image are applied to a road direction calculator 3012 for the ΔS intervals. The road direction calculator 3012 first finds a point on the road data nearest the start point coordinates as received by loading the road node table 306, and sets it as the coordinates A of the new start point. Subsequently, the calculator 3012 evaluates the road direction data ϑ r (i) of points at the respective fixed distances ΔS, for all road routes which can be reached from the point A, and it sends the evaluated data to a road direction data file 3013. The number of the road direction data items, namely, the size of the file is set to be double the maximum trajectory length M of DP matching. At the same time, the road direction calculator 3012 supplies a road coordinate data file 3014 with the coordinates {x r (i), y r (i)} of the points at the intervals ΔS. When a DP calculator 3015 is supplied with the vehicular direction data ϑ v (0) and ϑ v (1) from the azimuth calculator 3011 for the ΔS intervals with the proceeding of the vehicle, the minimum costs of three lattice points (0, 1), (1, 1) and (2, 1) in Fig. 24(a) are computed according to Eq. (16) and are delivered to a minimum cost file 3016. When the vehicle proceeds to pass the point of j = 2, ϑ v (2) is delivered from the azimuth calculator 3011. Then, the DP calculator 3015 reads out the minimum cost values J*(0, 1), J*(1, 1) and J*(2, 1) stored at the last time, from the minimum cost file 3016, and it calculates the minimum cost values J* (i, 2) (i = 1, ... and 4) at j = 2 in accordance with Eq. (16) by the use of the road direction angles ϑ r (i) (i = 0, 1, 2, 3 and 4) received from the road direction data file 3013, the calculated results being stored in the minimum cost file 3016. As stated before, the DP calculator 3015 executes the final stage of the DP matching calculation between the trajectory and the route of the road data in conformity with the running of the vehicle. A minimum cost detector 3017 detects i min which affords the minimum value concerning 'i' of J*(i, j) in the minimum cost file 3016, every running distance 'j'. A compensated position calculator 3018 loads the coordinates of a position on the map corresponding to i min , namely, the optimal matching point of the vehicular distance 'j', from the road data coordinate file 3014, and delivers them to the picturization means 307, thereby to display the vehicular position as a compensated position in superposition on the map coordinates indicated on the image display device 303, and it also delivers them to the input device 305, thereby to read out road data centering around the vehicular position. Besides, each time i min increases with the proceeding of the vehicle, the road direction calculator 3012 for the ΔS intervals evaluates a road direction and coordinate data corresponding to an increment and supplements them to the road direction data file 3013 and the road coordinate data file 3014. Incidentally, the DP calculator 3015 checks the computed cost J*(i, j), and it stops the DP calculations as illustrated in Fig. 24(b) when the cost has exceeded a threshold value α. In a case where, as shown in Fig. 23, all the costs J*(i, j) concerning the running distance 'j' have exceeded the threshold value α after branching at an intersection, the computation of the road direction data on this branching is not executed thenceforth. Owing to the repetition of the above operations, the vehicular position compensated by the optimum matching as the route is displayed on the image display device 303 every moment with the running of the vehicle. According to Embodiment 9, when a vehicular position is estimated from on-board sensor data in an on-board navigation system, the global matching between an on-board sensor data sequence and map road data and the correction of an estimated vehicular position are made by a DP matching technique. This is effective to provide the on-board navigation system which lowers the possibility of the failure of the vehicular position estimation attributed to insufficiency in the map data and sensor errors and in which temporary mismatching can be corrected by a posterior global judgement.

Claims: A method for operating a vehicle navigation system having first detector means (1) for detecting the distance travelled by the vehicle and/or second detector means (2) for detecting an azimuth of the vehicle, further having a first memory (5) for storing map data, comprising the following steps: detecting the distance travelled and/or the azimuth by said first and/or second detector means (1, 2), calculating a first probability density for the vehicle position on the basis of the detected distance travelled and/or azimuth and of the detection accuracy, and determining the current position of the vehicle on the basis of the calculated first probability density, characterised in that said map includes a priori position probability densities associated with discrete locations comprising on-road and off-road locations, and that a composite probability density is calculated by combining said a priori position probability density at each discrete location with said first probability density. The method of claim 1, characterised in that the composite probability density at a current time is calculated on the basis of the detected data obtained until the current time since the start of the calculation of the vehicle position. The method of claim 2, characterised in that said composite probability is repeatedly calculated after identical time intervals to obtain a series of vehicle positions. The method as defined in any of Claims 1 to 3, wherein said step of calculating the probability density of the vehicular position comprises the step of further calculating a composite probability density of the position at a next time on the basis of the probability density calculated at a current time. The method as defined in any of Claims 1 to 4, further comprising the step of displaying on an image display device (7, 173, 194, 303) which is prepared from the map data and the calculated probability density of the vehicular position. The method as defined in any of Claims 1 to 5, further comprising the step of producing voice which is synthesized from the map data and the calculated probability density of the vehicular position. The method as defined in any of Claims 1 to 6, comprising the step of receiving an initial position at a start time of the calculation of the vehicular position, and the step of calculating an initial probability density in a data processor on the basis of the initial position. The method as defined in any of Claims 1 to 7, wherein an astronomical sensor is employed as the vehicular azimuth detection means. The method as defined in any of Claims 1 to 8, wherein a plurality of sorts of devices are disposed as both or either of the running distance detection means and the vehicular azimuth detection means. The method as defined in Claim 9, comprising the step of sensing abnormal detection data by comparing output data items of the plurality of sorts of detection means. The method as defined in any of Claims 1 to 7, wherein besides said detection means (1, 2), at least one third detection means (3) for detecting data on the vehicular position is provided, so as to be used for said step of calculating the probability density. The method as defined in Claim 11, wherein a sensor for an inclination angle of a body of the vehicle is employed as said third detection means (3). A navigation method using map data as defined in Claim 11, comprising the step of sensing any abnormality by comparing the probability density of the vehicular position calculated with said first and second detection means (1, 2) and the probability density calculated with said third detection means (3). The method as defined in any of Claims 1 to 13, wherein the map data includes locations, connective relations and attributes on nodes and links constituting roads (140-144), speed limits (145, 146) and diversion probabilities (147, 148) of traffic flows. The method as defined in Claim 14, wherein said map data further includes auxiliary information items (149) externally written. The method as defined in Claim 15, wherein the auxiliary information items are stored in a rewritable memory. The method as defined in Claim 15, wherein the auxiliary information items include the accuracy information of said first and /or second detection means (1, 2). The method as defined in any of Claims 1 to 17, wherein the composite probability density is calculated as to take non-zero values only on roads in the map data. The method as defined in any of Claims 1 to 17, wherein the operation mode may be changed so that the composite probability density is either calculated as taking non-zero values only on roads in the map data or it is calculated as taking non-zero values also in other places. The method of any of claims 1 to 19, characterised in that said first and/or second detection means (1, 2) are carried on the vehicle and the output thereof is transmitted to a centre device (151) not carried on the vehicle, wherein the vehicle position is calculated in said centre device (151). The method of claim 20, wherein the vehicle position calculated by said centre device (151) is transmitted back to the vehicle. The method of claim 20 or 21, wherein said centre device (151) executes processing functions of said detection means (1, 2). The method of any of claims 1 to 22, wherein said first detection means is a speed sensor (309) said second detection means is a vehicle azimuth sensor and wherein a second memory is provided, said calculating steps further comprising the following substeps: storing in said second memory coordinates of a plurality of places on a road as estimated current positions of the vehicle together with their calculated probability densities, and iteratively updating said estimated vehicle positions and their corresponding calculated probability densities on the basis of the sensed speed, the sensed azimuth, the corresponding road map data and the previously stored estimated current position together with the corresponding calculated probability density. The method of claim 23, wherein the estimated vehicle positions are estimated in a dynamic programming matching calculation step (3015) on the basis of the sensed speed and azimuth and the map data. The method of claim 23 or 24, further comprising the step of selecting that estimated vehicle position, the calculated probability density of which is higher than that of other possible vehicle positions and displaying the estimated vehicle position on an image display device (17, 303). The method of any of claims 23 to 25, wherein said iteration step includes a dynamic programming matching step between route data obtained from the first and/or second detector means (1, 2) from the travelling start time of the vehicle up to the current time and at least one candidate route of the road map data. The method of any of claims 23 to 26, wherein said storing step includes the following substeps: storing the calculated probability density at dynamic programming matching calculation stages of predetermined number on a maximum probability route (3016) leading to each of the estimated vehicle positions (3018), and increasing, on account of the probability density concerning the initial stages of the predetermined number, a calculated probability density concerning the estimated vehicle position (3018) at a next time. A vehicle navigation apparatus, comprising first detector means (1, 309) for detecting the distance travelled by the vehicle and/or second detector means (2, 310) for detecting an azimuth of the vehicle, a first memory (5, 193, 304) for storing map data, and means (4, 192) for calculating a first probability density for the vehicle position on the basis of the detected distance travelled and/or azimuth and of the detection accuracy, and for determining the current position of a vehicle on the basis of the calculated first probability density, characterised in that a memory means (5, 193, 304) is provided for storing a priori position probability densities associated with discrete locations including on-road and off-road locations, and that said calculating means (4, 192) comprise a means for calculating a composite probability density by combining said a priori position probability density at each discrete location with said first probability density. The apparatus of claim 28, characterised in that said calculating means (4) are carried on the vehicle. The apparatus of claim 28 or 29, characterised in that said first detection means is a speed sensor (309), said second detection means is a vehicle azimuth sensor (310), that a second memory is provided, and that said calculating means (311 to 318) further comprise: means for storing in said second memory coordinates of a plurality of places on a road as estimated current positions of the vehicle together with their calculated probability densities, and means for iteratively updating said estimated vehicle positions and their corresponding calculated probability densities on the basis of the sensed speed, the sensed azimuth, the corresponding road map data and the previously stored estimated current position together with the corresponding calculated probability density. The apparatus of claim 30, characterised by means (315) for estimating the vehicle position by dynamic programming matching calculation on the basis of the sensed speed and azimuth and the map data.

Inventors: HIRAYAMA YOSHIKAZU, HOMMA KOICHI HAKURAKU-HAUSU NR, KAGAMI AKIRA HITACHI-SAGINUMA-, KATO MAKOTO HITACHI-SAGINUMA-R, KOMURA FUMINOBU OKURAYAMA-FURA, KOSAKA MICHITAKA, MATSUOKA YOJI MURATA APT NR, SHIBATA TAKANORI, HIRAYAMA, YOSHIKAZU, HOMMA, KOICHI HAKURAKU-HAUSU NR. 602, KAGAMI, AKIRA HITACHI-SAGINUMA-RYO, KATO, MAKOTO HITACHI-SAGINUMA-RYO, KOMURA, FUMINOBU OKURAYAMA-FURATTO NR. 406, KOSAKA, MICHITAKA, MATSUOKA, YOJI MURATA APT. NR. 13, SHIBATA, TAKANORI
Applicants: HITACHI LTD, HITACHI, LTD.
Application year: 1989
Main classification: G01C21
IPC codes: G06F17, G01C21