JP2007171211A - Optimum path searching method - Google Patents

Abstract

<P>PROBLEM TO BE SOLVED: To process at a high speed even when all paths between every place points are searched in which there are a large number of points used as a departure point, a destination point in relation with the optimum path searching method of retrieving for an optimal path from the departure point to the destination point based on road data. <P>SOLUTION: In a path searching unit 15 in the optimum path searching method, a peripheral searching unit 51 asks for a satellite which is selected road point from among road points on a highway around the destination based on detailed road data. All path searching units 52 retrieve detailed road data for a field path from the departure point to the highway of its periphery, in a certain case that a satellite obtained by the peripheral searching unit 51 or a destination point retrieves for the field path which results in the destination point with highway data on the highway from the road point on the highway called for by making it such, the destination point retrieves for the field path which results in the destination point with the highway data on the highway, and the optimal path is searched for. <P>COPYRIGHT: (C)2007,JPO&INPIT

Description

  The present invention relates to an optimum route search method in a route search device that searches for a route from a departure point to a destination point based on road data and obtains the route.

  The route search device obtains an optimum route based on road data when a product delivery route is obtained via a plurality of points.

  A conventional route search device obtains a road section to be connected starting from the departure point by the Dijkstra method, etc., evaluates the distance of the section, selects the section with the smallest distance as the optimum road section, and sequentially shortens the shortest distance to the destination point The route from the starting point to the destination point thus obtained was output as the optimum route. Conventionally, the optimum route has been obtained based on a main road map of only main roads or a detailed road map of all roads including narrow roads such as branch roads separated from the main road.

  When a conventional route search device searches for a route based on a main road map in order to speed up processing, the route to the destination cannot be obtained under the condition that the destination is not on the main road. It was. For this reason, it is necessary to supplement the vicinity of the destination with a detailed road map. However, when the shortest route between many points is obtained with the destination and the starting point as the point, the detailed road for each starting point and the destination point. It was necessary to supplement with data, and it took a long time.

  Also, on actual roads, it may not be possible to move at the maximum legal speed due to road width, traffic congestion, etc. Even if the route is the shortest distance, it may actually reach the destination in the shortest time. It is not always possible, and there is actually a route that can move at high speed even if the distance is long and the required time is short. For this reason, the route obtained by the conventional route search device that uses the shortest distance route from the departure point to the destination point as the optimum route is not always the optimum route in actual operation. In addition, there are those that estimate the required time to the destination in consideration of the width of the road and display it as supplementary information on the obtained shortest route, but the required time is only supplementary information and the required minimum The route of time is not output as the optimum route.

  An object of the present invention is to provide an optimum route search method capable of obtaining a route from a departure point to a destination point at high speed. Another object of the present invention is to enable high-speed processing when there are a number of points serving as starting points and destination points, and all the optimum routes between the points are obtained.

  The basic configuration of the present invention is to search for a route from the departure point to the destination point based on the road data, an input unit for inputting the destination point and the point serving as the departure point, a road data holding unit for holding road data, and the road data. In an optimum route search method in a route search device comprising a route search unit for obtaining an optimum route and an output unit for outputting route information of the optimum route, from the point to the main road in the vicinity based on the detailed road data A route search unit for searching for a route, and an all route search unit capable of searching for a route with the selected road data of the detailed road data and the main road data. The satellite which is the road point selected from the road points on the main road around the destination is obtained, and the route from the departure point to the main road in the vicinity is detailed by the whole route search unit If the satellite or destination point is located on the main road from the road point on the main road determined in this way, the route to the destination point is searched using the main road data to find the optimum route. Have the structure you want.

  The configuration of the technology related to the present invention includes an input unit for inputting a destination point and a starting point, a road data holding unit for holding road data, and a route from the starting point to the destination point based on the road data. In an optimal route search method in a route search device, comprising: a route search unit for searching for an optimum route; a speed table holding unit for determining a traveling speed according to a road attribute; and an output unit for outputting route information. The route is obtained by referring to the speed table for the route, evaluating the route obtained from the required time, and outputting the route information with the route having the shortest required time from the starting point to the destination as the optimum route.

  FIG. 1 is a diagram showing a configuration of a technique related to the present invention.

  In FIG. 1, reference numeral 1 denotes a road data holding unit which holds road data. 2 is section data, which is data obtained by dividing a road into sections, and holds the section distance, section attributes (road type (national road, general road, etc.), road width, etc.), and travel speed adjustment coefficient. Is. The adjustment coefficient is normally 1 and can be set by the user according to road conditions such as traffic congestion. 3 is an attribute and an adjustment coefficient. Reference numeral 4 denotes road point data, which is data in which connection sections are associated with points on the road. A speed table holding unit 10 holds a traveling speed corresponding to a road type and a width. 11 is a speed table. A route search unit 15 searches for a route from the departure point to the destination point and obtains a route with a short required time.

  Reference numeral 21 denotes processing for searching for a route from the departure point to the destination point. Reference numeral 22 denotes a process for calculating a required time for the searched route. Reference numeral 23 denotes processing for evaluating a route based on a required time and obtaining a route with the shortest time. Reference numeral 24 denotes processing for outputting the obtained route as an optimum route to the display unit. Reference numeral 25 denotes a display unit. Reference numeral 26 denotes an input unit.

  The route search unit 15 refers to the road data provided from the road data holding unit 1 based on the input departure point and destination point, and obtains the distance between the route from the departure point to the destination point and the obtained route. Then, a required time from the starting point to the destination point obtained based on the traveling speed and the adjustment coefficient corresponding to the attribute of the section data given from the speed table holding unit 10 is obtained, and a route with a short required time is output to the display unit 25. To do. For example, when the optimum route is obtained by the Dijkstra method, the other road point of the section connected to the departure point is obtained starting from the departure point. Then, referring to the speed table according to the attribute of each section connected to the departure point, the travel speed that can actually be moved is obtained. Further, the travel speed obtained in this manner is multiplied by an adjustment coefficient to obtain a travel speed close to the actual speed. Then, based on the travel speed, the section is obtained by the required time for moving the section and evaluated for each route, and the route having the shortest required time is selected as the optimum section. Next, the section and the time for moving the section are similarly determined for the road points thus determined, each section is evaluated, and a section that can move in the shortest time is determined. This process is repeated to find the route that reaches the destination point in the shortest time.

  The above speed table, for example, is preliminarily determined in consideration of the width of the road to the legal maximum speed of the road. However, the speed table is provided with a means for changing the speed table so that the user can check the traffic congestion situation, experience, etc. It can be changed on the basis. To change the speed table, the speed table is displayed on the display unit 25, and the user changes the set value on the display screen. For example, the adjustment coefficient is set to 1 at the time of product shipment, and can be set by the user according to the situation such as traffic congestion on the road. Alternatively, when a history about the moving speed and the moving point can be obtained, the adjustment coefficient may be changed based on the history information.

  Also, according to the above configuration, a route that can travel from the departure point to the destination point in the shortest time is output, and the most effective route in reality can be output. In addition, since the required time can be finely changed by the adjustment coefficient, a route search can be performed under conditions close to the actual travel time. In addition, since the user can easily change the speed table, it is possible to flexibly cope with actual road conditions.

  FIG. 2 shows the basic configuration of the present invention.

In FIG. 2, reference numeral 1 denotes a road data holding unit, which holds a detailed road data unit for all roads such as branch roads separated from the main road and the main road, and a main road data unit for only the main road in a hierarchical manner. . A route search unit 15 searches for a route from the destination to the main road around the destination, and obtains a point (satellite) on the main road around the destination and a route between the destination and the satellite. The search unit and the route from the starting point to the satellite or destination (when the destination is on the main road) are obtained based on the detailed road data and the main road data.
Reference numeral 10 denotes a speed table holding unit (necessary when evaluating a searched route with a required time, and not when evaluating with a distance). Reference numeral 25 denotes a display unit. Reference numeral 26 denotes an input unit.

  In the road data holding unit 1, 42 is a main road data unit. 43 is a detailed road data section. In the route search unit 15, 51 is a periphery search unit that searches the periphery of the destination using detailed road data, and obtains a road point (satellite) on the main road around the destination and a route between the destination and the satellite. It is. 52 is an all-route search unit that searches from the departure point to the road point on the main road near the departure point based on the detailed road data, and from that road point according to the main road data, the satellite or destination (destination) Route to the main road).

  53 is a route search process based on the detailed road data, and is a process for obtaining a route from the departure point to the road point (X) on the main road in the vicinity. 54 is a route search process based on the main road data. The route from the road point (X) on the main road near the departure point to the satellite (S) or the destination (when the destination is on the main road). Is searched according to main road data. 55 is a process for obtaining the optimum route by evaluating the searched route in the shortest route or in the shortest time. Reference numeral 56 denotes a process for outputting the obtained optimum route to the display unit.

  The operation of the configuration of FIG. 2 will be described. The route search unit 15 searches the route from the destination point to the road point on the main road in the vicinity by the surroundings search unit 51 based on the input departure point and destination point. Then, for example, the road points selected from the road points on the main road within a certain distance, for example, within 30% of the total number in the order found earlier are held as satellites. Further, a route search from the departure point to the destination point is performed by the all route search unit based on detailed road data or main road data. At that time, the search is started from the departure point, and the route search is performed based on the detailed road data until the road point (X) of the main road is reached. Next, from the road point (X) to the destination, a route search for the shortest distance or the shortest required time is performed while evaluating the search route based on the main road map. When the satellite or destination point (when the destination point is on the main road) is reached, the route is obtained. Furthermore, the route previously determined by the peripheral search is adopted from the satellite to the destination. The optimum route is the route having the shortest distance or the shortest required time for the searched route. This neighborhood search and all-route search are performed by, for example, the above-mentioned Dijkstra method, etc., and, as described above, the shortest distance of the sections extended while extending sections connected to road points one by one. This is performed by a method of searching for a route while obtaining a zone or a zone having the shortest time required to pass through the zone.

  According to the basic configuration of the present invention, the shortest route from the departure point to the destination point or a route close to the route with the minimum required time can be obtained at high speed. In particular, when there are multiple starting points and destination points, and each point is the starting point and destination point, and the optimal route between each point is determined, the satellites around each destination and its route are calculated. Therefore, the search time by detailed road data around the destination can be greatly reduced, and the route search to the destination can be performed at high speed.

  FIG. 3 shows an embodiment of the system configuration of the technical configuration related to the present invention. In FIG. 3, reference numeral 61 denotes a speed table holding unit, which is a magnetic disk device or the like that holds a speed table. 62 represents data of the speed table. A road data holding unit 63 is a CDROM or the like that holds road data. Reference numeral 64 denotes road point data. Reference numeral 65 denotes section data. Reference numeral 66 denotes a point data holding unit having data such as a destination point, a road point of a starting point, and its name (shop name, etc.), and is a magnetic disk device or the like. To specify). 67 represents point data.

  Reference numeral 71 denotes an evaluation table holding unit for holding the calculated evaluation value (shortest required time) of the route. 72 is a route search program for obtaining a route from a departure point according to road point data and section data, obtaining a distance for each section and a required time for passing the section (cumulative time for each section from the departure point) The route to reach the destination is selected by selecting a section that can be passed in the shortest time while evaluating the route by time. A route search unit 73 searches for a route from the departure point to the destination point. Reference numeral 74 denotes a required time calculation unit for calculating the required time to pass through the obtained section by referring to the obtained distance and speed table. A required time evaluation unit 75 evaluates the required time of the obtained section and obtains a section that can be passed in the shortest time. A route information holding unit 77 holds section data selected as the optimum route.

  Reference numeral 81 denotes a CPU. Reference numeral 82 denotes a memory. Reference numeral 83 denotes a display. 84 is a keyboard. 85 is a mouse. Reference numeral 91 denotes travel history information, which is a magnetic disk device, a memory card or the like that holds a travel record of the vehicle acquired by the in-vehicle device of the vehicle, and includes the travel date and time of the vehicle, the traveled position (latitude and longitude), It holds data such as travel speed. This is used when changing the adjustment coefficient of the speed table from the running record of the automobile. Reference numeral 92 denotes an adjustment coefficient changing means for changing the adjustment coefficient of the speed table from the travel history of the automobile. A speed table changing means 93 is used when the user changes the speed table. The operation of the system configuration shown in FIG. 3 will be described later.

  FIG. 4 shows an example of road segment data, road point data, and point data. The section data and road point data are held in a CDROM or the like. However, since the adjustment coefficient may be changed in the road section data, it is necessary to store the entire road section data or only the adjustment coefficient in an updatable medium. The point data is set by the user.

  Fig. 4 (a) shows an example of road segment data. The section data is data obtained by dividing the road into sections, having section numbers, connected road point numbers 1, connected road point numbers 2, section lengths, and attributes (highway, national highway type, road, etc.) , Etc.), and an adjustment factor for road travel speed. The adjustment coefficient has a default value of 1, but can be freely changed by the user based on traffic jam information, construction information, or experience (for example, 0.9, 0.65, etc. are set according to road conditions) To do). Alternatively, the adjustment coefficient can be changed based on the past travel history of the section based on the travel history of the automobile.

Fig. 4 (b) shows an example of road point data. The road point data has road point numbers and has section data (connection section numbers) connected to the road points.
FIG. 4 (c) shows an example of point data. The point data is composed of a departure point, a road point number of a destination point, a name (store name, etc.), etc., and is set by the user.
FIG. 5 is an example of a speed table. The traveling speed is determined in consideration of the width of the road for each road type.

  For example, when the road is a general national road and the legal maximum speed is 60 km / h, if the road width is 13.0 m or more, the traveling speed is 60 km / h. If the width is less than 13.0 m to 5.5 m or more, the speed is 55 km / h, if the width is less than 5.5 m to 3.0 m or more, the speed is 50 km / h, if the width is less than 3.0 m, it is 40 km, and 30 km on unexamined roads. This table can be displayed on the screen and can be changed by the user. Based on this speed table, the average speed of the section is calculated by “average speed = travel speed of the section × adjustment coefficient” of a certain road section. As described above, the adjustment coefficient has an attribute of the section data, has a default value of 1, and can be changed according to road congestion or a travel history.

  FIG. 6 is a diagram illustrating an example of an evaluation table and route information. FIG. 6 (a) is an example of an evaluation table, which has an evaluation value for each road point and the immediately preceding road point number. The evaluation value is the minimum value of the time required to pass through the section based on the average speed calculated based on the average speed of the section. The evaluation value is a cumulative value obtained by passing each road point from the departure point. It is.

  FIG. 6B is an example of route information, and has a passing road point number and a passing road point number at the position specified by the pointer and the pointer with the route information for each departure point and destination point. First, the maximum value (for example, 999999) is set as the evaluation value of all road points, and 0 is set as the evaluation value of the road points corresponding to the departure point. Find the road point with the smallest evaluation value (assumed to be A) among all road points, and find the time required to pass through the section based on the distance and attributes based on the section data connected to the road point. , And the total (cumulative required time) with the evaluation value of the road point is obtained. If the calculated accumulated time is smaller than the evaluation value of the other road point (assumed to be B) connected by the section, the evaluation value of B is regarded as the accumulated required time, and the previous road point number is A. . After this is performed for all the road sections connected from A, the road point with the smallest evaluation value is similarly obtained from all the road points, and the search operation is repeated. The evaluation table is the minimum accumulated time to each road point at that time, and the route to the departure point can be found by tracing the previous road point number. In this way, an evaluation table is created up to the destination point, and route information is created as shown in FIG. The road point number (passing road point number 0, passing road point number 1, etc.) selected from the departure point to the destination point is recorded in the route information.

FIG. 7 shows an embodiment when the configuration of the technology related to the present invention is applied to the Dijkstra method.
S1: The maximum value is set as the evaluation value for all road points in the evaluation table (initial value).
S2: The evaluation value of the road point that is the departure point is set to 0 (initial value).
S3: Check the road point with the smallest value (this is called the current road point).
S4: It is determined whether the current road point is a destination point (refer to the point data to determine whether or not it is a destination point). If it is not the destination point, the process after S5 is performed, and if it is the destination point, the process of S11 is performed.
S5: The evaluation target is connection section number 1.
S6: The evaluation value of the connecting road point that is not the current road point through the connecting section is obtained. The evaluation value is calculated by “evaluation value = evaluation value of current road point + (section length of connection section / travel speed × connection section adjustment coefficient)”. The traveling speed is obtained from the speed table according to the road type and width of the connected section.
S7: It is determined whether the evaluation value is smaller than the preset value. If it is smaller, the process of S8 is performed, and if it is not smaller, the process of S9 is performed.
S8: Set the evaluation value of the connected road point and the previous road point number in the evaluation table. Previous road point = current road point.
S9: It is determined whether there is still a connecting road at the current road point. If there is, the processing after S10 is performed, and if not, the processing after S3 is repeated.
S10: The process after S6 is repeated with the evaluation target as the next connection section.
S11: The evaluation value of the current road point is set as the required time. Traces the route information from the current road point in order to obtain the route information and outputs it.

  FIG. 8 is an explanatory diagram of the second embodiment and is an explanatory diagram of the embodiment of the basic configuration of the present invention.

  When there are many product delivery destinations and the optimum delivery route is to be obtained, there are a plurality of destination points, and it is necessary to obtain the shortest route or the route that passes through each point in the shortest time and returns to the departure point. In such a case, between the points (assuming that there are three points A, B, and C, A is the starting point, B and C are the destination points, and B is the starting point and C is the destination point) If a route that can travel in the shortest distance or the shortest time is obtained, it is convenient to obtain the order and route through the destination point. In this case, the second embodiment can obtain a route close to the shortest route between points at high speed.

Fig. 8 (a) is an image of the road data of the main road and the road data of the detailed road data superimposed. The thick line represents the main road, and the thin line represents the branch road separated from the main road. The point i represents a starting point or a destination point.
Fig. 8 (b) shows the road data of the main road. FIG. 8C shows detailed road data for all roads, including all roads including main roads and branch roads separated from the main roads.
In FIG. 8C, A, B, and C are points, and when obtaining the shortest route between AB and the shortest route between AC, A is a departure point and B and C are destination points. When obtaining the shortest route between BCs, B is the starting point and C is the destination point. When B is the departure point and A is the destination point, the same route is used when A is the departure point and B is the destination point. Similarly, when C is the starting point and A is B and the destination is B, the same route as when A or B is the starting point and C is the destination is the shortest route.

FIG. 9 is an explanatory diagram of a search around a destination point and a search around a departure point according to the second embodiment. FIG. 9A is an explanatory diagram of searching around a destination point. Point A is the destination point (the map is different from FIG. 8C). The route from the point A to the main road is obtained from the detailed road data. A road point (A ₁ , A ₂ , A ₃ ) on the main road within a certain distance is used as a satellite, and the road point and the route from the point A to the satellite are held.

  FIG. 9B is an explanatory diagram of route search around the departure point. B is a starting point (not corresponding to point B in FIG. 8). Starting from point B, the route search is started with the detailed road data, and after passing through the road points on the main road within a certain distance (X (multiple points may be present), B's own satellite) The shortest route to the destination point (when the destination point is on the main road) or the satellite is obtained from the road data.

  FIG. 9C is an example of display of the shortest path information (the shortest distance in the second embodiment) between the points A, B, and C in FIG. The information to be displayed is route information, and it is also possible to output road point passing information from the departure point to the destination point.

  FIG. 10 shows a system configuration of the second embodiment. In FIG. 10, reference numeral 63 denotes a road data holding unit, which is a CDROM or the like for holding road data. The detailed road data unit 110 and the main road data unit 111 are configured in a hierarchical structure. Reference numeral 66 denotes a point data holding unit which holds point data (a destination point, a road point of a point serving as a departure point, its name, and the number of satellites when it is a destination). 67 represents point data.

  Reference numeral 71 denotes an evaluation table holding unit which holds the obtained evaluation value of the route (the shortest route in the second embodiment). Reference numeral 72 denotes a route search program for obtaining the shortest route from the departure point to the destination point. A route information holding unit 77 holds the selected optimum route (section data).

  Reference numeral 81 denotes a CPU. Reference numeral 82 denotes a memory. Reference numeral 83 denotes a display. 84 is a keyboard. 85 is a mouse. In the road data holding unit 63, 110 is a detailed road data unit. Reference numeral 111 denotes a main road data section.

  In the route search program 72, reference numeral 121 denotes a peripheral search unit for obtaining satellites around the destination. Reference numeral 122 denotes an all-route search unit that obtains the shortest route from the departure point to the destination point or satellite. Reference numeral 123 denotes a route evaluation unit for obtaining the shortest route. Reference numeral 131 denotes a road point associated data holding unit for holding information such as a satellite source point number for each road point.

  The detailed road data section and main road data section of the road data holding section are composed of road point data and section data, but the configuration is the same as in FIG. The configuration of the evaluation table and the path information holding unit is the same as that in FIG. 6 and will not be described (however, in Example 2, the evaluation value is the shortest distance).

FIG. 11 shows an example of road point associated data and point data. FIG. 11 (a) is an example of road point associated data, in which satellites obtained by performing a peripheral search and a route from the destination point to the satellites generated at that time are held. The road point associated data has a point number, the number of satellites, each satellite source point number, and a pointer to route information for designating a position having the route information for each road point number (for example, FIG. 9 (a)). Since the point itself does not exist here for the road point number corresponding to satellite A ₂ , the point number has −1 which means nothing, and has route information between point A and satellite A ₃ . In addition, for the road point number corresponding to the destination point A, since the point number has the point A and there is no satellite, the number of satellites is 0). The number of passing points on the route and the number of passing road points are recorded at the location specified by the route information pointer. In addition, the obtained satellite can be reused when searching for the same destination point next time.

  FIG. 11B is an example of point data, and holds the road point number corresponding to each point number, the number of satellites, and the name (shop name, etc.). The number of own satellites is recorded based on the satellites obtained by the peripheral search (in the case of point A in FIG. 9A, the number of own satellites is 3). Also, the name of the point (shop name, etc.) is written by the user.

  In this embodiment, the search starts from the starting point, but does not start from the satellite at the starting point that has been obtained in advance. This is to prevent being lost.

  FIG. 12 is a flowchart of the overall processing of the route search program according to the second embodiment.

It is assumed that there are n points (A, B, C, etc. in FIG. 8) that are the targets of route search, from point 0 to point (n-1), and route search between n points is performed. S1 to S4 are processes for obtaining satellites around the destination point, and S5 to S8 are processes for searching all routes from the departure point to the satellite or the destination point.
S1: i is set to 0 (initial value).
S2: It is determined whether the surrounding search has been performed for n points. If all are performed (if i ≧ n), the process of S5 is performed. If not all (if i ≧ n), the process of S3 is performed.
S3: A search around the point i is performed by the peripheral search program (this process is set to (1)).
S4: i is set to i + 1, and the processes after S2 are repeated.
S5: i is cleared to 0, and the processing after S6 is performed.
S6: It is determined whether all routes have been searched for all the n points (determining whether i ≧ n) .If not i ≧ n, the process is not performed for all points, and the process of S7 is performed. If so, the process is terminated because it has been performed for all points.
S7: A route search is performed with the point i as a departure point, and a route to all other points (target points) is obtained.
S8: i is set to i + 1, and the processes after S6 are repeated.

FIG. 13 is a flowchart for searching for surrounding roads, and shows details of the process (1) in FIG. This process is performed on the detailed road data.
S1: A point number is set in the road point associated data of the road point corresponding to the point i.
・ S2: Maximize the evaluation value of all road points.
S3: The evaluation value of the road point corresponding to the point i is minimized.
S4: The road point with the smallest evaluation value is examined and set as the current road point.
S5: It is determined whether the peripheral search is finished. If not completed, the process of S6 is performed. If completed, the process is terminated. The termination determination condition depends on, for example, when six satellites are found.
S6: It is determined whether or not there is a main road corresponding to the current road point.
S7: Satellite information is set in the road point associated data of the current road point. That is, the spot number is set as the satellite source spot number. A passing road point number from the corresponding road point of the point i to the current road point is set.
S8: The road section connected from the current road point is evaluated, an evaluation value is set in the evaluation table, and the processes after S4 are repeated.

14 and 15 are flowcharts of the entire route search of the second embodiment, and are details of the process (2) in FIG.
S1: Maximize evaluation values for detailed roads and main roads (all roads).
S2: The evaluation value corresponding to the point i is minimized.
S3: The road point with the smallest evaluation value is checked, and this is set as the current road point.
S4: It is determined whether or not there is a point i at the current road point.
S5: Information on the passing road from the point i to the current road point is output as a route.
S6: It is determined whether there is a point (destination point) for which a route from the point i is not found. If there is, a process of S7 is performed, and if not, the process is terminated.
S7: It is determined whether or not there is a satellite (satellite at the destination point) at the current road point.
S8: It is determined whether the satellite source point has been obtained, and if so, the process of S10 ′ is performed, and if not, the process of S9 is performed.
S9: Link the information of the passing road point from the point i to the current road point and the information of the passing road point of the satellite to obtain a route to the satellite source point.
S10: It is determined whether there is a point for which a route from the point i is not found. If not, the process is terminated, and if it is, the process of S10 ′ is performed.
S10 ': It is determined whether there is still a satellite at the current road point.
S11: The road section connected from the current road point is evaluated, and an evaluation value is set in the evaluation table.
S12: It is determined whether or not to switch to the main road search. If the main road is to be switched, the process of S13 is performed. If the switch is not switched, the processes after S3 are repeated. The condition of whether or not to switch to the main road is determined by, for example, the condition that all the satellites at the point i (departure point) (the satellites obtained in the processing of (1)) have passed.
S13: If there is a corresponding main road among the road points of the detailed road, the evaluation value is copied to the main road. Subsequent search targets are main roads, and the processes after S3 are repeated.

  FIG. 16 shows a system configuration according to the third embodiment, in which the basic configuration of the present invention is evaluated in the shortest time.

  In FIG. 16, the common parts with FIG. 10 are common numbers. Reference numeral 61 denotes a speed table holding unit, which is the same as the speed table holding unit of the first embodiment shown in FIG. Reference numeral 71 denotes an evaluation table holding unit, which differs from the case of FIG. 10 only in that the evaluation value is the shortest time. Reference numeral 72 denotes a route search program, which differs from FIG. 10 only in that the route evaluation unit evaluates the route in the shortest time. A traveling history information holding unit 91 'is the same as the traveling history in FIG. Reference numeral 92 denotes adjustment coefficient changing means, which is the same as the adjustment coefficient changing means in FIG. Reference numeral 93 denotes speed table changing means, which is the same as the speed table changing means in FIG.

  The flowchart of the operation of the system configuration of FIG. 16 is the same as the flowcharts of FIGS. 12, 13, 14, and 15 except that the route is evaluated in the shortest time.

  FIG. 17 shows an embodiment of a speed table changing method and an adjustment coefficient changing method. FIG. 17A shows a speed table changing method. The speed table is displayed on the display 83 by the speed table display means 93 '. On the screen of the display 83, a field for changing the traveling speed is designated by the cursor by the input means 84 '(mouse, keyboard, etc.), and the traveling speed to be changed is input. The speed table changing means 93 changes the traveling speed in the field designated by the cursor of the speed table to the designated speed.

  FIG. 17B shows the adjustment coefficient changing method (1). The section data held in the road data holding unit 63 is displayed on the display 83 by the road data display means 93 ". The adjustment coefficient to be changed on the screen of the display 83 is designated with the cursor by the input means 84 'and the adjustment is changed. The adjustment coefficient changing unit 92 changes the adjustment coefficient of the designated section data in the road data holding unit 63 to a designated value.

  FIG. 18 shows an embodiment of the adjustment coefficient changing method. An adjustment coefficient changing method (2), in which the adjustment coefficient is changed based on the travel history information recorded in the travel history information holding unit 91 '.

  The adjustment coefficient changing means 92 obtains the traveling speed of the section where the adjustment coefficient is changed from the speed table (S1). The travel history information is input from the travel history information holding unit 91 '(S2). Compare the latitude and longitude of the travel location in the travel history information with the latitude and longitude data of the section of the road data, find the speed that actually traveled the section where the adjustment coefficient is changed, and find the average speed (the travel history information is If it has an ID common to the section ID of the road data, the actual traveling speed is obtained from the section ID) (S3). Then, the travel speed obtained from the speed table and the travel speed obtained from the travel history information are compared to obtain an adjustment coefficient (for example, take a ratio) (S4). Then, the adjustment coefficient changing unit 92 changes the adjustment coefficient for the section of the road data holding unit 63 with the obtained adjustment coefficient (S5).

It is a figure which shows the structure of the technique relevant to this invention. It is a figure which shows the basic composition of this invention. It is a figure which shows the Example of the system configuration | structure of the structure of the technique relevant to this invention. It is a figure which shows the Example of the data of a road area, road point data, and point data. It is a figure which shows the example of a speed table. It is a figure which shows the example of an evaluation table and route information. It is a figure which shows the flowchart (Dijkstra method) of Example 1. FIG. FIG. 6 is an explanatory diagram of Example 2. FIG. 6 is an explanatory diagram of Example 2. FIG. 3 is a diagram illustrating a system configuration of a second embodiment. It is a figure which shows the example of road point accompanying data and point data. FIG. 10 is a diagram illustrating an overall flowchart of the second embodiment. It is a figure which shows the flowchart of the route search around the destination point. It is a figure which shows the flowchart (the 1) of all the route searches of Example 2. FIG. It is a figure which shows the flowchart (the 2) of all the route searches of Example 2. FIG. It is a figure which shows Example 3 of a system configuration. It is a figure which shows the Example of the change method of a speed table, and the change method of an adjustment coefficient. It is a figure which shows the Example of the change method of an adjustment coefficient.

Explanation of symbols

1: Road data holding unit 2: Section data 3: Attributes, adjustment coefficient 4: Road point data 10: Speed table holding unit 11: Speed table 15: Route search unit 25: Display unit 26: Input unit 42: Main road data unit 43: Detailed road data section

Claims (5)

An input unit for inputting a destination point and a starting point, a road data holding unit for storing road data, and a route search for finding a route from the starting point to the destination point based on the road data. And an optimal route search method in a route search device comprising an output unit that outputs route information of an optimal route,
The route search unit
A peripheral search unit that searches for a route from the point of interest to a main road in the vicinity based on the detailed road data;
An all-route search unit capable of performing a route search with the selected road data of the detailed road data and the main road data;
The route search unit
A satellite which is a road point selected from road points on a main road around the destination by the peripheral search unit;
When the route from the starting point to the surrounding main road is searched by the detailed road data by the all route search unit, and the satellite or the destination point is on the main road from the road points on the main road thus obtained The optimal route search method is characterized in that the route to the destination point is searched from the main road data to find the optimal route. The route search unit
2. The optimum route searching method according to claim 1, wherein the optimum route is evaluated based on the distance of the route, and the route closest to the shortest distance is set as the optimum route. The route search device
It has a speed table that shows the speed of moving the route,
The route search unit
The optimal route search method according to claim 1, wherein a route is evaluated based on a time required to travel the calculated optimal route using the speed table, and a route that is close to the shortest time is determined as the optimal route. The route search unit
When there are multiple starting and destination points, the optimal route between each point is determined using each point as the starting point and destination point.
The output unit is:
The optimal route search method according to claim 1, 2, or 3, wherein the optimum route information between the obtained points is output. The route search unit
5. The optimum route searching method according to claim 1, wherein the obtained satellite is stored and reused at the next search.

Images