JP2002323334A - Navigation device and program for route search method - Google Patents

Abstract

PROBLEM TO BE SOLVED: To make searchable a desired route and to simplify the operation. SOLUTION: This navigation device is provided with a data acquisition means 91 acquiring road facilities data, a passing road specification means 92 specifying a passing road based on the road facilities data, a toll calculation means 93 reading toll data by referring to a toll table and calculating the toll of the passing road, a search cost calculation means calculating a search cost based on the toll cost corresponding to the toll, and a route selection means selecting the route based on the search cost. In this case, the passing road is specified based on the facilities data, the toll data is read out by referring to the toll table, the toll of the passing road is calculated, and the search cost is calculated based on the toll cost corresponding to the toll.

Description

DETAILED DESCRIPTION OF THE INVENTION

[0001]

The present invention relates to a navigation device and a program for a route search method.

[0002]

2. Description of the Related Art Conventionally, in a navigation device,
For example, GPS (Global Positioning System)
Based on the current position of the vehicle, that is, the current location, and the rotational angular velocity of the vehicle detected by the gyro sensor, that is, the turning angle, the azimuth of the vehicle, that is, the own vehicle azimuth is detected, and the display unit The current location, the direction of the host vehicle, and a map of the surrounding area are displayed on a map screen set on the display. Therefore, the driver who is the operator can drive the vehicle according to the current position and the own vehicle direction displayed on the map screen.

Further, a driver can set a departure place and a destination, and when the departure place and the destination are set, a route from the departure place to the destination is searched and searched. The searched route, that is, the searched route is displayed on the searched route display screen. Therefore, the driver can drive the vehicle according to the searched route. Note that the current location can be set as the departure location.

In the navigation apparatus, when searching for the route, a toll road prioritizing a route search and a high speed / toll road searching for a route are premised on using a high speed / toll road such as an expressway or a toll road. Search for a route on the premise that a general road such as a national road or a prefectural road is used instead of using it.Use a cost parameter according to the search condition of general road priority, or use a road such as an expressway, toll road, national road, prefectural road, etc. Use a cost parameter according to the type data, link distance data, right / left turn regulation, one-way traffic regulation data, etc. The route is determined.

[0005] Then, the user travels on a high-speed toll road, gets off the high-speed toll road at a predetermined facility, that is, at an interchange, runs on a general road, and rides on the same high-speed toll road at the next interchange. In order to suppress unnecessary getting on and off, a predetermined cost is added when riding on a highway / toll road from a general road.

[0006]

However, in the conventional navigation apparatus, the cost is added every time the user travels from a general road to a high-speed / toll road between the departure point and the destination, so that the distance is short. Even on a route, the fare required to travel on a high-speed toll road may be extremely high.

FIG. 2 is a comparison diagram of a conventional search route.

As shown in the figure, when the vehicle travels from the departure point PS to the destination PE, the vehicle travels on a general road from the departure point PS, gets on a high-speed and toll road at an interchange iA, and gets on a high-speed and toll road at an interchange iE. A first route RT1 that gets off the road and reaches the destination PE through a general road;
From the departure point PS, follow the general road, take the highway / toll road at interchange iA, get off the highway / toll road at interchange iB, pass the general road, and again at interchange i
Take the high-speed toll road at C and high-speed at the interchange iD
A second route RT2 that gets off the toll road and reaches the destination PE through the general road is considered.

When calculating the search cost, link costs for roads (set according to the type of road, number of lanes, etc.) and node costs for intersections (corresponding to the presence / absence of traffic lights, right / left turn, etc.). Each cost, such as a specific cost, which is added each time the user rides on a highway / toll road from an ordinary road, is set in each of the first and second routes RT.
1, added for each RT2, and the total value is used as the search cost. Then, among the first and second routes RT1 and RT2, the route with the smallest search cost is selected and determined as the recommended route.

[0010] In the calculation example shown in the figure, the link cost is a value as shown in the figure, the node cost is 0, the specific cost added each time the user gets on a highway / toll road from a general road is Z,・ When the fee when using the toll road is the value shown in the fee table,
The search cost Ct1 of the route RT1 is Ct1 = 500 + Z + 2000 + 500 = 3000 + Z, the search cost Ct2 of the second route RT2 is Ct2 = 500 + Z + 1000 + 300 + Z + 700 + 500 = 3000 + 2 · Z, and the search cost Ct1 is lower than the search cost Ct2.

As described above, the specific cost Z is added when the user rides on a highway / toll road from a general road, so that even if the link costs are equal, the first route RT1 is not connected to the second route R
Although the toll road is higher than T2, the route is determined as a recommended route.

In this case, since the driver has searched for a route different from the expected route, complicated operations such as setting a passing point are repeated until the intended route is searched. And the operation of the navigation device is cumbersome.

The present invention solves the problems of the conventional navigation device, and provides a navigation device and a program for a route search method capable of searching for a desired route and simplifying operation. The purpose is to:

[0014]

For this purpose, in the navigation device of the present invention, there are provided a data acquisition processing means for acquiring road facility data, and a passing road identification processing means for identifying a passing road based on the road facility data. A charge calculation processing means for reading charge data with reference to a charge table and calculating a charge for the passing road; a search cost calculation processing means for calculating a search cost based on a charge cost corresponding to the charge; Route selection processing means for selecting a route based on the cost.

[0015] The other navigation device of the present invention further includes a plurality of fee tables.

Then, the toll calculation processing means selects a toll table based on the road facility data, and reads out the toll data with reference to the selected toll table.

In still another navigation device according to the present invention, the toll table is divided for each high-speed toll road.

In still another navigation device according to the present invention, a condition setting processing means for setting conditions is further provided.
Charge cost change processing means for changing the charge cost based on the set conditions.

In still another navigation device according to the present invention, the fee cost is obtained by multiplying a fee by a coefficient.

In the program of the route search method according to the present invention, the computer refers to data acquisition processing means for acquiring road facility data, passing road identification processing means for identifying a passing road based on the road facility data, and a toll table. Toll data, and toll calculation processing means for calculating the toll for the passing road, search cost calculation processing means for calculating a search cost based on the toll cost corresponding to the toll, and a route based on the search cost. It functions as route selection processing means to be selected.

[0021]

Embodiments of the present invention will be described below in detail with reference to the drawings.

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

In the figure, reference numeral 91 denotes data acquisition processing means for acquiring road facility data; 92, passing road identification processing means for identifying a passing road based on the road facility data;
93: toll calculation processing means for reading the toll data with reference to the toll table and calculating the toll for the passing road;
Reference numeral 94 denotes search cost calculation processing means for calculating a search cost based on the charge cost corresponding to the charge, and recommended route determination processing means as a route selection processing means for selecting a route based on the search cost.

FIG. 3 is a block diagram of the navigation device according to the first embodiment of the present invention.

In FIG. 1, reference numeral 14 denotes a navigation device. The navigation device 14 includes a current position detection processing unit 15 for detecting a current position, a data recording unit 16 as a recording medium on which road data and the like are recorded, and a computer. The navigation processing unit 17 that functions as various processing units and performs various arithmetic processing such as navigation processing based on the input information, the input unit 34 as an operation unit and a first input unit, a display unit, A display unit 35 as a first output unit, an audio input unit 36 as a second input unit, an audio output unit 37 as a second output unit,
A communication unit 38 as a third input unit and a third output unit is provided. A vehicle speed sensor 41 is connected to the navigation processing unit 17.

The current position detection processing unit 15 includes a GPS 21 as a current position detecting means, a geomagnetic sensor 22,
A distance sensor 23, a steering sensor 24, a beacon sensor 25, a gyro sensor 26 as an azimuth detecting means,
It consists of an altimeter not shown.

The GPS 21 detects a current position on the earth by receiving a radio wave generated by an artificial satellite, the geomagnetic sensor 22 detects an azimuth of the vehicle by measuring geomagnetism, and the distance sensor 23 detects the distance between predetermined positions on the road and the like. Examples of the distance sensor 23 include a sensor that measures the number of revolutions of a wheel (not shown) and detects a distance based on the number of revolutions, a sensor that measures acceleration, and detects the distance by integrating the acceleration twice. Can be used.

The steering sensor 24 detects a rudder angle.
For example, an optical rotation sensor, a rotation resistance sensor attached to a rotating portion of a steering wheel (not shown),
An angle sensor or the like attached to a wheel is used.

The beacon sensor 25 receives position information from a radio beacon or an optical beacon disposed along the road to detect the current position. The gyro sensor 26 detects a turning angle. As the gyro sensor 26, for example, a gas rate gyro, a vibration gyro, or the like is used. Then, by integrating the turning angle detected by the gyro sensor 26, the azimuth of the own vehicle can be detected.

The GPS 21 and the beacon sensor 25 can independently detect the current location.
The current position can also be detected by combining the distance detected by the distance sensor 23 with the vehicle direction detected by the geomagnetic sensor 22 or the turning angle detected by the gyro sensor 26. Also,
The current position can also be detected by combining the distance detected by the distance sensor 23 and the steering angle detected by the steering sensor 24.

The data recording unit 16 stores a map data file, an intersection data file, a node data file,
A database comprising data files such as a road data file, a photograph data file, a search data file, and a point information data file is provided. The point information data file includes a hotel, a gas station, a parking lot, a tourist spot guide, etc. in each region. The facility is recorded as a point. Then, in each of the data files, a guide map is output along a searched route on a screen set on a display (not shown) of the display unit 35, that is, a guide map is displayed or a characteristic photograph at an intersection or a route is displayed. , And various data for displaying a distance to the next intersection, a traveling direction at the next intersection, and displaying other guidance information. The data recording unit 16 also records various data for outputting predetermined information by the audio output unit 37.

By the way, the intersection data file contains intersection data about each intersection, the node data file contains node data about node points, the road data file contains road data about roads, and the search data file searches for routes. Search data is recorded, and the intersection data, the node data, the road data, and the search data form road condition data representing a road condition. The node data includes data indicating actual branch points (including intersections, T-shaped roads, etc.), node points, links between node points connecting the node points, and the like.

According to the road data, the width of the road itself, the gradient, the cant, the bank, the state of the road surface, the number of lanes on the road, the places where the number of lanes decreases, the places where the width becomes narrower, etc. Regarding corners, radius of curvature, intersections, T-shaped roads, entrances of corners, etc., road attributes, downhill roads, uphill roads, etc., road types, general roads such as national roads, prefectural roads, expressways, urban expressways , Expressways and toll roads, respectively. Further, the road data indicates railroad crossings, attachment roads (ramp ways) at entrances and exits of expressways, tollgates on expressways and toll roads, and the like.

The navigation processing unit 17
CPU 3 for controlling the entire navigation device 14
1. In addition to a RAM 32 used as a working memory and a control program when the CPU 31 performs various arithmetic processes, various types of programs for searching for a route to a destination, providing route guidance, determining a specific section, etc. It comprises a ROM 33 as a recording medium on which a program is recorded.
4. The display unit 35, the audio input unit 36, the audio output unit 37, and the communication unit 38 are connected.

The data recording section 16 and the ROM 3
Reference numeral 3 includes a magnetic core (not shown), a semiconductor memory, and the like. The data recording unit 16 and the ROM 3
As 3, a variety of recording media such as a magnetic tape, a magnetic disk, a flexible disk, a magnetic drum, a CD, an MD, a DVD, an optical disk, an MO, an IC card, and an optical card can be used.

In the present embodiment, the ROM 33
Various programs are recorded in the data recording unit 16.
Although various types of data are recorded on the external storage medium, programs, data, and the like can be recorded on the same external recording medium. In this case, for example, a flash memory (not shown) can be provided in the navigation processing unit 17, and the program, data, and the like can be read from the external recording medium and written to the flash memory. Therefore, the program, data, and the like can be updated by exchanging an external recording medium. Further, a control program or the like of the automatic transmission control device (not shown) can be recorded on the external recording medium. In this way, the programs recorded on various recording media are started,
Various processes can be performed based on the data.

The communication section 38 is for transmitting and receiving various programs and data to and from an FM multiplex transmission apparatus, a telephone line, a communication line, and the like. In addition to receiving traffic information including traffic congestion information, regulation information, parking lot information, and the like, the receiving device receives various data such as traffic accident information and D-GPS information for detecting a GPS 21 detection error.

Further, a program for realizing the functions of the present invention, other programs for operating the navigation device 14, data and the like are transferred from an information center (Internet server, navigation server, etc.) to a plurality of base stations (Internet servers). To a communication terminal connected to the communication unit 38 via a telephone line, a communication line, or the like), and further from each base station to the communication unit 38. When such a system is used, when at least a part of the program and data transmitted from each base station is received, the CPU 31 reads and writes a memory such as a RAM 32, a flash memory, a hard disk, and the like. , The program is started, and various processes can be performed based on the data.

In this case, for example, the program and data can be recorded on different recording media, or can be recorded on the same recording medium.

Further, using a personal computer for home use, the program, data, etc. transmitted from the information center are downloaded to a recording medium such as a memory card or a flexible disk which is detachable from the personal computer, and the program is started. In addition, various processes can be performed based on the data. In this case, a navigation system includes the navigation device 14, the information center, the base station, and the like.

The input section 34 is used to correct the current position at the start of traveling and to input a departure point and a destination. The input section 34 is displayed as an image on a screen set on the display. It consists of various keys and operation switches such as an operation menu. Therefore, input can be performed by pressing the operation switch. In addition, as the input unit 34, a keyboard, a mouse, a barcode reader, a light pen, a remote control device for remote operation, and the like, which are provided separately from the display unit 35, can be used.

On the screen set on the display, operation guidance, an operation menu, guidance of operation keys, a route from the current position to the destination, guidance information along the route, and the like are displayed. As the display unit 35, a display such as a CRT display, a liquid crystal display, and a plasma display can be used, or a hologram device that projects a hologram on a windshield can be used.

The voice input unit 36 is constituted by a microphone (not shown) or the like, and can input necessary information by voice. Further, the audio output unit 37
Includes a voice synthesizer and a speaker (not shown), and outputs sound information, for example, guide information and speed change information composed of voice synthesized by the voice synthesizer from the speaker.
In addition to the speech synthesized by the speech synthesizer,
Various sounds, various kinds of guide information recorded in advance on a tape, a memory, or the like can be output from a speaker.

Next, the navigation device 14 having the above-described configuration is used.
Will be described.

First, when the input unit 34 is operated by the driver as the operator and the navigation device 14 is started, a navigation initialization processing means (not shown) of the CPU 31
A navigation initialization process is performed, and a matching processing unit (not shown) of the CPU 31 performs a matching process,
The current position detected by the gyro sensor 26 and the own vehicle direction detected by the gyro sensor 26 are read, and node data, map data, and the like are read from the data recording unit 16.

Next, a map display processing means (not shown) of the CPU 31 performs map display processing, sets a map screen on the display, displays a peripheral map on the map screen according to the map data, and The current location and the direction of the vehicle are displayed.

When the navigation device 14 is used as a route search device, the driver operates the input unit 34.
To input the departure place and the destination, the CPU 31
The destination setting processing means (not shown) performs a destination setting process to set a destination. A route search processing unit (not shown) of the CPU 31 performs a route search process. Then, the data acquisition processing means 91 (FIG. 1) of the route search processing means performs data acquisition processing and reads out the search data with reference to the search data file. Then, the route search processing means searches for a route from the departure place to the destination based on the search data. The search route display processing means of the route search processing means sets a search route display screen on the display and displays the search route on the search route display screen. Therefore, the driver can drive the vehicle according to the searched route. Note that the current location detected by the GPS 21 may be set as the departure location without setting the departure location. Further, the data acquisition processing unit 91 can also acquire search data via the communication unit 38.

By the way, in searching for the route,
Toll road priority to search for routes assuming use of expressways and toll roads such as expressways and toll roads, and assuming use of general roads such as national roads and prefectural roads without using expressways and toll roads Use a cost parameter according to the search conditions of general road priority to search for routes, data of road types such as expressways, toll roads, national roads, prefectural roads, data such as link distances, right / left turn restrictions, one-way traffic, etc. A route that minimizes the search cost is selected by using a cost parameter according to the regulation data or the like, and is determined as a recommended route.

Unnecessary getting on and off such as traveling on a highway / toll road, getting off from the highway / toll road at a predetermined interchange, traveling on a general road, and riding on the same highway / toll road at the next interchange. High speed,
Toll road costs are added as toll roads are used.

For this purpose, the search data file contains
When adding data (hereinafter referred to as "tollgate data") such as entrances, exits, clearing stations, barriers, and ticket gates of expressways and toll roads, when searching for routes, The passing road can be specified. In addition, a charge table is added to the search data file, the charge table is read out by referring to the charge table, the charge data when the high-speed / toll road is used, the charge corresponding to the charge data is calculated, and the charge cost is calculated. be able to. Road facilities are constituted by entrances, exits, clearing stations, barriers, ticket gates, and the like, and road facility data is constituted by the data of the toll gates and the like. Also,
The entrances and exits represent tollgates located at interchanges for riding on expressways and toll roads, and at interchanges for getting off from expressways and toll roads. Indicates the tollgate that was installed.

Next, the data structure of the search data file will be described.

FIG. 4 is a diagram showing a data structure of a search data file according to the first embodiment of the present invention. FIG. 5 is a diagram showing a first example of a fee table according to the first embodiment of the present invention. FIG. 6 is a diagram showing a second example of the fee table according to the first embodiment of the present invention.

As shown in the figure, the search data file includes intersection data, road data,
Data such as traffic regulation data, route display data, and additional information data are recorded, the number of intersection data, data such as intersection data # 1 to #m are recorded as intersection data, and the number of road data, road data as road data. # 1 to #n
Is recorded.

As the intersection data # 1 to #m,
Data such as the number of connection roads, connection roads # 1 to #o, and tollgate data are recorded. Then, each of the road data # 1 to #n
The data such as a road type, a road attribute, a distance, a travel time, a tollgate, and the like are recorded.
Exits, clearing stations, barriers, ticket gates, etc.), facility names, fee attributes, etc. are recorded. It should be noted that these tollgates and other data are replaced with road data # 1 to #m and intersection data # 1 to #m.
It can also be recorded as.

In the search data file, data such as toll data and road name data are additionally recorded as additional information data, and a toll table is recorded as the toll data.

A tollgate data number is assigned to each tollgate in the toll table, and the reference position in the toll table is determined based on the tollgate data number obtained by searching the route by referring to the search data file. Can be specified. The fee table shown in FIG. 5 is used for a fee system of a pay-as-you-go rate where the longer the journey, the higher the fee. The fare table shown in FIG. 6 uses the same flat fee even if the journey is long or short. Used for fee structure. In the pay-as-you-go fee system, an entrance and an exit are required as road facilities, and in the toll system with a flat fee, a clearing house is required as a road facility.

Next, the route search processing will be described.

FIG. 7 is a diagram showing a departure place side search processing subroutine in the first embodiment of the present invention, and FIG. 8 is a view showing a destination side search processing subroutine in the first embodiment of the present invention. 9 is a diagram showing a search result combining process subroutine according to the first embodiment of the present invention, FIG. 10 is a diagram showing a first example of a route search process according to the first embodiment of the present invention, and FIG. FIG. 12 is a diagram illustrating a second example of the route search process according to the first embodiment of the present invention, and FIG. 12 is a diagram illustrating a third example of the route search process according to the first embodiment of the present invention.

In this case, the route search is performed in a plurality of hierarchies, and in the vicinity of the departure point and the destination, the intersection data # 1 to ## in the search data file in order to increase the search accuracy. m and all of the road data # 1 to #n are to be searched, and intersection data and roads to be searched are set so that the processing speed of the route search processing increases as the distance from the departure point and the destination increases. Data is reduced.

Therefore, the route search processing means performs a route search process, searches from the departure place to the destination, acquires a predetermined route, and performs a search from the destination to the departure place. Obtain a predetermined route.

For this purpose, the route search processing means performs a starting point side search process in the route search process. And
The data acquisition processing means 91 (FIG. 1) of the route search processing means performs data acquisition processing, reads out the next intersection data of the departure place, and determines whether there is a tollgate at the intersection corresponding to the intersection data. If there is a tollgate, the facility attribute determination processing means of the search processing means performs a facility attribute determination process, reads the data of the tollgate, etc., and, based on the facility attribute of the tollgate data, the tollgate enters at the entrance. Is there
Determine if it is an exit. Then, the passing road identification processing means 92 of the search processing means performs the passing road identification processing, and when it is determined that the tollgate is the entrance, records the entrance in a buffer (not shown). When it is determined that the tollgate is the exit based on the facility attribute of the place data, the passing road is specified. Subsequently, the charge calculation processing means 93 of the search processing means performs a charge calculation process, reads out the charge data with reference to the charge table of FIG. 5 or 6, and calculates the charge from the entrance to the exit. And the fee cost giving processing means of the search processing means,
A toll cost according to the calculated toll is given to a predetermined node on the passing road, in this embodiment, an exit. If it is determined that the tollgate is neither an entrance nor an exit,
The passing road identification processing means 92 records a barrier for identifying the passing road in the buffer. If the charge cost is Cf, the charge is w, and the coefficient is k, the charge is obtained by multiplying the charge w by the coefficient k, and Cf = w · k.

As described above, it can be seen that when the vehicle passes through the entrance after passing through the entrance on a predetermined route along with the search, the high-speed / toll road is used in the route. Also,
A passing road from the entrance to the exit is specified, and a toll cost Cf according to the toll is given to a node of the passing road.

On the other hand, the route search processing means performs a destination side search process in the route search process. For this purpose, the data acquisition processing means 91 performs data acquisition processing,
Read the next intersection data of the destination, determine whether there is a tollgate at the intersection corresponding to the intersection data, if there is a tollgate, the facility attribute determination processing means reads the tollgate etc. data, It is determined whether the tollgate is an entrance or an exit based on the facility attribute of the tollgate data. When it is determined that the tollgate is an exit, the passing road identification processing means 92 records the exit in the buffer, and thereafter, based on the facility attribute of the read tollgate or the like data, the tollgate enters the entrance. If it is determined that the vehicle is passing through, the passing road is specified. Subsequently, the charge calculation processing means 93
Reads out the charge data with reference to the charge table of FIG. 5 or 6, calculates the charge, and the charge cost assignment processing means sets the charge cost Cf corresponding to the charge to a predetermined node, in the present embodiment, Give to the exit. If it is determined that the tollgate is neither an entrance nor an exit, the passing road identification processing means 92 records a barrier for identifying the passing road in the buffer.

As described above, it is understood that when the vehicle passes through the exit after passing through the exit on a predetermined route along with the search, the high-speed and toll road is used in the route. Also,
A passing road from the exit to the entrance is specified, and a toll cost Cf according to the toll is given to a node of the passing road.

Subsequently, the passing road identification processing means 92
Determines whether there is an entrance in the search results on the departure side and whether there is an exit in the search results on the destination side for each route obtained during the search on the departure side and the search on the destination side. If there is an entrance in the search result on the departure side and an exit in the search result on the destination side, the passing road is specified based on the entrance on the departure side, the exit on the destination side, and the barrier.

The charge calculation processing means 93 reads out the charge data with reference to the charge table shown in FIG. 5 or 6, calculates the charge, and the charge cost assignment processing means calculates the charge cost Cf corresponding to the charge. Assigned to a predetermined node.

Subsequently, the search cost calculation processing means 94 of the route search processing means performs search cost calculation processing, and calculates a search cost for each route. In this case, the search cost calculation processing means 94 sets the link cost for the road (corresponding to the road type, the number of lanes, etc.),
Each cost such as a node cost for an intersection (set according to the presence or absence of a traffic light, right / left turn, etc.) and a toll cost is added for each route, and the total value is set as a search cost.

The recommended route determination processing means 95 as a route selection processing means of the route search processing means performs a recommended route determination process, selects a route having a minimum search cost from each route, and sets the selected route as a recommended route. decide.

For example, in the example shown in FIG. 10, the route search processing means performs a search from the departure point PS to the destination PE in the departure point side search processing, as indicated by the arrows, to obtain the routes RTs1, RTs2. In addition, in the destination side search processing, as indicated by an arrow, a search is performed from the destination PE toward the departure point PS to obtain routes RTe1 and RTe2.

Then, on the route RTs1, the interchange i1 passed along with the search and on the route RTs2, the interchange i2 passed along with the search are recorded as an entrance in the buffer. Also, the route RT
At e1, the interchange i3 passed along with the search is recorded as an exit on the route RTe2 in the buffer as the interchange i4 passed along with the search.

Then, at the point X, each route RTs1,
When RTe1 matches, the routes RTs1 and RTe1 are combined to form a first route RT1, and the route RTs at the point Y
2. When RTe2 matches, the routes RTs2 and RTe2 are combined to form the second route RT2.

In this case, on the first route RT1,
Interchange i1 which is the entrance to the search result on the departure point side
However, since the search result on the destination side includes the interchange i3 which is the exit, the passing road identification processing means 92
Is specified as a passing road. Then, the fee cost granting processing means comprises the interchanges i1, i
A charge cost Cf corresponding to the charge between the three is given to the node at the point X.

In the second route RT2, the search result on the departure point side shows that the interchange i2, which is the entrance,
Interchange i4 which is the exit in the search result on the destination side
Therefore, the passing road identification processing means 92 identifies the second route RT2 as a passing road. Then, the charge cost grant processing means assigns a charge cost Cf corresponding to the charge between the interchanges i2 and i4 to the node at the point Y.

In the example shown in FIG. 11, the route search processing means performs a search from the departure point PS to the destination PE as indicated by an arrow in the departure point side search processing, and the routes RTs3 and RTs4. In the destination-side search process, a search is performed from the destination PE to the departure point PS to obtain routes RTe3 and RTe4, as indicated by arrows.

In the route RTs4, the interchanges i5 and i6 that have passed along with the search are recorded in the buffer as entrances and exits. Also, on the route RTe3, the interchange i7 that has passed along with the search,
i8 is recorded in the buffer as entry and exit.

Then, at the point X, each route RTs3,
When RTe3 matches, the routes RTs3 and RTe3 are combined to form a third route RT3, and the route RTs at the point Y
4. When RTe4 matches, routes RTs4 and RTe4 are combined to form a fourth route RT4.

In this case, on the third route RT3,
Although the search result on the departure side does not include an interchange as an entrance, but the search result on the destination side includes an interchange i7 as an exit and an interchange i8 as an entrance, the passing road identification processing means 92 determines the third route RT3.
Is specified as a passing road. Then, the charge cost grant processing means assigns a charge cost Cf corresponding to the charge between the interchanges i7 and i8 to the node of the interchange i8.

In the fourth route RT4, the search result on the destination side does not include an interchange as an exit, but the search result on the departure side includes an interchange i5 as an entrance and an interchange i6 as an exit.
The passing road identification processing means 92 identifies the fourth route RT4 as a passing road. Then, the charge cost grant processing means assigns a charge cost Cf corresponding to the charge between the interchanges i5 and i6 to the node of the interchange i6.

Here, when the route search processing according to the present embodiment is performed on the search route shown in FIG.
The search cost Ct1 of the first route RT1 is Ct1 = 500 + 2000 + (2000 × k) + 500 = 3000 + (2000 × k), and the search cost Ct2 of the second route RT2 is Ct2 = 500 + 1000 + (500 × k) +300. +700+ (300 × k) + 500 = 3000 + (800 × k), and the search cost Ct1 is higher than the search cost Ct2.

Next, even if the interchange used when riding on a high-speed toll road, ie, the interchange used, and the interchange used when getting off from a high-speed, toll road, ie, the same interchange that gets off, are different routes, A method for specifying a passing road in the case where the road exists will be described.

As shown in FIG. 12, take the highway / toll road at the interchange i11 and change to the interchange i1.
If you get off the highway / toll road at 2, use the first and second routes R
There are two ways through T11 and RT12. Then, the case of passing through the first route RT11 and the case of passing through the second route RT1
If the pass is different from that of passing through 2, the barriers and ticket gates in the middle of the route are read out while the search is being performed. By recording, each route can be specified as a passing road. It is possible to record other facilities in the middle of the route in addition to the barrier, the ticket gate, and the like, and to record an interchange that is not an entrance or an exit but simply passes.

For example, in performing the departure point side search processing, if the interchange i12 is read after the interchange i11 is read, the passing road specifying processing means 92 specifies the first route RT11 as the passing road. . Then, the charge cost grant processing means refers to the charge table corresponding to the first route RT11, and converts the charge cost Cf1 corresponding to the charge into the interchange i12.
Is assigned to the node.

When the barrier j is read after the interchange i11 is read, the passing road specifying processing means 92 specifies the second route RT12 as a passing road. Then, the charge cost grant processing means refers to the charge table corresponding to the second route RT12, and converts the charge cost Cf2 corresponding to the charge into the interchange i12.
Is assigned to the node.

As described above, in the present embodiment, in the search data file, facility attributes such as entrances, exits, clearing stations, barriers, and ticket gates are recorded as toll gate data.
When searching for a route, the route can be specified by recording facility attributes. Further, since the fee table is recorded as additional information data in the search data file, the fee for each route can be accurately calculated, the fee can be reflected in the search cost, and the speed and the speed of the toll road can be improved. Despite the high price, a given route is no longer recommended.

Therefore, since the intended route is searched for by the driver, it is not necessary to repeat complicated work such as setting a passing point, and the operation of the navigation device can be simplified.

[0086] Even if the interchange to get on and the interchange to get off are the same, the fee may differ depending on the route to be used.
It is possible to specify a passing road based on a ticket gate or the like, and calculate a search cost in consideration of a fee for each route. Therefore, the intended route is more reliably searched for by the driver.

Next, the flowchart of FIG. 7 will be described. Step S1 The next intersection data is read. Step S2: Determine whether there is a tollgate at the intersection. If there is a tollgate at the intersection, proceed to step S3,
If not, read the next intersection data. Step S3: Tollgate data is read. Step S4: It is determined whether the facility attribute is the entrance. If the facility attribute is the entrance, the process proceeds to step S10; otherwise, the process proceeds to step S5. Step S5: It is determined whether or not the facility attribute is the exit. When the facility attribute is the exit, the process proceeds to step S7, and when the facility attribute is not the exit, the process proceeds to step S6. Step S6: Record the barrier for specifying the passing road, and read the next intersection data. Step S7: Specify a passing road. Step S8: The charge data is read out with reference to the charge table. Step S9: A charge cost corresponding to the charge is given to the node, and the next intersection data is read. Step S10 The entrance is recorded, and the next intersection data is read.

Next, the flowchart of FIG. 8 will be described. Step S11: Read the next intersection data. Step S12: It is determined whether there is a tollgate at the intersection. If there is a tollgate at the intersection, the process proceeds to step S13; otherwise, the next intersection data is read. Step S13: Tollgate data is read. Step S14: It is determined whether or not the facility attribute is the entrance. If the facility attribute is entrance, go to step S18.
If it is not the entrance, the process proceeds to step S15. Step S15: It is determined whether or not the facility attribute is the exit. If the facility attribute is exit, go to step S17.
If not, the process proceeds to step S16. Step S16: Record the barrier for specifying the passing road, and read the next intersection data. Step S17 The exit is recorded, and the next intersection data is read. Step S18: A passing road is specified. Step S19: The charge data is read out with reference to the charge table. Step S20: A fare cost corresponding to the fare is provided to the node, and the next intersection data is read.

Next, the flowchart of FIG. 9 will be described. Step S21 A loop is started. Step S22: It is determined whether there is an entrance in the search result on the departure place side. If there is an entrance in the search result on the departure place side, the flow proceeds to step S23, and if not, the flow proceeds to step S27. Step S23: It is determined whether or not there is an exit in the search result on the destination side. If the search result on the destination side includes an exit, the process proceeds to step S24; otherwise, the process proceeds to step S27. Step S24: A passing road is specified from the entrance on the departure side, the exit on the destination side, and the barrier. Step S25: The charge data is read out with reference to the charge table. Step S26: A charge cost according to the charge is given to the node. Step S27: The loop ends. Step S28: The route with the minimum search cost is selected. Step S29: Determine a recommended route and return.

Next, a second embodiment of the present invention for dividing the charge table will be described.

FIG. 13 is a diagram showing an example of the charge table, and FIG.
4 is a diagram illustrating an example of a toll table according to the second embodiment of the present invention, and FIG. 15 is a diagram illustrating a configuration of data such as a toll gate according to the second embodiment of the present invention.

By the way, as shown in FIG. 13, if the charge table is created so that the charges between all the interchanges iA to iH can be referred to, the data amount of the charge table becomes too large.

Then, for example, the interchange iA ~
The charge table for iG is provided at interchanges iA to i
A first charge table TB1 for D, a second charge table TB2 for interchanges iD to iF, and a third charge table TB3 for interchanges iF and G
Divided into In this case, the first to third charge tables TB
1 to TB3 can be created for each high-speed / toll road line. When a plurality of routes are connected at a predetermined junction, it is necessary to record the tollgate data number of the nearest interchange for the predetermined junction in each route and a fee table in association with each other.

For example, if there is a high-speed / toll road that separates from the interchange iD and joins the same route again at the interchange iF, the interchange iD, i
A fourth charge table TB4 for E'iF is recorded.

Therefore, the charge calculation processing means 93 (FIG. 1) of the route search processing means (not shown) of the CPU 31 selects a predetermined charge table from the first to fourth charge tables TB1 to TB4 and selects the selected charge table. Read the fee between each interchange from the fee table. For example, when calculating the charge between the interchanges iA to iG, when selecting the route that passes through the interchange iE, the charge between the interchanges iA to iD is c4 yen, the charge for the interchanges iD to iF is d2 yen, and the interchange iF. Read out the charge f1 yen between iG and iG
The value obtained by adding the yen, the d2 yen and the f1 yen is calculated as a fee. In addition, interchange i
When selecting a route that passes through E ', the fee between interchanges iA to iD is c4 yen, and interchange i
A value obtained by adding the charge d'2 yen between D, iE 'and iF and the charge f1 yen between interchanges iF to iG is calculated as a charge.

For this purpose, as shown in FIG. 15, the tollgate data and the like constituting the search data file are tollgate data numbers, tollgate table numbers indicating the table numbers where the tollgates are located, route numbers, and facility numbers. , Facility attributes (entrance, exit, clearinghouse, barrier, ticket gate, etc.), facility name, fee attribute, and the like. Then, as shown in FIG. 14, since a plurality of fee tables are provided, a table number for indicating which fee table each interchange belongs to is recorded in each fee table.

For example, when the user gets on a high-speed toll road at the interchange iB, passes through the interchange iE, and gets off the high-speed toll road at the interchange iG, the toll is calculated according to the tollgate table number of each of the interchanges iB, iE, and iG. First to third charge table T
B1 to TB3 are determined. In this case, charges c4, d
The value obtained by adding 2, f1 is the fee.

When the user gets on the high-speed / toll road at the interchange iB, passes through the interchange iE, and gets off the high-speed / toll road at the interchange iF, the toll is calculated according to the tollgate table number of each interchange iB, iE, iF. And second charge table T for
B1 and TB2 are determined. In this case, charges c4, d2
The value obtained by adding is the fee.

When the user gets on the high-speed / toll road at the interchange iB and gets off the high-speed / toll road at the interchange iD, the first toll table TB1 for calculating the toll according to the tollgate table number of each interchange iB and iD. Is determined. In this case, the fee is c5.

As described above, when there is an interchange that passes, the tollgate data number of the interchange can be recorded as a barrier, so that the passing road can be specified. If there is only one toll table and no tollgate table number, the passing road can be specified based on the names of expressways and toll roads. Also,
By recording the tollgate table number without recording the tollgate data number of the passing interchange, the passing road can be specified.

Next, the operation of the route search processing means will be described.

FIG. 16 is a diagram showing a route search processing subroutine according to the second embodiment of the present invention.

The facility attribute determination processing means of the route search processing means performs facility attribute determination processing, reads out entrances and exits, and the charge calculation processing means 93 (FIG. 1) performs charge calculation processing and obtains the obtained information. For each route, the fee between the entrance and the exit is read for each fee table with reference to the fee table corresponding to the entrance and the exit. Subsequently, the charge calculation processing means 93 calculates the total charge from the entrance to the exit by summing the charges for each charge table.

[0104] The toll cost granting means of the route search processing means assigns a toll cost Cf corresponding to the fee between the interchanges corresponding to the entrance and the exit to a predetermined node, in this embodiment, an exit. I do.

As described above, in the present embodiment, the toll table for the high-speed and toll road is divided into a plurality of sections, and a predetermined toll table is referred to based on data such as toll gates to calculate the toll. The recording capacity of the data file can be reduced, and the data amount can be reduced. Therefore, not only can the cost of the navigation device 14 be reduced, but also the time required to perform the fee cost providing process can be reduced.

In dividing the charge table,
The boundary may be an interchange that is a branch point, an interchange that is a junction, an interchange that changes the fare system, or a boundary on a road such as a barrier or a ticket gate.

Next, the flowchart will be described. Step S31: Read out the entrance. Step S32 A loop is started. Step S33: Read out the exit. Step S34: The charge data is read out with reference to the charge table. Step S35: A fee cost is assigned to the node according to the fee. Step S36: End the loop and return.

Next, a description will be given of a third embodiment of the present invention in which an operator can set conditions for a fee, a process, a required time, and the like. In addition, about what has the same structure as 1st Embodiment, the description is abbreviate | omitted by attaching the same code | symbol.

FIG. 17 is a diagram showing an example of a condition setting screen according to the third embodiment of the present invention.

The route search processing means determines whether or not the condition setting key as the operating means displayed on the screen for inputting the destination is pressed by the driver who is the operator. Then, the condition setting screen display processing means (not shown) of the route search processing means sets a condition setting screen as shown in FIG. 17 on the display, and inputs a fee as the first condition on the condition setting screen. AR11 for inputting a range of charges, an area AR12 for inputting a range as a second condition, and an area AR1 for inputting a range of steps.
4. Area A for inputting required time, which is the third condition
R15 and an area AR for inputting a range of required time
16 is displayed.

Note that the areas AR12, AR14, AR16
In the above, the “more than” means that the first to third conditions are in the area AR1.
1, the degree is equal to or greater than the value input to AR13, AR15, and the "degree" is that the first to third conditions satisfy the area AR11,
To be within a predetermined setting range centered on the values input to R13 and AR15, "below" means that the first to third conditions are not more than the values input to the areas AR11, AR13, and AR15. Represent.

Then, when the operator presses a predetermined numeric key (not shown) as operating means, inputs the first to third conditions, and presses a decision key k21 as operating means,
The condition setting processing means of the route search processing means sets the input first to third conditions as a setting range. In addition,
k22 is a cancel key.

Next, a description will be given of a route search process when a charge setting range is input on the condition setting screen.

FIG. 18 is a first diagram showing a route search processing subroutine according to the third embodiment of the present invention.

First, the route search processing means reads out data of toll gates and the like. If there is a toll gate in the facility attribute, it reads out the entrance and exit, and reads out the toll data between the entrance interchange and the exit interchange. The charge from the departure point to the destination is calculated based on the charge data.

Subsequently, the route search processing means determines whether the fee falls within the set range set in the condition setting process. When the fare falls within the set range, the fare cost granting means of the route search processing means grants the fare cost Cf corresponding to the fare to the interchange node. Further, when the fee does not fall within the set range, the route search processing unit disables the passage of the route, or the fee cost change processing unit of the fee cost assignment processing unit,
A charge cost change process is performed to change the charge cost Cf. Then, the charge cost assignment processing means assigns a large charge cost to a predetermined node, in this embodiment, an exit.

Next, the flowchart will be described. Step S41: to judge whether there is a tollgate. When there is a tollgate, the process proceeds to step S42, and when there is no tollgate, the process returns. Step S42: Read the entrance and the exit. Step S43: The charge is calculated. Step S44: It is determined whether the charge falls within the set range. If the charge falls within the set range, step S46
Otherwise, the process proceeds to step S45. Step S45: Disable traffic or give a large toll cost, and return. Step S46: A charge cost corresponding to the charge is given to the node, and the process returns.

Next, a description will be given of a route search process when a setting range of a process is input on the condition setting screen.

FIG. 19 is a second diagram showing a route search processing subroutine according to the third embodiment of the present invention.

First, the route search processing means reads data such as tollgates, reads out the entrance and exit if the facility attribute includes a tollgate, reads out the toll data between the entrance interchange and the exit interchange, The charge from the departure point to the destination is calculated based on the charge data. The travel calculation processing means of the route search processing means performs travel calculation processing, reads road data # 1 to #n, and calculates an integrated value of the distances of the road data # 1 to #n as a travel.

Subsequently, the route search processing means determines whether or not the travel falls within the set range set in the condition setting processing. When the process falls within the set range, the fee cost grant processing means grants a fee cost Cf according to the fee to the interchange node. Further, if the itinerary does not fall within the set range, the route search processing means disables the passage of the route, or the charge cost change processing means performs the charge cost change processing to change the charge cost Cf. Then, the charge cost assignment processing means assigns a large charge cost to a predetermined node, in this embodiment, an exit.

Next, the flowchart will be described. Step S51 It is determined whether or not there is a tollgate. If there is a tollgate, the process proceeds to step S52; otherwise, the process returns. Step S52: Read the entrance and exit. Step S53: A charge and a process are calculated. Step S54: It is determined whether the process falls within the set range. If the stroke falls within the set range, step S56
Otherwise, the process proceeds to step S55. Step S55: Disable traffic or assign a large toll cost, and return. Step S56: Apply a fee cost according to the fee, and return.

Next, a description will be given of a route search process when a required time setting range is input on the condition setting screen.

FIG. 20 is a third diagram showing a route search processing subroutine according to the third embodiment of the present invention.

First, the route search processing means reads data such as toll gates, reads out the entrance and exit if the facility attribute includes a toll gate, reads the toll data between the entrance interchange and the exit interchange, The charge from the departure point to the destination is calculated based on the charge data. The required time calculation processing means (not shown) of the route search processing means performs required time calculation processing, reads out the road data # 1 to #n, and calculates the integrated value of the travel time of each of the road data # 1 to #n. Calculate as time.

Subsequently, the route search processing means determines whether the required time falls within the set range set in the condition setting processing. When the required time falls within the set range, the charge cost granting processing means assigns a charge cost Cf according to the charge to the interchange node.
If the required time does not fall within the set range, the route search processing means disables the passage of the route, or the charge cost change processing means performs the charge cost change processing to change the charge cost Cf. Then, the charge cost giving processing means assigns a large charge cost to a predetermined node, in this embodiment, an exit.

Next, the flowchart will be described. Step S61: to judge whether there is a tollgate. If there is a tollgate, the process proceeds to step S62; otherwise, the process ends. Step S62: Read out the entrance and exit. Step S63: The charge and the required time are calculated. Step S64: It is determined whether the required time falls within the set range. If the required time falls within the set range, the process proceeds to step S66; otherwise, the process proceeds to step S65. Step S65: Disable traffic or give a large toll cost, and return. Step S66: A charge cost corresponding to the charge is given to the node, and the process returns.

As described above, in this embodiment, when the driver sets the first to third conditions by operating the input unit 34 (FIG. 3) for the fare, the journey, the required time, and the like, the conditions are changed. Since the path to be satisfied is selected, the first to third
The route can be searched based on the condition of.

[0129] For example, it is possible to search for the route with the lowest fee, search for the route with the shortest total traveling distance of the general road, or search for the route with the shortest required time.

In the present embodiment, it is determined whether any one of the fee, the journey, and the required time falls within the set range. However, two or more of the fee, the travel, and the required time are determined. Can be determined whether or not falls within the set range.

The present invention is not limited to the above-described embodiment, but can be variously modified based on the gist of the present invention, and they are not excluded from the scope of the present invention.

[0132]

As described above in detail, according to the present invention, in a navigation device, data acquisition processing means for acquiring road facility data, and a passing road for specifying a passing road based on the road facility data. Specific processing means, toll data with reference to a toll table, toll rate calculation means for calculating the toll for the passing road, and search cost calculation means for calculating a search cost based on the toll cost corresponding to the toll And route selection processing means for selecting a route based on the search cost.

In this case, the passing road is specified based on the road facility data, the toll data is read out with reference to the toll table, the toll of the passing road is calculated, and the toll cost corresponding to the toll is calculated. Since the search cost is calculated, a predetermined route is not recommended even though the toll road is expensive.

Accordingly, the intended route is searched for by the driver, so that there is no need to repeat complicated work such as setting a passing point, and the operation of the navigation device can be simplified.

[0135] Another navigation apparatus of the present invention further includes a plurality of fee tables.

Then, the toll calculation processing means selects a toll table based on the road facility data, and reads out the toll data with reference to the selected toll table.

In this case, the toll table is selected based on the road facility data, and the toll data is read out with reference to the selected toll table. Therefore, the recording capacity of the search data file is reduced and the data amount is reduced. Can be. Therefore, not only the cost of the navigation device can be reduced, but also the time required to perform the fee cost providing process can be shortened.

In still another navigation device of the present invention, a condition setting processing means for setting conditions is further provided.
Charge cost change processing means for changing the charge cost based on the set conditions.

In this case, if conditions are set for a fee, a journey, a required time, and the like, a route that satisfies the conditions is selected. For example, a route with the lowest fee is searched for, or the total mileage of a general road is the shortest. It is possible to search for a route or to search for a route that requires the shortest time.

[Brief description of the drawings]

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

FIG. 2 is a comparison diagram of a conventional search route.

FIG. 3 is a block diagram of the navigation device according to the first embodiment of the present invention.

FIG. 4 is a diagram showing a data structure of a search data file according to the first embodiment of the present invention.

FIG. 5 is a diagram showing a first example of a charge table according to the first embodiment of the present invention.

FIG. 6 is a diagram illustrating a second example of a fee table according to the first embodiment of the present invention.

FIG. 7 is a diagram showing a departure place side search processing subroutine according to the first embodiment of the present invention.

FIG. 8 is a diagram showing a destination side search processing subroutine according to the first embodiment of the present invention.

FIG. 9 is a diagram showing a search result combining processing subroutine according to the first embodiment of the present invention.

FIG. 10 is a diagram showing a first example of a route search process according to the first embodiment of the present invention.

FIG. 11 is a diagram illustrating a second example of the route search processing according to the first embodiment of the present invention.

FIG. 12 is a diagram illustrating a third example of the route search processing according to the first embodiment of the present invention.

FIG. 13 is a diagram showing an example of a fee table.

FIG. 14 is a diagram showing an example of a fee table according to the second embodiment of the present invention.

FIG. 15 is a diagram showing a configuration of data such as a tollgate according to the second embodiment of the present invention.

FIG. 16 is a diagram showing a route search processing subroutine according to the second embodiment of the present invention.

FIG. 17 is a diagram illustrating an example of a condition setting screen according to the third embodiment of the present invention.

FIG. 18 is a first diagram illustrating a route search processing subroutine according to the third embodiment of the present invention.

FIG. 19 is a second diagram illustrating a route search processing subroutine according to the third embodiment of the present invention.

FIG. 20 is a third diagram illustrating a route search processing subroutine according to the third embodiment of the present invention.

[Explanation of symbols]

 Reference Signs List 14 navigation apparatus 17 navigation processing unit 31 CPU 91 data acquisition processing means 92 passing road identification processing means 93 fee calculation processing means 94 search cost calculation processing means 95 recommended route determination processing means

Continued on the front page F-term (reference) 2C032 HC08 HD21 2F029 AA02 AB01 AB07 AB13 AC01 AC08 AC09 AC14 AC18 AC19 AC20 5H180 AA01 BB02 BB04 BB05 BB12 BB13 CC12 EE02 EE10 FF04 FF05 FF07 FF12 FF22 FF25 FF27 FF27 FF27

Claims (6)

[Claims] 1. A data acquisition processing means for acquiring road facility data, a passing road identification processing means for identifying a passing road based on the road facility data, and reading the toll data with reference to a toll table. Charge calculation processing means for calculating a charge, search cost calculation processing means for calculating a search cost based on a charge cost corresponding to the charge, and route selection processing means for selecting a route based on the search cost. A navigation device characterized by the above-mentioned. 2. A system comprising a plurality of charge tables,
2. The navigation device according to claim 1, wherein the toll calculation processing means selects a toll table based on road facility data, and reads out the toll data with reference to the selected toll table. 3. The navigation device according to claim 2, wherein the toll table is divided for each highway / toll road line. 4. The navigation apparatus according to claim 1, further comprising: condition setting processing means for setting a condition; and charge cost change processing means for changing a charge cost based on the set condition. 5. The navigation device according to claim 1, wherein the fee cost is obtained by multiplying a fee by a coefficient. 6. A computer, comprising: data acquisition processing means for acquiring road facility data; passing road identification processing means for identifying a passing road based on the road facility data; Function as toll calculation processing means for calculating a road toll, search cost calculation processing means for calculating a search cost based on a toll cost corresponding to the toll, and route selection processing means for selecting a route based on the search cost A program for a route search method characterized by the above-mentioned.