JP2006003169A - Route guidance system and program for route guidance method - Google Patents

Abstract

<P>PROBLEM TO BE SOLVED: To enable the evaluation of a candidate route on the basis of the traffic congestion state when the candidate route is searched. <P>SOLUTION: The route guidance system comprises: the route information acquisition means for acquiring map data; the route search means for searching a plurality of routes from the starting point to the destination on the basis of the map data; the distance of traffic congestion calculation means for calculating the distance of traffic congestion, wherein the congestion degree indicating the degree of congestion are over the prescribed value in the candidate route; and the distance of the traffic congestion display means for displaying the candidate route and the distance of the traffic congestion on the prescribed screen. A driver can evaluate the candidate route on the basis of the traffic congestion state because of the candidate route and distance of the traffic congestion are displayed on the prescribed screen. <P>COPYRIGHT: (C)2006,JPO&NCIPI

Description

  The present invention relates to a route guidance system and a route guidance method.

  Conventionally, in a navigation device, for example, the current position of a vehicle, that is, the current position is detected by GPS (Global Positioning System), and the direction of the vehicle, that is, based on the turning angle of the vehicle detected by a gyro sensor, that is, The vehicle direction is detected, map data is read from the data recording unit, a map screen is formed on the display unit, the vehicle position indicating the current location, a map around the vehicle position, and the vehicle The direction is displayed. Therefore, the driver who is an operator can drive the vehicle according to the vehicle position displayed on the map screen, the map around the vehicle position, and the vehicle direction.

  Further, when the driver inputs a destination and sets search conditions, a route from the departure point represented by the current location to the destination is searched according to the map data based on the search conditions. The searched route, that is, the searched route is displayed together with the vehicle position on the map screen. Therefore, the driver can drive the vehicle along the displayed search route.

By the way, in a navigation device, a plurality of routes are usually searched based on search conditions, a candidate route display screen is formed on the display unit, and a plurality of search routes according to search conditions are displayed on the candidate route display screen. Is displayed. In this case, for each candidate route from the departure point to the destination, the pattern corresponding to the road on the map, that is, the road pattern is displayed as a line, and from the departure point to the arrival point Required time, the distance between the departure point and the destination, and the like are calculated and displayed as supplementary information on the candidate route display screen. Therefore, the driver can evaluate each candidate route based on the required time, distance, and the like, and select a predetermined candidate route (see, for example, Patent Document 1).
Japanese Patent Laid-Open No. 10-26932

  However, in the conventional navigation device, each candidate route is evaluated based on the required time, distance, etc., and it is possible to evaluate the traffic jam situation when the vehicle is driven along each candidate route. Can not.

  The present invention provides a program for a route guidance system and a route guidance method that solves the problems of the conventional navigation device and can evaluate candidate routes based on a traffic jam situation when a route is searched. With the goal.

  Therefore, in the route guidance system of the present invention, information acquisition processing means for acquiring map data, route search processing means for searching a plurality of routes from the departure point to the destination as candidate routes based on the map data, Traffic congestion variable calculation processing means for calculating a traffic congestion variable for which the traffic congestion degree representing the degree of traffic congestion in each candidate route takes a predetermined value; traffic congestion variable display processing means for displaying the candidate route and the traffic congestion variable on a predetermined screen; Have

  According to the present invention, a traffic congestion variable in which the traffic congestion degree indicating a traffic congestion level takes a predetermined value is calculated, and the candidate route and the traffic congestion variable are displayed on a predetermined screen, so that the driver can select the candidate route based on the traffic congestion status. Can be evaluated.

  Hereinafter, embodiments of the present invention will be described in detail with reference to the drawings.

  FIG. 1 is a block diagram showing a navigation system in an embodiment of the present invention, FIG. 2 is a diagram showing an example of a vehicle speed table in the embodiment of the present invention, and FIG. 3 is a congestion degree calculation table in the embodiment of the present invention. FIG. 4 is a diagram showing an example, and FIG. 4 is a diagram showing an example of a required link time table in the embodiment of the present invention.

  In FIG. 1, reference numeral 14 denotes an information terminal, for example, a navigation device as an in-vehicle device mounted on a vehicle. The navigation device 14 includes a GPS sensor 15 as a current location detection unit for detecting a current location, various types of data in addition to map data. The data recording unit 16 as a recording device in which the above information is recorded, a navigation processing unit that functions as a computer based on various programs, data, and the like, and performs various arithmetic processes such as navigation processing based on the input information 17, an orientation sensor 18 as an orientation detection unit for detecting the direction of the vehicle, an operation unit 34 as a first input unit for performing a predetermined input when operated by a driver as an operator, and a screen (not shown) A display unit 35 as a first output unit for performing various displays according to the displayed image and notifying the driver, A voice input unit 36 as a second input unit for performing predetermined input by voice, a voice output unit 37 as a second output unit for performing various displays by voice and notifying the driver, a communication terminal The navigation processing unit 17 is connected with an operation unit 34, a display unit 35, a voice input unit 36, a voice output unit 37, and a communication unit 38. The navigation processor 17 is also connected with a vehicle speed sensor 41 as a vehicle speed detector.

  The GPS sensor 15 detects the current location on the earth by receiving radio waves generated by an artificial satellite, and also detects the time.

  In the present embodiment, the GPS sensor 15 is used as the current position detection unit, but a distance sensor, a steering sensor, an altimeter, etc. (not shown) may be used alone or in combination instead of the GPS sensor 15. Further, a gyro sensor, a geomagnetic sensor, or the like can be used as the direction sensor 18.

  The data recording unit 16 includes a map database including map data files, and map data is recorded in the map database. The data recording unit 16 also records data for outputting predetermined information by the audio output unit 37. The map data includes intersection data related to intersections, node data related to nodes, road data related to road links, search data processed for searching, facility data related to facilities, and the like.

  The navigation processing unit 17 includes a CPU 31 as a control device that controls the entire navigation device 14, a RAM 32 as a first recording medium used as a working memory when the CPU 31 performs various arithmetic processes, and a control device. In addition to the program, the ROM 33 as a second recording medium on which various programs for searching for a route to the destination, route guidance, etc. are recorded, various data, programs and the like used for recording 3 is provided with a flash memory (not shown) as a recording medium. Note that an MPU or the like may be used as the control device instead of the CPU 31.

  The data recording unit 16 includes a disk (not shown) such as a hard disk, a CD, a DVD, and an optical disk as a fourth recording medium for recording the various data, and reads various data. A head (not shown) such as a read / write head for writing is provided. Note that a memory card or the like can be used as the fifth recording medium in the data recording unit 16.

  By the way, various programs can be recorded in the ROM 33 and various data can be recorded in the data recording unit 16, but the programs, data, and the like can also be recorded on a hard disk or the like. In this case, the program, data, etc. can be read from a hard disk or the like and written to the flash memory. Therefore, the program, data, etc. can be updated by exchanging the hard disk or the like. Further, when an automatic transmission control device is mounted to control an automatic transmission (not shown) mounted on the vehicle, the control program and data for the automatic transmission control device are also stored in the hard disk or the like. Can be recorded. Further, the program, data, etc. can be received via the communication unit 38 and written to the flash memory.

  The operation unit 34 is operated by the driver to correct the current location at the start of traveling, to input a departure point and a destination, to input a passing point, and to activate the communication unit 38. As the operation unit 34, a keyboard, a mouse, or the like disposed independently of the display unit 35 can be used. Further, as the operation unit 34, a predetermined input operation is performed by touching or clicking an image operation unit such as various keys, switches, and buttons displayed as images on the screen formed in the display unit 35. It is possible to use a touch panel that can be used.

  A display can be used as the display unit 35. Then, on various screens formed on the display unit 35, the vehicle position indicating the current location, a map, a searched route, guidance information along the searched route, traffic information, etc. are displayed, or until the next intersection in the searched route. In addition to displaying the distance and the direction of travel at the next intersection, the operation guidance, operation menu, and key guidance of the image operation unit, operation unit 34, voice input unit 36, etc. can be displayed. A multiplex broadcast program or the like can be displayed.

  The voice input unit 36 includes a microphone (not shown) and the like, and can input necessary information by voice. Further, the voice output unit 37 includes a voice synthesizer and a speaker (not shown), and the search route, guidance information, traffic information, and the like are output from the voice output unit 37, for example, as voice synthesized by the voice synthesizer. .

  The communication unit 38 is arranged along the road with various types of information transmitted from a road traffic information center (not shown) such as a VICS (registered trademark) vehicle center as a first information provider. A beacon receiver for receiving as a radio beacon, an optical beacon or the like via a radio beacon device or an optical beacon device, an FM receiver for receiving as an FM multiplex broadcast via an FM broadcast station, or the like. And, the beacon receiver receives traffic information such as traffic jam information, regulation information, parking lot information, traffic accident information, service area congestion status information, etc. In addition to the traffic information, news, General information such as weather forecasts can be received as FM multiplexed information. The beacon receiver and the FM receiver are unitized and arranged as a VICS receiver, but can be arranged separately. The traffic jam information includes a distance from the head to the tail of the traffic jam, a traffic jam level for each road link constituting each road, a link required time required for traveling on each road link, and the like.

  The communication unit 38 can also receive various information such as traffic information and general information from the information center 51 as the second information provider. For this purpose, the communication unit 38 and the information center 51 are connected via a network 43.

  The navigation device 14, the road traffic information center, the information center 51, the network 43 and the like constitute a navigation system, and various types of information are transmitted and received between the communication unit 38 and the communication unit 57 of the information center 51.

  The network 43 may be a LAN (Local Area Network), a WAN (Wide Area Network), a communication line network such as the Internet, or the like.

  The information center 51 includes a server 53, a communication unit 57 connected to the server 53, a database (DB) 58 as an information recording unit, and the like, and the information center 51 and navigation through the network 43 by the communication unit 57. Two-way communication is performed with the device 14, and traffic information, general information, and the like are provided. For this purpose, the server 53 includes a CPU 54, a RAM 55, a ROM 56, and the like as an arithmetic device and a control device, and functions as a computer based on predetermined programs, data, and the like. In addition, the same data as various data recorded in the data recording unit 16 can be recorded in the database 58. The server 53 and the navigation processing unit 17 can also constitute a computer. Further, an MPU or the like can be used instead of the CPU 54.

  By the way, in the present embodiment, in addition to the map database, a travel history database including a travel history data file, a statistical database including a statistical data file, and the like are formed in the data recording unit 16, and the travel history data file The travel history data is recorded in the statistical data file.

  The statistical data is history information representing a history of traffic information such as traffic conditions provided in the past, and is based on traffic information provided by the road traffic information center and the road traffic census provided by the Ministry of Land, Infrastructure, Transport and Tourism. It is created by combining, processing, and applying statistical processing to data representing traffic volume (hereinafter referred to as “road traffic census information”).

  In addition to the traffic information provided by the road traffic information center and the road traffic census information, the statistical data includes road timetable information provided by the Ministry of Land, Infrastructure, Transport and Tourism, and an information center, if necessary. It can also be created by combining and processing probe data 51, which is travel history data collected from a plurality of vehicles, and performing statistical processing.

  The data items of the statistical data include a route on which the vehicle has traveled in the past, that is, a road number (ID) and a travel direction for each road link Li (i = 1, 2,..., N) constituting each travel route. A direction flag to be represented, an information type representing whether the traffic information is provided by a road traffic information center or the like, or the road traffic census information, every predetermined timing t, in this embodiment, 15 [minutes] Is a traffic jam degree KJi (t) (i = 1, 2,..., N) representing the degree of traffic jam every time. In this embodiment, the degree of traffic congestion KJi (t) is used as a traffic congestion index indicating the degree of traffic congestion, and is expressed separately for traffic congestion, congestion, and non-congestion, and is formed corresponding to the road link Li and time. It is recorded in the statistical database as a traffic congestion degree table (not shown) comprising a matrix. In the statistical database, when the traffic congestion degree KJi (t) is calculated, the vehicle speed Kvi (t) (i = 1, 2,..., N) is calculated based on the road type for each road link Li. A vehicle speed table as shown in FIG. Note that, in the congestion degree KJi (t), for example, on a general road, when the traffic is traveling at a vehicle speed of 10 km / h or less, the congestion is higher than 10 km / h and 20 km / h. When traveling at the following vehicle speed, non-congested traffic refers to traveling at a vehicle speed higher than 20 [km / h].

  In the present embodiment, the time in the matrix is represented by an instantaneous time such as 8:00, 8:15,..., But 8: 0 to 8:15, 8: It can be expressed in a time zone such as 15 to 8:30,. In the present embodiment, the road type includes an expressway, an urban expressway, and a general road.

  The travel history data is calculated on the basis of data representing the travel performance on the travel route, that is, travel data, and is recorded as a travel history database. The data item of the travel history data is a link required time that represents a required time every 15 [minutes] in a predetermined cycle when the vehicle travels on each road link Li constituting the travel route. STi (t) (i = 1, 2,..., N), the degree of congestion at every predetermined timing t when traveling on each road link Li, and every 15 minutes in this embodiment. SJi (t) (i = 1, 2,..., N), etc., and the link required time STi (t) includes the road link Li and the reference time (hereinafter referred to as “reference time”) as shown in FIG. Is recorded in the travel history database as a link required time table composed of a matrix formed corresponding to a certain time. The congestion degree SJi (t) is calculated with reference to the congestion degree calculation table shown in FIG. 3, and similarly, a congestion degree table (not shown) composed of a matrix formed corresponding to the road link Li and time. Recorded in the travel history database.

  The link required time STi (t) is calculated on the basis of the past plural times, in the present embodiment, a maximum of five driving results, and is accumulated for each road link Li. When the number of required times is 1, the link required time STi (t) is not calculated.

  When the number of required times accumulated for each road link Li is 2, in addition to the two required times τ1 and τ2, it is calculated based on the congestion degree KJi (t) of the statistical data. The link required time STi (t) is calculated based on the estimated required time τ3.

  For this purpose, first, the road type for each road link Li is read, and then the congestion degree KJi (t) for each road link Li is read with reference to the congestion degree table of the statistical database. Subsequently, with reference to a vehicle speed table having the same contents as the vehicle speed table shown in FIG. 2, the vehicle speed Kvi (t) corresponding to the road type and the degree of congestion KJi (t) is calculated, and the link length of each road link Li and The required time τ3 can be calculated based on the vehicle speed Kvi (t). When the required times τ1 to τ3 are calculated in this way, the median value of the required times τ1 to τ3 is set as the link required time STi (t). In addition, although the link length of each road link Li can be read from road data, it can have as a data structure of driving history data.

  Further, when the number of required times accumulated for each road link Li is 3 or more, the median value of the required times τ1, τ2,... Is set as the link required time STi (t). Then, the vehicle speed Svi (t) (i = 1, 2,..., N) is calculated based on the link length of each road link Li and the link required time STi (t), and then, for each road link Li. The traffic type SJi (t) corresponding to the road type and the vehicle speed Svi (t) can be calculated by reading the road type and referring to the traffic level calculation table of FIG.

  In the statistical data, it is possible to add traffic jam prediction information for predicting a traffic jam status to the history information. In that case, in creating the statistical data, detailed conditions such as date and time, day of the week, weather, various events, seasons, facility information (presence / absence of large facilities such as department stores and supermarkets) are added to the history information.

  In the present embodiment, the data recording unit 16 is provided with the map database, the travel history database, the statistical database, and the like, but the information center 51 includes the map database, the travel history. Databases, statistical databases, etc. can be provided.

  Next, a basic operation of the navigation system having the above configuration will be described.

  First, when the operation unit 34 is operated by the driver and the navigation device 14 is activated, a navigation initialization processing unit (not shown) of the CPU 31 performs navigation initialization processing, and the current location and direction detected by the GPS sensor 15. While reading the direction of the vehicle detected by the sensor 18, various data are initialized. Note that the matching processing means (not shown) of the CPU 31 performs matching processing, and the current location is on any road link based on the trajectory of the read current location and the shape and arrangement of each road link constituting the surrounding road. The current location is specified by determining whether the current location is located.

  Subsequently, an information acquisition processing unit (not shown) of the CPU 31 performs an information acquisition process and reads and acquires the map data from the data recording unit 16 or receives and acquires it from the information center 51 or the like via the communication unit 38. To do. When acquiring from the information center 51, the information acquisition processing means downloads the received map data to a flash memory, a hard disk or the like. Moreover, when acquiring map data via the communication part 38, a program can also be acquired.

  The display processing means (not shown) of the CPU 31 performs display processing, forms a map screen on the display unit 35, and displays the vehicle position, a map around the vehicle position, and the vehicle direction on the map screen. . Therefore, the driver can drive the vehicle according to the vehicle position, the map around the vehicle position, and the vehicle direction.

  The navigation device 14 can receive traffic information, general information, and the like via the communication unit 38. For this purpose, the additional information acquisition processing means of the information acquisition processing means performs additional information acquisition processing, and receives and acquires the traffic information, general information, and the like as additional information. Therefore, the display processing means can display additional information on the map screen.

  The traffic information specifies information type data indicating the type of information, secondary mesh X and Y data for specifying a secondary mesh as a mesh, and a road link connecting two points (for example, intersections). And link number data representing the uplink / downlink and link information representing the content of information provided corresponding to the link number data. The link information includes, for example, a traffic jam from the start point of the road link. Congestion head data representing the distance to the head, traffic congestion degree data representing the degree of traffic congestion, traffic jam length data representing the traffic jam section from the head of the traffic jam to the tail of the traffic jam (distance), and the like.

  Therefore, the display processing means converts each link information in the traffic information into, for example, a traffic congestion arrow as a traffic condition index indicating a traffic congestion index indicating whether the traffic is congested or not. A traffic jam arrow is displayed along the road on the map screen. In this case, the color of the road, the traffic jam arrow, etc. is changed to red, orange, etc. according to the degree of traffic jam.

  In this manner, the driver can know the traffic jam situation on the route on which the vehicle is to travel, the searched route, and the like.

  Next, the operation of the route guidance system when the navigation device 14 or the navigation system is used for guiding a route will be described.

  FIG. 5 is a flowchart showing the operation of the route search processing means in the embodiment of the present invention, FIG. 6 is a diagram showing an example of a candidate route display screen in the embodiment of the present invention, and FIG. 7 is in the embodiment of the present invention. FIG. 8 is a first diagram illustrating a method for calculating the total required time, FIG. 8 is a second diagram illustrating a method for calculating the total required time in the embodiment of the present invention, and FIG. 9 is an entire process according to the embodiment of the present invention. It is a figure which shows the example of a list display screen.

  First, when a driver inputs a destination by operating the operation unit 34 (FIG. 1), a destination setting processing unit (not shown) of the CPU 31 performs a destination setting process to set the destination. Note that the departure place can be input and set as necessary. Moreover, a predetermined point can be registered in advance, and the registered point can be input as a destination.

  When the destination is set, the route search processing unit (not shown) of the CPU 31 performs route search processing, reads the current location, the destination, etc., and is represented by the current location based on the current location, the destination, and the map data. The route from the starting point to the destination is searched. Of the roads represented by the road data constituting the map data, roads other than the narrow streets are the roads that are subject to route search and route guidance.

  For this purpose, the candidate route search processing means of the route search processing means performs candidate route search processing, searches a plurality of, in this embodiment, five routes, respectively according to a predetermined search condition, and searches each search route. Let it be a candidate route Rtj (j = 1, 2,..., 5) for each search condition. In the present embodiment, each candidate route Rtj is given priority to a “recommended” candidate route and a toll road that are searched with priority given to the one having the smallest total link cost assigned to each road link Li. The searched “paid priority” candidate route, the “general priority” candidate route searched with priority on the general road, the “distance priority” candidate route searched with priority on the short distance of the whole process, And based on preset conditions, for example, the route is composed of “other route” candidate routes searched with priority given to the one with the next smallest link cost.

  Next, a method for calculating each candidate route Rtj will be described.

  The selection route calculation processing means of the candidate route calculation processing means performs the selection route calculation processing and calculates the candidate route Rt1, first, from the departure point to the destination based on the search condition corresponding to the candidate route Rt1. A plurality of (X), for example, three routes are assumed to be selected routes rj (j = 1, 2,..., X).

  To that end, each road link Li that constitutes a road is prohibited from turning right or left depending on the type of road, such as an expressway of the toll road, an urban expressway, or a national road, a main local road, or a prefectural road of the general road, Various link costs are set according to the presence or absence of traffic restrictions such as one-way traffic and the size of the link length representing the length of each road link Li. In the route search processing, roads other than narrow streets among the roads represented by the road data constituting the map data are subject to route search, link costs are set, and narrow streets are It is not subject to route search, and no link cost is set.

  Subsequently, the total travel distance calculation processing means of the candidate route calculation processing means performs the total travel distance calculation processing, and the link lengths ρm (m of all the road links Lm constituting the candidate route Rt1 among the respective road links Li. = 1, 2,... M), and the total stroke distance Σρj (j = 1) is calculated.

  Subsequently, the total required time calculation processing means of the candidate route calculation processing means performs the total required time calculation processing, and each road constituting each selected route rj when the vehicle travels along each selected route rj. The link required times STi (t) corresponding to the links Lmk (k = 1, 2,..., K) are totaled to calculate the total required time ΣTj (j = 1, 2,..., M).

  Next, the total required time calculation process will be described.

  In FIG. 7, rj is the selected route, Pr is the current location, G is the destination, nd1 to nd7 are nodes on the selected route rj, Lm1 to Lm8 are road links on the selected route rj, and the road links Lm1 to Lm8 are The current location Pr, the nodes nd1 to nd7, and the destination G are connected.

  By the way, among the roads that are subject to route search and route guidance, the traffic information provided by the road traffic information center, etc., and the roads to which the road traffic census information is provided are described in the statistical database. Statistical data can be used, and the travel history data in the travel history database can be used for roads that have been traveled twice or more of the roads.

  Therefore, in the present embodiment, among the roads subject to route search and route guidance, a road that cannot use any of statistical data and travel history data is defined as a navigation standard road, and statistical data and A road that can use at least the travel history data in the travel history data is referred to as a travel history use road, and a road that can use only the statistical data and the statistical data in the travel history data is referred to as a statistical use road.

  Then, in calculating the total required time ΣTj, the total required time calculation processing means for the section of the navigation standard road, the link required time NTi based on the fixed vehicle speed and link length for each road link Lm. (I = 1, 2,..., N) is calculated, and the link required time NTi is used. The total required time calculation processing means reads and uses the link required time STi (t) recorded in the travel history database for the section of the travel history utilization road. Further, the total required time calculation processing means reads out the congestion degree KJi (t) recorded in the statistical database for the section of the statistical use road and refers to the vehicle speed table of FIG. 2 to determine the vehicle speed Kvi (t). Read, and then, based on the link length ρi and the vehicle speed Kvi (t) of each road link Lm, a link required time KTi (t) (i = 1, 2,..., N) is calculated, and the link required time KTi Use (t).

  Since the communication unit 38 always acquires the current traffic jam information transmitted from the road traffic information center, the communication unit 38 is traveling on a road where the current traffic jam information transmitted from the road traffic information center can be used. In this case, the total required time calculation processing means uses the link required time VTi (i = 1, 2,..., N) in the current traffic jam information.

  For example, in the case of the selected route rj as shown in FIG. 7, the total required time calculation processing means sets the link required time NTi (t) for the road links Lm1 and Lm8 and the road links Lm2 to Lm4. Uses the link required time STi (t) and the link required time KTi (t) for the sections of the road links Lm5 to Lm7, and calculates the total required time ΣTj by adding each link required time.

  By the way, the link required times STi (t) and KTi (t) are both recorded with a period of 15 [minutes], so that the total required time calculation processing means calculates the total required time ΣTj. In calculating the time, a time slice process is performed.

  8, rj is a selected route, Pr is a current location, G is a destination, L1 to LN are road links, n1, n2,... Are nodes, and arrival time prediction processing means of the total required time calculation processing means. Performs arrival time prediction processing, reads the link required times STi (t) and KTi (t) for each road link L2, L5, L8, and L7 on the selected route rj, and the link required times STi (t), Based on KTi (t), the time when the vehicle arrives at each of the nodes n2, n4, n6 and the destination G is predicted, and further, the road link ahead of each of the nodes n2, n4, n6 based on the predicted time. The link required times STi (t) and KTi (t) are read for L5, L8, and L7.

  For example, when the total required time ΣTj is calculated using the link required time STi (t), as shown in FIG. 8, when the current location Pr is departed toward the destination G at 8:00, The total required time calculation processing means reads the link required time STi (t) at the reference time 8:00 referring to the link required time table of FIG. In the link required time STi (t) at the reference time 8:00, the link required time required to travel on the link L2 is 20 [minutes]. Therefore, the total required time calculation processing means causes the vehicle to move to the node n2. The arrival time is predicted to be 8:20.

  Subsequently, the total required time calculation processing means calculates the link required time required to travel on the road link L5 ahead of the node n2, and is the time at which it arrives at the node n2 in the link required time table. : 20, the link required time STi (t) is not recorded. Therefore, the total required time calculation processing means reads the link required time STi (t) at the reference time 8:15 immediately before the time of arrival at the node n2. At the required link time STi (t) at the reference time 8:15, the required link time required to travel the link L5 is 10 [minutes], so the total required time calculation processing means arrives at the node n4. The time is predicted to be 8:30.

  Similarly, the total required time calculation processing means predicts that the time to arrive at the node n6 is 8:36 based on the link required time STi (t) at the reference time 8:30, and reaches the destination G. The arrival time is predicted to be 8:44.

  Subsequently, the total required time calculation processing means calculates the total required time ΣTj as 44 [minutes] by subtracting the departure time from the time of arrival at the destination G. As described above, when traveling on a road where the current traffic information can be used, the link required time of the current traffic information is used instead of the link required time STi (t) of the reference time. VTi is used.

  Next, the candidate route determination processing means of the candidate route calculation processing means performs candidate route determination processing, and determines the shortest total required time ΣTj from among the selected routes rj as the candidate route Rt1.

  In this way, when the candidate route Rt1 corresponding to the predetermined search condition is determined, the traffic jam determination processing means (not shown) of the CPU 31 subsequently performs the traffic jam determination processing, and the traffic jam location and the congestion on the candidate route Rt1. Identify the location. Therefore, the traffic congestion determination processing means, for the section of the travel history utilization road on the candidate route Rt1, the road number of the road link Li whose traffic congestion degree SJi (t) recorded in the travel history database is congested or congested. For the section of the statistical use road, the road number of the road link Li whose traffic congestion degree KJi (t) recorded in the statistical database is traffic jam or congestion is read. Since the communication unit 38 always acquires the current traffic jam information transmitted from the road traffic information center, the communication unit 38 travels on a road where the current traffic jam information transmitted from the road traffic information center can be used. If there is, the traffic number VJi (i = 1, 2,..., N) in the current traffic jam information reads the road number of the road link Li that is jammed or congested.

  Subsequently, the traffic congestion variable calculation processing unit (not shown) of the CPU 31 performs the traffic congestion variable calculation processing, and calculates the total of the link length of each road link Li of the traffic congestion location and the congestion location identified on the candidate route Rt1 as the amount of traffic congestion. It is calculated as a traffic jam distance as a traffic jam variable. In the present embodiment, the degree of traffic congestion SJi (t), KJi (t), VJi takes a predetermined value, and the distance of a traffic jam or congested area is calculated as the traffic jam distance. The distance of the area where the values of the congestion degree SJi (t), KJi (t), and VJi are congested can be used as the congestion distance. Further, in the present embodiment, the values of the congestion degree SJi (t), KJi (t), and VJi are set in three stages of congestion, congestion, and non-congestion. In other embodiments, for example, It can be further subdivided, such as traffic jams, light traffic jams, congestion, and non-traffic jams. In this case, the distance of an area that is heavy traffic jam or light traffic jam can be calculated as the traffic jam distance.

  Subsequently, the processing described above is repeated for each candidate route Rt2 to Rt5.

  Next, candidate route display processing means (not shown) of the CPU 31 performs candidate route display processing, forms a candidate route display screen as shown in FIG. 6 on the display unit 35, and displays a wide area on the candidate route display screen. As well as the current location Pr, the destination G, the candidate route Rtj, and the like.

  In FIG. 6, Rtx is a predetermined candidate route of the candidate route Rtj, for example, a “recommended” candidate route, and Rty is another predetermined candidate route of the candidate route Rtj, for example, “another route”. The candidate routes Rtx and Rty are highlighted with respect to other roads. When a predetermined candidate route among the candidate routes Rtj matches, it is displayed as a common candidate route.

  The candidate route display screen includes an area AR1 for displaying a map orientation and scale, a key k1 for displaying the previous screen, a key k2 for displaying a detailed map, A stroke list screen is formed, and a key k3 for displaying a list of all strokes, a key k4 for displaying a map of a wide area, and the like are displayed, and a predetermined candidate route of each candidate route Rtj is selected. Buttons b1 to b5 and the like are displayed. The keys k1 to k4 constitute a first operation element, and the buttons b1 to b5 constitute a second operation element for selecting a candidate route.

  In this way, when a wide area map is displayed on the candidate route display screen, and the current location Pr, destination G, candidate route Rtj, and the like are further displayed, the driver presses the key k3 as necessary. Along with this, the all-stroke list display processing means and the congestion variable display processing means (not shown) of the CPU 31 perform the all-stroke list display processing and the congestion variable display processing, and the display unit 35 shows a predetermined screen as shown in FIG. The entire process list display screen is formed, and the entire process list is displayed on the entire process list display screen. The all-stroke list is represented by the search conditions for each candidate route Rtj, the distance of all the routes, the distance of the toll road during the whole route, the total route fee, and the total required time ΣTj (in FIG. 9, “required time”). ) And the congestion distance on each candidate route Rtj. The distance representing the traffic jam distance is in units of kilometers.

  At this time, the highlighting processing means of the all-stroke list display processing means performs a highlighting process, highlights a route in which traffic congestion has occurred among the candidate routes Rtj, that is, a traffic jam route, Use bold letters to indicate the congestion link length. In order to perform highlighting, a frame of a predetermined color, in this embodiment, a red color can be displayed around the total traffic jam link length. In another embodiment, the characters representing the total traffic jam link length can be displayed in a predetermined color, for example, red. Further, in the present embodiment, the congestion distance is displayed on the entire process list screen. However, in another embodiment, the congestion distance is associated with the candidate route Rtj on the candidate route display screen. Can be displayed.

  Further, on the candidate route display screen, the driver selects and specifies a predetermined candidate route based on a passing point of each candidate route Rtj, an emphasis display on the traffic route, etc., and presses the corresponding buttons b1 to b5. Then, the specific candidate route display processing means (not shown) of the CPU 31 performs the specific candidate route display processing to form a specific candidate route display screen (not shown) on the display unit 35, and the button pressed on the specific candidate route display screen. The corresponding candidate route is displayed as a specific candidate route.

  Then, when the driver presses the guidance start key on the specific candidate route display screen, the guidance processing means (not shown) of the CPU 31 performs guidance processing and provides route guidance to the driver. For this purpose, the route display processing means of the guidance processing means performs route display processing, reads the route data, and displays the searched route on the map screen according to the route data.

  If necessary, the voice output processing means of the guidance processing means performs voice output processing and outputs a search route by voice from the voice output unit 37 to provide route guidance.

  Thus, the driver can recognize the total traffic jam link length for each candidate route Rti on the all-stroke list screen, and thus can sufficiently evaluate each candidate route Rti. For example, as shown in FIG. 9, in the “recommended” candidate route and the “other route” candidate route, there is no part where the traffic jam occurs even though the distance of the entire route is long, and the total traffic jam Since the link length is zero, it can be seen that the total required time ΣTj is short. In contrast, the “paid priority” candidate route has a long total traffic link length despite the use of a toll road, so the total required time ΣTj becomes long and is the same as the “general priority” candidate route. It turns out that it becomes. Further, in the “general priority” candidate route, it is understood that not only the distance of the entire process is long, but also there is a traffic jam portion, so that the total required time ΣTj becomes long. Further, in the “distance priority” candidate route, there is a portion where the traffic jam occurs even though the distance of the whole process is short, and it is understood that the total required time ΣTj becomes long. That is, the driver can evaluate each candidate route Rti based on the total traffic jam link length.

  The information center 51 can perform route search processing. In that case, the CPU 31 transmits the current location, the destination, and the like to the information center 51. When the information center 51 receives the current location and destination, the route search processing means (not shown) of the CPU 54 performs the same route search processing, reads the search data from the database 58, and based on the current location, destination and search data. The route from the departure point to the destination is searched, and route data representing the searched route is output. Subsequently, a transmission processing unit (not shown) of the CPU 54 performs transmission processing and transmits the route data to the navigation device 14. Therefore, in the navigation device 14, when the information acquisition processing means receives the route data from the information center 51, the guidance processing means performs route guidance as described above.

  In this way, route guidance is performed, and the driver can drive the vehicle according to the searched route.

  In another embodiment, after the route search process is performed in the information center 51, a candidate route display process, a specific candidate route display process, an all-stroke list display process, and the like can be performed. In that case, the database 58 comprises a map database consisting of map data files. In addition to the database 58, a travel history database including a travel history data file, a statistical database including a statistical data file, and the like are formed connected to the server 53, and the travel history data is stored in the travel history data file. Statistical data is recorded in the data file. For this purpose, traveling data based on the traveling performance of the vehicle is sent from the navigation device 14 to the information center 51.

Next, a flowchart will be described.
Step S-1 The repetition is started.
Step S1-1: The candidate route Rtj is calculated.
Step S1-2: A traffic jam location and a congestion location on the candidate route Rtj are specified.
Step S1-3: Calculate the total link length of the traffic jam location and the congestion location.
Step S-2 The repetition is terminated.
Step S-3: Create an all process list screen and end the process.

  In the present embodiment, the congestion distance is displayed on the all process list screen. However, in another embodiment, the congestion ratio as a congestion variable may be displayed on the all process list screen. it can. For this purpose, the traffic variable calculation processing means of the CPU 31 calculates the traffic congestion ratio, for example, as a percentage by dividing the calculated traffic jam distance by the distance of the entire route of the candidate route Rti. And the said traffic congestion variable display process means displays a traffic congestion ratio on the said all process list screen.

  In addition, this invention is not limited to the said embodiment, It can change variously based on the meaning of this invention, and does not exclude them from the scope of the present invention.

It is a block diagram which shows the navigation system in embodiment of this invention. It is a figure which shows the example of the vehicle speed table in embodiment of this invention. It is a figure which shows the example of the congestion degree calculation table | surface in embodiment of this invention. It is a figure which shows the example of the link required time table in embodiment of this invention. It is a flowchart which shows operation | movement of the route search process means in embodiment of this invention. It is a figure which shows the example of the candidate path | route display screen in embodiment of this invention. It is a 1st figure explaining the calculation method of the total required time in embodiment of this invention. It is a 2nd figure explaining the calculation method of the total required time in embodiment of this invention. It is a figure which shows the example of the all process list display screen in embodiment of this invention.

Explanation of symbols

14 Navigation device 16 Data recording unit 17 Navigation processing unit 31 CPU
43 Network 51 Information Center 53 Server G Destination L1 to L7, LN, Lm1 to Lm8 Road Link Pr Current Location Rtj Candidate Route

Claims (8)

  Information acquisition processing means for acquiring map data, route search processing means for searching a plurality of routes from a departure point to a destination as candidate routes based on the map data, and a traffic jam indicating the degree of traffic jam in each candidate route A route guidance system comprising: a traffic jam variable calculation processing unit that calculates a traffic jam variable having a predetermined value; and a traffic jam variable display processing unit that displays the candidate route and the traffic jam variable on a predetermined screen.   The route guidance system according to claim 1, wherein the congestion variable calculation processing means calculates a congestion variable in an area where the congestion degree is congestion and congestion.   The route guidance system according to claim 1, wherein the congestion variable calculation processing means calculates a congestion variable based on traffic information recorded in a recording device in association with time and road links.   The route guidance system according to claim 1, wherein the congestion variable calculation processing means calculates a congestion variable based on traffic information recorded in a recording device in association with time and road links, and current traffic information.   The route guidance system according to claim 1, wherein the traffic jam variable display processing means displays candidate routes and traffic jam variables in association with each other for each search condition.   The route guidance system according to any one of claims 1 to 5, wherein the congestion variable is a congestion distance.   The route guidance system according to claim 1, wherein the congestion variable is a congestion ratio.   Information acquisition processing means for acquiring map data, route search processing means for searching a plurality of routes from a starting point to a destination as candidate routes based on the map data, and the degree of congestion in each candidate route A route guidance method characterized by functioning as a traffic congestion variable calculation processing means for calculating a traffic congestion variable for which a traffic congestion degree takes a predetermined value, and a traffic congestion variable display processing means for displaying the candidate route and the traffic congestion variable on a predetermined screen. program.

Images