JPH1164022A - Method for deciding route of network and road route deciding device - Google Patents

Abstract

PROBLEM TO BE SOLVED: To provide a method and device for deciding an optimum route on such network as road with less stored quantity of data stored in a short time. SOLUTION: An input device 2 for taking in a point information, a first storage device 4 where such digital map information as representing a road network is stored a second storage device 5 where an optimum route information between representative intersections is stored, a route decision processing part 1, wherein an optimum route between the points taken in by an input device 2 is decided using an information stored in the two kinds of storage devices 4 and 5, and a display device 3 for displaying the decided route, are constituted.

Description

DETAILED DESCRIPTION OF THE INVENTION

[0001]

BACKGROUND OF THE INVENTION 1. Field of the Invention The present invention relates to the determination of an optimal route such as a shortest route on a network such as a road network, and more particularly to a route determination method and apparatus suitable for a wide range of objects.

[0002]

2. Description of the Related Art The problem of determining an optimum route in a road network is a problem of determining a route having a shortest distance between two points or a plurality of points in a car navigation, a delivery plan or the like. In situations where this issue needs to be resolved,
In many cases, the real-time property is strong, and thus a solution in a short time is required. Conventionally, the Dijkstra method or a method using a neural network has been used to achieve the above. For example, it is detailed in the literature "System analysis method for planning" (Technical Shoin).

A typical processing procedure according to the conventional method is shown in FIG.
0 is shown. In process S _2, for example by using a Dijkstra method, to search for the best candidate route. When A and B are close to each other, a solution can be obtained in a relatively short time, but when they are far from each other, a long time is required because it is necessary to check a huge number of combinations of roads and intersections. The Generally performs rough search, the process S _3, if is better ,, this searched proposal compared to other candidate, the processing S _4, replacing the current draft as an optimal solution candidate. In this way, the best idea that remaining after repeating several times the process S ₂ to S ₄ under processing S ₁ in the process S ₅ outputs as the shortest path. When the conventional method as described above is used, there is a problem that not only the processing time is long but also the processing time depends on the distance between two points. Due to these problems, car navigation and DRGS (Dynamic Route Guidance System, Dynamic Rout
e Guidance System) is difficult to use, but at present it is used because there is no other method.

[0004]

The basic idea of the conventional method is to determine a route following a road and an intersection between two points based on digital map information representing a road network. A plurality of different path candidates are examined, and a solution in which a target item (hereinafter, referred to as an objective function) has a maximum or a minimum is determined as a solution. When this method is used, a solution can be obtained in a short time when the road network is simple and two points are close to each other, but when the road network is complicated or the two points are far apart. Takes a long time.

[0005] As another method, a conventional optimal route between registered points is calculated in advance and stored in a large-capacity storage device so that it can be referred to immediately if necessary. A method of making the apparent calculation time almost zero has also been put to practical use. If the number of registered points (delivery destinations, etc.) is about 100, the required number of routes is 10
Since 0 × 100 = 10,000 (streets) is sufficient, it is realistic. However, actual car navigation and delivery plans require at least 10,000 or more. The required number of routes in this case is 10,000 × 10,000 = 10 ⁸
If the number of roads and intersections included in one route is 1000 on average, at least the order of information on roads and intersections exceeds 10 ^11, and it is difficult to store them in a practical storage device.

Accordingly, the present invention provides a method of the related art, comprising:
In particular, it is an object of the present invention to provide a method and an apparatus for solving the problems of processability and storage data amount and determining an optimal route on a network such as a road in a very short time with a small storage data amount. .

[0007]

According to the present invention, there is provided a method for determining a shortest path between any two points on a network having nodes and links, the method comprising the steps of: When a plurality of shortest link strings connecting between representative nodes defined in the area, which are obtained as the shortest paths, are stored in the storage device, and given two arbitrary nodes for which the shortest paths are to be obtained, This 2
A method for determining a representative node closest to a point node, searching for and reading a shortest link sequence that is a shortest path between the two representative nodes from the storage device, and determining a path. Is disclosed.

Further, according to the present invention, in a method of determining the shortest path between any two points on a network having a node and a link, the shortest path is determined as each shortest path between all areas in a subdivided network area. In addition, when a plurality of shortest link strings connecting representative nodes defined in an area are stored in a storage device, and given any two nodes for which a shortest route is to be obtained, these two nodes are provided. , A shortest link sequence, which is the shortest path between the two representative nodes, is searched and read from the storage device, and a link sequence from the input two nodes to the closest representative node is searched. A route determining method for a network, characterized in that a route added to the read shortest node sequence is set as a shortest route, is disclosed.

Further, the present invention provides a method for determining an optimum route between any two points on a network having a node and a link, wherein the optimum route is determined as an optimum route between all areas in a subdivided network area. In addition, when an optimal link sequence for each optimal condition that connects representative nodes defined in an area is stored in a storage device, and given two arbitrary nodes and optimal conditions for which an optimal route is to be obtained,
A representative node closest to the two nodes is determined, and an optimal link sequence, which is an optimal route, between the two determined representative nodes and corresponding to the optimal condition is searched and read from the storage device. A method for determining a route of a network is disclosed.

Further, according to the present invention, in a method for determining an optimum route between arbitrary two points on a network having a node and a link, the optimum route is obtained as each optimum route between all areas in a subdivided network area. In addition, when an optimal link sequence for each optimal condition that connects representative nodes defined in an area is stored in a storage device, and given two arbitrary nodes and optimal conditions for which an optimal route is to be obtained,
The representative node closest to the two nodes is determined, and an optimal link sequence, which is an optimal route between the two determined representative nodes and corresponds to the optimal condition, is searched and read out from the storage device, and the input is performed. A route determination method for a network, characterized in that a route added to an optimal node sequence obtained by searching and reading a link sequence from two nodes to the nearest representative node is set as an optimal route, is disclosed.

Further, the present invention relates to a road route determining device for obtaining and displaying the shortest route between two given points on a road network, an input device for taking in point information, and a digital map information representing the road network. , A second storage device for storing the shortest route information between representative intersections set for each sectioned area on the road network, and a shortest distance between the points captured by the input device. A road route, comprising: route determining means for determining a route using information stored in the first and second storage devices; and a display device for displaying the determined route. A determination device is disclosed.

Further, according to the present invention, the route determining means finds a representative intersection closest to the given two points, and then searches the information in the second storage device for the shortest route between the found representative intersections. A road route determination device is disclosed, wherein a shortest route between two points is determined by joining a route from the two points to the nearest representative intersection with a route between the representative intersections.

Further, the present invention provides a road route determining device for obtaining and displaying an optimum route between given two points on a road network, and an input device for capturing point information and optimum conditions, and a road network. A first storage device for storing digital map information, a second storage device for storing optimum route information for each optimum condition between representative intersections set for each sectioned area on the road network, and the input device Determining means using information stored in the first and second storage devices to determine an optimum route between the points taken in by the method and according to the optimum condition, and a display for displaying the determined route And a device for determining a road route, comprising:

Further, according to the present invention, the route determining means obtains a representative intersection closest to the given two points, and then stores the optimum route between the obtained representative intersections and according to the optimum condition in the second storage device. A road route determination device, wherein a route from the two points to the nearest representative intersection is joined to a route between the representative intersections to determine an optimal route between the two points. Disclose.

According to the present invention, an optimum route such as the shortest route between any two points in a wide area road network can be obtained in a very short time. Here, “optimal” refers to a route that changes depending on requirements and circumstances, but has a shortest distance or a minimum (travel) operating time at least under certain conditions.

[0016]

DETAILED DESCRIPTION OF THE PREFERRED EMBODIMENTS FIG. 1 shows an embodiment of a route determining apparatus according to the present invention. The present device includes an input device 2 for capturing position information of at least two points requesting an optimal route, a first storage device 4 for storing digital map information for displaying a previously created road network, and an optimal device for a representative intersection. Second storage device 5 for storing route information
A route determination processing unit 1 that determines an optimal route between points captured by the input device 2 using information stored in the two types of storage devices; and a display that displays the determined route. It is composed of the device 3.

Here, the storage devices 4, 5 and the processing section 1 will be described. Even when considering the entire country, the first
The digital map information stored in the storage device 4 is a finite amount that can be stored in a storage medium such as a CD-ROM, a DAT, or a DVD that is put into practical use. This is arbitrarily set as a two-dimensional division, for example, glue pink at a fixed size. The glued pink area is further glued in a certain size. In the grouped area in this way, a representative intersection is determined such that the intersection density or the area of the area is constant and the number thereof is, for example, within 5000. Next, an optimum route such as the shortest route between representative intersections in each grouped area is determined and stored in the second storage device 5. The optimal route data amount such as the shortest between representative intersections created in this way is a size that can be stored in a practical storage device. When two points A and B are arbitrarily given, the route determination processing unit 1 searches for a representative intersection closest to each point. The time required for this process is extremely short. If a nearby representative intersection is determined, the optimum route such as the shortest route can be obtained by referring to the second storage device 5, so that it is not necessary to calculate the route again. By performing the above processing, the optimum route is determined in a very short time even when a completely unknown point is input.

In the conventional delivery plan system for delivery to Takkyubin or factories / offices, when new delivery destination information is registered, it is necessary to create a route between registered delivery destinations each time, which is extremely convenient. Although the method is low, it is not necessary to generate the route information every time the destination is registered. In other words, even when a large number of destinations are added, changed, or deleted, it is not necessary to recalculate the route between the destinations, so that replanning can be performed immediately. By using the present invention, a route plan can be presented instantaneously in the shortest route support logic in car navigation, which is becoming widespread, or in the optimal route guidance processing in DRGS (dynamic vehicle route guidance system) as public infrastructure. it can. This indicates that not only can the service of each user be improved, but also that each vehicle can be given an accurate presentation.

First, in the road network shown in FIG. 7, a set of roads and intersections is grouped so as to cover the entire target area. This may be a uniform mesh determination in two dimensions. At least one or more representative intersections are selected in the grouped area in this manner. In this example, points 1 to 24 are selected, which indicates that the area is well covered. Next, FIG.
As shown in FIG. 7, the shortest route between all the representative intersections 1 to 24 is calculated in advance when offline, and the second storage device 5
To be stored. For example, as shown in FIG.
The shortest route to 19 is made up of 18 links from road numbers (hereinafter link numbers) 2 to 19. In the same manner, the route information for all combinations of the representative intersections is calculated and stored in the second storage device 5. FIG. 9 is an example of data when a road having a width of 5 m or more, which is required for a large vehicle of 10 tons or more, is used. In this way, a database for each required requirement may be created hierarchically in advance.

FIG. 2 is a diagram showing a processing procedure of the route determining apparatus 1 according to the present invention. This will be described with reference to FIG. First,
At process S ₁ using a digital map data in the first storage device 4, to search for a representative intersection C ₁ closest to the point A. In the example of FIG. Then find the closest representative intersection C ₂ to point B in the process S _2. In the example of FIG. Then treated S ₃ refers to the second storage device 5, it takes out the shortest path from point 1 19. Finally, in processing S _4, a representative intersection determined by the processing S ₁ and the processing S ₂ before and after the link row of shortest path from point 1 19 1,1
The detailed link sequence for 9 is joined and output to the display device 3. In the above processing, the repetition processing is processing S ₁ ,
It is only S _2, and extremely low since the number of repetitions is to occur only limited mesh area, and the point A, does not depend on the distance B. Fig. 5
The same applies to the case where a condition that a road width of 5 m or more is used occurs as shown in FIG.

FIG. 6 shows a column in which a large number of destinations and destinations are set in the vehicle allocation planning problem and the visit planning problem. As described above, even if the number of planning objects is enormous, the information to be stored is small and constant because it does not depend on the number of planning objects. If the circle in FIG. 6 is a running vehicle, appropriate route guidance can be instantaneously output to all vehicles, so that an advanced traffic control system can be realized.

Although the shortest path has been described above, the path can be extended to an optimum path in general. The optimum route is as follows depending on the optimum condition.・ Minimum distance, ・ Minimum time, ・ Comfort (from the viewpoint of selecting a route that allows you to relax slowly and enjoy the scenery even if the distance and time are not minimum) ・ Minimum fuel consumption, etc. The condition of the road of 5 m or more can be considered as one of such optimum conditions. By obtaining the optimum route according to the optimum conditions in advance and making it into a database, the input of the two points and the input of the optimum conditions allow the optimum route to be immediately known, and the rapid operation of the automobile,
It is now possible to operate on demand. Further, such a concept can be applied to a general network as data other than roads.

[0023]

According to the present invention, there is an effect that an optimum route between many points can be determined in a very short time.

[Brief description of the drawings]

FIG. 1 is a diagram showing an embodiment of the present invention.

FIG. 2 is an example of a processing procedure according to the present invention.

FIG. 3 is an example diagram of a road network based on digital map information.

FIG. 4 is a diagram showing an example of the shortest route from point A to point B when all roads are targeted.

FIG. 5 is a diagram showing an example of a shortest route from a point A to a point B by a road having a road width of 5 m or more.

FIG. 6 is a diagram showing an example of a situation where a large number of destinations are set.

FIG. 7 is a setting example diagram of a representative intersection.

FIG. 8 is a diagram showing shortest route database information for all roads.

FIG. 9 is a diagram showing shortest route database information of a road having a road width of 5 m or more.

FIG. 10 is a diagram showing an example of a processing procedure according to a conventional method.

[Explanation of symbols]

 Reference Signs List 1 route determination processing unit 2 input device 3 display device 4 digital map data 5 storage device

Claims (9)

[Claims] 1. A method for determining a shortest path between any two points on a network having a node and a link, wherein the area is determined as the shortest path between all areas in a subdivided network area. In the storage device, a plurality of shortest link strings connecting the representative nodes defined in are stored in a storage device, and given any two nodes from which the shortest path is to be obtained, the closest to the two nodes is given. Find the representative node,
A shortest link sequence that is the shortest route between the two representative nodes thus obtained is searched and read out from the storage device, and a route is determined. 2. A method for determining a shortest path between two arbitrary points on a network having a node and a link, the area being obtained as the shortest path between all the areas in the subdivided network areas. In the storage device, a plurality of shortest link strings connecting the representative nodes defined in are stored in a storage device, and given any two nodes from which the shortest path is to be obtained, the closest to the two nodes is given. Find the representative node,
The shortest link sequence that is the shortest path between the two representative nodes is searched and read from the storage device, and the link sequence from the input two-point node to the closest representative node is added to the shortest node sequence searched and read. A route determination method for a network, wherein a route is a shortest route. 3. Instead of providing two nodes, arbitrary coordinates or positions are input, two nodes close to the coordinates or positions are obtained, and a storage device is searched from the obtained two nodes. 3. The method according to claim 1, wherein the shortest node sequence between the two points is read. 4. A method for determining an optimum route between any two points on a network having a node and a link, wherein the area is obtained as an optimum route between all areas in a subdivided network area. In a storage device, an optimal link sequence for each optimal condition, which connects the representative nodes defined in, is stored. A representative node closest to the node is determined, and an optimal link sequence that is an optimal path between the two determined representative nodes and corresponding to the optimal condition is searched and read out from the storage device to determine a path. Characteristic network route determination method. 5. A method for determining an optimal route between two arbitrary points on a network having nodes and links, wherein the area is obtained as an optimal route between all areas in a subdivided network area. In a storage device, an optimal link sequence for each optimal condition, which connects the representative nodes defined in, is stored. Is searched for and read out from the storage device an optimal link sequence which is an optimal route between the two representative nodes obtained and corresponding to the above-mentioned optimal condition. A route determination method for a network, characterized in that a route added to an optimal node sequence obtained by searching and reading a link sequence from a node to a nearest representative node is set as an optimal route. 6. A road route determination device for obtaining and displaying a shortest route between two given points on a road network, wherein an input device for capturing point information and digital map information representing the road network are stored. A first storage device, and a second storage device that stores respective shortest route information between the representative intersections set for each sectioned area on the road network.
A storage device, and a route determining means for determining the shortest route between the points captured by the input device using information stored in the first and second storage devices; and displaying the determined route. A road route determination device, comprising: 7. The route determining means finds a representative intersection closest to the given two points, and determines a shortest route between the found representative intersections by searching information in the second storage device. 7. The road route determination device according to claim 6, wherein a route from the two points to the nearest representative intersection is joined to a route between the representative intersections to determine a shortest route between the two points. 8. A road route determination device for obtaining and displaying an optimum route between given two points on a road network, an input device for capturing point information and optimum conditions, and digital map information representing the road network. A first storage device for storing the optimum route information for each optimum condition between the representative intersections set for each sectioned area on the road network, and a second storage device for storing the optimum route information. Route determination means for determining an optimal route between the points and according to the optimal condition using the information stored in the first and second storage devices; a display device for displaying the determined route; A road route determination device, comprising: 9. The route determining means obtains a representative intersection closest to the given two points, and determines an optimum route between the obtained representative intersections and in accordance with the optimum condition in the second storage device. 9. The road route determination according to claim 8, wherein information is retrieved and determined, and a route from the two points to a nearest representative intersection is joined to a route between the representative intersections to determine an optimal route between the two points. apparatus.