JPWO2008146398A1 - Route search device, route search method, route search program, and recording medium - Google Patents

Abstract

The route search device (100) includes an extraction unit (101), an acquisition unit (102), a specification unit (103), and a search unit (104). The extraction unit (101) extracts a crossing on the map data. The acquisition unit (102) acquires the number of vehicles (traffic blockage amount) that blocks traffic for each time zone at the level crossing extracted by the extraction unit (101). The identification unit (103) identifies a level crossing (congestion level crossing) in which a certain amount of traffic congestion has occurred based on the traffic blocking amount acquired by the acquisition unit (102). The search unit (104) searches for a route to the destination by multiplying the link including the traffic crossing specified by the specifying unit (103) by a predetermined link cost value.

Description

  The present invention relates to a route search device, a route search method, a route search program, and a recording medium mounted on a mobile object. However, the use of the present invention is not limited to the above-described route search device, route search method, route search program, and recording medium.

  In recent years, a moving body such as a vehicle is equipped with a route search device that searches for a route to a destination based on map data. For example, when searching for a route to a destination, a route that passes through a so-called unopened level crossing may be set. In such a case, it takes time to pass through the level crossing at a level crossing without opening, which may be significantly different from the searched scheduled time.

  Therefore, a technique has been proposed in which the opening / closing time for each time zone at each level crossing is stored in advance, and the route search is performed based on the stored data and taking into account the level crossing data corresponding to the time. (For example, see Patent Document 1 below.)

JP 2001-304877 A

  However, the technique of Patent Document 1 described above is, for example, a crossing of a road where one level crossing is congested when the opening / closing times of adjacent level crossings are the same. Even if it is a level crossing, a route that takes into account only the opening and closing time of the level crossing is set, and therefore a level crossing on a congested road may be used as the route. That is, even if the opening and closing times are the same, there is a problem that an appropriate route cannot be set because only the opening and closing times are taken into consideration even though the traffic time is different and the passing time of the road is different.

  In order to solve the above-described problems and achieve the object, a route search device according to the invention of claim 1 includes an extraction means for extracting a crossing on map data, and a time zone at a crossing extracted by the extraction means. Based on the acquisition means for acquiring the number of traffic blocking units (hereinafter referred to as “traffic blocking amount”) and the level crossing (hereinafter referred to as “traffic crossing”) based on the traffic blocking amount acquired by the acquiring unit. And a search means for searching for a route to the destination by multiplying a link including the traffic crossing specified by the specifying means by a predetermined link cost value. It is characterized by.

  The route search method according to the invention of claim 10 includes an extraction step of extracting a level crossing on map data, and a number of blocks (hereinafter referred to as “traffic cutoff”) at the level crossing extracted by the extraction step. An acquisition step for acquiring a traffic volume), and a specific step for identifying a level crossing (hereinafter referred to as a “traffic level crossing”) where a certain amount of traffic congestion has occurred based on the traffic blocking amount acquired by the acquisition step; A search step of searching for a route to the destination by multiplying a link including the traffic jam crossing specified by the specifying step by a predetermined link cost value.

  A route search program according to an invention of claim 11 causes a computer to execute the route search method according to claim 10.

  A recording medium according to a twelfth aspect of the present invention is characterized in that the route search program according to the eleventh aspect is recorded in a computer-readable manner.

FIG. 1 is a block diagram of an example of a functional configuration of the route search apparatus according to the embodiment. FIG. 2 is a flowchart illustrating an example of a route search processing procedure of the route search device according to the embodiment. FIG. 3 is a block diagram illustrating an example of a hardware configuration of the navigation device according to the present embodiment. FIG. 4 is a flowchart illustrating an example of route search processing of the navigation device according to the present embodiment. FIG. 5 is a flowchart illustrating another example of the route search process of the navigation device according to the present embodiment. FIG. 6A is a flowchart illustrating an example of a link cost calculation process used in route search in the present embodiment. FIG. 6B is a flowchart of another example of the route search process of the navigation device according to the present embodiment. FIG. 7 is a flowchart illustrating an example of a crossing attribute assignment process in the present embodiment. FIG. 8 is a graph showing an example of the average waiting time of the vehicle when there is no vehicle waiting for a crossing in this embodiment. FIG. 9 is a graph showing an example of the average waiting time of the vehicle when there is a vehicle waiting for a crossing in this embodiment. FIG. 10 is an explanatory diagram illustrating an example of a crossing display according to the present embodiment. FIG. 11 is an explanatory diagram illustrating an example of a display format of a crossing symbol according to the present embodiment. FIG. 12 is an explanatory diagram illustrating an example of a display format of a solid intersection symbol according to the present embodiment.

Explanation of symbols

DESCRIPTION OF SYMBOLS 100 Route search apparatus 101 Extraction part 102 Acquisition part 103 Identification part 104 Search part 105 Time required calculation part 106 Acquisition part 107 Blocking amount calculation part 108 Notification part 109 Display control part 110 Display part 300 Navigation apparatus 1030 Level crossing 1030a Traffic congestion level crossing 1030b Traffic congestion Railroad crossing 1031 Level crossing road 1100 Level crossing symbol 1110 Mark 1120 Outer circumference 1200 Level crossing sign 1210 Mark 1220 Outer circumference

  Exemplary embodiments of a route search device, a route search method, a route search program, and a recording medium according to the present invention will be explained below in detail with reference to the accompanying drawings.

(Embodiment)
(Functional configuration of route search device)
A functional configuration of the route search apparatus 100 according to the embodiment of the present invention will be described. FIG. 1 is a block diagram of an example of a functional configuration of the route search apparatus according to the embodiment. In FIG. 1, the route search apparatus 100 includes an extraction unit 101, an acquisition unit 102, a specification unit 103, a search unit 104, a required time calculation unit 105, a capture unit 106, an interception amount calculation unit 107, The notification unit 108, the display control unit 109, and the display unit 110 are provided.

  The extraction unit 101 extracts a crossing on the map data. The acquisition unit 102 acquires the number of traffic blocks (hereinafter referred to as “traffic blocking amount”) for each time zone at the level crossing extracted by the extraction unit 101. Specifically, the traffic blocking amount is the number of traffic blocking for a predetermined time, and for example, it is actually measured at each level crossing. The time period typically includes a span of 1 hour or 2 hours, but may be a day, morning, daytime, evening or night. The traffic blocking amount may be information recorded in advance in addition to real-time information received by wire or wireless.

  The identifying unit 103 identifies a level crossing (hereinafter referred to as “traffic level crossing”) in which a certain amount of traffic jam occurs based on the traffic blocking amount acquired by the acquisition unit 102. More than a certain amount of traffic is a traffic jam that is more than a certain distance from the railroad crossing point, a traffic jam that has more than a certain number of vehicles, a traffic jam that has more than a certain number of vehicles waiting for a level crossing, For example, the time required for passing the level crossing is a traffic jam of a certain time or more. That is, a level crossing that takes a long time to pass through a level crossing corresponds to a traffic jam crossing. The “constant” mentioned here does not have to be a constant value common to all level crossings, and may be a value set for each level crossing.

  Specifically, for example, when the acquisition unit 102 acquires a traffic blocking amount, the specifying unit 103 compares the traffic blocking amount with a threshold set for each time zone recorded in advance for each level crossing. Thus, when the traffic blocking amount is equal to or greater than the threshold, the level crossing is specified as a traffic jam level crossing.

  The search unit 104 calculates the link cost of each link when performing a route search by the Dijkstra method or the like, for example. The search unit 104 calculates a predetermined link cost value of the link including the traffic crossing specified by the specifying unit 103. The link cost value is a weight used when calculating the link. For example, the link cost value may be calculated each time based on the real-time traffic cut-off amount, or corresponds to the traffic cut-off amount for each pre-recorded time zone. It may be set in advance.

  Further, the search unit 104 may search for a route to the destination by multiplying a link including the traffic jam crossing by a predetermined link cost value according to the traffic blocking amount acquired by the acquisition unit 102. . Further, a required time calculation unit 105 may be provided. The required time calculation unit 105 calculates the required time to the destination based on the route searched by the search unit 104. Specifically, when the route to the destination includes a traffic jam crossing, the search unit 104 adds a predetermined time corresponding to the link cost value to calculate the time required to the destination.

  Moreover, in this Embodiment, the taking-in part 106 and the interruption | blocking amount calculation part 107 are arbitrary components. The take-in part 106 takes in the traffic volume per predetermined time of the road where a level crossing exists in each time zone, and the vehicle sweep-out amount that allows the vehicle to pass during the predetermined time of the level crossing. The blocking amount calculation unit 107 calculates a traffic blocking amount based on the traffic volume per predetermined time taken in by the fetching unit 106 and the vehicle sweep-out amount. The traffic volume per predetermined time on a road where a railroad crossing exists is an amount that generally increases in accordance with, for example, a main road or the number of lanes. The vehicle sweep-out amount is also generally an amount that increases according to the main road, the number of lanes, and the like. Further, the vehicle sweep-out amount is an amount that changes according to the opening / closing time of the railroad crossing, and increases as the time during which the breaker is open is longer.

  The identifying unit 103 detours the traffic crossing (hereinafter referred to as “detour crossing”) or bypasses the traffic crossing based on the position of the traffic crossing determined from the crossing position on the map data May be identified as a road (hereinafter referred to as a “three-dimensional intersection road”). In this case, the search unit 104 may select an optimum route from among traffic crossings, detour crossings, or routes passing through a three-dimensional intersection based on the set search conditions. More specifically, the three-dimensional intersection road is an overpass that straddles the track or an underpass that passes under the track. In addition, the search conditions when searching by the search unit 104 are conditions such as time priority and distance priority. The optimum route is a route that best matches the search condition.

  In the present embodiment, the notification unit 108 is an arbitrary component. When the search unit 104 searches for a route to a destination via a detour or level crossing road, the notification unit 108 notifies that the traffic crossing has been detoured. For example, the notification unit 108 may create an image indicating that a detour is made by characters, or may indicate a route passing through the traffic crossing with a dotted line or the like and notify that the traffic crossing is bypassed. .

  In addition, the acquisition unit 102 may acquire the traffic interception amount of the traffic jam crossing when departing at the current time and the traffic traffic interception amount of the traffic jam crossing when departing at a time after a predetermined time has elapsed. In this case, the search unit 104 acquires the traffic interception amount of the traffic jam crossing when departing at the current time and the traffic traffic interception amount of the traffic jam crossing when departing at the time after a predetermined time, acquired by the acquisition unit 102. Based on this, the route at each departure time may be searched. Moreover, the required time calculation part 105 should just calculate the required time in each departure time.

  In the present embodiment, the display control unit 109 and the display unit 110 are arbitrary components. The display control unit 109 controls the display of the traffic crossing specified by the specifying unit 103 to a display different from the normal display. The display unit 110 displays the traffic crossing controlled by the display control unit 109. The display different from the normal display by the display control unit 109 is a display that allows the user to recognize the traffic jam, such as a colored display, a blinking display, and a penalty point display on the road where the traffic jam occurs. The display unit 110 may be any device that can display a traffic crossing such as a display. Accordingly, the display unit 110 displays a level crossing in which a certain level of traffic congestion including a traffic jam level crossing occurs, which is different from the normal display.

  The display control unit 109 may display a traffic jam crossing as a symbol, and may change the display format of the traffic jam crossing displayed as a symbol according to the traffic blocking amount acquired by the acquisition unit 102. The symbol display includes, for example, a mark indicating a level crossing. To change the display format according to the traffic blockage amount, for example, the mark may be blinked or the color of the mark may be changed according to the length of the traffic jam or the time taken for passing the crossing. Specifically, for example, if the time taken to pass a level crossing is a predetermined time or more, display a prompt to bypass the traffic jam crossing by, for example, speeding up blinking of the mark or displaying the color of the mark in red. That's fine.

  The display control unit 109 may display a detour railroad or a three-dimensional intersection road as a symbol. The symbol display includes, for example, a mark indicating a level crossing. In this case, the display control unit 109 may change the display format of the detour railroad or the multilevel crossing road according to the traffic blocking amount of the traffic jam crossing. In other words, when the congestion at a traffic crossing is greater than or equal to a predetermined level, the color of the mark may be displayed in blue so as to blink, for example, a color that prompts passage to the detour crossing or a three-dimensional crossing road.

(Route search processing procedure of route search device 100)
Next, a route search processing procedure of the route search device 100 will be described with reference to FIG. FIG. 2 is a flowchart illustrating an example of a route search processing procedure of the route search device according to the embodiment.

  In the flowchart of FIG. 2, the route search device 100 waits for an input of a route search start (step S201: No loop), and when there is an input of a route search start (step S201: Yes), the extraction unit 101 reads the map. A crossing on the data is extracted (step S202). And the acquisition part 102 acquires the traffic interruption amount in a level crossing extracted by the extraction part 101 (step S203).

  And the specific | specification part 103 specifies a traffic jam level crossing based on the traffic interruption amount acquired by the acquisition part 102 (step S204). Then, the search unit 104 multiplies a link including a traffic jam crossing by a predetermined link cost value to search for a route to the destination (step S205), and ends a series of processing.

  As described above, the route search device 100 according to the present embodiment identifies a traffic jam crossing based on the number of traffic blocks (traffic blockage amount) for each time zone at a railroad crossing, and includes the traffic jam crossing. A route search is performed by multiplying a link by a predetermined link cost value. According to such a route search device 100, a route search according to the traffic volume at each level crossing can be performed. Accordingly, the user can follow a travel route that avoids a traffic crossing having a long transit time. Moreover, if a large number of vehicles avoid the traffic crossing, the traffic can be alleviated.

  In addition, the route search device 100 according to the present embodiment includes the capturing unit 106 that captures the traffic volume per predetermined time and the vehicle sweep-out amount at the level crossing, and the predetermined route captured by the capturing unit 106. You may make it provide the interruption | blocking amount calculation part 107 which calculates traffic interruption | blocking amount based on the traffic volume per time and the vehicle sweeping-out amount. That is, the traffic blocking amount for each level crossing may be calculated based on the traffic volume and the vehicle sweep-out amount. According to such a configuration, the traffic blocking amount can be calculated easily and accurately.

  Further, the route search device 100 according to the present embodiment specifies a detour crossing or a level crossing road in addition to a traffic jam crossing, and a traffic jam crossing, detour crossing or level crossing road based on the set search conditions. An optimal route may be selected from the routes passing through. According to such a configuration, a route search according to search conditions such as time priority and distance priority can be performed.

  In addition, the route search device 100 according to the present exemplary embodiment, when the search unit 104 searches for a route to a destination via a detour crossing or a multilevel crossing road, a notification unit 108 that notifies that the traffic crossing has been detoured. You may make it provide. According to such a configuration, the user can know that the displayed route is not a detour route but a route that bypasses the traffic jam crossing, and the time required to reach the destination is shortened. I can know that.

  In addition, the route search device 100 according to the present embodiment has the traffic interception amount of the traffic jam crossing when the acquisition unit 102 departs at the current time and the traffic traffic interception amount of the traffic jam crossing when the acquisition unit 102 departs at a time after a predetermined time has elapsed. And may be acquired. Further, based on the traffic blockage amount of the traffic jam crossing when the search unit 104 departs at the current time and the traffic blockage amount of the traffic jam crossing when the search unit 104 departs at a time after a predetermined time, acquired by the acquisition unit 102. Thus, the route at each departure time may be searched. According to such a configuration, since the user can know the arrival time and the required time when the departure time is delayed, the departure time can be delayed with peace of mind when there is room.

  In addition, the route search device 100 according to the present embodiment displays a display control unit 109 that controls the display of the traffic jam crossing to a display different from the normal display, and the traffic crossing controlled by the display control unit 109. A display unit 110 may be provided. According to such a configuration, the user can confirm on the display screen a crossing with a long transit time.

  In addition, the display control unit 109 in the route search device 100 according to the present embodiment displays a traffic jam crossing as a symbol, and displays the traffic jam crossing displayed as a symbol according to the traffic blocking amount acquired by the acquisition unit 102. May be changed. According to such a configuration, the user can grasp the traffic crossing at a glance and can also grasp the degree of congestion at a glance.

  Further, the display control unit 109 in the route search apparatus 100 according to the present embodiment may display a detour railroad or a three-dimensional intersection road as a symbol. According to such a configuration, the user can grasp the detour railroad crossing or the multilevel intersection road at a glance and easily find it.

  Examples of the present invention will be described below. In this embodiment, an example in which the route search device 100 of the present invention is implemented by a navigation device mounted on a vehicle will be described.

(Hardware configuration of navigation device 300)
The hardware configuration of the navigation device 300 according to the present embodiment will be described with reference to FIG. FIG. 3 is a block diagram illustrating an example of a hardware configuration of the navigation device according to the present embodiment. In FIG. 3, a navigation device 300 is mounted on a moving body such as a vehicle, and includes a CPU 301, ROM 302, RAM 303, magnetic disk drive 304, magnetic disk 305, optical disk drive 306, optical disk 307, and audio. An I / F (interface) 308, a speaker 309, an input device 310, a video I / F 311, a display 312, a communication I / F 313, a GPS unit 314, and various sensors 315 are provided. Each component 301 to 315 is connected by a bus 320.

  The CPU 301 governs overall control of the navigation device 300. The ROM 302 stores various programs such as a boot program, a current location calculation program, a navigation program, a route guidance program, a voice generation program, a map data display program, and a symbol display program. The RAM 303 is used as a work area for the CPU 301.

  The current location calculation program, for example, calculates the current location of the vehicle (the current location of the navigation device 300) based on output information from a GPS unit 314 and various sensors 315 described later.

  The navigation program searches for an optimal route from the departure point to the destination point using map data recorded on a magnetic disk 305 described later. Here, the optimum route is the shortest (or fastest) route to the destination point or the route that best meets the conditions specified by the user. Further, not only the destination point but also a route to a stop point or a rest point may be searched. The searched guidance route is output to the audio I / F 308 and the video I / F 311 via the CPU 301.

  The route guidance program is based on the guidance route information searched by executing the navigation program, the vehicle current location information calculated by executing the current location calculation program, and the map data read from the magnetic disk 305. Real-time route guidance information is generated. The generated route guidance information is output to the audio I / F 308 and the video I / F 311 via the CPU 301.

  The voice generation program generates tone and voice information corresponding to the pattern. That is, based on the route guidance information generated by executing the route guidance program, the virtual sound source corresponding to the guidance point is set and the voice guidance information is generated and output to the voice I / F 308 via the CPU 301. .

  The map data display program displays map data recorded on the magnetic disk 305 and the optical disk 307 on the display 312 by the video I / F 311.

  The symbol display program displays a railroad crossing position on the map-displayed map data recorded on the magnetic disk 305 or the optical disk 307 and changes the display format based on the traffic interception amount of the railroad crossing.

  The magnetic disk drive 304 controls the reading / writing of the data with respect to the magnetic disk 305 according to control of CPU301. The magnetic disk 305 records data written under the control of the magnetic disk drive 304. As the magnetic disk 305, for example, an HD (hard disk) or an FD (flexible disk) can be used.

  The optical disk drive 306 controls the reading / writing of the data with respect to the optical disk 307 according to control of CPU301. The optical disk 307 is a detachable recording medium from which data is read according to the control of the optical disk drive 306. As the optical disc 307, a writable recording medium can be used. In addition to the optical disk 307, the removable recording medium may be an MO, a memory card, or the like.

  The audio I / F 308 is connected to a speaker 309 for audio output. Examples of the input device 310 include a remote controller having a plurality of keys for inputting characters, numerical values, and various instructions, a keyboard, a mouse, and a touch panel. The input device 310 may be realized by any one of a remote controller, a keyboard, a mouse, and a touch panel, or may be realized by a plurality of forms.

  The video I / F 311 is connected to the display 312. Specifically, the video I / F 311 includes, for example, a graphic controller that controls the entire display 312, a buffer memory such as a VRAM (Video RAM) that temporarily records image information that can be displayed immediately, and a graphic controller. Based on the output image data, the display 312 is configured by a control IC or the like.

  The display 312 displays icons, cursors, menus, windows, or various data such as characters and images. On the display 312, the above-described map data is drawn two-dimensionally or three-dimensionally. The map data displayed on the display 312 can be displayed with a mark representing the current location of the vehicle on which the navigation device 300 is mounted. The current location of the vehicle is calculated by the CPU 301.

  As this display 312, for example, a CRT, a TFT liquid crystal display, a plasma display, or the like can be adopted. The display 312 is installed near the dashboard of the vehicle, for example. A plurality of displays 312 may be installed in the vehicle, for example, in the vicinity of the dashboard of the vehicle or in the vicinity of the rear seat of the vehicle.

  The communication I / F 313 is connected to a network via wireless and functions as an interface between the navigation device 300 and the CPU 301. The communication I / F 313 is further connected to a communication network such as the Internet via wireless, and also functions as an interface between the communication network and the CPU 301.

  Communication networks include LANs, WANs, public line networks and mobile phone networks. Specifically, the communication I / F 313 includes, for example, an FM tuner, a VICS (Vehicle Information and Communication System) / beacon receiver, a radio navigation device, and other navigation devices. Get road information such as regulations. VICS is a registered trademark.

  The GPS unit 314 receives radio waves from GPS satellites and outputs information indicating the current location of the vehicle. The output information of the GPS unit 314 is used when the current position of the vehicle is calculated by the CPU 301 together with output values of various sensors 315 described later. The information indicating the current location is information for specifying one point on the map data, such as latitude / longitude and altitude.

  The various sensors 315 output information that can determine the position and behavior of the vehicle, such as a vehicle speed sensor, an acceleration sensor, and an angular velocity sensor. The output values of the various sensors 315 are used for the calculation of the current location of the vehicle by the CPU 301 and the measurement of the change in speed and direction.

  The extraction unit 101, the acquisition unit 102, the specifying unit 103, the search unit 104, the required time calculation unit 105, the capture unit 106, and the blocking amount calculation unit 107 included in the route search device 100 illustrated in FIG. The notification unit 108, the display control unit 109, and the display unit 110 are a CPU 301 that uses programs and data recorded in the ROM 302, RAM 303, magnetic disk 305, optical disk 307, and the like in the navigation device 300 shown in FIG. Implements its function by executing a predetermined program and controlling each part in the navigation device 300.

  That is, the navigation device 300 of the present embodiment executes the various programs recorded in the ROM 302 as a recording medium in the navigation device 300, thereby providing the functions provided in the route search device 100 shown in FIG. It can be executed by the route search processing procedure shown.

(Example of route search processing of the navigation device 300)
Next, an example of route search processing performed by the navigation device 300 according to the present embodiment will be described with reference to FIG. FIG. 4 is a flowchart illustrating an example of route search processing of the navigation device according to the present embodiment.

  In the flowchart of FIG. 4, the navigation apparatus 300 is in a standby state until an instruction to start a route search is received (step S401: No loop). When an instruction to start a route search is received (step S401: Yes), for example, time Under the priority search condition, the route search is performed without multiplying the link including the railroad crossing by the link cost value (step S402). Then, the route search is performed by multiplying the link including the railroad crossing by the link cost value (step S403). The required time may be calculated by adding a predetermined time corresponding to the link cost value when the route includes a traffic jam crossing. The calculation of the link cost value will be described later.

  Then, it is determined whether or not the above-described two routes are different (step S404). If it is determined in step S404 that the two routes are different (step S404: Yes), a traffic crossing is identified from the map data (step S405). Specifically, the two routes differ from each other in that the route searched by multiplying the link by the link cost value is a route that bypasses the traffic jam level crossing, and is a route that takes less time than a route that passes through the traffic jam level crossing. It means that there is.

  Then, the display format of the traffic crossing is changed according to the traffic blocking amount, which is the number of traffic blocking at each time (step S406). The change of the display format is, for example, blinking a traffic crossing in red, as will be described in detail later. And the detour crossing which detours a traffic jam crossing is specified (step S407). As a detour crossing, for example, a crossing that is not a traffic crossing but is another crossing existing along the same track as the traffic crossing may be used as the detour crossing. Then, according to the degree of congestion at the traffic crossing, for example, the display format of the detour crossing such as blinking the detour crossing in blue is changed (step S408).

  And the image which displayed that it is the path | route which detoured the traffic jam crossing is produced (step S409). The image in this case is, for example, a character image such as “I bypassed a crossing in a traffic jam” as will be described later. Then, the traffic crossing at which the display format is changed, the detour crossing, and the route passing through the detour crossing are displayed (step S410), and the series of processing ends. On the other hand, in step S404, when the two routes are not different, the route searched without multiplying the link including the level crossing by the link cost value and the route searched by multiplying the link including the level crossing by the link cost value ( Step S404: No), that is, if it is determined that there is no traffic crossing on the link, the series of processing ends.

  In the above description, in step S404, when the two routes are different, that is, when there is a route that bypasses the traffic jam crossing, the route that is automatically bypassed is selected. You may make it accept. Specifically, it displays a message such as "Do you want to detour the crossing in a traffic jam?", And when you receive an "YES" input from the user, displays the route that passes through the detour. When an input of “NO” is received, a route passing through the traffic jam crossing may be displayed.

  Further, in this embodiment, when detouring a traffic crossing, not only the detour crossing but also a three-dimensional crossing road that crosses the track. In the case of a route for which a three-dimensional intersection road is selected, the display format may be changed, for example, the display of the three-dimensional intersection road is blinked in blue. In step S409, a character image is created. However, along with this, for example, a route passing through a traffic jam crossing may be indicated by a dotted line.

  Further, when all the level crossings near the traffic crossing are congested, that is, when the detour crossing cannot be specified, the route passes through the traffic crossing. In this case, it is only necessary to display that the route passes through a traffic jam crossing and to blink all the crossings displayed on the map in red.

(Another example of route search processing of the navigation device 300)
Next, another example of the route search process performed by the navigation device 300 according to the present embodiment will be described with reference to FIG. FIG. 5 is a flowchart illustrating another example of the route search process of the navigation device according to the present embodiment. The flowchart shown in FIG. 5 is a process in which a route when starting at the current time and a route when starting at a time after a predetermined time have been searched.

  In the flowchart of FIG. 5, the navigation device 300 is in a standby state until an instruction to start a route search is received (step S501: No loop). When an instruction to start a route search is received (step S501: Yes), for example, time Under the priority search condition, the route search is performed without multiplying the link including the railroad crossing by the link cost value (step S502). The required time may be calculated by adding a predetermined time corresponding to the link cost value when the route includes a traffic jam crossing. Then, the route search is performed by multiplying the link including the railroad crossing by the link cost value at the time of departure at the current time (step S503). Note that the link cost value at the time of departure at the current time is the link cost value at the time of departure at the current time and reaching the railroad crossing.

  Then, it is determined whether or not the two routes described above are different (step S504). If it is determined in step S504 that the two routes are different (step S504: Yes), a route search is performed by multiplying the link cost value at the time after departure for a predetermined time (step S505). The link cost value at the time of departure at a time after the elapse of a predetermined time is a link cost value at a time zone when the vehicle departs at a time after the elapse of the predetermined time and reaches the railroad crossing. Then, the route and the required time at each departure time multiplied by the link cost value are displayed (step S506), and the series of processes is terminated.

  On the other hand, in step S504, when the two routes are not different, the route searched without multiplying the link including the level crossing by the link cost value and the route searched by multiplying the link including the level crossing by the link cost value ( Step S504: No), that is, if it is determined that there is no traffic crossing on the link, the series of processing ends.

  In the route search process described above, the route search at each departure time will be supplemented by taking a specific time zone as an example. For example, the current time is 8 am. The scheduled arrival time at the destination for departure at 8 am is 9:30. Also, if the time after 1 hour has passed, that is, if you depart at 9:00 am, the rush time will be over and the traffic at the railroad crossing will alleviate, so the scheduled arrival time at the destination will be 9:50 To do. In such a case, by displaying the route and required time at each departure time, the user can select the optimum departure time. In addition, such route search processing can also be performed by reversely calculating the latest time that can be departed by designating the arrival time at the destination by the user.

  In the route search process described above, a traffic crossing or a detour crossing may be displayed as a symbol for the crossing on the route at each departure time. Further, it may be displayed that the route at each departure time is a route that bypasses the traffic jam crossing.

(Example of link cost calculation process used for route search)
Next, with reference to FIG. 6A, an example of a link cost calculation process used in route search in the present embodiment will be described. FIG. 6A is a flowchart illustrating an example of a link cost calculation process used in route search in the present embodiment.

  In the flowchart of FIG. 6A, the navigation apparatus 300 calculates the link cost from the link length, width, number of lanes, number of traffic lights, and the like (step S601). The link crossing attribute is acquired (step S602). Then, it is determined whether or not the acquired crossing attribute includes a crossing attribute of a traffic jam crossing (step S603). A method for assigning a level crossing attribute for a traffic jam level crossing will be described later. If it is determined in step S603 that the acquired level crossing attribute includes a level crossing attribute for traffic jam crossing (step S603: Yes), it is determined whether the time to reach the link is within the time for traffic jam crossing (step S604). .

  In step S604, when it is determined that the time to reach the link is within the time of traffic jam crossing (step S604: Yes), the link cost is increased by α (step S605), and the series of processes is terminated. Α is a weighting value set for each traffic crossing. On the other hand, when it is determined in step S603 that the acquired crossing attribute does not have a crossing attribute for a traffic jam crossing (step S603: No), a series of processing ends. If it is determined in step S604 that the time to reach the link is not within the traffic crossing time (step S604: No), the series of processing ends. Note that the order of the processes in steps S603 and S604 is arbitrary, and the process in step S604 may be performed first.

(Another example of route search processing of the navigation device according to the present embodiment)
Next, another example of the route search process of the navigation device according to the present embodiment will be described with reference to FIG. FIG. 6B is a flowchart of another example of the route search process of the navigation device according to the present embodiment.

  In the flowchart of FIG. 6B, the navigation device 300 is in a standby state until an instruction for starting a route search is received (step S611: No). When an input for starting a route search is received (step S611: Yes), Is extracted (step S612). And the average waiting time in each extracted level crossing is acquired (step S613). Note that the average waiting time may be stored in advance for each hour. Details of the average waiting time calculation method will be described later.

  Thereafter, the link cost α corresponding to the average waiting time is calculated (step S614). Then, a route to the destination is searched by multiplying the link including the railroad crossing by a predetermined link cost α (step S615), and the series of processes is terminated. Specifically, for example, if the average waiting time is a crossing of 10 minutes, it is multiplied by a link cost corresponding to 10 minutes, and if the average waiting time that is not a traffic jam crossing is 10 seconds, it corresponds to 10 seconds. Multiply the link cost. In addition, in such a process, when performing a route search when leaving at a time after the elapse of a predetermined time, the route search is performed using an average waiting time and a traffic blocking amount after the elapse of the predetermined time stored in advance. Just do it.

(An example of level crossing attribute assignment processing)
Next, an example of a crossing attribute assignment process in the present embodiment will be described with reference to FIG. FIG. 7 is a flowchart illustrating an example of a crossing attribute assignment process in the present embodiment.

  In the flowchart of FIG. 7, the navigation apparatus 300 acquires the number of traffic blocks (traffic blocking amount N) per certain time at a certain level crossing (step S701). Details of the traffic blocking amount N will be described later. Then, it is determined whether or not there is a time zone in which the acquired traffic blocking amount N exceeds the predetermined value β (step S702). The predetermined value β is a threshold set for each level crossing. In addition, the time zone in this case is a time zone having a long passage time, for example, a time zone such as 7:00 am to 9:00 am during rush hours.

  In step S702, when it is determined that there is a time zone in which the traffic blocking amount N exceeds the predetermined value β (step S702: Yes), a crossing attribute of the traffic jam crossing is given to the link including the crossing (step S703). And the time slot | zone when the traffic interruption amount N exceeds predetermined value (beta) is stored (step S704), and a series of processes are complete | finished. In Step S702, when it is determined that there is no time zone in which the traffic blocking amount N exceeds the predetermined value β (Step S702: No), the series of processes is terminated. Here, in step S704, the time zone in which N exceeds β is stored, but it is not always necessary to store the time zone, and information indicating whether or not the level crossing is a traffic jam level crossing is at least attribute information. It only has to be generated. Thus, by giving the attribute information of the traffic crossing and storing the time zone in which the traffic blocking amount N exceeds the predetermined value β, it becomes possible to display the traffic information near the level crossing on the display screen.

(An example of the average waiting time of a vehicle when no vehicle is waiting for a level crossing)
Next, an example of calculating the traffic blocking amount will be described with reference to FIGS. 8 and 9. First, the average waiting time of a vehicle when there is no vehicle waiting for a level crossing will be described with reference to FIG. FIG. 8 is a graph showing an example of the average waiting time of the vehicle when there is no vehicle waiting for a crossing in this embodiment.

  In FIG. 8, in a graph 800, the horizontal axis 801 indicates the elapsed time (seconds) after the level crossing is released, and the vertical axis 802 indicates the vehicle waiting time (seconds). The crossing in the graph shown in FIG. 8 is a crossing that closes for 60 seconds and opens for 60 seconds. That is, in FIG. 8, the crossing is open when the horizontal axis 801 is 0 to 60 seconds, and the crossing is closed while the horizontal axis 801 is 60 to 120 seconds. For example, a vehicle that has reached the level crossing within 0 to 60 seconds after the level crossing is released (point A in FIG. 8) has a waiting time of 0, indicating that it can pass without waiting time.

  On the other hand, when the horizontal axis 801 reaches 60 seconds, the railroad crossing closes. Therefore, it is shown that the vehicle that has reached the level crossing (point B in FIG. 8) waits for 60 seconds after the level crossing is released for 60 seconds. For example, when the horizontal axis 801 is 90 seconds, the vehicle that has reached the railroad crossing (point C in FIG. 8) waits for 30 seconds. When the horizontal axis 801 is 120 seconds, the vehicle that has reached the railroad crossing (D point in FIG. 8) indicates that it can pass without waiting time.

  From this graph 800, the average waiting time of the vehicle at the level crossing is calculated. First, the total waiting time for 120 seconds is calculated. The total of the waiting time of the vehicle for 120 seconds is a triangular area 820 surrounded by the straight line 811, the straight line 812, and the horizontal axis 801. That is, the area 820 is (120−60) × 60 ÷ 2 = 1800. Next, the average waiting time of the vehicle per 120 seconds is calculated. The average waiting time of the vehicle is 15 seconds, which is a value obtained by dividing the area 820 by 120 seconds (1800 ÷ 120). Therefore, the average waiting time at a level crossing without such a level crossing waiting time is 15 seconds per 120 seconds.

(Example of calculating traffic blockage)
Next, an example of calculating the traffic blocking amount will be described with reference to FIG. FIG. 9 is a graph illustrating an example of calculation of the traffic blocking amount when there is a vehicle waiting for a crossing in the present embodiment. The case where there is a vehicle waiting for a crossing when the vehicle reaches the crossing will be described using the graph shown in FIG.

  In FIG. 9, the graph 900 shows the elapsed time (seconds) after the level crossing is released on the horizontal axis 901, and the waiting time of the vehicle on the vertical axis 902. A graph 900 shown in FIG. 9 is a railroad crossing that closes for 60 seconds and opens for 60 seconds, like the graph 800 shown in FIG. At this level crossing, it is assumed that the traffic volume on the road is 6 cars / 60 seconds. Therefore, six vehicles will wait for the crossing while the crossing is closed for 60 seconds. Further, in this level crossing, the traffic volume (corresponding to the vehicle sweep-out amount) through which the vehicle can pass when the level crossing is open is 12 vehicles / 60 seconds.

  In FIG. 9, when the horizontal axis 901 is 0 seconds, that is, when the level crossing is released, the vehicle that has reached the level crossing (point E in FIG. 9) has a waiting time of 30 seconds. This means waiting for the passage of six vehicles waiting for a crossing. Specifically, since the traffic volume (vehicle sweep-out amount) that the vehicle can pass when the railroad crossing is open is 12 vehicles / 60 seconds, the time required to pass per vehicle is the vehicle sweep-out amount. The reciprocal of 5 seconds / 1 unit. Therefore, it means that it takes 30 seconds to pass 6 vehicles by 5 seconds / 1 vehicle (6 times).

  Further, for example, when the horizontal axis 901 is 30 seconds, that is, a vehicle that has reached the level crossing after 30 seconds have elapsed since the level crossing was released (point F in FIG. 9), the waiting time is 15 seconds. This will be described. Since the time required to pass per vehicle is 5 seconds / 1 vehicle, the number of vehicles that are swept out during 30 seconds after the level crossing is released is 30 seconds ÷ (5 seconds / 1 vehicle), 6 units. On the other hand, the traffic volume on the road is 6 cars / 60 seconds, and the time interval between cars is 10 seconds / 1 car which is the reciprocal of the traffic volume.

  Therefore, the number of vehicles that reach the level crossing within 30 seconds after the level crossing is released is 3 by 30 seconds / (10 seconds / 1 vehicle). That is, a vehicle that arrives 30 seconds after the level crossing is released waits for three vehicles to arrive after the level crossing is released. Accordingly, the passage of three vehicles takes 15 seconds, which is 5 seconds / 1 vehicle, which is the time required for passing one vehicle, for three vehicles. Similarly, a vehicle that has reached the railroad crossing before the horizontal axis 901 passes 60 seconds (point G in FIG. 9) has a waiting time of zero.

  On the other hand, when 60 seconds have elapsed, the vehicle that has reached the level crossing (point H in FIG. 9) becomes the head of waiting for the level crossing and has a waiting time of 60 seconds. Similarly, for example, a vehicle that reaches the railroad crossing after 90 seconds (point I in FIG. 9) has a waiting time of 45 seconds. Although the details of the calculation are omitted, this is a value obtained by adding the remaining time 30 seconds until the railroad crossing is opened and the time 15 seconds required for passing the three cars that have arrived after the railroad crossing is closed. .

  From this graph 900, the average waiting time of the vehicle at the level crossing is calculated. First, the total waiting time for 120 seconds is calculated. The total vehicle waiting time for 120 seconds is surrounded by a triangular area 920 surrounded by a horizontal axis 901, a vertical axis 902, and a straight line 911, and surrounded by a horizontal axis 901, a straight line 912, a straight line 913, and a wavy line 914. The total area is obtained by adding the trapezoidal area 921. Specifically, the area 920 is 60 × 30/2 = 900. The area 921 is (30 + 60) × (120−60) / 2 = 2700. Therefore, the total area is 3600 obtained by adding the area 920 and the area 921.

  Next, the average waiting time of the vehicle per 120 seconds is calculated. The average waiting time of the vehicle is 30 seconds, which is a value obtained by dividing the total area by 120 seconds (3600 ÷ 120). Therefore, the average waiting time for such a level crossing is a waiting time of 30 seconds per 120 seconds. Next, the traffic blocking amount is calculated. The traffic blocking amount is the number of vehicles that cannot pass per predetermined time, and is obtained by dividing the average waiting time by the time required for passing per vehicle. In this level crossing, the time required for one vehicle to pass is 5 seconds / 1 vehicle. Therefore, the traffic blocking amount is 6/120 seconds from (30 seconds / 120 seconds) / (5 seconds / 1 vehicle). That is, the traffic cut-off amount at this level crossing is 6 cars per 120 seconds. For example, if this traffic blocking amount is converted per hour, it becomes 180 units.

  The traffic blocking amount calculated in this way is compared with a predetermined traffic volume (predetermined value β) as a threshold value set for each time zone at each level crossing as described with reference to FIG. In the above case, the railroad crossing is used to be identified as a traffic jam crossing.

(Example of level crossing display)
Next, an example of a crossing display according to the present embodiment will be described with reference to FIG. FIG. 10 is an explanatory diagram illustrating an example of a crossing display according to the present embodiment.

  In FIG. 10, the display screen 1000 displayed on the display 312 is north-up displayed, and the upper part of the display screen 1000 is set to the north and displayed. The display screen 1000 displays a track 1010, a road 1020, a railroad crossing 1030 (1030a to 1030c), a three-dimensional intersection road 1031, a current position 1040, a destination 1050, and a character display 1060. Each level crossing 1030 is displayed as a symbol. The level crossings 1030a and 1030b are traffic jam crossings. The level crossing 1030c is a detour level crossing. The three-dimensional intersection road 1031 is displayed as a symbol. The three-dimensional intersection road 1031 is a road that three-dimensionally intersects the track.

  As will be described later, the display format of the level crossing 1030 is changed according to the length of the traffic jam, the waiting time of the level crossing 1030, and the like based on the traffic blocking amount. In this embodiment, for example, the traffic jam crossing 1030a on the east side and the traffic jam crossing 1030b on the west side have the longest time that the circuit breaker is descending because of the proximity to the station 1032. Therefore, the road is congested. The outer periphery shows red. Details of the color of the outer periphery of the crossing symbol will be described later. Further, the detour railroad crossing 1030c is not congested, and the outer periphery of the crossing symbol indicates blue. Further, in the three-dimensional intersection road 1031, the outer periphery of the crossing symbol indicates yellow.

  It is assumed that when such a display screen 1000 is displayed, it is assumed that the user is located at the current position 1040 and a route search to the destination 1050 is performed. In the normal route search, for example, a route that has followed the shortest route is drawn, that is, a route that passes through the east side traffic crossing 1030a or the west side traffic crossing 1030b is drawn. A route that passes through the railroad crossing 1030c or a route that passes through the three-dimensional intersection road 1031 is searched. Then, a character image of “Turning around a crossing in a traffic jam” is displayed on the character display 1060.

(Example of display format of level crossing symbols)
Next, an example of a display format of a crossing symbol according to the present embodiment will be described with reference to FIG. FIG. 11 is an explanatory diagram illustrating an example of a display format of a crossing symbol according to the present embodiment.

  In FIG. 11, a crossing symbol 1100 is a symbol displayed on the crossing 1030 shown in FIG. In FIG. 11, a railroad crossing symbol 1100 includes a mark 1110 indicating a train and an outer periphery 1120. The color of the outer periphery 1120 changes according to the traffic blocking amount. For example, when the time required to pass through a level crossing is very long, specifically, when it takes 30 minutes or more to pass through the level crossing, the light turns red. Further, for example, when it takes 10 minutes or more and 30 minutes or less to pass the railroad crossing, the light turns yellow. In addition, for example, when the time required to pass the railroad crossing is 10 minutes or less, that is, when it is not congested, the light turns blue. In addition, about the lighting of the outer periphery 1120, you may set arbitrarily not only the system which represented the traffic congestion in 3 steps | paragraphs using the three colors mentioned above.

(Example of the display format of the solid intersection symbol)
Next, an example of the display format of the solid intersection symbol according to the present embodiment will be described with reference to FIG. FIG. 12 is an explanatory diagram illustrating an example of a display format of a solid intersection symbol according to the present embodiment.

  In FIG. 12, a three-dimensional intersection symbol 1200 is a symbol displayed on the three-dimensional intersection road 1031 shown in FIG. In FIG. 12, the solid intersection symbol 1200 includes a mark 1210 indicating a solid intersection road and an outer periphery 1220. The three-dimensional intersection symbol 1200 may be displayed at all times, or may be displayed only when there is a traffic crossing in the vicinity. Further, when there is a traffic crossing in the vicinity, the color of the outer periphery 1220 may be changed to make it stand out. For example, when there is a traffic crossing in the vicinity, the user can be urged to pass through the three-dimensional intersection road by lighting the outer periphery 1220 in blue.

  As described above, the navigation apparatus 300 according to the present embodiment specifies the traffic jam crossing based on the number of traffic blocks (traffic blockage amount) for each time zone at the railroad crossing, and links to the link including the traffic jam crossing. A route search is performed by multiplying a predetermined link cost value. According to such a navigation device 300, a route search according to the traffic volume at each level crossing can be performed. Therefore, the user can follow a route that avoids a traffic crossing having a long transit time. Moreover, if a large number of vehicles avoid the traffic crossing, the traffic can be alleviated.

  In addition, the navigation device 300 according to the present embodiment calculates the traffic blocking amount based on the traffic volume per predetermined time and the vehicle sweep-out amount at the crossing. That is, the traffic cut-off amount for each level crossing is calculated based on the traffic volume and the vehicle sweep-out amount. According to such a configuration, the traffic blocking amount can be calculated easily and accurately.

  Further, the navigation device 300 according to the present embodiment specifies a detour crossing or a three-dimensional crossing road in addition to a traffic crossing, and passes through the traffic crossing, detour crossing or three-dimensional crossing road based on a set search condition. The optimal route was selected from among the routes. According to such a configuration, a route search according to search conditions such as time priority and distance priority can be performed.

  In addition, the navigation device 300 according to the present embodiment notifies that the traffic crossing has been detoured when searching for a detour crossing or a route to a destination via a three-dimensional intersection road. According to such a configuration, the user can know that the displayed route is not a detour route but a route that bypasses the traffic jam crossing, and the time required to reach the destination is shortened. I can know that.

  Further, the navigation device 300 according to the present embodiment acquires the traffic interception amount of the traffic jam crossing when departing at the current time and the traffic traffic interception amount of the traffic jam crossing when departing at the time after a predetermined time has elapsed. The route at each departure time is searched based on the traffic interception amount of the traffic jam crossing when departing at the current time and the traffic traffic interception amount of the traffic jam crossing when departing at the time after a predetermined time has elapsed. Also good. According to such a configuration, since the user can know the arrival time and the required time when the departure time is delayed, the departure time can be delayed with peace of mind when there is room.

  Further, the navigation device 300 according to the present embodiment controls the display of the traffic crossing to a display different from the normal display. According to such a configuration, the user can confirm on the display screen a crossing with a long transit time.

  In addition, the navigation device 300 according to the present embodiment displays a traffic jam crossing as a symbol, and changes the display format of the traffic jam crossing displayed as a symbol according to the amount of traffic interruption. According to such a configuration, the user can grasp the traffic crossing at a glance and can also grasp the degree of congestion at a glance.

  Further, the navigation device 300 according to the present embodiment displays a detour railroad or a three-dimensional intersection road as a symbol. According to such a configuration, the user can grasp the detour railroad crossing or the multilevel intersection road at a glance and easily find it.

  As described above, the route search device, route search method, route search program, and recording medium of the present invention specify a traffic jam crossing based on the number of traffic blocks (traffic blockage amount) for each time zone at a level crossing. In addition, the route search is performed by multiplying the link including the traffic jam crossing by a predetermined link cost value. That is, a route search according to the traffic volume at each level crossing can be performed. Therefore, the user can follow a route that avoids a traffic crossing having a long transit time. Moreover, if a large number of vehicles avoid the traffic crossing, the traffic can be alleviated.

  The route search method described in the present embodiment can be realized by executing a program prepared in advance on a computer such as a personal computer or a workstation. This program is recorded on a computer-readable recording medium such as a hard disk, a flexible disk, a CD-ROM, an MO, and a DVD, and is executed by being read from the recording medium by the computer. Further, this program may be a transmission medium that can be distributed via a network such as the Internet.

  The present invention relates to a route search device, a route search method, a route search program, and a recording medium mounted on a mobile object. However, the use of the present invention is not limited to the above-described route search device, route search method, route search program, and recording medium.

  In recent years, a moving body such as a vehicle is equipped with a route search device that searches for a route to a destination based on map data. For example, when searching for a route to a destination, a route that passes through a so-called unopened level crossing may be set. In such a case, it takes time to pass through the level crossing at a level crossing without opening, which may be significantly different from the searched scheduled time.

  Therefore, a technique has been proposed in which the opening / closing time for each time zone at each level crossing is stored in advance, and the route search is performed based on the stored data and taking into account the level crossing data corresponding to the time. (For example, see Patent Document 1 below.)

JP 2001-304877 A

  However, the technique of Patent Document 1 described above is, for example, a crossing of a road where one level crossing is congested when the opening / closing times of adjacent level crossings are the same. Even if it is a level crossing, a route that takes into account only the opening and closing time of the level crossing is set, and therefore a level crossing on a congested road may be used as the route. That is, even if the opening and closing times are the same, there is a problem that an appropriate route cannot be set because only the opening and closing times are taken into consideration even though the traffic time is different and the passing time of the road is different.

  In order to solve the above-described problems and achieve the object, the route search device according to the invention of claim 1 includes an extraction means for extracting a level crossing on map data, and a predetermined time of a road where a level crossing exists in each time zone. Based on the taking-in means for taking in the traffic volume per hour and the vehicle sweep-out amount that allows the vehicle to pass around a predetermined time of the railroad crossing, and on the basis of the traffic volume per hour and the vehicle sweep-out amount A calculating means for calculating the number of traffic blocks (hereinafter referred to as “traffic blocking amount”) at a level crossing extracted by the means, and a level crossing in which a certain amount of traffic congestion occurs based on the traffic blocking amount ( And a search means for searching for a route to the destination by multiplying the link including the traffic crossing by a predetermined link cost value. And features.

  A route search device according to a second aspect of the invention includes an extraction means for extracting a level crossing on map data, and a number of vehicles (hereinafter referred to as “traffic cut-off”) at a level crossing extracted by the extraction means. Acquisition means for acquiring a traffic volume) and a level crossing where a certain level of traffic congestion occurs (hereinafter referred to as “traffic traffic level crossing”) based on the traffic blocking amount, and based on the position of the traffic congestion level A specific means for identifying a level crossing that bypasses a traffic crossing (hereinafter referred to as “detour crossing”) or a road that bypasses the traffic crossing and crosses a track (hereinafter referred to as “level crossing road”), and a set search Search means for selecting an optimum route from among the routes to the destination passing through the traffic jam crossing, the detour railroad crossing or the multilevel intersection road based on conditions.

  According to a third aspect of the present invention, there is provided a route search method for extracting a level crossing on map data, a traffic volume per predetermined time on a road where a level crossing exists in each time zone, The vehicle sweeping amount that allows the vehicle to pass through, and the traffic volume per predetermined time and the vehicle sweeping amount based on the traffic volume and the vehicle sweeping amount for each time zone at the level crossing extracted by the extraction step A calculation process for calculating the number of traffic blocking units (hereinafter referred to as “traffic blocking amount”) and a level crossing (hereinafter referred to as “traffic level crossing”) in which a certain amount of traffic congestion has occurred based on the traffic blocking amount And a search step of searching for a route to the destination by multiplying a link including the traffic jam crossing by a predetermined link cost value.

  According to a fourth aspect of the present invention, there is provided a route search method for extracting a level crossing on map data, and a number of times (hereinafter referred to as “traffic blocking”) at a level crossing extracted by the extraction step. A level crossing in which a certain level of traffic congestion has occurred (hereinafter referred to as “traffic traffic level crossing”) based on the traffic blocking amount, and based on the position of the traffic level crossing A specific process for identifying a level crossing that bypasses a traffic crossing (hereinafter referred to as “detour level crossing”) or a road that bypasses the traffic crossing and crosses a track (hereinafter referred to as “level crossing road”), and a set search And a search step of selecting an optimum route from among the routes to the destination passing through the traffic jam crossing, the detour railroad crossing or the three-dimensional intersection road based on conditions.

  According to a fifth aspect of the present invention, a route search program causes a computer to execute the route search method according to the third or fourth aspect.

  A recording medium according to a sixth aspect of the invention is characterized in that the route search program according to the fifth aspect is recorded in a computer-readable manner.

It is a block diagram which shows an example of a functional structure of the route search apparatus concerning embodiment. It is a flowchart which shows an example of the route search process sequence of the route search apparatus concerning embodiment. It is a block diagram which shows an example of the hardware constitutions of the navigation apparatus concerning a present Example. It is a flowchart which shows an example of the route search process of the navigation apparatus concerning a present Example. It is a flowchart which shows another example of the route search process of the navigation apparatus concerning a present Example. In this example, it is a flowchart which shows an example of the process of calculation of the link cost used at the time of a route search. It is a flowchart which shows another example of the route search process of the navigation apparatus concerning a present Example. 5 is a flowchart illustrating an example of a crossing attribute assignment process in the present embodiment. In this example, it is a graph which shows an example of the average waiting time of vehicles when there is no vehicle waiting for a crossing. In this example, it is a graph which shows an example of the average waiting time of vehicles when there is a vehicle waiting for a crossing. It is explanatory drawing which shows an example of the display of a level crossing concerning a present Example. It is explanatory drawing which shows an example of the display format of a crossing symbol concerning a present Example. It is explanatory drawing which shows an example of the display format of the solid intersection symbol concerning a present Example.

  Exemplary embodiments of a route search device, a route search method, a route search program, and a recording medium according to the present invention will be explained below in detail with reference to the accompanying drawings.

(Embodiment)
(Functional configuration of route search device)
A functional configuration of the route search apparatus 100 according to the embodiment of the present invention will be described. FIG. 1 is a block diagram of an example of a functional configuration of the route search apparatus according to the embodiment. In FIG. 1, the route search apparatus 100 includes an extraction unit 101, an acquisition unit 102, a specification unit 103, a search unit 104, a required time calculation unit 105, a capture unit 106, an interception amount calculation unit 107, The notification unit 108, the display control unit 109, and the display unit 110 are provided.

  The extraction unit 101 extracts a crossing on the map data. The acquisition unit 102 acquires the number of traffic blocks (hereinafter referred to as “traffic blocking amount”) for each time zone at the level crossing extracted by the extraction unit 101. Specifically, the traffic blocking amount is the number of traffic blocking for a predetermined time, and for example, it is actually measured at each level crossing. The time period typically includes a span of 1 hour or 2 hours, but may be a day, morning, daytime, evening or night. The traffic blocking amount may be information recorded in advance in addition to real-time information received by wire or wireless.

  The identifying unit 103 identifies a level crossing (hereinafter referred to as “traffic level crossing”) in which a certain amount of traffic jam occurs based on the traffic blocking amount acquired by the acquisition unit 102. More than a certain amount of traffic is a traffic jam that is more than a certain distance from the railroad crossing point, a traffic jam that has more than a certain number of vehicles, a traffic jam that has more than a certain number of vehicles waiting for a level crossing, For example, the time required for passing the level crossing is a traffic jam of a certain time or more. That is, a level crossing that takes a long time to pass through a level crossing corresponds to a traffic jam crossing. The “constant” mentioned here does not have to be a constant value common to all level crossings, and may be a value set for each level crossing.

  Specifically, for example, when the acquisition unit 102 acquires a traffic blocking amount, the specifying unit 103 compares the traffic blocking amount with a threshold set for each time zone recorded in advance for each level crossing. Thus, when the traffic blocking amount is equal to or greater than the threshold, the level crossing is specified as a traffic jam level crossing.

  The search unit 104 calculates the link cost of each link when performing a route search by the Dijkstra method or the like, for example. The search unit 104 calculates a predetermined link cost value of the link including the traffic crossing specified by the specifying unit 103. The link cost value is a weight used when calculating the link. For example, the link cost value may be calculated each time based on the real-time traffic cut-off amount, or corresponds to the traffic cut-off amount for each pre-recorded time zone. It may be set in advance.

  Further, the search unit 104 may search for a route to the destination by multiplying a link including the traffic jam crossing by a predetermined link cost value according to the traffic blocking amount acquired by the acquisition unit 102. . Further, a required time calculation unit 105 may be provided. The required time calculation unit 105 calculates the required time to the destination based on the route searched by the search unit 104. Specifically, when the route to the destination includes a traffic jam crossing, the search unit 104 adds a predetermined time corresponding to the link cost value to calculate the time required to the destination.

  Moreover, in this Embodiment, the taking-in part 106 and the interruption | blocking amount calculation part 107 are arbitrary components. The take-in part 106 takes in the traffic volume per predetermined time of the road where a level crossing exists in each time zone, and the vehicle sweep-out amount that allows the vehicle to pass during the predetermined time of the level crossing. The blocking amount calculation unit 107 calculates a traffic blocking amount based on the traffic volume per predetermined time taken in by the fetching unit 106 and the vehicle sweep-out amount. The traffic volume per predetermined time on a road where a railroad crossing exists is an amount that generally increases in accordance with, for example, a main road or the number of lanes. The vehicle sweep-out amount is also generally an amount that increases according to the main road, the number of lanes, and the like. Further, the vehicle sweep-out amount is an amount that changes according to the opening / closing time of the railroad crossing, and increases as the time during which the breaker is open is longer.

  The identifying unit 103 detours the traffic crossing (hereinafter referred to as “detour crossing”) or bypasses the traffic crossing based on the position of the traffic crossing determined from the crossing position on the map data May be identified as a road (hereinafter referred to as a “three-dimensional intersection road”). In this case, the search unit 104 may select an optimum route from among traffic crossings, detour crossings, or routes passing through a three-dimensional intersection based on the set search conditions. More specifically, the three-dimensional intersection road is an overpass that straddles the track or an underpass that passes under the track. In addition, the search conditions when searching by the search unit 104 are conditions such as time priority and distance priority. The optimum route is a route that best matches the search condition.

  In the present embodiment, the notification unit 108 is an arbitrary component. When the search unit 104 searches for a route to a destination via a detour or level crossing road, the notification unit 108 notifies that the traffic crossing has been detoured. For example, the notification unit 108 may create an image indicating that a detour is made by characters, or may indicate a route passing through the traffic crossing with a dotted line or the like and notify that the traffic crossing is bypassed. .

  In addition, the acquisition unit 102 may acquire the traffic interception amount of the traffic jam crossing when departing at the current time and the traffic traffic interception amount of the traffic jam crossing when departing at a time after a predetermined time has elapsed. In this case, the search unit 104 acquires the traffic interception amount of the traffic jam crossing when departing at the current time and the traffic traffic interception amount of the traffic jam crossing when departing at the time after a predetermined time, acquired by the acquisition unit 102. Based on this, the route at each departure time may be searched. Moreover, the required time calculation part 105 should just calculate the required time in each departure time.

  In the present embodiment, the display control unit 109 and the display unit 110 are arbitrary components. The display control unit 109 controls the display of the traffic crossing specified by the specifying unit 103 to a display different from the normal display. The display unit 110 displays the traffic crossing controlled by the display control unit 109. The display different from the normal display by the display control unit 109 is a display that allows the user to recognize the traffic jam, such as a colored display, a blinking display, and a penalty point display on the road where the traffic jam occurs. The display unit 110 may be any device that can display a traffic crossing such as a display. Accordingly, the display unit 110 displays a level crossing in which a certain level of traffic congestion including a traffic jam level crossing occurs, which is different from the normal display.

  The display control unit 109 may display a traffic jam crossing as a symbol, and may change the display format of the traffic jam crossing displayed as a symbol according to the traffic blocking amount acquired by the acquisition unit 102. The symbol display includes, for example, a mark indicating a level crossing. To change the display format according to the traffic blockage amount, for example, the mark may be blinked or the color of the mark may be changed according to the length of the traffic jam or the time taken for passing the crossing. Specifically, for example, if the time taken to pass a level crossing is a predetermined time or more, display a prompt to bypass the traffic jam crossing by, for example, speeding up blinking of the mark or displaying the color of the mark in red. That's fine.

  The display control unit 109 may display a detour railroad or a three-dimensional intersection road as a symbol. The symbol display includes, for example, a mark indicating a level crossing. In this case, the display control unit 109 may change the display format of the detour railroad or the multilevel crossing road according to the traffic blocking amount of the traffic jam crossing. In other words, when the congestion at a traffic crossing is greater than or equal to a predetermined level, the color of the mark may be displayed in blue so as to blink, for example, a color that prompts passage to the detour crossing or a three-dimensional crossing road.

(Route search processing procedure of route search device)
Next, a route search processing procedure of the route search device 100 will be described with reference to FIG. FIG. 2 is a flowchart illustrating an example of a route search processing procedure of the route search device according to the embodiment.

  In the flowchart of FIG. 2, the route search device 100 waits for an input of a route search start (step S201: No loop), and when there is an input of a route search start (step S201: Yes), the extraction unit 101 reads the map. A crossing on the data is extracted (step S202). And the acquisition part 102 acquires the traffic interruption amount in a level crossing extracted by the extraction part 101 (step S203).

  And the specific | specification part 103 specifies a traffic jam level crossing based on the traffic interruption amount acquired by the acquisition part 102 (step S204). Then, the search unit 104 multiplies a link including a traffic jam crossing by a predetermined link cost value to search for a route to the destination (step S205), and ends a series of processing.

  As described above, the route search device 100 according to the present embodiment identifies a traffic jam crossing based on the number of traffic blocks (traffic blockage amount) for each time zone at a railroad crossing, and includes the traffic jam crossing. A route search is performed by multiplying a link by a predetermined link cost value. According to such a route search device 100, a route search according to the traffic volume at each level crossing can be performed. Accordingly, the user can follow a travel route that avoids a traffic crossing having a long transit time. Moreover, if a large number of vehicles avoid the traffic crossing, the traffic can be alleviated.

  In addition, the route search device 100 according to the present embodiment includes the capturing unit 106 that captures the traffic volume per predetermined time and the vehicle sweep-out amount at the level crossing, and the predetermined route captured by the capturing unit 106. You may make it provide the interruption | blocking amount calculation part 107 which calculates traffic interruption | blocking amount based on the traffic volume per time and the vehicle sweeping-out amount. That is, the traffic blocking amount for each level crossing may be calculated based on the traffic volume and the vehicle sweep-out amount. According to such a configuration, the traffic blocking amount can be calculated easily and accurately.

  Further, the route search device 100 according to the present embodiment specifies a detour crossing or a level crossing road in addition to a traffic jam crossing, and a traffic jam crossing, detour crossing or level crossing road based on the set search conditions. An optimal route may be selected from the routes passing through. According to such a configuration, a route search according to search conditions such as time priority and distance priority can be performed.

  In addition, the route search device 100 according to the present exemplary embodiment, when the search unit 104 searches for a route to a destination via a detour crossing or a multilevel crossing road, a notification unit 108 that notifies that the traffic crossing has been detoured. You may make it provide. According to such a configuration, the user can know that the displayed route is not a detour route but a route that bypasses the traffic jam crossing, and the time required to reach the destination is shortened. I can know that.

  In addition, the route search device 100 according to the present embodiment has the traffic interception amount of the traffic jam crossing when the acquisition unit 102 departs at the current time and the traffic traffic interception amount of the traffic jam crossing when the acquisition unit 102 departs at a time after a predetermined time has elapsed. And may be acquired. Further, based on the traffic blockage amount of the traffic jam crossing when the search unit 104 departs at the current time and the traffic blockage amount of the traffic jam crossing when the search unit 104 departs at a time after a predetermined time, acquired by the acquisition unit 102. Thus, the route at each departure time may be searched. According to such a configuration, since the user can know the arrival time and the required time when the departure time is delayed, the departure time can be delayed with peace of mind when there is room.

  In addition, the route search device 100 according to the present embodiment displays a display control unit 109 that controls the display of the traffic jam crossing to a display different from the normal display, and the traffic crossing controlled by the display control unit 109. A display unit 110 may be provided. According to such a configuration, the user can confirm on the display screen a crossing with a long transit time.

  In addition, the display control unit 109 in the route search device 100 according to the present embodiment displays a traffic jam crossing as a symbol, and displays the traffic jam crossing displayed as a symbol according to the traffic blocking amount acquired by the acquisition unit 102. May be changed. According to such a configuration, the user can grasp the traffic crossing at a glance and can also grasp the degree of congestion at a glance.

  Further, the display control unit 109 in the route search apparatus 100 according to the present embodiment may display a detour railroad or a three-dimensional intersection road as a symbol. According to such a configuration, the user can grasp the detour railroad crossing or the multilevel intersection road at a glance and easily find it.

  Examples of the present invention will be described below. In this embodiment, an example in which the route search device 100 of the present invention is implemented by a navigation device mounted on a vehicle will be described.

(Hardware configuration of navigation device)
The hardware configuration of the navigation device 300 according to the present embodiment will be described with reference to FIG. FIG. 3 is a block diagram illustrating an example of a hardware configuration of the navigation device according to the present embodiment. In FIG. 3, a navigation device 300 is mounted on a moving body such as a vehicle, and includes a CPU 301, ROM 302, RAM 303, magnetic disk drive 304, magnetic disk 305, optical disk drive 306, optical disk 307, and audio. An I / F (interface) 308, a speaker 309, an input device 310, a video I / F 311, a display 312, a communication I / F 313, a GPS unit 314, and various sensors 315 are provided. Each component 301 to 315 is connected by a bus 320.

  The CPU 301 governs overall control of the navigation device 300. The ROM 302 stores various programs such as a boot program, a current location calculation program, a navigation program, a route guidance program, a voice generation program, a map data display program, and a symbol display program. The RAM 303 is used as a work area for the CPU 301.

  The current location calculation program, for example, calculates the current location of the vehicle (the current location of the navigation device 300) based on output information from a GPS unit 314 and various sensors 315 described later.

  The navigation program searches for an optimal route from the departure point to the destination point using map data recorded on a magnetic disk 305 described later. Here, the optimum route is the shortest (or fastest) route to the destination point or the route that best meets the conditions specified by the user. Further, not only the destination point but also a route to a stop point or a rest point may be searched. The searched guidance route is output to the audio I / F 308 and the video I / F 311 via the CPU 301.

  The route guidance program is based on the guidance route information searched by executing the navigation program, the vehicle current location information calculated by executing the current location calculation program, and the map data read from the magnetic disk 305. Real-time route guidance information is generated. The generated route guidance information is output to the audio I / F 308 and the video I / F 311 via the CPU 301.

  The voice generation program generates tone and voice information corresponding to the pattern. That is, based on the route guidance information generated by executing the route guidance program, the virtual sound source corresponding to the guidance point is set and the voice guidance information is generated and output to the voice I / F 308 via the CPU 301. .

  The map data display program displays map data recorded on the magnetic disk 305 and the optical disk 307 on the display 312 by the video I / F 311.

  The symbol display program displays a railroad crossing position on the map-displayed map data recorded on the magnetic disk 305 or the optical disk 307 and changes the display format based on the traffic interception amount of the railroad crossing.

  The magnetic disk drive 304 controls the reading / writing of the data with respect to the magnetic disk 305 according to control of CPU301. The magnetic disk 305 records data written under the control of the magnetic disk drive 304. As the magnetic disk 305, for example, an HD (hard disk) or an FD (flexible disk) can be used.

  The optical disk drive 306 controls the reading / writing of the data with respect to the optical disk 307 according to control of CPU301. The optical disk 307 is a detachable recording medium from which data is read according to the control of the optical disk drive 306. As the optical disc 307, a writable recording medium can be used. In addition to the optical disk 307, the removable recording medium may be an MO, a memory card, or the like.

  The audio I / F 308 is connected to a speaker 309 for audio output. Examples of the input device 310 include a remote controller having a plurality of keys for inputting characters, numerical values, and various instructions, a keyboard, a mouse, and a touch panel. The input device 310 may be realized by any one of a remote controller, a keyboard, a mouse, and a touch panel, or may be realized by a plurality of forms.

  The video I / F 311 is connected to the display 312. Specifically, the video I / F 311 includes, for example, a graphic controller that controls the entire display 312, a buffer memory such as a VRAM (Video RAM) that temporarily records image information that can be displayed immediately, and a graphic controller. Based on the output image data, the display 312 is configured by a control IC or the like.

  The display 312 displays icons, cursors, menus, windows, or various data such as characters and images. On the display 312, the above-described map data is drawn two-dimensionally or three-dimensionally. The map data displayed on the display 312 can be displayed with a mark representing the current location of the vehicle on which the navigation device 300 is mounted. The current location of the vehicle is calculated by the CPU 301.

  As this display 312, for example, a CRT, a TFT liquid crystal display, a plasma display, or the like can be adopted. The display 312 is installed near the dashboard of the vehicle, for example. A plurality of displays 312 may be installed in the vehicle, for example, in the vicinity of the dashboard of the vehicle or in the vicinity of the rear seat of the vehicle.

  The communication I / F 313 is connected to a network via wireless and functions as an interface between the navigation device 300 and the CPU 301. The communication I / F 313 is further connected to a communication network such as the Internet via wireless, and also functions as an interface between the communication network and the CPU 301.

  Communication networks include LANs, WANs, public line networks and mobile phone networks. Specifically, the communication I / F 313 includes, for example, an FM tuner, a VICS (Vehicle Information and Communication System) / beacon receiver, a radio navigation device, and other navigation devices. Get road information such as regulations. VICS is a registered trademark.

  The GPS unit 314 receives radio waves from GPS satellites and outputs information indicating the current location of the vehicle. The output information of the GPS unit 314 is used when the current position of the vehicle is calculated by the CPU 301 together with output values of various sensors 315 described later. The information indicating the current location is information for specifying one point on the map data, such as latitude / longitude and altitude.

  The various sensors 315 output information that can determine the position and behavior of the vehicle, such as a vehicle speed sensor, an acceleration sensor, and an angular velocity sensor. The output values of the various sensors 315 are used for the calculation of the current location of the vehicle by the CPU 301 and the measurement of the change in speed and direction.

  The extraction unit 101, the acquisition unit 102, the specifying unit 103, the search unit 104, the required time calculation unit 105, the capture unit 106, and the blocking amount calculation unit 107 included in the route search device 100 illustrated in FIG. The notification unit 108, the display control unit 109, and the display unit 110 are a CPU 301 that uses programs and data recorded in the ROM 302, RAM 303, magnetic disk 305, optical disk 307, and the like in the navigation device 300 shown in FIG. Implements its function by executing a predetermined program and controlling each part in the navigation device 300.

  That is, the navigation device 300 of the present embodiment executes the various programs recorded in the ROM 302 as a recording medium in the navigation device 300, thereby providing the functions provided in the route search device 100 shown in FIG. It can be executed by the route search processing procedure shown.

(Example of route search processing of navigation device)
Next, an example of route search processing performed by the navigation device 300 according to the present embodiment will be described with reference to FIG. FIG. 4 is a flowchart illustrating an example of route search processing of the navigation device according to the present embodiment.

  In the flowchart of FIG. 4, the navigation apparatus 300 is in a standby state until an instruction to start a route search is received (step S401: No loop). When an instruction to start a route search is received (step S401: Yes), for example, time Under the priority search condition, the route search is performed without multiplying the link including the railroad crossing by the link cost value (step S402). Then, the route search is performed by multiplying the link including the railroad crossing by the link cost value (step S403). The required time may be calculated by adding a predetermined time corresponding to the link cost value when the route includes a traffic jam crossing. The calculation of the link cost value will be described later.

  Then, it is determined whether or not the above-described two routes are different (step S404). If it is determined in step S404 that the two routes are different (step S404: Yes), a traffic crossing is identified from the map data (step S405). Specifically, the two routes differ from each other in that the route searched by multiplying the link by the link cost value is a route that bypasses the traffic jam level crossing, and is a route that takes less time than a route that passes through the traffic jam level crossing. It means that there is.

  Then, the display format of the traffic crossing is changed according to the traffic blocking amount, which is the number of traffic blocking at each time (step S406). The change of the display format is, for example, blinking a traffic crossing in red, as will be described in detail later. And the detour crossing which detours a traffic jam crossing is specified (step S407). As a detour crossing, for example, a crossing that is not a traffic crossing but is another crossing existing along the same track as the traffic crossing may be used as the detour crossing. Then, according to the degree of congestion at the traffic crossing, for example, the display format of the detour crossing such as blinking the detour crossing in blue is changed (step S408).

  And the image which displayed that it is the path | route which detoured the traffic jam crossing is produced (step S409). The image in this case is, for example, a character image such as “I bypassed a crossing in a traffic jam” as will be described later. Then, the traffic crossing at which the display format is changed, the detour crossing, and the route passing through the detour crossing are displayed (step S410), and the series of processing ends. On the other hand, in step S404, when the two routes are not different, the route searched without multiplying the link including the level crossing by the link cost value and the route searched by multiplying the link including the level crossing by the link cost value ( Step S404: No), that is, if it is determined that there is no traffic crossing on the link, the series of processing ends.

  In the above description, in step S404, when the two routes are different, that is, when there is a route that bypasses the traffic jam crossing, the route that is automatically bypassed is selected. You may make it accept. Specifically, it displays a message such as "Do you want to detour the crossing in a traffic jam?", And when you receive an "YES" input from the user, displays the route that passes through the detour. When an input of “NO” is received, a route passing through the traffic jam crossing may be displayed.

  Further, in this embodiment, when detouring a traffic crossing, not only the detour crossing but also a three-dimensional crossing road that crosses the track. In the case of a route for which a three-dimensional intersection road is selected, the display format may be changed, for example, the display of the three-dimensional intersection road is blinked in blue. In step S409, a character image is created. However, along with this, for example, a route passing through a traffic jam crossing may be indicated by a dotted line.

  Further, when all the level crossings near the traffic crossing are congested, that is, when the detour crossing cannot be specified, the route passes through the traffic crossing. In this case, it is only necessary to display that the route passes through a traffic jam crossing and to blink all the crossings displayed on the map in red.

(Another example of route search processing of the navigation device)
Next, another example of the route search process performed by the navigation device 300 according to the present embodiment will be described with reference to FIG. FIG. 5 is a flowchart illustrating another example of the route search process of the navigation device according to the present embodiment. The flowchart shown in FIG. 5 is a process in which a route when starting at the current time and a route when starting at a time after a predetermined time have been searched.

  In the flowchart of FIG. 5, the navigation device 300 is in a standby state until an instruction to start a route search is received (step S501: No loop). When an instruction to start a route search is received (step S501: Yes), for example, time Under the priority search condition, the route search is performed without multiplying the link including the railroad crossing by the link cost value (step S502). The required time may be calculated by adding a predetermined time corresponding to the link cost value when the route includes a traffic jam crossing. Then, the route search is performed by multiplying the link including the railroad crossing by the link cost value at the time of departure at the current time (step S503). Note that the link cost value at the time of departure at the current time is the link cost value at the time of departure at the current time and reaching the railroad crossing.

  Then, it is determined whether or not the two routes described above are different (step S504). If it is determined in step S504 that the two routes are different (step S504: Yes), a route search is performed by multiplying the link cost value at the time after departure for a predetermined time (step S505). The link cost value at the time of departure at a time after the elapse of a predetermined time is a link cost value at a time zone when the vehicle departs at a time after the elapse of the predetermined time and reaches the railroad crossing. Then, the route and the required time at each departure time multiplied by the link cost value are displayed (step S506), and the series of processes is terminated.

  On the other hand, in step S504, when the two routes are not different, the route searched without multiplying the link including the level crossing by the link cost value and the route searched by multiplying the link including the level crossing by the link cost value ( Step S504: No), that is, if it is determined that there is no traffic crossing on the link, the series of processing ends.

  In the route search process described above, the route search at each departure time will be supplemented by taking a specific time zone as an example. For example, the current time is 8 am. The scheduled arrival time at the destination for departure at 8 am is 9:30. Also, if the time after 1 hour has passed, that is, if you depart at 9:00 am, the rush time will be over and the traffic at the railroad crossing will alleviate, so the scheduled arrival time at the destination will be 9:50 To do. In such a case, by displaying the route and required time at each departure time, the user can select the optimum departure time. In addition, such route search processing can also be performed by reversely calculating the latest time that can be departed by designating the arrival time at the destination by the user.

  In the route search process described above, a traffic crossing or a detour crossing may be displayed as a symbol for the crossing on the route at each departure time. Further, it may be displayed that the route at each departure time is a route that bypasses the traffic jam crossing.

(Example of link cost calculation process used for route search)
Next, with reference to FIG. 6A, an example of a link cost calculation process used in route search in the present embodiment will be described. FIG. 6A is a flowchart illustrating an example of a link cost calculation process used in route search in the present embodiment.

  In the flowchart of FIG. 6A, the navigation apparatus 300 calculates the link cost from the link length, width, number of lanes, number of traffic lights, and the like (step S601). The link crossing attribute is acquired (step S602). Then, it is determined whether or not the acquired crossing attribute includes a crossing attribute of a traffic jam crossing (step S603). A method for assigning a level crossing attribute for a traffic jam level crossing will be described later. If it is determined in step S603 that the acquired level crossing attribute includes a level crossing attribute for traffic jam crossing (step S603: Yes), it is determined whether the time to reach the link is within the time for traffic jam crossing (step S604). .

  In step S604, when it is determined that the time to reach the link is within the time of traffic jam crossing (step S604: Yes), the link cost is increased by α (step S605), and the series of processes is terminated. Α is a weighting value set for each traffic crossing. On the other hand, when it is determined in step S603 that the acquired crossing attribute does not have a crossing attribute for a traffic jam crossing (step S603: No), a series of processing ends. If it is determined in step S604 that the time to reach the link is not within the traffic crossing time (step S604: No), the series of processing ends. Note that the order of the processes in steps S603 and S604 is arbitrary, and the process in step S604 may be performed first.

(Another example of route search processing of the navigation device according to the present embodiment)
Next, another example of the route search process of the navigation device 300 according to the present embodiment will be described with reference to FIG. FIG. 6B is a flowchart of another example of the route search process of the navigation device according to the present embodiment.

  In the flowchart of FIG. 6B, the navigation device 300 is in a standby state until an instruction for starting a route search is received (step S611: No). When an input for starting a route search is received (step S611: Yes), Is extracted (step S612). And the average waiting time in each extracted level crossing is acquired (step S613). Note that the average waiting time may be stored in advance for each hour. Details of the average waiting time calculation method will be described later.

  Thereafter, the link cost α corresponding to the average waiting time is calculated (step S614). Then, a route to the destination is searched by multiplying the link including the railroad crossing by a predetermined link cost α (step S615), and the series of processes is terminated. Specifically, for example, if the average waiting time is a crossing of 10 minutes, it is multiplied by a link cost corresponding to 10 minutes, and if the average waiting time that is not a traffic jam crossing is 10 seconds, it corresponds to 10 seconds. Multiply the link cost. In addition, in such a process, when performing a route search when leaving at a time after the elapse of a predetermined time, the route search is performed using an average waiting time and a traffic blocking amount after the elapse of the predetermined time stored in advance. Just do it.

(An example of level crossing attribute assignment processing)
Next, an example of a crossing attribute assignment process in the present embodiment will be described with reference to FIG. FIG. 7 is a flowchart illustrating an example of a crossing attribute assignment process in the present embodiment.

  In the flowchart of FIG. 7, the navigation apparatus 300 acquires the number of traffic blocks (traffic blocking amount N) per certain time at a certain level crossing (step S701). Details of the traffic blocking amount N will be described later. Then, it is determined whether or not there is a time zone in which the acquired traffic blocking amount N exceeds the predetermined value β (step S702). The predetermined value β is a threshold set for each level crossing. In addition, the time zone in this case is a time zone having a long passage time, for example, a time zone such as 7:00 am to 9:00 am during rush hours.

  In step S702, when it is determined that there is a time zone in which the traffic blocking amount N exceeds the predetermined value β (step S702: Yes), a crossing attribute of the traffic jam crossing is given to the link including the crossing (step S703). And the time slot | zone when the traffic interruption amount N exceeds predetermined value (beta) is stored (step S704), and a series of processes are complete | finished. In Step S702, when it is determined that there is no time zone in which the traffic blocking amount N exceeds the predetermined value β (Step S702: No), the series of processes is terminated. Here, in step S704, the time zone in which N exceeds β is stored, but it is not always necessary to store the time zone, and information indicating whether or not the level crossing is a traffic jam level crossing is at least attribute information. It only has to be generated. Thus, by giving the attribute information of the traffic crossing and storing the time zone in which the traffic blocking amount N exceeds the predetermined value β, it becomes possible to display the traffic information near the level crossing on the display screen.

(An example of the average waiting time of a vehicle when no vehicle is waiting for a level crossing)
Next, an example of calculating the traffic blocking amount will be described with reference to FIGS. 8 and 9. First, the average waiting time of a vehicle when there is no vehicle waiting for a level crossing will be described with reference to FIG. FIG. 8 is a graph showing an example of the average waiting time of the vehicle when there is no vehicle waiting for a crossing in this embodiment.

  In FIG. 8, in a graph 800, the horizontal axis 801 indicates the elapsed time (seconds) after the level crossing is released, and the vertical axis 802 indicates the vehicle waiting time (seconds). The crossing in the graph shown in FIG. 8 is a crossing that closes for 60 seconds and opens for 60 seconds. That is, in FIG. 8, the crossing is open when the horizontal axis 801 is 0 to 60 seconds, and the crossing is closed while the horizontal axis 801 is 60 to 120 seconds. For example, a vehicle that has reached the level crossing within 0 to 60 seconds after the level crossing is released (point A in FIG. 8) has a waiting time of 0, indicating that it can pass without waiting time.

  On the other hand, when the horizontal axis 801 reaches 60 seconds, the railroad crossing closes. Therefore, it is shown that the vehicle that has reached the level crossing (point B in FIG. 8) waits for 60 seconds after the level crossing is released for 60 seconds. For example, when the horizontal axis 801 is 90 seconds, the vehicle that has reached the railroad crossing (point C in FIG. 8) waits for 30 seconds. When the horizontal axis 801 is 120 seconds, the vehicle that has reached the railroad crossing (D point in FIG. 8) indicates that it can pass without waiting time.

  From this graph 800, the average waiting time of the vehicle at the level crossing is calculated. First, the total waiting time for 120 seconds is calculated. The total of the waiting time of the vehicle for 120 seconds is a triangular area 820 surrounded by the straight line 811, the straight line 812, and the horizontal axis 801. That is, the area 820 is (120−60) × 60 ÷ 2 = 1800. Next, the average waiting time of the vehicle per 120 seconds is calculated. The average waiting time of the vehicle is 15 seconds, which is a value obtained by dividing the area 820 by 120 seconds (1800 ÷ 120). Therefore, the average waiting time at a level crossing without such a level crossing waiting time is 15 seconds per 120 seconds.

(Example of calculating traffic blockage)
Next, an example of calculating the traffic blocking amount will be described with reference to FIG. FIG. 9 is a graph illustrating an example of calculation of the traffic blocking amount when there is a vehicle waiting for a crossing in the present embodiment. The case where there is a vehicle waiting for a crossing when the vehicle reaches the crossing will be described using the graph shown in FIG.

  In FIG. 9, the graph 900 shows the elapsed time (seconds) after the level crossing is released on the horizontal axis 901, and the waiting time of the vehicle on the vertical axis 902. A graph 900 shown in FIG. 9 is a railroad crossing that closes for 60 seconds and opens for 60 seconds, like the graph 800 shown in FIG. At this level crossing, it is assumed that the traffic volume on the road is 6 cars / 60 seconds. Therefore, six vehicles will wait for the crossing while the crossing is closed for 60 seconds. Further, in this level crossing, the traffic volume (corresponding to the vehicle sweep-out amount) through which the vehicle can pass when the level crossing is open is 12 vehicles / 60 seconds.

  In FIG. 9, when the horizontal axis 901 is 0 seconds, that is, when the level crossing is released, the vehicle that has reached the level crossing (point E in FIG. 9) has a waiting time of 30 seconds. This means waiting for the passage of six vehicles waiting for a crossing. Specifically, since the traffic volume (vehicle sweep-out amount) that the vehicle can pass when the railroad crossing is open is 12 vehicles / 60 seconds, the time required to pass per vehicle is the vehicle sweep-out amount. The reciprocal of 5 seconds / 1 unit. Therefore, it means that it takes 30 seconds to pass 6 vehicles by 5 seconds / 1 vehicle (6 times).

  Further, for example, when the horizontal axis 901 is 30 seconds, that is, a vehicle that has reached the level crossing after 30 seconds have elapsed since the level crossing was released (point F in FIG. 9), the waiting time is 15 seconds. This will be described. Since the time required to pass per vehicle is 5 seconds / 1 vehicle, the number of vehicles that are swept out during 30 seconds after the level crossing is released is 30 seconds ÷ (5 seconds / 1 vehicle), 6 units. On the other hand, the traffic volume on the road is 6 cars / 60 seconds, and the time interval between cars is 10 seconds / 1 car which is the reciprocal of the traffic volume.

  Therefore, the number of vehicles that reach the level crossing within 30 seconds after the level crossing is released is 3 by 30 seconds / (10 seconds / 1 vehicle). That is, a vehicle that arrives 30 seconds after the level crossing is released waits for three vehicles to arrive after the level crossing is released. Accordingly, the passage of three vehicles takes 15 seconds, which is 5 seconds / 1 vehicle, which is the time required for passing one vehicle, for three vehicles. Similarly, a vehicle that has reached the railroad crossing before the horizontal axis 901 passes 60 seconds (point G in FIG. 9) has a waiting time of zero.

  On the other hand, when 60 seconds have elapsed, the vehicle that has reached the level crossing (point H in FIG. 9) becomes the head of waiting for the level crossing and has a waiting time of 60 seconds. Similarly, for example, a vehicle that reaches the railroad crossing after 90 seconds (point I in FIG. 9) has a waiting time of 45 seconds. Although the details of the calculation are omitted, this is a value obtained by adding the remaining time 30 seconds until the railroad crossing is opened and the time 15 seconds required for passing the three cars that have arrived after the railroad crossing is closed. .

  From this graph 900, the average waiting time of the vehicle at the level crossing is calculated. First, the total waiting time for 120 seconds is calculated. The total vehicle waiting time for 120 seconds is surrounded by a triangular area 920 surrounded by a horizontal axis 901, a vertical axis 902, and a straight line 911, and surrounded by a horizontal axis 901, a straight line 912, a straight line 913, and a broken line 914. The total area is obtained by adding the trapezoidal area 921. Specifically, the area 920 is 60 × 30/2 = 900. The area 921 is (30 + 60) × (120−60) / 2 = 2700. Therefore, the total area is 3600 obtained by adding the area 920 and the area 921.

  Next, the average waiting time of the vehicle per 120 seconds is calculated. The average waiting time of the vehicle is 30 seconds, which is a value obtained by dividing the total area by 120 seconds (3600 ÷ 120). Therefore, the average waiting time for such a level crossing is a waiting time of 30 seconds per 120 seconds. Next, the traffic blocking amount is calculated. The traffic blocking amount is the number of vehicles that cannot pass per predetermined time, and is obtained by dividing the average waiting time by the time required for passing per vehicle. In this level crossing, the time required for one vehicle to pass is 5 seconds / 1 vehicle. Therefore, the traffic blocking amount is 6/120 seconds from (30 seconds / 120 seconds) / (5 seconds / 1 vehicle). That is, the traffic cut-off amount at this level crossing is 6 cars per 120 seconds. For example, if this traffic blocking amount is converted per hour, it becomes 180 units.

  The traffic blocking amount calculated in this way is compared with a predetermined traffic volume (predetermined value β) as a threshold value set for each time zone at each level crossing as described with reference to FIG. In the above case, the railroad crossing is used to be identified as a traffic jam crossing.

(Example of level crossing display)
Next, an example of a crossing display according to the present embodiment will be described with reference to FIG. FIG. 10 is an explanatory diagram illustrating an example of a crossing display according to the present embodiment.

  In FIG. 10, the display screen 1000 displayed on the display 312 is north-up displayed, and the upper part of the display screen 1000 is set to the north and displayed. The display screen 1000 displays a track 1010, a road 1020, a railroad crossing 1030 (1030a to 1030c), a three-dimensional intersection road 1031, a current position 1040, a destination 1050, and a character display 1060. Each level crossing 1030 is displayed as a symbol. The level crossings 1030a and 1030b are traffic jam crossings. The level crossing 1030c is a detour level crossing. The three-dimensional intersection road 1031 is displayed as a symbol. The three-dimensional intersection road 1031 is a road that three-dimensionally intersects the track.

  As will be described later, the display format of the level crossing 1030 is changed according to the length of the traffic jam, the waiting time of the level crossing 1030, and the like based on the traffic blocking amount. In this embodiment, for example, the traffic jam crossing 1030a on the east side and the traffic jam crossing 1030b on the west side have the longest time that the circuit breaker is descending because of the proximity to the station 1032. Therefore, the road is congested. The outer periphery shows red. Details of the color of the outer periphery of the crossing symbol will be described later. Further, the detour railroad crossing 1030c is not congested, and the outer periphery of the crossing symbol indicates blue. Further, in the three-dimensional intersection road 1031, the outer periphery of the crossing symbol indicates yellow.

  It is assumed that when such a display screen 1000 is displayed, it is assumed that the user is located at the current position 1040 and a route search to the destination 1050 is performed. In the normal route search, for example, a route that has followed the shortest route is drawn, that is, a route that passes through the east side traffic crossing 1030a or the west side traffic crossing 1030b is drawn. A route that passes through the railroad crossing 1030c or a route that passes through the three-dimensional intersection road 1031 is searched. Then, a character image of “Turning around a crossing in a traffic jam” is displayed on the character display 1060.

(Example of display format of level crossing symbols)
Next, an example of a display format of a crossing symbol according to the present embodiment will be described with reference to FIG. FIG. 11 is an explanatory diagram illustrating an example of a display format of a crossing symbol according to the present embodiment.

  In FIG. 11, a crossing symbol 1100 is a symbol displayed on the crossing 1030 shown in FIG. In FIG. 11, a railroad crossing symbol 1100 includes a mark 1110 indicating a train and an outer periphery 1120. The color of the outer periphery 1120 changes according to the traffic blocking amount. For example, when the time required to pass through a level crossing is very long, specifically, when it takes 30 minutes or more to pass through the level crossing, the light turns red. Further, for example, when it takes 10 minutes or more and 30 minutes or less to pass the railroad crossing, the light turns yellow. In addition, for example, when the time required to pass the railroad crossing is 10 minutes or less, that is, when it is not congested, the light turns blue. In addition, about the lighting of the outer periphery 1120, you may set arbitrarily not only the system which represented the traffic congestion in 3 steps | paragraphs using the three colors mentioned above.

(Example of the display format of the solid intersection symbol)
Next, an example of the display format of the solid intersection symbol according to the present embodiment will be described with reference to FIG. FIG. 12 is an explanatory diagram illustrating an example of a display format of a solid intersection symbol according to the present embodiment.

  In FIG. 12, a three-dimensional intersection symbol 1200 is a symbol displayed on the three-dimensional intersection road 1031 shown in FIG. In FIG. 12, the solid intersection symbol 1200 includes a mark 1210 indicating a solid intersection road and an outer periphery 1220. The three-dimensional intersection symbol 1200 may be displayed at all times, or may be displayed only when there is a traffic crossing in the vicinity. Further, when there is a traffic crossing in the vicinity, the color of the outer periphery 1220 may be changed to make it stand out. For example, when there is a traffic crossing in the vicinity, the user can be urged to pass through the three-dimensional intersection road by lighting the outer periphery 1220 in blue.

  As described above, the navigation apparatus 300 according to the present embodiment specifies the traffic jam crossing based on the number of traffic blocks (traffic blockage amount) for each time zone at the railroad crossing, and links to the link including the traffic jam crossing. A route search is performed by multiplying a predetermined link cost value. According to such a navigation device 300, a route search according to the traffic volume at each level crossing can be performed. Therefore, the user can follow a route that avoids a traffic crossing having a long transit time. Moreover, if a large number of vehicles avoid the traffic crossing, the traffic can be alleviated.

  In addition, the navigation device 300 according to the present embodiment calculates the traffic blocking amount based on the traffic volume per predetermined time and the vehicle sweep-out amount at the crossing. That is, the traffic cut-off amount for each level crossing is calculated based on the traffic volume and the vehicle sweep-out amount. According to such a configuration, the traffic blocking amount can be calculated easily and accurately.

  Further, the navigation device 300 according to the present embodiment specifies a detour crossing or a three-dimensional crossing road in addition to a traffic crossing, and passes through the traffic crossing, detour crossing or three-dimensional crossing road based on a set search condition. The optimal route was selected from among the routes. According to such a configuration, a route search according to search conditions such as time priority and distance priority can be performed.

  In addition, the navigation device 300 according to the present embodiment notifies that the traffic crossing has been detoured when searching for a detour crossing or a route to a destination via a three-dimensional intersection road. According to such a configuration, the user can know that the displayed route is not a detour route but a route that bypasses the traffic jam crossing, and the time required to reach the destination is shortened. I can know that.

  Further, the navigation device 300 according to the present embodiment acquires the traffic interception amount of the traffic jam crossing when departing at the current time and the traffic traffic interception amount of the traffic jam crossing when departing at the time after a predetermined time has elapsed. The route at each departure time is searched based on the traffic interception amount of the traffic jam crossing when departing at the current time and the traffic traffic interception amount of the traffic jam crossing when departing at the time after a predetermined time has elapsed. Also good. According to such a configuration, since the user can know the arrival time and the required time when the departure time is delayed, the departure time can be delayed with peace of mind when there is room.

  Further, the navigation device 300 according to the present embodiment controls the display of the traffic crossing to a display different from the normal display. According to such a configuration, the user can confirm on the display screen a crossing with a long transit time.

  In addition, the navigation device 300 according to the present embodiment displays a traffic jam crossing as a symbol, and changes the display format of the traffic jam crossing displayed as a symbol according to the amount of traffic interruption. According to such a configuration, the user can grasp the traffic crossing at a glance and can also grasp the degree of congestion at a glance.

  Further, the navigation device 300 according to the present embodiment displays a detour railroad or a three-dimensional intersection road as a symbol. According to such a configuration, the user can grasp the detour railroad crossing or the multilevel intersection road at a glance and easily find it.

  As described above, the route search device, route search method, route search program, and recording medium of the present invention specify a traffic jam crossing based on the number of traffic blocks (traffic blockage amount) for each time zone at a level crossing. In addition, the route search is performed by multiplying the link including the traffic jam crossing by a predetermined link cost value. That is, a route search according to the traffic volume at each level crossing can be performed. Therefore, the user can follow a route that avoids a traffic crossing having a long transit time. Moreover, if a large number of vehicles avoid the traffic crossing, the traffic can be alleviated.

  The route search method described in the present embodiment can be realized by executing a program prepared in advance on a computer such as a personal computer or a workstation. This program is recorded on a computer-readable recording medium such as a hard disk, a flexible disk, a CD-ROM, an MO, and a DVD, and is executed by being read from the recording medium by the computer. Further, this program may be a transmission medium that can be distributed via a network such as the Internet.

DESCRIPTION OF SYMBOLS 100 Route search apparatus 101 Extraction part 102 Acquisition part 103 Identification part 104 Search part 105 Time required calculation part 106 Acquisition part 107 Blocking amount calculation part 108 Notification part 109 Display control part 110 Display part 300 Navigation apparatus 1030 Level crossing 1030a Traffic congestion level crossing 1030b Traffic congestion Railroad crossing 1031 Level crossing road 1100 Level crossing symbol 1110 Mark 1120 Outer circumference 1200 Level crossing sign 1210 Mark 1220 Outer circumference

Claims (12)

An extraction means for extracting a crossing on map data;
Obtaining means for obtaining the number of vehicles that block traffic for each time zone at the level crossing extracted by the extracting means (hereinafter referred to as “traffic blocking amount”);
Identifying means for identifying a level crossing in which a certain amount of traffic congestion has occurred (hereinafter referred to as “traffic level crossing”), based on the traffic blocking amount acquired by the acquisition means;
Search means for searching for a route to the destination by multiplying a link including the traffic jam crossing specified by the specifying means by a predetermined link cost value;
A route search apparatus comprising:   The search means multiplies a link including the traffic jam crossing by a predetermined link cost value according to the traffic blocking amount acquired by the acquisition means, and searches for a route to the destination. Item 4. The route search device according to Item 1. Capture means for capturing the traffic volume per predetermined time on a road where a level crossing exists in each time zone and the vehicle sweep-out amount that allows the vehicle to pass during the predetermined time of the level crossing;
Further comprising a calculation means for calculating the traffic blocking amount based on the traffic volume per predetermined time taken in by the taking-in means and the vehicle sweep-out amount,
The route search apparatus according to claim 1, wherein the acquisition unit acquires the traffic blocking amount calculated by the calculation unit. The specifying means is configured to bypass the traffic crossing (hereinafter referred to as “detour crossing”) or to bypass the traffic crossing based on the position of the traffic crossing determined from the crossing position on the map data. And a road that intersects the track (hereinafter referred to as a “three-dimensional intersection road”)
The said search means selects the optimal path | route among the paths which pass through the said traffic jam level crossing, the said detour level crossing, or the said three-dimensional intersection road based on the set search conditions. Route search device.   2. The information processing apparatus according to claim 1, further comprising notification means for notifying that the traffic crossing has been detoured when the searching means searches for a route to the destination via the detour crossing or the multilevel crossing road. The described route search device. The acquisition means acquires the traffic interception amount of the traffic jam crossing when departing at the current time and the traffic interception amount of the traffic jam crossing when departing at a time after a predetermined time,
The search means acquires the traffic interception amount of the traffic jam crossing when departing at the current time, acquired by the acquisition means, and the traffic interception amount of the traffic jam crossing when departing at a time after a predetermined time has elapsed. The route search device according to claim 1, wherein a route at each departure time is searched based on the route. Display control means for controlling the display of the traffic jam crossing specified by the specifying means to a display different from a normal display;
Display means for displaying the traffic crossing controlled by the display control means;
The route search device according to claim 1, further comprising:   The display control means symbolically displays the traffic jam crossing and changes the display format of the traffic jam crossing displayed by the symbol in accordance with the traffic blocking amount acquired by the acquisition means. Item 8. The route search device according to Item 7.   The route search device according to claim 7, wherein the display control means displays the detour railroad crossing or the three-dimensional intersection road as a symbol. An extraction process for extracting crossings on map data;
An acquisition step of acquiring the number of vehicles that block traffic for each time zone at the level crossing extracted by the extraction step (hereinafter referred to as “traffic blocking amount”);
Based on the traffic blocking amount acquired by the acquisition step, a specific step of specifying a level crossing where a certain amount of traffic jam occurs (hereinafter referred to as “traffic level crossing”);
A search step of searching for a route to a destination by multiplying a link including the traffic jam crossing specified by the specifying step by a predetermined link cost value;
A route search method comprising:   A route search program causing a computer to execute the route search method according to claim 10.   A computer-readable recording medium on which the route search program according to claim 11 is recorded.

Images