JPH02244399A - Path search device - Google Patents

Abstract

PURPOSE:To search for the shortest required time path in consideration of time loss due to right turning and left turning searching the path in the order of the shortest required time by employing the time, obtained by adding the time required to travel between intersections and the time required for right turning and left turning in an intersection, as the necessary time. CONSTITUTION:A search means 103 inputs a start point and a destination from a point input means 101 and map data required to search for the path are read out of a map data recording means 102. Then at least >=1 path from the start point to the destination is searched in the order of the shortest required time by employing the time, obtained by adding the time required to travel between intersections and the time required for right turning and left turning in an intersection, as the necessary time. Consequently, the search is made in the order of the shortest required time by employing the time, obtained by adding the time required to travel between intersections and the time required for right turning and left turning in an intersection, as the necessary time, so the shortest necessary time is obtained when an actual travel is made on the path and the path where an easy travel is possible while neither unnecessary right nor left turning is required can be searched for.

Description

DETAILED DESCRIPTION OF THE INVENTION Field of the Invention The present invention relates to a route search device used by a vehicle driver to find a route from a departure point to a destination.

BACKGROUND OF THE INVENTION In a vehicle using a conventional route searching device, a device for searching the route the vehicle should travel is, for example, disclosed in Japanese Patent Laid-Open No. 6
There is a vehicle route guidance device disclosed in Japanese Patent No. 2-60100.

This vehicle route guidance device is a route search device that searches for the shortest time required route from a departure intersection to a destination intersection based on the required time for each of a pair of adjacent registered intersection sections.

Problems to be Solved by the Invention However, a route searched only based on the time required for each intersection section does not take into account the time required for right and left turns or the number of right and left turns, and the shortest time required when actually traveling the route is not considered. There are problems in that there are cases where the route is not possible, and there are cases where the route is difficult to travel even though it is the shortest route.

SUMMARY OF THE INVENTION In view of the problems of conventional route searching devices, it is an object of the present invention to provide a route searching device that searches for the shortest route in time, taking into account time loss due to right turns and left turns.

Means for Solving the Problems The present invention provides a point input means for inputting a departure point and a destination, a map data recording means in which map data is recorded in advance, and a route from the departure point to the destination between intersections. a search means for searching at least one or more items in order of the shortest required time, with the time required for driving plus the time required for turning right and left at an intersection as the required time; and a display means for displaying the search results of the search means. The present invention provides a route searching device.

According to the above-described configuration, the present invention searches for at least one or more routes in order of shortest required time, with the time required to travel between intersections and the time required to turn right and left at the intersection as the required time. It is possible to search for an easy-to-travel route that takes the shortest amount of time when actually traveling the route, does not require more right or left turns than necessary.

Examples Examples of the present invention will be described below with reference to the drawings.

FIG. 1 is a block diagram of a route searching device according to a first embodiment of the present invention.

101 is a point input means for inputting a departure point and a destination;
02 is a map data recording means in which map data used for route searching is recorded in advance. Reference numeral 103 denotes a search means, which uses a one-chip CPU, for example, to input the departure point and the destination from the point input means 101, read out the map data necessary for route searching from the map data recording means 102, and It searches for at least one or more routes in the order of the shortest required time from the departure point to the destination, with the time required as the sum of the time required to travel between intersections and the time required to turn right and left at the intersection. be. 104 is means such as a liquid crystal display device for displaying the search results.

The operation of the route searching device of the first embodiment configured as described above will be described below.

Point input means 101 inputs the starting point and destination of the route to be searched. The map data recording means 102 records map data necessary for route searching in advance. The search means 103 inputs the departure point and the destination which are output from the point input means lot, reads out the map data used for route searching from the map data recording means 102, and searches from the departure point to the destination. If it is necessary to make a right turn on the route being searched, add the time required to turn right, and if it is necessary to make a left turn, add the time required to turn left. The search is performed by adding up the time, and the search result is output to the display means 104.

The display means 104 inputs and displays the search results that are the output of the search means 103.

As described above, according to the first embodiment, the shortest required time is the sum of the time required to travel between intersections on the route from the departure point to the destination and the time required to turn right and left at the intersection. By providing search means 103 that searches for at least one or more routes in order of required time, it is possible to search for a route that provides the shortest required time when the route is actually traveled.

The flowchart showing the outline of the operation of the first embodiment is shown in the second embodiment.
As shown in the figure. First, in step 201, the starting point and destination of the route to be searched are input, and in step 202, map data used to perform the route search based on the starting point and the destination is read out. Next, in process 203, at least one route is selected in the order of shortest required time from the departure point to the destination, adding the time required for a right turn if it is necessary to make a right turn on the route being searched, and If it is necessary to make a left turn, the time required for the left turn is added and searched, and processing 204 is performed.
Display the search results and exit.

Next, the search process 203 will be explained in more detail using the flowchart of FIG. The starting point and destination of the route to be searched that were input in the process 201, and the process 2
Based on the map data used to perform the route search read out in step 02, for example, the device data consisting of the time required to travel between intersections, in step 301, the starting point is set as a reference intersection for the search. , the time required for line scrap from the starting point to the reference intersection is T, and T-b=o (minutes). Then, in step 302, an intersection where a road connects to the reference intersection is searched from the map data. Here, judgment 30
3 determines whether to turn right at the standard intersection, and if Y
If it is ES, in process 304, the time required to turn right at the reference intersection is set to T, and the time required for line scrap from the starting point to exiting the reference intersection is T. Then, T. T,. = T − k + T r . T is given in advance as, for example, T=2 (minutes). If no, it is determined whether to make a left turn at the reference intersection in step 305, and if YES, in step 306, the time required to turn left at the reference intersection is set to T+;
T. T,. = T s h + T + . TI is given in advance as, for example, T+=1 (minute). If NO, the process goes to T in step 307. T,. = T @ h. After performing any of the above processing 304, the above processing 308, and the above processing 307, in processing 308, the time required for line scrap from the starting point to the connected intersection is set as T sL, and the required time from the reference intersection to the connected intersection is set as Tkt. , read Tkt from the map data and calculate Ts
Find t as T - t = T - 0 + Tkt. Here, in judgment 309, T calculated in the process 308 and the required line waste time from the departure point to the intersection connected to the turtle searched so far are T a I m, and T1. T-+ −> T st
If the answer is YES, the standard intersection number at which the connecting intersection has been reached is recorded in the internal memory of the search means 103 (RAM area inside the CPU, etc.) as T a la ” T s t in process 310. If NO, in the same way as the result of the process 310, it is determined in judgment 311 whether all connected intersections from the reference intersection have been investigated;
If so, the process returns to step 302 described above. If YES, a judgment 312 is performed to determine whether the destination is being searched as a reference intersection, and if NO, a process 313 is performed in which T1. The intersection with the smallest value is set as the next reference intersection, T s k =T a 1 m, and the process returns to step 302 . Also, if YES, process 31
In step 4, the shortest time required route is created based on the result of the above procedure, and the search process 203 is ended.

Next, an example of determination 303 and determination 305 will be explained using FIG. 4. 401 is a reference intersection, 402 is the direction of the road that entered the reference intersection, 403 is an extension of the direction 402 of the road that entered the reference intersection from the reference intersection 401, and 404, 405 and 408 are the directions exiting from the reference intersection. The direction of the road, θ11, θ and θ is the extension, 114, centered on the reference intersection 401.
03 and the direction of the road 404, 405 and 40B are the angles made counterclockwise. In judgment 303, if the angle θ1 is, for example, 180 (degrees) × θ+<330 (degrees), the direction 404 of the road exiting from the reference intersection that creates the angle θ■ is a right turn at the reference intersection. to decide. Also, in the judgment 305, the angle θ! If, for example, 30 (degrees) and θe<tsO (degrees), it is determined that the direction 405 of the road exiting from the reference intersection that creates the angle θ2 is a left turn at the reference intersection. Also,
The angle θ3 is, for example, θ.

=20 (degrees), judgment 303 shows that 0m<180
(degrees), it is determined that the direction 405 of the road is not a right turn at the reference intersection. Furthermore, since θa<30 (degrees) in the judgment 305, it is judged that the road direction 405 is not a left turn at the reference intersection.

Next, an example of the data format handled by the search unit 203 and processing 3
14 examples will be explained using FIG. 501 is an intersection number recording area in which intersections on the map data are recorded as numbers; 502 is a reference intersection number recording area in which intersection numbers of reference intersections, which are intersections to which the intersections with the respective intersection numbers in the intersection number recording area 501 are connected, are recorded; 503 is an intersection where the intersections of each intersection number in the intersection number area 501 are connected, and the Meiji Restoration required time T1 from the starting point to the connected intersection. This is a recording area for the line waste time required. For example, when intersection number 1 is taken as the starting point, O is recorded in the reference intersection number recording area 502 corresponding to the intersection number 1 in the intersection number recording area 501, and the total acidification time required recording area 503 is recorded. Record O (minutes). Furthermore, from intersection number 1, the intersection number of the connected intersection and the required Meiji Restoration time T from the starting point to the connected intersection.
If a l m has an intersection number of 2 and T-+-=3 (minutes) and an intersection number of 3 and T-+-=5 (minutes),
A reference intersection number 1 is recorded in the reference intersection number recording area 502 corresponding to the intersection number 2 in the intersection number recording area 501, and T1. Record 3 (minutes). Further, a reference intersection number 1 is recorded in the reference intersection number recording area 502 corresponding to the intersection number 3 in the intersection number recording area 501, and T, 1. 5 (
minutes). In this way, the searched results are recorded, and in step 314, the reference intersection number of the reference intersection number recording area 502 is read out in order from the destination intersection number of the intersection number recording area 501, and the reference intersection number of the read reference intersection is Write the intersection number again in the intersection number recording area 50.
By repeating the search procedure from 1 until reaching the starting point, the route with the shortest required time can be found.

A block diagram of a route searching device according to a second embodiment of the present invention is shown in FIG.

101 is a point input means, 102 is a map data recording means,
104 is a display means, which is similar to the embodiment shown in FIG. What is different from the configuration of the embodiment shown in FIG. 1 is that the search means 601 searches for at least two or more routes in order of shortest required time, and when the required times of the routes are the same, selects the route that requires fewer right turns and left turns. This is the point of outputting.

The operation of the route searching device of the second embodiment configured as described above will be explained below.

The search means 601 inputs the starting point and destination that are output from the point inputting means 101, reads out map data used for route searching from the map data recording means 102, and calculates the route from the starting point to the destination. At least two or more routes are searched in order of shortest required time, and when the required times of the routes are the same, a route with fewer right and left turns is selected and the result is output to display means 104.

As described above, according to the second embodiment, at least two routes are searched in order of the shortest required time from the departure point to the destination, and when the required times of the routes are the same, the number of right turns and left turns is Search means 8 for selecting and outputting fewer routes
By providing 01, it is possible to search for an easy-to-travel route that does not require more right or left turns than necessary.

The flowchart showing the outline of the operation of the second embodiment is shown in the seventh embodiment.
As shown in the figure. First, in step 201, the starting point and destination of the route to be searched are input, and in step 202, map data used to perform the route search based on the starting point and the destination is read out. Next, in process 701, at least two routes are searched in order of the shortest required time from the departure point to the destination, and when the required times of the routes are the same, a route with fewer right turns and left turns is selected, Processing 2
At step 04, the search results are displayed and the process ends.

Next, the search process 70) will be explained using the flowchart of FIG. Based on the departure point and destination of the route to be searched inputted in the step 201 and the map data used to perform the route search read out in the step 202, the process 801 determines the shortest route from the departure point to the destination. At least two or more routes are searched in order of required time, and in judgment 802 it is determined whether there are any routes with the same required time.

If NO, the search result is output in process 803 and the search process 701 is ended. If YES, in process 804, the number of right turns on the nth route is determined by taking the same route with the same required time, and K r a of each route is checked, and in process 805, the number of left turns on the nth route is determined. Assuming that the number is K + m, check K + a of each route, and in process 80B, calculate the total number of right turns and left turns on the n-th route, and for each route, K @ = K r Calculate by a + K l m. Here, in process 807, the routes with the same required time are compared, and the route with the smaller value of Kll is output as the route with the shortest required time, and the search process 701 is ended.

Note that in the first embodiment, the time required for right and left turns was given in advance in steps 304 and 308 of the flowchart in FIG. The time required for a right turn and a left turn may be changed depending on the angle with the direction and calculated in process 3Q4 and process 30B. Further, the time required for a right turn and a left turn may be changed and calculated in steps 304 and 306 based on the ratio of the width of the road entering the intersection and the width of the road exiting the intersection. Further, the approach angle of each road forming an intersection may be recorded in advance in the map data recording means 102 shown in FIG. Furthermore, the first embodiment and the second embodiment
In the embodiment, routes were searched in order of shortest required time, but in the first embodiment, at least one route may be searched in order of shortest distance, with a certain distance added at intersections when turning right or left. . Further, in the second embodiment, at least two or more routes may be searched in order of shortest distance, and when the distances of the searched routes are the same, the route with the fewest number of right turns and left turns may be selected.

As described in detail, according to the present invention, the time required to travel between intersections on a route plus the time required to turn right and left at an intersection is defined as the required time, and at least one Since the vehicle searches for more than one route, it is possible to search for an easy-to-travel route that takes the shortest amount of time when actually traveling the route and does not require more right or left turns than necessary.

[Brief explanation of drawings]

FIG. 1 is a block diagram of a route search device according to a first embodiment of the present invention, FIG. 2 is a schematic flowchart showing the operation of the first embodiment, and FIG. 3 is an example of a search routine of the first embodiment. 4 is a direction diagram for explaining right turn and left turn judgments in the same device, FIG. 5 is a configuration diagram of data at the time of search in the same device, and FIG. 8 is a second embodiment of the present invention. A block diagram of the example route searching device, FIG. 7 is a schematic flowchart showing the operation of the second embodiment,
FIG. 8 is a flowchart showing an example of the search routine of the second embodiment. 101 - point input means, 102 - fist map data recording means, 103 - fist search means, 104 - cloud - display means. Name of agent: Patent attorney Shigetaka Awano (1 person)

Claims (2)

[Claims] (1) A point input means for inputting a departure point and a destination, a map data recording means for pre-recording map data, and a point input means for inputting a departure point and a destination, a map data recording means for recording map data in advance, and a point input means for inputting a departure point and a destination, and a map data recording means for inputting a departure point and a destination; It is characterized by comprising a search means for searching for at least one vehicle in order of shortest required time, with the time required for turning right and left being added, and display means for displaying the search results of the search means. Route searching device. (2) The searching means searches for at least two or more routes in order of shortest required time, and when the required times of the routes are the same, selects and outputs the route with fewer right turns and left turns. 1. The route searching device according to 1.