JP4663366B2 - Navigation device - Google Patents

Description

  The present invention relates to a navigation device, and more particularly to a route search technique for an in-vehicle navigation device.

  There is an in-vehicle navigation device that receives traffic jam information and regulation information and uses these information to search for a route with high accuracy (see Non-Patent Document 1). In addition, a system that enables a wide range of traffic jam information and regulation information to be delivered at once using satellite radio or the like has been considered.

JPO, standard technology collection, car navigation device user interface, main classification: 3-B-1 search for loopholes and search for detour routes

  However, if the received traffic jam information or restriction information increases, the processing load at the time of route search increases. When the processing load increases, a rapid route search cannot be performed.

  An object of the present invention is to provide a technique for reducing the processing burden when performing route search using received traffic jam information and regulation information.

  In order to solve the above problems, the navigation device of the present invention limits the amount of traffic information used for route search from the received traffic information.

For example, the navigation device of the present invention includes receiving means for receiving traffic jam information and restriction information, and route searching means for performing a route search using the traffic jam information and the restriction information. Then, the route search means uses a passage time determined from the current position using a passage time determined according to a node density for each mesh divided in a predetermined geographical range. The range includes the mesh that is within the time .

The navigation method of the present invention is a navigation method for a navigation device, wherein the navigation device receives a traffic jam information and restriction information, and performs a route search using the traffic jam information and the restriction information. And a range of the traffic jam information used in the route search step is determined from a current position using a transit time determined according to a node density for each mesh divided by a predetermined geographical range. The accumulated passage time is a range including a mesh within a predetermined time.

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

  FIG. 1 is a schematic configuration diagram of a navigation system according to an embodiment of the present invention. As shown in the figure, the navigation system of the present embodiment includes an in-vehicle navigation device 100 and a traffic information distribution server 200. The traffic information distribution server 200 is connected to the radio base station 202 via the network 201. The in-vehicle navigation device 100 is connected to the traffic information distribution server 200 via the radio base station 202. The traffic information distribution server 200 distributes traffic information held by the traffic information distribution server 200 to the in-vehicle navigation apparatus 100 via the satellite radio station 203, the FM multiplex broadcasting station 204, the beacon 205, and the like.

  The traffic information distribution server 200 is a server device that distributes traffic information to the in-vehicle navigation device 100. The traffic information distribution server 200 holds traffic information such as traffic jam information 210 and regulation information 220 in its own storage device.

  FIG. 2 is a diagram illustrating a configuration of the traffic jam information 210. The traffic jam information 210 includes information 211 indicating a traffic jam location, information 212 indicating a traffic jam time zone, and traffic jam content 213. Information 211 indicating the location of the traffic jam includes information for identifying the coordinate position of the traffic jam and the road related to the traffic jam (road name, mesh ID, link ID, etc. described later). The traffic jam content 213 includes the type of traffic jam such as accident traffic jam and natural traffic jam, the traffic jam degree, the link travel time, and the like.

  FIG. 3 is a diagram showing the configuration of the restriction information 220. As shown in FIG. The restriction information 220 includes information 221 indicating the place of restriction, information 222 indicating a restriction time zone, and restriction contents 223. The information 221 indicating the place of restriction includes information (such as a road name, a mesh ID and a link ID described later) that specifies the coordinate position of the place of restriction and the road to be restricted. The restriction contents 223 include, for example, road closure, right / left turn restriction, speed restriction, lane restriction, one-side restriction, chain restriction, on-ramp restriction, large-scale restriction, movement restriction, off-ramp restriction, and the like.

  FIG. 4 is a schematic configuration diagram of the in-vehicle navigation device 100. As shown in the figure, the in-vehicle navigation device 100 includes an arithmetic processing unit 1, a display 2, a storage device 3, a voice input / output device 4, an input device 5, a wheel speed sensor 6, a geomagnetic sensor 7, It has a gyro sensor 8, a GPS (Global Positioning System) receiver 9, an in-vehicle LAN device 11, an FM multiplex broadcast receiver 12, a beacon receiver 13, a satellite radio receiver 14, and a network communication device 15. .

  The arithmetic processing unit 1 is a central unit that performs various processes. For example, the present location is detected based on information output from the various sensors 6 to 8 and the GPS receiver 9. Further, map data necessary for display is read out from the storage device 3 based on the obtained current location information. Further, the read map data is developed in graphics, and a mark indicating the current location is superimposed on the map data and displayed on the display 2. Further, using the map data stored in the storage device 3 and the time-series traffic information received from the traffic information distribution server 200, an optimum route (recommended) connecting the destination instructed by the user and the current location (departure location) Route). Further, the user is guided using the voice input / output device 4 and the display 2.

  The display 2 is a unit that displays graphics information generated by the arithmetic processing unit 1. The display 2 is composed of a CRT, a liquid crystal display, or the like. The signal S1 between the arithmetic processing unit 1 and the display 2 is generally connected by an RGB signal or an NTSC (National Television System Committee) signal.

  The storage device 3 includes a storage medium such as a CD-ROM, DVD-ROM, HDD, or IC card. In this storage medium, map data 300 is stored.

  FIG. 5 is a diagram illustrating the configuration of the map data 300. The map data 300 includes, for each mesh identification code (mesh ID) 310, which is a partitioned area on the map, link data 311 of each link constituting a road included in the mesh area.

  For each link ID 321, the link data 311 includes coordinate information 322 of two nodes (start node and end node) constituting the link, road type information 323 including the link, link length information 324 indicating the link length, link The travel time 325 includes a link ID (connection link ID) 326 of a link connected to each of the two nodes. Here, by distinguishing the start node and the end node for the two nodes constituting the link, the upward direction and the downward direction of the same road are managed as different links. Further, the link travel time 325 may be a link travel time associated with each condition such as date and weather. The map data 300 also includes information (name, type, coordinate information, etc.) on map components other than roads included in the corresponding mesh area.

  Returning to FIG. The voice input / output device 4 converts the message to the user generated by the arithmetic processing unit 1 into a voice signal and outputs it. Also, a process of recognizing the voice uttered by the user and transferring the contents to the arithmetic processing unit 1 is performed.

  The input device 5 is a unit that receives instructions from the user. The input device 5 includes a hard switch such as a scroll key and a scale change key, a joystick, a touch panel pasted on a display, and the like.

  The sensors 6 to 8 and the GPS receiver 9 are used for detecting the current location (vehicle position) by the vehicle-mounted navigation device 100. The wheel speed sensor 6 measures the distance from the product of the wheel circumference and the measured number of rotations of the wheel, and further measures the angle at which the moving body is bent from the difference in the number of rotations of the paired wheels. The geomagnetic sensor 7 detects the magnetic field held by the earth and detects the direction in which the moving body is facing. The gyro 8 is configured by an optical fiber gyro, a vibration gyro, or the like, and detects an angle at which the moving body rotates. The GPS receiver 9 receives a signal from a GPS satellite and measures the distance between the mobile body and the GPS satellite and the rate of change of the distance with respect to three or more satellites to thereby determine the current position, travel speed, and travel of the mobile body. Measure orientation.

  The in-vehicle LAN device 11 receives various information of the vehicle on which the in-vehicle navigation device 100 is mounted, such as door opening / closing information, light lighting state information, engine status, failure diagnosis result, and the like.

  The FM multiplex broadcast receiver 12 receives the rough current traffic information, regulation information, SA / PA (service station / parking) information, parking lot information, weather information, etc. sent from the FM multiplex broadcast station 204 as FM multiplex broadcast signals. Receive.

  The beacon receiving device 13 receives current traffic information, regulation information, SA / PA information, parking lot information, and the like sent from the beacon 205.

  The satellite radio receiver 14 receives traffic jam information, regulation information, SA / PA information, parking lot information, and the like sent from the satellite radio broadcasting station 203.

  The network communication device 15 mediates exchange of information between the in-vehicle navigation device 100 and the traffic information distribution server 200. In addition, the traffic information distribution server 200 is accessed periodically or during route search, and traffic jam information and regulation information are received.

  FIG. 6 is a functional block diagram of the arithmetic processing unit 1.

  As illustrated, the arithmetic processing unit 1 includes a user operation analysis unit 41, a route search unit 42, a route guidance unit 43, a current position calculation unit 44, an information storage unit 45, a display processing unit 46, and a received information processing. Part 47.

  The user operation analysis unit 41 receives a request from the user input to the input device 5, analyzes the request content, and controls each unit of the arithmetic processing unit 1 so that processing corresponding to the request content is executed. To do. For example, when the user requests a search for a recommended route, the display processing unit 45 is requested to display a map on the display 2 in order to set a destination. Further, it requests the route search unit 42 to calculate a route from the current location (departure location) to the destination.

  The current position calculation unit 44 uses distance data and angle data obtained as a result of integrating the distance pulse data S5 measured by the wheel speed sensor 6 and the angular acceleration data S7 measured by the gyro 8, respectively. The current position (X ′, Y ′), which is the position after the vehicle travels, is periodically calculated from the initial position (X, Y). Further, by performing map matching processing using the calculation result, the current location is matched with the road (link) having the highest shape correlation.

  The route search unit 42 uses a Dijkstra method or the like to search for a route that minimizes the cost (for example, travel time) of a route connecting two designated points (current location, destination).

  The route guidance unit 43 performs route guidance using the route searched by the route search unit 42. For example, the information on the route is compared with the information on the current location, and the voice input / output device 4 is used to inform the user by voice whether the vehicle should go straight before passing an intersection or the like. Further, the route guiding unit 43 displays the direction to travel on the map displayed on the display 2 and notifies the user of the recommended route.

  The display processing unit 46 receives map data in an area required to be displayed on the display 2 from the storage device 3, and at a specified scale and drawing method, roads, other map components, current location, destination, A map drawing command is generated so as to draw a mark such as an arrow for the guide route. Then, the generated command is transmitted to the display 2.

  The reception information processing unit 47 stores the received traffic jam information and restriction information in the information storage unit 45. When the storage device 3 is configured by a rewritable HDD, flash ROM, or the like, the reception information processing unit 47 may store the received information in the storage device 3.

  FIG. 7 is a diagram illustrating a hardware configuration example of the arithmetic processing unit 1.

  As illustrated, the arithmetic processing unit 1 has a configuration in which devices are connected by a bus 32. The arithmetic processing unit 1 includes a CPU (Central Processing Unit) 21 that executes various processes such as numerical calculation and control of each device, and a RAM (Random Access Memory) that stores map data, arithmetic data, and the like read from the storage device 3. ) 22, a ROM (Read Only Memory) 23 for storing programs and data, a DMA (Direct Memory Access) 24 for transferring data between the memories and between the memory and each device, and graphics drawing. In addition, a drawing controller 25 that performs display control, a video random access memory (VRAM) 26 that stores graphics image data, a color palette 27 that converts image data into RGB signals, and an A / D that converts analog signals into digital signals. Converter 28 and an SCI (Serial Communication Interface) that converts the serial signal into a parallel signal synchronized with the bus. ace) 29, a PIO (Parallel Input / Output) 30 that puts a parallel signal on the bus in synchronization with the bus, and a counter 31 that integrates the pulse signal.

  [Description of Operation] Next, the operation of the in-vehicle navigation device 100 having the above-described configuration will be described.

  First, processing when traffic information is received will be described.

  The reception information processing unit 47 causes the information storage unit 45 to store the traffic jam information 210 and the restriction information 220 received from the traffic information distribution server 200 as reception information 451.

  FIG. 8 is a diagram illustrating a configuration of the reception information 451. The reception information 451 includes traffic information 4511 and restriction information 4515. The traffic jam information 4511 is the traffic jam information 210 transmitted from the traffic information distribution server 200. The restriction information 4515 is the restriction information 221 transmitted from the traffic information distribution server 200.

  Next, route search processing will be described.

  FIG. 9 is a schematic flowchart of route search processing.

  This flow starts when searching for a new route to the destination when a route search request is received from the user via the input device 5 or when the current position deviates from the guide route during route guidance. Is done.

  The route search unit 42 first sets a departure place and a destination. The route search unit 42 normally sets the current position as the departure place. Further, a point received by the user via the input device 5 is set as a destination. Then, the route search unit 42 specifies a region (mesh) to be considered in the route search. For example, the route search unit 42 sets a mesh in a predetermined range (for example, within 200 km) from a straight line connecting the departure point to the destination as a mesh to be considered in the route search (S210).

  Next, the route search unit 42 extracts links to be used for route search, in other words, links (candidate links) that can be candidates for the route from among the links in the mesh specified in S210 (S220).

  FIG. 10 is a flowchart of such candidate link extraction processing.

  The route search unit 42 refers to the map data 300 and extracts links existing in the mesh specified in S210 (S221).

  Next, the route search unit 42 refers to the restriction information 4515 of the reception information 451, and excludes links that constitute roads that cannot be passed due to restrictions from the extracted links (S222). Specifically, for each link extracted in S221, it is checked whether the link is a link existing in the restriction location 4516 of the restriction information 4515. When the link is a link existing in the restriction place 4516, the restriction content 4518 is checked to determine whether or not the restriction indicates that the road cannot be closed. If the restriction is not allowed, the link is excluded.

  In this way, the route search unit 42 excludes the impassable link and ends the candidate link extraction process (S220).

  The route search unit 42 may consider a restricted time zone 4517 when extracting candidate links. Specifically, the estimated arrival time to the candidate link is obtained, and the links that constitute the road with traffic restrictions at the estimated arrival time are excluded from the candidate links. The estimated arrival time can be obtained, for example, by adding a value obtained by dividing the distance from the current position to the link by a predetermined average speed to the current time.

  Returning to FIG. Next, the route search unit 42 uses the candidate links extracted in S220 to search for a route with the lowest total cost from the departure point to the destination by, for example, the Dijkstra method.

  At this time, the route search unit 42 obtains the cost of each link as follows. FIG. 11 is a flowchart of link cost calculation processing.

  The route search unit 42 checks whether the link is a link around the current position (S231). The link position can be obtained from the link start node / end node 322 of the link data 311. Note that the reception information processing unit 47 determines, for example, “a vicinity of the current position” within a predetermined distance (for example, 150 km square) from the current position.

  When the link is around the current position (Yes in S231), the route search unit 42 checks whether or not the traffic information 4511 includes traffic information at the expected arrival time of the link to the link (S232). . Specifically, the route search unit 42 checks whether or not the target link is a link existing at the traffic jam location 4512. When the link is a link existing in the traffic jam location 451, it is checked from the time zone 4513 whether the traffic jam information is at the expected arrival time of the link. When the traffic jam information is at the estimated arrival time of the link, the route search unit 42 determines that the traffic jam information 4511 includes the traffic jam information at the predicted arrival time of the link to the link. In other cases, it is determined that there is no traffic jam information at the arrival time of the link in the traffic jam information 4511.

  If the traffic information 4511 includes traffic information related to the estimated arrival time of the link (Yes in S232), the route search unit 42 determines the cost of the link using the traffic content 4514 (S233). ). Specifically, when the link travel time is included in the traffic jam content 4514, the travel time is set as the link cost. When the congestion content 4514 includes a congestion level, the link cost is determined according to the congestion level. For example, the link travel time obtained from the link travel time 325 of the map data 300 includes a coefficient corresponding to the traffic congestion degree (for example, “2.0” in the order of “high”, “medium”, and “low” of the traffic congestion degree). ”,“ 1.5 ”, and a coefficient multiplied by“ 1.0 ”) are set as link costs.

  In addition, when the traffic content 4514 includes the link travel time for each condition such as date and weather and the traffic congestion level, the route search unit 42 matches the link travel time and traffic jam that match the weather conditions on the departure date. The link cost may be obtained using the degree.

  On the other hand, when the link is not around the current position (No in S231), or when there is no traffic information in the traffic information 4511 at the expected arrival time of the link to the link (No in S232), the route search unit 42 calculates the link cost without using the traffic jam information. Specifically, the link travel time 325 of the map data 300 is set as the cost of the link as it is (S233).

  As described above, the route search unit 42 determines the link cost for each link. Then, a route that minimizes the total cost to the destination is searched (S230), and the route search process is terminated.

  The embodiment of the present invention has been described above.

  According to the embodiment, in the route search, not all the received traffic jam information is used, but limited to traffic jam information around the current position. Therefore, even if the received traffic jam information is a large amount that covers a wide area, a limited amount of traffic jam information is used in the route search, so the processing load does not increase. In addition, since traffic jams change from moment to moment, there is not much meaning in considering far away traffic jam information, and accuracy is not affected.

  On the other hand, as for the restriction information, a wider range of information (all the received restriction information in the above embodiment) is used than the traffic jam information. Traffic regulation does not change much compared to traffic jams, so it is meaningful to consider route information even if it is far away. According to the embodiment, since a wide range of restriction information is used, a route search can be performed with high accuracy.

  <Modification> The present invention is not limited to the above embodiment, and various modifications are possible.

  For example, predetermined traffic information may be previously extracted from the received traffic information and stored separately. Then, when searching for a route, the necessary information may be searched from a limited amount of traffic information and used instead of searching for the necessary information directly from the received large amount of traffic information. In this way, the processing load during route search is reduced. Specifically, the configuration is as follows.

  The reception information processing unit 47 stores traffic information (congestion information and regulation information) for use in route search in the information storage unit 45 separately from the reception information 451.

  FIG. 12 is a flowchart of processing for generating traffic jam information (route traffic jam information) 452 used for route search. This flow is performed by the reception information processing unit 47 periodically (for example, every hour) or every time the current position moves by a predetermined distance (for example, every movement of 30 km).

  The reception information processing unit 47 extracts the congestion information used in the route search from the congestion information 4511 of the reception information 451. Specifically, the reception information processing unit 47 extracts traffic jam information around the current position from the traffic jam information 4511 of the received information 451 based on the traffic jam location 4512. Note that the reception information processing unit 47 determines, for example, “a vicinity of the current position” within a predetermined distance (for example, 150 km square) from the current position.

  When the traffic jam information around the current position is extracted in this way, the extracted traffic jam information is stored in the information storage unit 45 as route search traffic jam information 452. If the previous route search traffic jam information is already stored, it is deleted, and the newly extracted traffic jam information is stored and updated (S102).

  FIG. 14 shows the configuration of the route searching traffic jam information 452 generated in this way. The configuration is basically the same as the traffic jam information 210 shown in FIG.

  In addition, the reception information processing unit 47 stores restriction information (route search restriction information) 453 for use in route search in the information storage unit 45 separately from the reception information 451. In the present embodiment, the reception information processing unit 47 stores all the received restriction information 4515 in the information storage unit 45 as route search restriction information 453.

  The reason why all of the restriction information is used in the route search is that it is less likely to change compared to the traffic jam information and is meaningful in consideration of the route search. Note that a wide range of restriction information may be extracted from “around the current position” as a reference for extracting traffic jam information, and may be used as the route search restriction information 453.

  FIG. 15 shows a configuration of the route search restriction information 452 thus generated. The configuration is basically the same as the restriction information 220 shown in FIG.

  Next, route search processing in such a case will be described. The outline of the route search process is as described above with reference to FIG. 9, but the candidate link extraction process (S220) and the link cost calculation process (S230) are performed as follows.

  FIG. 16 is a flowchart of candidate link extraction processing in such a case.

  The route search unit 42 refers to the map data 300 and extracts a link existing in the mesh specified in S210 (S321).

  Next, the route search unit 42 refers to the route search restriction information 453, and excludes links that constitute roads that are inaccessible due to restriction from the extracted links (S322). Specifically, for each link extracted in S221, it is checked whether or not the link is a link existing in the restriction location 4531 of the route search restriction information 4531. When the link is a link existing in the restriction place 4531, the restriction content 4533 is checked to determine whether or not the restriction indicates that the road cannot be closed, such as a closed road. If the restriction is not allowed, the link is excluded.

  In this way, the route search unit 42 excludes the impassable link and ends the candidate link extraction process (S220).

  Note that the route search unit 42 may consider a restricted time zone 4532 when extracting candidate links. Specifically, an expected arrival time to the candidate link is obtained, and a link that is restricted at the expected arrival time is excluded from the candidate links.

  FIG. 17 is a flowchart of link cost calculation processing.

  The route search unit 42 checks whether or not the route search traffic information 452 includes traffic information at the arrival time of the link at the link (S331). Specifically, the route search unit 42 checks whether or not the target link is a link that exists in the traffic jam location 4521 of the traffic jam information 452 for route search. When the link is a link existing in the traffic jam location 4521, it is checked from the time zone 4522 whether the traffic jam information is at the expected arrival time of the link. When the traffic jam is at the estimated arrival time of the link, the route search unit 42 determines that the traffic information at the arrival time of the link at the link is included in the traffic information for route search 452. . In other cases, it is determined that there is no traffic jam information at the arrival time of the link in the route search traffic jam information 452.

  If there is traffic jam information at the expected arrival time of the link in the traffic jam information 452 for route search (Yes in S331), the route search unit 42 determines the cost of the link using the traffic jam content. Specifically, when the link travel time is included in the traffic jam content 4523, the travel time is set as the link cost. When the traffic jam content 4523 includes the traffic jam level, the link cost is determined according to the traffic jam level. For example, the link travel time obtained from the link travel time 325 of the map data 300 includes a coefficient corresponding to the traffic congestion degree (for example, “2.0” in the order of “high”, “medium”, and “low” of the traffic congestion degree). ”,“ 1.5 ”, and a coefficient multiplied by“ 1.0 ”) are set as link costs (S332).

  In addition, when the traffic jam content 4523 includes the link travel time for each condition such as date and weather and the degree of traffic jam, the route search unit 42 matches the link travel time and traffic jam that match the weather conditions on the departure date. The link cost may be obtained using the degree.

  When there is no traffic jam information at the expected arrival time of the link in the traffic jam information 452 for route search (No in S331), the route search unit 42 calculates the link cost without using the traffic jam information. Specifically, the link travel time 325 of the map data 300 is used as the cost of the link as it is (S333).

  As described above, the route search unit 42 determines the link cost for each link. Then, a route that minimizes the total cost to the destination is searched (S230), and the route search process is terminated.

  As described above, the embodiment in which the traffic information used for the route search is separately prepared in advance has been described. According to this embodiment, when searching for a route, it is possible to search for necessary information from a limited amount of traffic information, instead of searching for necessary information directly from a large amount of received traffic information. That is, the processing load at the time of route search can be reduced.

  In addition, instead of holding the traffic information for route search separately, by adding a flag indicating that it is for route search to the reception information 451, the above-mentioned route search traffic jam information or route search restriction information and You may make it handle similarly.

In the above embodiment, it is determined whether or not the link is “around the current position” (S231), and whether or not the traffic jam information is “around the current position” (S101). . Such a range of “around the current position” may be set by receiving selection from the user. In addition, the range around the “current position” may be determined by the route search unit 42 or the reception information processing unit 47 as follows, for example.
(1) As described above, a predetermined range (for example, 160 km square) from the current position is set as “around the current position”. The predetermined range can be changed as required.
(2) The predetermined range may be changed according to the current date and time. For example, in the case of a rush hour in the morning and evening (for example, 7:00 to 9:00, 19: 0 to 19:00), the predetermined range in consideration of the rush duration (for example, 2 hours) (For example, 100 km square).
(3) The predetermined range may be changed according to the travel history. For example, the predetermined range is increased as the average vehicle speed obtained from the travel history accumulated in the information storage unit 45 is higher. Specifically, when the average vehicle speed is less than 50 km / h, the “current position vicinity” is set within 100 km from the current position, and when the average vehicle speed exceeds 50 km / h, the “current position vicinity” is set within 150 km from the current position.
(4) You may change according to the conditions of a route search. For example, the information storage unit 45 stores information on the size of the range of “around the current position” in association with route search conditions such as general road priority and distance priority. The route search unit 42 or the reception information processing unit 47 refers to this information and obtains the size of the range around the current position corresponding to a preset route search condition. Then, the range of the size from the current position is set as “around the current position”.

  In the above embodiment, in the route search, traffic information around the current position is used. However, traffic information in an area where the required time from the current position is within a predetermined time may be used. Further, the required time (expected arrival time) in such a case may be obtained as follows.

  For example, as illustrated in FIG. 18, the route search unit 42 calculates the number of nodes in the mesh with reference to the link data of the map data 300 for each mesh with respect to the mesh up to the destination. Then, the density of the nodes is obtained by dividing the number of nodes by the size of the mesh, and an approximate mesh transit time is obtained. Specifically, the node density is ranked as “Large”, “Medium”, “Small” according to the value. When “Large”, the transit time is 40 minutes, and when “Middle”, If the passage time is 30 minutes and “small”, the passage time is set to 20 minutes. Then, a passing time corresponding to the node density is obtained for each mesh existing between the departure point and the point. Accumulate the obtained transit times to obtain the approximate required time to that point. The expected arrival time is obtained by adding the obtained required time to the current date and time. In the example of FIG. 18, the departure place P exists in the mesh M1. Between the points existing in the mesh M3, meshes M2 and M3 exist, and the respective node densities are both “large”. Therefore, the required time to the point existing in the mesh M3 is 40 minutes + 40 minutes to 80 minutes. The node densities of the meshes M2, M3, and M4 are “large”, “large”, and “small”, respectively. Therefore, the required time to the point existing in M4 is 40 minutes + 40 minutes + 20 minutes to 100 minutes.

  The route search unit 42 (reception information processing unit 47) may determine the passing time according to the average vehicle speed obtained from the travel history. For example, the faster the average vehicle speed, the shorter the passing time.

  Further, the route search unit 42 (reception information processing unit 47) may change the transit time corresponding to the node density in accordance with the set route search condition. For example, when the travel time priority route search condition is set, that is, when the route is searched for the shortest time, the transit time is set shorter than when the route is not set as such.

  In the above embodiment, an example in which the present invention is applied to a vehicle-mounted navigation device has been described. However, the present invention can also be applied to a navigation device other than a vehicle-mounted navigation device.

FIG. 1 is a schematic configuration diagram of a navigation system to which an embodiment of the present invention is applied. FIG. 2 is a diagram illustrating a configuration example of traffic congestion information to be distributed. FIG. 3 is a diagram illustrating a configuration example of the regulation information to be distributed. FIG. 4 is a schematic configuration diagram of the in-vehicle navigation device. FIG. 5 is a diagram illustrating a configuration example of map data stored in the storage device 3. FIG. 6 is a diagram illustrating a functional configuration of the arithmetic processing unit 1. FIG. 7 is a diagram illustrating a hardware configuration of the arithmetic processing unit 1. FIG. 8 is a diagram illustrating a configuration example of received information stored in the storage device of the in-vehicle navigation device. FIG. 9 is a flowchart of route search processing of the in-vehicle navigation device to which the present embodiment is applied. FIG. 10 is a flowchart of the candidate link extraction process in S220 of FIG. FIG. 11 is a flowchart of the link cost calculation process in S230 of FIG. FIG. 12 is a flowchart of traffic jam information extraction processing according to the modification. FIG. 13 is a flowchart of restriction information extraction processing according to the modification. FIG. 14 is a diagram illustrating a configuration example of traffic information for route search. FIG. 15 is a diagram illustrating a configuration example of restriction information for route search. FIG. 16 is a flowchart of the candidate link extraction process in S220 of FIG. FIG. 17 is a flowchart of the link cost calculation process in S230 of FIG. FIG. 18 is a diagram for explaining the calculation process of the estimated arrival time.

Explanation of symbols

100: In-vehicle navigation device,
200 ... Traffic information distribution server,
201 ... Network, 202 ... Radio base station, 203 ... Satellite radio broadcast station, 204 ... FM multiplex broadcast station, 205 ... Beacon,
DESCRIPTION OF SYMBOLS 1 ... Arithmetic processing part, 2 ... Display, 3 ... Memory | storage device, 4 ... Audio | voice input / output device, 5 ... Input device, 6 ... Wheel speed sensor, 7 ... Geomagnetic sensor, 8 ... Gyro, 9 ... GPS receiver, 21 ... CPU, 22 ... RAM, 23 ... ROM, 24 ... DMA, 25 ... Drawing controller, 26 ... VRAM, 27 ... Color palette, 28 ... A / D converter, 29 ... SCI, 30 ... PIO, 31 ... Counter, 41 ... User operation analysis unit, 42 ... route search unit, 43 ... route guidance unit, 44 ... current position calculation unit, 45 ... information storage unit, 46 ... display processing unit, 47 ... received information processing unit

Claims (8)

And receiving means for receiving and regulatory information and congestion information,
Route search means for performing a route search using the traffic jam information and the restriction information ,
The route search means uses a passing time determined from a node density for each mesh divided in a predetermined geographical range as a range of the congestion information to be used, and a passing time accumulated from a current position within a predetermined time. A range that includes the mesh
A navigation device characterized by that. The navigation device according to claim 1,
The traffic information includes the date and time of the traffic,
The route search means uses the traffic jam information of the traffic jam occurring at the expected arrival time to the traffic jam location ,
Navigation device comprising a call. The navigation device according to claim 1 or 2 ,
The route search means makes the range covered by the traffic information used different from the range covered by the restriction information used ,
Navigation device comprising a call. The navigation device according to any one of claims 1 to 3,
The route search means makes the range covered by the traffic information to be used smaller than the range covered by the restriction information to be used .
Navigation device comprising a call. The navigation device according to any one of claims 1 to 4,
  The route search means sets the transit time determined according to the node density for each mesh as the average vehicle speed obtained from the travel history is higher,
  A navigation device characterized by that. The navigation device according to any one of claims 1 to 5,
  The route search means corrects and sets a transit time determined according to a node density for each mesh according to a set route search condition.
  A navigation device characterized by that. The navigation device according to claim 6,
  When the route search condition is a condition for searching for a route with the shortest time, the route search means corrects and sets a transit time determined according to the node density for each mesh,
  A navigation device characterized by that. A navigation method for a navigation device, comprising:
The navigation device
A receiving step for receiving traffic jam information and regulation information;
A route search step for performing a route search using the traffic jam information and the restriction information,
The range of the traffic jam information used in the route search step uses a transit time determined according to a node density for each mesh divided in a predetermined geographical range, and the accumulated transit time from the current position is within a predetermined time. A range that includes a mesh,
A navigation method characterized by that.

Images