JPH1183514A - Route search equipment and route search method - Google Patents

Abstract

PROBLEM TO BE SOLVED: To prevent transference in a toll road section of uniform charge, by detecting the transference from the inside of road link constituting a search route to the same uniform charge section, and changing the transference section to a route using only the toll road of uniform charge. SOLUTION: Road map data containing the attribute of a road link are previously stored, e.g. in a storage device mounted on a vehicle. A controller obtains an entering link which reaches most quickly from a start point node to a destination point node when the destination point is set, and forms a guidance route. Next, from the destination point node side, the most quickly entering link is obtained in order. When the most quickly entering link is a uniform charge line and a toll road ID is not registered, it is registered. When the same toll road ID exists in uniform charge toll road registration ID stack, it is judged that transference exists in the same uniform charge section. The part between terminal nodes of the link of the same toll road ID is route-operated, as the toll road of the same ID only is used, and the guidance route searched in advance is changed.

Description

DETAILED DESCRIPTION OF THE INVENTION

[0001]

BACKGROUND OF THE INVENTION 1. Field of the Invention The present invention relates to a route search device and a route search method for searching for an optimum route from a current position to a destination.

[0002]

2. Description of the Related Art A passenger is given a choice of whether to search for a route to a destination by giving priority to a toll road, and if toll road priority is selected, the cost of a toll road link is reduced. There is known a route search device that performs a route search and preferentially selects a toll road.

On a toll road, such as an expressway between cities, for which tolls are set in proportion to the distance, after getting off the toll road, it is necessary to "re-start" the toll road again via a general road. Even if a proper route is set, if the time required to reach the destination is shorter, an extra toll is not paid, and the route is evaluated as a proper guide route.

[0004] However, on an expressway in a city, there is a case where a uniform toll system is used for each line such as the Metropolitan Expressway. You will have to pay, and even if the time required to reach your destination is reduced, double payment of tolls will not be tolerated by the crew.

If the conventional route search device described above is to prevent re-riding in a uniform toll section, there is no data relating to the uniform toll section in the link attribute of the conventional road map data. It is not possible to distinguish between toll roads and toll roads with a flat fee system,
When toll roads are prioritized, link costs on all toll roads will be significantly reduced. However, in such a case, for example, when a highway between cities is largely detoured, such a way is required even though once via a general road, the time required is shorter and there is no need to pay extra tolls. A route via a general road is not searched, but a route using a large intercity expressway is searched.

An object of the present invention is to provide a route search device and a route search method for preventing re-starting in a toll road section with a flat fee.

[0007]

[Means for Solving the Problems]

(1) A storage means for storing road map data having uniform toll section data as an attribute of a road link, and a route search means for searching for a route to a destination based on the road map data. Link extracting means for extracting a toll road link having a uniform toll from among the road links constituting the search route, and searching for the extracted toll road link having a uniform toll to detect re-starting to the same flat toll section. There is provided a re-take detecting means and a route changing means for changing a road section where the search route is re-taken into a route using only the toll road with the same toll. (2) The flat fare section data of the route search device according to claim 2 includes an ID for each flat fare section. (3) According to a third aspect of the present invention, there is provided a route search process for searching for a route to a destination based on road map data having uniform toll section data as attributes of the road link, Link extraction processing for extracting a toll road link with a uniform toll from the vehicle, reconnection detection processing for searching for the extracted toll road link with a uniform toll and detecting re-entry to the same flat toll section, and riding on a search route A guidance route is searched for by performing a route change process of changing a fixed road section to a route that uses only the toll road with the same toll. (4) The flat fare section data used in the route search method according to claim 4 includes an ID for each flat fare section.

[0008]

According to the present invention, it is possible to permit re-starting on a toll road with a toll system proportional to the distance, while prohibiting re-starting on a toll road with a uniform toll system. A route can be searched, and double payment of tolls can be avoided.

[0009]

FIG. 1 shows a configuration of an embodiment. The controller 1 includes a microcomputer and peripheral components such as a memory, and executes a program described later to search for a route to a destination. The controller 1 includes a direction sensor 2, a distance sensor 3, a GPS receiver 4,
The communication device 5, the storage device 6, and the input device 7 are connected. The direction sensor 2 detects the traveling direction of the vehicle, and the distance sensor 3 detects the traveling distance of the vehicle. The GPS receiver 4 receives a GPS signal from a satellite and detects a current position, a traveling direction, and the like of the vehicle.

The communication device 5 communicates with facilities outside the vehicle, and receives road traffic information and dynamic guidance route information. The communication device 5 includes a beacon transceiver for communicating with a roadside beacon transceiver, an FM receiver for receiving FM multiplex broadcasting, a vehicle-mounted telephone for communicating with a telephone base station, and the like.
Road traffic information for RGS (Locally Dynamic Route Guidance System) and C-DRGS (Centrally Dynami)
c Obtain the dynamic guidance route information of the Route Guidance System). Here, L-DRGS is a system that calculates a dynamic guidance route on the vehicle side based on road traffic information provided from outside the vehicle. Also, C-DRGS is a system that sends destination information to a road traffic information center outside the vehicle, calculates a dynamic guidance route that takes the road traffic information into account, and receives the dynamic guidance route resulting from the calculation on the vehicle side. .

The storage device 6 stores the road map data.
The input device 7 is a device such as a D-ROM, and is a device for inputting a destination, the possibility of a route change, and the like. The controller 1 is also connected with a display 8 for displaying a road map and character information, and a speaker 9 for performing voice guidance.

The road map data including the attributes of the road links as shown in Table 1 is stored in advance in the storage device 6 mounted on the vehicle or the storage device (not shown) of the road traffic information center.

[Table 1] The link attributes of the road map data include a road link number, a toll road ID if the link is a toll road, a link start node number, a link end node number, a link cost, and a "flat fare line flag". included. Toll road ID is a unique number for each toll road line (excluding 0)
Assign. However, even if the route has the same name, if it is divided into a plurality of sections, a different ID is assigned to each section. Also, even if routes with different names are treated as flat fare sections, the same ID
Assign. For a toll road of a uniform toll system, 1 is set to the flat toll route flag, and for other toll roads and general roads, 0 is set to the flat toll route flag. In the example of Table 1, the link 2653 is the toll road 65 with a flat fee.

FIGS. 2 and 3 are flowcharts showing a route search program. The controller 1 includes an input device 7
When the destination is set and a route search start operation is performed, the execution of the route search program is started. In step 1, an incoming link reaching each node from the departure node toward the destination node is obtained by the well-known Dijkstra method, and the node number and the earliest incoming link number are stored in the memory as shown in Table 2. .

[Table 2] In step 2, it is confirmed whether or not the destination node has been reached. If the destination node has been reached, the process proceeds to step 3, otherwise, the process returns to step 1 to continue the route search. When the vehicle reaches the destination node, in step 3, the ingress link is returned from the destination node to the departure node, and a guidance route is generated.

At step 4, the earliest incoming link is read from the memory in order from the destination node side, and the processing of steps 5 to 11 is performed. First, in step 5, it is checked whether the flat fare route flag of the earliest incoming link is 1; if it is 1, the process proceeds to step 6; otherwise, the process proceeds to step 7. If the flat fare line flag of the link that has entered the earliest entry is 1, it is checked in step 6 whether the toll road ID of the link is registered in the "flat fare toll road ID registration area" of the memory. If the toll road ID of the link is registered, the process proceeds to step 11, and if not, the process proceeds to step 8. Note that the initial value of the flat fee toll road ID registration area is set to 0.

[0015] The flat fee route flag of the earliest approach link is 1
If the toll road ID is not registered, the toll road ID of the link is registered in the flat toll road ID registration area in step 8. In the following step 9, as shown in Table 3, the toll road ID of the link is loaded on the "uniform toll road registration ID stack".

[Table 3] Further, in step 10, as shown in Table 3, the "end node stack of flat toll road link" is loaded with the end node number of the link. Note that the toll road ID and the end point node number accumulated in each memory stack can be referred to the corresponding link numbers. On the other hand, if the flat toll road flag is 0, the flat toll road ID registration area is reset to 0 in step 7. In step 11,
It is checked whether the above processing has been completed up to the departure point node, and if completed, the process proceeds to step 12, and if not completed, the process returns to step 4 to read the next earliest approach link,
Perform the above processing.

At step 12, the presence or absence of the same toll road ID is searched from the top of the flat toll road registration ID stack shown in Table 3. That is, it is checked whether or not the user has re-rided on the same toll road via a general road after getting off the toll road with a flat fee. Step 13
Then, if there is the same toll road ID, it is determined that the vehicle is re-starting in the same uniform toll section, and the process proceeds to step 14. Then, the route calculation is performed between the end nodes of the links having the same toll road ID assuming that only the toll road with that ID is used, and the previously searched guidance route is changed to the route of the calculation result. In the example shown in Table 3, link 5321 and link 35
2 is the same toll road ID 23, and the toll road section (I
At D23), he is re-riding. Therefore, the route calculation is performed assuming that only the toll road with ID 23 is used between the end nodes of these links, and the searched guidance route is changed to the route of the calculation result. In a succeeding step 15, the link data between the links subjected to the processing in the step 14 is deleted from the flat fee toll road registration ID stack and the end node stack of the flat fee toll road link, and the stack is packed. In the example shown in Table 3, toll road 2 having the same ID
The link 6954 between the third links 5321 and 352 is deleted. Thereafter, the process returns to step 13, and steps 14, 1
The processing of step 5 is performed until the same toll road ID disappears from the stack. If there is no more toll road ID, the process proceeds to step 16, where the route at that time is set as a guidance route, and the process is terminated.

As described above, the toll road ID and the data of the flat toll section are added to the attributes of the road link in the road map data, and the constituent links of the guide route searched by the Dijkstra method are searched to ride on the same flat toll section. Check to see if any corrections have been made. If there is a re-establishment on the same flat toll line, route computation is performed assuming that the re-launched road section uses only the toll road, and the previously searched guidance route is changed to the route of the computation result. As a result, it is possible to prohibit re-starting on a toll road with a toll road that is proportional to the distance, while prohibiting re-starting on a toll road with a uniform toll system, and search for an optimal guidance route. In addition, double payment of tolls can be avoided.

In the above-described embodiment, an example in which the vehicle searches for a guidance route has been described.
-It can be applied to the route search performed by the road traffic information center in DRGS. Further, the present invention can be applied to both a dynamic guidance route and a static guidance route. Furthermore, the route search device of the present invention is not limited to vehicles.

In the configuration of the above embodiment, the storage device 6 constitutes a storage means, and the controller 1 constitutes a route search means, a link extraction means, a return detection means, and a route change means.

[Brief description of the drawings]

FIG. 1 is a diagram showing a configuration of an embodiment.

FIG. 2 is a flowchart showing a route search program according to one embodiment.

FIG. 3 is a flowchart showing a route search program according to one embodiment, following FIG. 2;

[Explanation of symbols]

 DESCRIPTION OF SYMBOLS 1 Controller 2 Orientation sensor 3 Distance sensor 4 GPS receiver 5 Communication device 6 Storage device 7 Input device 8 Display 9 Speaker

Claims (4)

[Claims] 1. A storage means for storing road map data provided with uniform toll section data as an attribute of a road link; a route search means for searching for a route to a destination based on the road map data; Link extracting means for extracting a toll road link with a uniform toll from among the road links constituting the above, and a re-riding for retrieving the extracted toll road link with a uniform toll and detecting re-entry to the same flat toll section A route search device comprising: a detection unit; and a route change unit that changes the re-taken road section of the search route into a route that uses only the toll road with the flat fee. 2. The route searching device according to claim 1, wherein the flat fare section data includes an ID for each flat fare section. 3. A route search process for searching for a route to a destination based on road map data having uniform toll section data as an attribute of a road link; A link extraction process for extracting a toll road link; a reconnection detection process for retrieving a toll road link of the extracted uniform toll and detecting a reconnection to the same uniform toll section; A route search method characterized by searching for a guide route by performing a route change process of changing a certain road section into a route using only a toll road with the same flat fee. 4. The route search method according to claim 3, wherein the flat fare section data includes an ID for each flat fare section.