JP6295508B2 - Navigation device, navigation method, and program - Google Patents

Description

  The present invention relates to a navigation device, a navigation method, and a program.

  There is known a navigation device that informs a vehicle occupant of a traffic jam situation. For example, in Patent Document 1, the distance from the current position to the beginning of the traffic jam section is calculated based on the information on the traffic jam section received from the road traffic information communication system (VICS (registered trademark)). A navigation device that outputs a distance is disclosed.

JP 2002-257561 A

  If the apparatus shown in Patent Document 1 is used, the user can easily grasp the distance to the head of the traffic jam. However, the apparatus shown in Patent Document 1 cannot easily grasp the distance to the end of the traffic jam. Even if the distance to the traffic jam head and traffic jam end can be grasped, the user cannot intuitively know where those points are actually and cannot immediately determine the next action.

  The present invention has been made in view of such problems, and an object of the present invention is to provide a navigation device, a navigation method, and a program that allow a user to easily grasp a traffic jam situation.

In order to achieve the above object, a navigation device according to the first aspect of the present invention provides:
A route search unit for searching for a route to a destination using road data expressed by combining two types of nodes, a point name holding node and a point name non-holding node, and a link connecting the nodes;
A traffic information acquisition unit for acquiring traffic information;
Based on the traffic jam information, the traffic jam head point and the traffic jam end point are specified, and the traffic jam head point is selected from the traffic jam head point in the traveling direction on the route based on the traffic jam head point information. select location names owned nodes closest as congestion top node from the based on the information of the traffic jam ending point in from the congestion end point node in traveling the opposite direction on the path, the congestion tail A node selection unit that selects the node having the name of the point closest to the point as a traffic jam end node ;
A traffic jam information output unit that outputs the traffic jam head node and the traffic jam end node point names as information indicating the traffic jam head and traffic jam end , and
It is characterized by that.

The navigation method according to the second aspect of the present invention is:
A route search step for searching for a route to a destination using road data expressed by combining two types of nodes, a point name holding node and a point name non-holding node, and a link connecting the nodes;
A traffic information acquisition step for acquiring traffic information,
Based on the traffic jam information, the traffic jam head point and the traffic jam end point are specified, and the traffic jam head point is selected from the traffic jam head point in the traveling direction on the route based on the traffic jam head point information. select location names owned nodes closest as congestion top node from the based on the information of the traffic jam ending point in from the congestion end point node in traveling the opposite direction on the path, the congestion tail A node selection step for selecting the node having the point name closest to the point as the traffic jam end node ;
A traffic jam information output step for outputting the traffic jam head node and the traffic jam last node point names as information indicating the traffic jam head and traffic jam end , and
It is characterized by that.

The program according to the third aspect of the present invention is:
On the computer,
A route search function for searching for a route to a destination using road data expressed by combining two types of nodes, a point name holding node and a point name non-holding node, and a link connecting the nodes,
A traffic information acquisition function for acquiring traffic information,
Based on the traffic jam information, the traffic jam head point and the traffic jam end point are specified, and the traffic jam head point is selected from the traffic jam head point in the traveling direction on the route based on the traffic jam head point information. select location names owned nodes closest as congestion top node from the based on the information of the traffic jam ending point in from the congestion end point node in traveling the opposite direction on the path, the congestion tail A node selection function for selecting the node having the point name closest to the point as the traffic jam end node ,
Realizing a traffic jam information output function that outputs the traffic jam head node and the traffic jam end node point names as information indicating the traffic jam head and traffic jam end ,
It is characterized by that.

  It is possible to provide a navigation device, a navigation method, and a program that allow a user to easily grasp a traffic jam situation.

It is a figure which shows a mode that traffic congestion information is delivered to the navigation apparatus which concerns on embodiment of this invention. It is a block diagram of the navigation apparatus concerning an embodiment of the invention. It is a functional block diagram for demonstrating the function of the control part shown in FIG. It is a figure for demonstrating a traffic jam head point and a traffic jam last point. It is a figure for demonstrating road data. It is a flowchart for demonstrating the navigation process which concerns on embodiment of this invention. It is a flowchart for demonstrating the traffic information output process which concerns on embodiment of this invention. It is a flowchart for demonstrating the congestion head node selection process which concerns on embodiment of this invention. It is a figure for demonstrating a mode that a node selection part selects a traffic jam head node and a traffic jam tail node. It is a flowchart for demonstrating the traffic congestion tail node selection process which concerns on embodiment of this invention. It is a figure which shows a mode that the place of a traffic jam head and the traffic jam end was highlighted on the map. It is a figure which shows a mode that the name of the landmark near a traffic jam point is specified as information which shows a traffic jam head or a traffic jam end.

  Hereinafter, embodiments for carrying out the present invention will be described with reference to the drawings.

  A navigation device 100 according to an embodiment of the present invention is a car navigation device that is mounted on a vehicle and used, for example, as shown in FIG. The navigation device 100 has a function of notifying a user of traffic jam information distributed from the server 200 in addition to a function of guiding a route to a destination.

  As shown in FIG. 2, the navigation device 100 includes a receiving unit 110, a control unit 120, a communication unit 130, an input unit 140, an output unit 150, and a storage unit 160.

  The receiving unit 110 is a receiver that receives radio waves from a navigation satellite of a satellite positioning system (for example, GPS (Global Positioning System), Galileo Positioning System (Galileo Positioning System), etc.). When receiving a radio wave from the navigation satellite, the receiving unit 110 calculates a current position (for example, information on longitude and latitude) based on information included in the received radio wave and transmits the current position to the control unit 120.

  The control unit 120 includes a processing device such as a processor. The control unit 120 operates according to a program stored in a ROM (Read Only Memory) or a RAM (Random Access Memory) (not shown), and executes various operations including “navigation processing” described later. The control unit 120 operates as a “navigation process” and functions as a route search unit 121, a route guide unit 122, a traffic jam information acquisition unit 123, a node selection unit 124, and a traffic jam information output unit 125, as shown in FIG. To do. The operation of these functions will be described later in the description of “navigation processing”.

  Returning to FIG. 2, the communication unit 130 is a communication device having a function of communicating with a wireless station. The wireless station is connected to the server 200 via a network such as a LAN (Local Area Network), a WAN (Wide Area Network), a telephone network (a mobile phone network, a fixed telephone network, etc.), a regional IP network, or the Internet. . The server 200 has a function of transmitting traffic jam information to an external device connected via a network. The traffic jam information is information indicating the current traffic jam status, such as the traffic jam section, the total length of the traffic jam, the traffic jam head point, and the traffic jam end point. The traffic jam head point refers to the head position of a traffic jam section as shown in FIG. The traffic jam end point refers to the end position of the traffic jam section. When receiving the traffic jam information from the server 200, the communication unit 130 transmits the received traffic jam information to the control unit 120.

  Returning to FIG. 2, the input unit 140 includes various user interfaces such as a touch panel, a menu button, and a power button. The input unit 140 notifies the control unit 120 of the user operation content.

  The output unit 150 includes a display device such as an LCD (Liquid Crystal Display) and a sound output device such as a speaker. The output unit 150 outputs images, sounds, and the like according to the control of the control unit 120.

  The storage unit 160 includes a storage device such as a dynamic random access memory (DRAM), a static random access memory (SRAM), a flash memory, a hard disk, and an optical disk. The storage unit 160 stores various data such as road data 161.

  The road data 161 is data for expressing a road network. The road data 161 represents a road network by combining nodes that are nodes on the road network expression and links that are line segments connecting the nodes, as in the case of general road data. Each node is associated with attribute data such as a node type code and intersection name information. The navigation device 100 can identify the type of the node by looking at the attribute data. For example, the navigation device 100 can identify whether the corresponding node is, for example, an intersection node, a dead end node, or an attribute change point node by looking at the node type of the attribute data. When the corresponding node is an intersection node, the navigation device 100 can identify the name of the intersection indicated by the node by looking at the attribute data. For example, if the corresponding node is the node E shown in FIG. 5, by looking at the intersection name information of the attribute data of the node E, the name of the intersection indicated by the node E can be specified as “Honmachi 1-chome intersection”. In addition, even if it is an intersection node, there is a node which does not have intersection name information. In general, nodes indicating large intersections (for example, nodes A and E shown in FIG. 5) have intersection name information, and nodes indicating small intersections (for example, nodes BD shown in FIG. 5) are intersections. I do not have name information. Here, the big intersection is, for example, an intersection at a place where a thick road such as a main road and a thick road intersect. The small intersection is, for example, an intersection at a place where a narrow road and a narrow road, such as a life road, or a thin road and a thick road intersect. In the following description, a node having intersection name information is referred to as a “point name holding node”, and a node having intersection name information is referred to as a “point name non-owning node”.

  Next, the operation of the navigation device 100 having such a configuration will be described.

  When the navigation apparatus 100 is powered on, the control unit 120 starts “navigation processing”. The “navigation process” will be described below with reference to the flowchart of FIG.

  The route search unit 121 of the control unit 120 determines whether the destination is set by the user (step S100). If the destination is not set (step S100: No), step S100 is repeated until the destination is set. When the destination is set (step S100: Yes), the process proceeds to step S200.

  The route search unit 121 searches for a route to the destination using the current position information acquired by the receiving unit 110 and the road data 161 stored in the storage unit 160 (step S200).

  The route guidance unit 122 of the control unit 120 performs route guidance based on the current position information acquired by the reception unit 110 and the route information to the destination acquired in step S200 (step S300).

  The traffic jam information acquisition unit 123 of the control unit 120 determines whether traffic jam information has been received from the server 200 (step S400). When the traffic jam information has not been received (step S400: No), the process proceeds to step S600. When the traffic jam information is received (step S400: Yes), the process proceeds to step S500.

  The controller 120 executes a traffic jam information output process (step S500). The traffic jam information output process is a process for notifying the user of traffic jam information. Hereinafter, the “congestion information output process” will be described with reference to the flowchart of FIG.

  The traffic jam information acquisition unit 123 acquires traffic jam information from the communication unit 130 and stores it in a RAM (not shown) (step S510).

  The node selection unit 124 of the control unit 120 executes a traffic jam head node selection process (step S520). The traffic jam head node selection process is a process for selecting a node to be output to the user as the traffic jam head. In the following description, the node that is output to the user as the head of the traffic jam is referred to as a “traffic head node”. The “congestion head node selection process” will be described below with reference to the flowchart of FIG.

  The node selection unit 124 identifies the traffic jam head point using the traffic jam information acquired in step S510 (step S521).

  The node selection unit 124 identifies a point name possessing node that is closest in the traveling direction from the traffic jam head point among a plurality of nodes on the route to the destination (step S522). Here, the traveling direction refers to the direction in which the vehicle on the route travels. Various methods can be used to identify the node. For example, the following methods can be used. First, the node selection unit 124 determines whether a node (node B in the example of FIG. 9) that is closest in the traveling direction from the traffic jam head point is a point name possessing node. If it is a point name possessing node, the node is specified as the point name possessing node that is closest in the traveling direction. If it is not a point name possessing node, the next closest node (node A in the example of FIG. 9) in the traveling direction is identified, and it is determined whether the identified node is a point name possessing node. If it is a point name possessing node, the node is specified as the point name possessing node that is closest in the traveling direction. If the node is not a location name possession node, the next closest node is identified, and it is determined whether the identified node is a location name possession node. The node selection unit 124 repeats this operation until a spot name holding node is found, and finally specifies the spot name holding node that is closest in the traveling direction. In the example of FIG. 9, the node selection unit 124 specifies the node A as the point name possessing node that is closest in the traveling direction.

  Returning to the flow of FIG. 8, the node selection unit 124 is the closest in the reverse direction (hereinafter referred to as “opposite direction”) of the traveling direction from the congestion start point among the plurality of nodes on the route to the destination. The point name possession node at is identified (step S523). Various methods can be used to identify the node. For example, the following methods can be used. First, the node selection unit 124 determines whether the node closest in the opposite direction from the traffic jam head point (in the example of FIG. 9, the node C) is the point name possessing node. If it is a point name possessing node, that node is specified as the nearest point name possessing node in the opposite direction. If it is not a point name possessing node, the next closest node in the opposite direction (node D in the example of FIG. 9) is identified, and it is determined whether the identified node is a point name possessing node. If it is a point name possessing node, that node is specified as the nearest point name possessing node in the opposite direction. If the node is not a location name possession node, the next closest node is identified, and it is determined whether the identified node is a location name possession node. The node selection unit 124 repeats this operation until a spot name possessing node is found, and finally identifies the nearest spot name possessing node in the opposite direction. In the example of FIG. 9, the node selection unit 124 identifies the node D as the closest point name possessing node in the opposite direction.

  Returning to the flow of FIG. 8, the node selection unit 124 selects, as the traffic jam head node, the node closer to the traffic jam head point from the two nodes of the node identified in step S522 and the node identified in step S523 ( Step S524). In the example of FIG. 9, the node selection unit 124 compares the distance L1 between the traffic jam head point and the node A and the distance L2 between the traffic jam head point and the node D. When the distance L1 is smaller than the distance L2, the node selection unit 124 selects the node A as the traffic jam head node, and the node selection unit 124 selects the node D as the traffic jam when the distance L2 is smaller than the distance L1. Select as the first node.

  When the selection of the congestion start node is completed, the process returns to the flow of FIG. 7 and the node selection unit 124 executes the congestion end node selection process (step S530). The traffic jam tail node selection process is a process for selecting a node to be output to the user as the traffic jam tail. In the following description, a node that is output to the user as the end of the traffic jam is referred to as a “traffic jam end node”. The “traffic jam end node selection process” will be described below with reference to the flowchart of FIG.

  The node selection unit 124 specifies the traffic jam end point using the traffic jam information acquired in step S510 (step S531). Various methods can be used to identify the end point of the traffic jam. For example, if the traffic jam information acquired in step S510 includes information on “start point of traffic jam” and information on “total length of traffic jam”, the node selection unit 124 sets the traffic jam in the opposite direction from the traffic jam start point. You may specify the point which progressed the full length as a traffic jam end point.

  The node selection unit 124 identifies the point name possessing node that is closest in the traveling direction from the traffic jam end point among the plurality of nodes on the route to the destination (step S532). In the example of FIG. 9, the node selection unit 124 identifies the node E as the point name possessing node that is closest in the traveling direction. At this time, the node selection unit 124 may specify a node using a method similar to the method used in step S522.

  Returning to the flow of FIG. 10, the node selection unit 124 identifies a point name possessing node that is closest in the opposite direction from the traffic congestion end point among the plurality of nodes on the route to the destination (step S533). . In the example of FIG. 9, the node selection unit 124 specifies the node G as the point name possessing node that is closest in the opposite direction. At this time, the node selection unit 124 may specify a node using a method similar to the method used in step S523.

  Returning to the flow of FIG. 10, the node selection unit 124 selects, as a traffic jam end node, a node closer to the traffic jam end point among the two nodes of the node identified in step S532 and the node identified in step S533 (step S534). In the example of FIG. 9, the node selection unit 124 compares the distance L3 between the traffic jam end point and the node E and the distance L4 between the traffic jam end point and the node G. When the distance L3 is smaller than the distance L4, the node selection unit 124 selects the node E as a congestion end node, and when the distance L4 is smaller than the distance L3, the node selection unit 124 selects the node G as a congestion. Select as end node.

  When the selection of the traffic jam tail node is completed, the flow returns to the flow of FIG. 7 and the traffic jam information output unit 125 of the control unit 120 names the intersection added to the traffic jam head node from the road data. In addition, the traffic jam information output unit 125 acquires the intersection name added to the traffic jam end node from the road data (step S540).

  The traffic jam information output unit 125 outputs traffic jam information including information on the intersection name acquired in step S540 to the user (step S550). The output method of traffic jam information is arbitrary. In the example of FIG. 9, if the node selection unit 124 selects the node A as the traffic jam head node and the node E as the traffic jam end node, the traffic jam information output unit 125, for example, “Near Honmachi 1-chome intersection” From there to the vicinity of the Honmachi Sanchome intersection, it is about 1 km of traffic. "

  When the output of the traffic jam information is completed, the process returns to the flow of FIG. 6 and the route guidance unit 122 determines whether the vehicle has reached the destination (step S600). When the destination has not been reached (step S600: No), the control unit 120 repeats the processes of steps S300 to S600 until the destination is reached. When the destination is reached (step S600: Yes), the control unit 120 returns to step S100 and waits for the destination to be set by the user.

  According to this embodiment, it is configured to output the traffic jam head and traffic jam end with the intersection name instead of the distance from the current position, so the user can intuitively know where the traffic jam head and traffic jam end are actually. Can grasp.

  Moreover, in the case of normal road data, the intersection name information is already added to the attribute data of the intersection node. Therefore, the above function (function of outputting the traffic jam head and the traffic jam tail as an intersection name) can be realized using conventional road data without constructing a new database. Since it is not necessary to construct a new database in order to output the intersection name, it is very easy to introduce the above functions. In other words, the navigation device having the above function can be manufactured at a low cost by configuring a search for a node having a name of a point near the traffic jam beginning point or traffic jam end point from a plurality of nodes recorded in the road data. Can be realized.

  In general, intersection name information is added to a node indicating a large intersection, and no intersection name information is added to a node indicating a small intersection. If it is a big intersection, the user can grasp the place intuitively only by hearing the name of the intersection. The navigation apparatus 100 according to the present embodiment defines a point name possessing node as “a node having intersection name information” and searches for “a node having intersection name information”. Therefore, the navigation apparatus 100 can output the location at the beginning of the traffic jam or the location at the end of the traffic jam as an intersection name of a large intersection instead of an intersection name of a small intersection. Therefore, the user can intuitively grasp the position of the traffic jam head or the traffic jam tail.

  When the traffic jam head point or traffic jam end point (hereinafter, these two points are collectively referred to as “traffic spot”) is output as an intersection name, the navigation apparatus 100 selects a point different from the actual traffic jam point. Since it is output as the traffic jam head or traffic jam end, in some cases, the actual traffic jam point and the location output as the traffic jam head or traffic jam may be different. However, the navigation device 100 according to the present embodiment identifies the point name holding node that is closest in the direction of the route and in the opposite direction from the traffic jam point, and of the two identified nodes, the one near the traffic jam point is the head of the traffic jam. Or at the end of the traffic jam. Therefore, the navigation apparatus 100 can reduce the difference between the actual traffic jam point and the location output as the traffic jam head or the traffic jam tail.

  The above-described embodiment is an example, and various changes and applications are possible.

  For example, in step S524 or step S534, the node having the name of the point closest to the direction of traffic and in the opposite direction from the traffic jam point is specified, and, of the two specified nodes, the node closest to the traffic jam point is the head node of the traffic jam or the traffic jam Although selected as the end node, the node selection unit 124 may select a point name possessing node that is closest in the traveling direction from the traffic jam head point as the traffic jam head node. In addition, the node selection unit 124 may select a point name possessing node that is closest in the opposite direction from the traffic jam end point as the traffic jam end node. In the example of FIG. 9, the node selection unit 124 may select the node A that is closest in the traveling direction from the traffic jam head point as the traffic jam head node. In addition, the node selection unit 124 may select the node G that is closest in the opposite direction from the congestion end point as the congestion end node. In this case, the node selection unit 124 selects one of a plurality of point name possessing nodes in the traveling direction from the traffic jam heading point instead of the point name possessing node closest in the traveling direction from the traffic jam heading point. You may choose as In addition, the node selection unit 124 selects one of a plurality of point name holding nodes in the opposite direction from the traffic jam end point as the traffic jam end node instead of the point name holding node nearest in the opposite direction from the traffic jam end point. May be.

  When a node in the opposite direction to the traffic jam head point is selected as the traffic jam head node, the navigation device 100 outputs a position after the actual traffic jam head as the traffic jam head. In this case, the user faces a situation in which the traffic jam has not ended yet even after the output traffic jam head. Users expecting the end of the traffic jam will be greatly disappointed. When a node in the traveling direction of the traffic jam end point is selected as the traffic jam end node, the navigation device 100 outputs a position ahead of the actual traffic jam end as the traffic jam tail. In this case, the user enters the traffic jam before the point output by the navigation device 100. The user who was thinking of avoiding the traffic jam cannot perform the avoidance action. The user who has acted with confidence in the traffic jam information output from the navigation device 100 is greatly disappointed. However, the point name possession node in the direction of travel from the traffic jam start point is the traffic jam head node, and the location name possession node in the opposite direction from the traffic jam end point is the traffic jam end node, so that the user's expectation is not betrayed. .

  In step S520 and step S530, the node selection unit 124 selects the node having the name that is closest in the traveling direction or in the opposite direction from the congestion point as the congestion start node or the congestion end node. The node selection unit 124 does not have to select the traffic jam head node or the traffic jam tail node when the distance is more than a certain distance. For example, in the example of FIG. 9, the distance L1 between the traffic jam head point and the closest point name holding node (node A) in the traveling direction, and the spot name holding node (node) closest to the traffic jam head point in the opposite direction. When the distance L2 to D) is greater than the predetermined distance Ls, the node selection unit 124 does not select the traffic jam head node. Similarly, the distance L3 between the traffic jam end point and the closest point name holding node (node E) in the traveling direction, and the distance between the traffic jam starting point and the nearest location name holding node (node G) When both of L4 are larger than the predetermined distance Le, the node selection unit 124 does not select the traffic jam tail node. In this case, the navigation apparatus 100 may output the location of the traffic jam head and the traffic jam tail as a distance from the current position instead of the intersection name. It is possible to prevent the actual traffic jam point from greatly deviating from the location output as the traffic jam head or traffic jam end.

  In step S522 and step S523, it has been described that the node selection unit 124 identifies a point name possessing node from among a plurality of nodes on the route to the destination. However, even if the destination is not set, the user is relieved if the traffic information on the road that is currently traveling is known. Therefore, when the destination is not set, it is on a road that is currently traveling (for example, if the vehicle is running on National Highway No. 1, National Highway No. 1; hereinafter referred to as “in-progress road”). A point name possessing node may be specified from among a plurality of nodes. Specifically, in step S522, the node selection unit 124 identifies a point name possessing node that is closest in the traveling direction from the traffic jam head point among a plurality of nodes on the ongoing road. Further, in step S523, the node selection unit 124 identifies a point name possessing node that is closest in the opposite direction from the congestion start point among the plurality of nodes on the road in progress. Thereby, even when the destination is not set, the user can intuitively know where the traffic jam head is actually. The same applies to the end of the traffic jam.

  In step S550, the traffic jam information output unit 125 outputs a voice of the location of the traffic jam head or the traffic jam end. For example, the traffic jam information output unit 125 may output “about 1 km from the vicinity of the Honmachi 1-chome intersection to the vicinity of the Honmachi 3-chome intersection. May be displayed on the display screen. Further, for example, as shown in FIG. 11, the traffic jam information output unit 125 may highlight the location of the traffic jam head or traffic jam on the map as “Honmachi 1-chome”, “Honmachi 3-chome”, or the like. Even if you miss the voice, you can check it on the screen.

  Note that the traffic jam information output by the traffic jam information output unit 125 does not necessarily include both the information indicating the location of the traffic jam head and the information indicating the location of the traffic jam tail. The traffic jam information output by the traffic jam information output unit 125 may include only information indicating the location at the beginning of the traffic jam, or may include only information indicating the location at the end of the traffic jam. For example, the traffic information output unit 125 may output a voice message “There is a traffic jam of about 1 km from Honcho 1-chome intersection at the beginning of about 500 m ahead”, or “A traffic jam of 1 km from the vicinity of the Honmachi 3-chome intersection will occur. There may be voice output.

  In the above-described embodiment, a node having intersection name information is a “point name holding node”, and a node not having intersection name information is a “point name non-owning node”. However, a node having information for specifying a spot name may be a “spot name holding node”, and a node having no spot name information may be a “spot name non-holding node”. The point name is not limited to the name of the intersection, and may be, for example, the name of a tunnel entrance or the name of a toll gate. Moreover, the name of a highway entrance may be sufficient and the name of a service area entrance may be sufficient. By using only the name of the intersection instead of the name of the tunnel entrance, the name of the toll gate, the name of the expressway entrance or the name of the service area entrance as information indicating the head of the traffic jam, the user intuitively There is a merit that can be grasped. On the other hand, if a name other than the name of the intersection is used, there is an advantage that the position can be specified more finely.

  Further, the information specifying the location of the traffic jam head or the traffic jam tail is not limited to the node name. For example, the navigation device 100 may output the name of a landmark near the traffic jam head point or the traffic jam end point as information indicating the location of the traffic jam head or the traffic jam end. Here, the landmark means a visually conspicuous thing such as a building or a facility. In the example of FIG. 12, the navigation apparatus 100 may output “first parking” within the range of the distance r1 set in advance from the traffic jam heading point as information indicating the traffic jam heading location. Further, the navigation device 100 may output “second parking” within the range of the distance r2 set in advance from the traffic jam end point as information indicating the location of the traffic jam end. In this case, the navigation apparatus 100 may output a voice message “There is a traffic jam of about 1 km from the vicinity of the first parking to the vicinity of the second parking, approximately 500 m ahead”.

  The navigation device 100 is not limited to a car navigation device. The navigation device 100 may be a mobile terminal equipped with a navigation function, such as a mobile phone, a smartphone, a tablet terminal, a PDA (Personal Digital Assistant), a game machine, or the like.

  The navigation apparatus 100 according to the present embodiment may be realized by a dedicated system or may be realized by a normal computer system. For example, the navigation apparatus 100 may be configured by storing and distributing a program for performing the above-described operation in a computer-readable recording medium, installing the program in a computer, and executing the above-described processing. Good. Further, it may be stored in a disk device provided in a server device on a network such as the Internet so that it can be downloaded to a computer, for example. Further, the above-described functions may be realized by joint operation of the OS and application software. In this case, only the part other than the OS may be stored and distributed in a medium, or may be downloaded to a computer.

  Various embodiments and modifications can be made to the present invention without departing from the broad spirit and scope of the present invention. The above-described embodiments are for explaining the present invention and do not limit the scope of the present invention. In other words, the scope of the present invention is shown not by the embodiments but by the claims. Various modifications within the scope of the claims and within the scope of the equivalent invention are considered to be within the scope of the present invention.

DESCRIPTION OF SYMBOLS 100 Navigation apparatus 110 Receiving part 120 Control part 121 Route search part 122 Route guidance part 123 Congestion information acquisition part 124 Node selection part 125 Congestion information output part 130 Communication part 140 Input part 150 Output part 160 Storage part 161 Road data 200 Server

Claims (6)

A route search unit for searching for a route to a destination using road data expressed by combining two types of nodes, a point name holding node and a point name non-holding node, and a link connecting the nodes;
A traffic information acquisition unit for acquiring traffic information;
Based on the traffic jam information, the traffic jam head point and the traffic jam end point are specified, and the traffic jam head point is selected from the traffic jam head point in the traveling direction on the route based on the traffic jam head point information. The node having the name of the nearest point from the traffic congestion is selected as a traffic jam head node, and the traffic jam tail end is selected from the traffic jam tail point in a direction opposite to the progress on the route based on the information on the traffic jam tail point. A node selection unit that selects the node having the name of the point closest to the point as a traffic jam end node;
A traffic jam information output unit that outputs the traffic jam head node and the traffic jam end node point names as information indicating the traffic jam head and traffic jam end, and
A navigation device characterized by that. The node selection unit selects a point name holding node that is within a predetermined distance from the traffic jam head point and is closest in the traveling direction from the traffic jam head point as a traffic jam head node, and from the traffic jam end point in advance A point name possessing node that is within a predetermined distance and is closest to the direction of travel from the end point of the traffic jam in the direction opposite to the traveling direction is selected as the traffic jam end node;
The navigation device according to claim 1. The point name possessing node is a node having information of an intersection name,
The point name non-owned node is a node that does not have information on the intersection name,
The traffic jam information output unit outputs an intersection name of the traffic jam head node as information indicating a traffic jam head, and outputs an intersection name of the traffic jam tail node as information indicating a traffic jam tail.
The navigation device according to claim 1 or 2, wherein The node selection unit includes:
If the destination is not set, select the node that will be the traffic jam head node and the traffic jam tail node from the point name possession nodes on the ongoing road,
The navigation device according to any one of claims 1 to 3, wherein A route search step for searching for a route to a destination using road data expressed by combining two types of nodes, a point name holding node and a point name non-holding node, and a link connecting the nodes;
A traffic information acquisition step for acquiring traffic information,
Based on the traffic jam information, the traffic jam head point and the traffic jam end point are specified, and the traffic jam head point is selected from the traffic jam head point in the traveling direction on the route based on the traffic jam head point information. The node having the name of the nearest point from the traffic congestion is selected as a traffic jam head node, and the traffic jam tail end is selected from the traffic jam tail point in a direction opposite to the progress on the route based on the information on the traffic jam tail point. A node selection step for selecting the node having the point name closest to the point as the traffic jam end node;
A traffic jam information output step for outputting the traffic jam head node and the traffic jam last node point names as information indicating the traffic jam head and traffic jam end, and
A navigation method characterized by that. On the computer,
A route search function for searching for a route to a destination using road data expressed by combining two types of nodes, a point name holding node and a point name non-holding node, and a link connecting the nodes,
A traffic information acquisition function for acquiring traffic information,
Based on the traffic jam information, the traffic jam head point and the traffic jam end point are specified, and the traffic jam head point is selected from the traffic jam head point in the traveling direction on the route based on the traffic jam head point information. The node having the name of the nearest point from the traffic congestion is selected as a traffic jam head node, and the traffic jam tail end is selected from the traffic jam tail point in a direction opposite to the progress on the route based on the information on the traffic jam tail point. A node selection function for selecting the node having the point name closest to the point as the traffic jam end node,
Realizing a traffic jam information output function that outputs the traffic jam head node and the traffic jam end node point names as information indicating the traffic jam head and traffic jam end,
A program characterized by that.

Images