JP6247130B2 - Route search device and route search system - Google Patents

Description

  The present invention relates to a route search apparatus.

  In recent years, car navigation systems, mobile phones, portable game machines, PNDs (Personal Navigation Devices) and PDAs (Personal Digital Assistants) installed in automobiles are known as route search devices for searching for routes from departure points to arrival points. It has been. Some route search devices present a plurality of routes to the user as routes from the departure point to the arrival point.

  For example, in Patent Document 1, the departure point and the arrival point are the same, and when searching for a walk course or a drive course, based on the moving speed of the user and the distance from the departure point, the departure point to the arrival point. A route search device that searches for a route to the route is disclosed.

JP 2006-145408 A

  However, in the technique described in Patent Document 1, only the user's moving speed and the distance from the starting point are considered in the route search, and other than the user's moving speed and the distance from the starting point. There was also a problem of wanting to perform a route search that also considered. In addition, there has been a problem of performing route search more efficiently.

  SUMMARY An advantage of some aspects of the invention is to solve at least a part of the problems described above, and the invention can be implemented as the following forms.

(1) According to one aspect of the present invention, there is provided a route search device that searches for a route starting from a first point that is an arbitrary point on a network and arriving at the first point. The route search device includes: a route information storage unit that stores data for specifying nodes and links constituting a route; and data for specifying a link cost representing a time required for each link to pass; A point setting unit for setting; a route cost setting unit for setting a route cost that is a cumulative value of link costs allowed from the first point to the arrival at the first point; a plurality of specific points A label attaching unit for assigning a label to each of the nodes, wherein the label is included in a cumulative value of a link cost in a specific route from the first point to the specific node and in the specific route A label assigning unit, including a previous label that is the label given to a previous node that is a node adjacent to the specific node via a link; from the first point; An allowed route setting unit for setting a route whose cumulative link cost of a route originating and arriving at the first point is equal to or less than the route cost as an allowed route, and for a specific node based on the immediately preceding label When the allowable route from the first point to the immediately preceding node is set, an allowable route that sets a new allowable route based on the set allowable route and the label given to the specific node A setting unit. According to the route search device of this aspect, a label including information on the link cost set for the link is assigned to the node included in the route, and the allowable route is set based on the assigned label. It is possible to set an allowable route that accurately arrives by the arrival time at which the user wishes to arrive at the first point. In addition, since a plurality of allowable routes are set based on the labels given to the nodes, more routes that arrive at the first point by the arrival time are set efficiently.

(2) In the route search device according to the above aspect, the label assigning unit considers the restriction set based on the direction of the traveling direction for each link, and the specific node for each of the specific nodes. The label is given to an adjacent node through a link that can pass from a node to an adjacent node adjacent to the specific node; the allowable path setting unit is included in a plurality of labels assigned to each of the specific node The allowable route may be set based on a minimum value and a value other than the minimum value among the accumulated values of the link costs. According to the route search device of this aspect, since the allowable route is set in consideration of various restrictions set on the link, an accurate route that can arrive at the first point from the first point is set. The

(3) In the route search device of the above aspect, the label attaching unit starts from all the immediately preceding nodes that can attach the label to the specific node via a link among the specific nodes on the allowable route. The label is affixed to a label awaiting node that is a node to which the label is not affixed; and when the plurality of labels are affixed to the label awaiting node, The permissible route may be set based on the route cost, the link cost of the permissible route in the label awaiting node, and the total value of the link costs included in the given plurality of labels. According to the route search device of this aspect, since the allowable route within the route cost is set from the label attached to the label waiting queue on the allowable route, since unnecessary label assignment exceeding the route cost is not performed, An allowable route is set quickly and efficiently.

(4) In the route search device according to the above aspect, the label assigning unit sets, as the minimum cost label, the label including the cumulative value of the minimum link cost for each of the specific nodes; The unit connects the first point and the specific node to which the minimum cost label is assigned when a value twice the cumulative value of link costs included in the minimum cost label is equal to or less than the route cost. Of the routes, a route that makes a round trip along a route specified based on the minimum cost label may be set as the allowable route. According to the route search device of this aspect, since the label only needs to be assigned to the node until the cumulative value of the link cost included in the label becomes half or less of the route cost, the allowable route composed of the forward route and the return route is efficient. Is set automatically.

(5) In the route search device of the above aspect, the label assigning unit sets the label other than the minimum cost label as a non-minimum cost label for each of the specific nodes; In the specific node, the link cost included in the minimum cost label is changed from the cumulative value of the link cost included in the non-minimum cost label to a value twice the cumulative value of the link cost included in the minimum cost label. When a value obtained by adding a value obtained by subtracting the cumulative value is equal to or less than the route cost, the minimum cost label in the route connecting the first point and the specific node to which the minimum cost label is assigned. A combination of a route specified based on the route specified based on the non-minimum cost label and a forward route and a return route It may be set as the allowable path. According to the route search device of this aspect, the forward route and the return route in the allowable route are set based on the plurality of labels given to the nodes, and more allowable routes are efficiently set.

(6) In the route search device of the above aspect, further; data specifying a facility associated with at least one of a node or a link, data specifying a facility use cost representing a time required when using the facility, A facility information storage unit that stores information; and the allowable route setting unit sets the allowable route based on the route cost and the facility use cost associated with a node and a link included in the allowable route. Also good. According to the route search device of this aspect, since the allowable route is set by adding the facility use cost necessary for using the facility to the link cost of each link, the allowable arrival at the first point is allowed. A route is set.

(7) The route search device of the above aspect further includes: a use facility setting unit that sets conditions of the facility to be used; the route cost setting unit allows a route whose cumulative link cost is equal to or less than the route cost After being set as a route, among the facilities associated with the nodes and links included in the allowable route, a value obtained by subtracting the facility use cost of the facility to be used from the route cost is set as the new route cost. The allowable route setting unit sets a new route less than the new route cost as a new allowable route; each of the route cost setting unit and the allowable route setting unit includes a new route cost and a new route cost. The setting update with the allowable route may be repeated until the condition is satisfied. According to the route search device of this aspect, until the allowable route satisfying the set condition is set, the allowable route set based on the route cost is determined based on the total value of the facility use costs of the facilities used. Since narrowing down is performed, an allowable route satisfying the condition is set efficiently.

  Note that the present invention can be realized in various modes. For example, a route search device and method, a route search system and method, an information terminal device, an information transmission device and method, a mobile terminal device, an information processing server, The present invention can be realized in the form of a route search server, a computer program for realizing these devices, methods, and systems. Further, these computer programs may be recorded on a computer-readable recording medium (for example, a flexible disk, a CD-ROM, a DVD-ROM, a magneto-optical disk, a memory card, a hard disk, etc.).

It is explanatory drawing which shows schematic structure of the route search system 10 in 1st Embodiment of this invention. It is explanatory drawing which shows the flow of a route search process. It is explanatory drawing which shows the flow of a route search process. It is explanatory drawing which shows an example of start / end SG, a node, and a link. It is explanatory drawing which shows the outline of label provision with respect to each node. It is explanatory drawing which shows the outline of label provision with respect to each node. It is explanatory drawing which shows the outline of label provision with respect to each node. It is explanatory drawing which shows the flow of the similar path | route setting process based on a definite label. It is explanatory drawing which shows the flow of the similar path | route setting process based on a losing label. It is explanatory drawing which shows the outline of the label provided with respect to each node, and the set similar path | route. It is explanatory drawing which shows an example of the start end point SG, a node, and a link in 2nd Embodiment. It is explanatory drawing which shows the flow of the route search process in 2nd Embodiment. It is explanatory drawing which shows the flow of the route search process in 2nd Embodiment. It is explanatory drawing which shows the outline of label provision with respect to each node. It is explanatory drawing which shows the outline of label provision with respect to each node. It is explanatory drawing which shows the outline of label provision with respect to each node. It is explanatory drawing which shows the outline of label provision with respect to each node. It is explanatory drawing which shows the outline of label provision with respect to each node. It is explanatory drawing which shows the outline of label provision with respect to each node. It is explanatory drawing which shows the flow of the similar path | route setting process based on a losing label. It is explanatory drawing which shows an example of the positional relationship between a node and a link, and each facility. It is explanatory drawing which shows the outline of the allowable path | route updated based on a utilization facility. It is explanatory drawing which shows an example of the similar path | route shown to a user. It is explanatory drawing which shows the outline of label provision with respect to each node in 4th Embodiment. It is explanatory drawing which shows the outline of the label provided with respect to each node in 4th Embodiment, and a part of set similar path | route.

Next, embodiments of the present invention will be described in the following order.
A. First embodiment:
A-1. Information processing system configuration:
A-2. Route search process:
B. Second embodiment:
C. Third embodiment:
D. Fourth embodiment:
E. Variations:

A. First embodiment:
A-1. Information processing system configuration:
FIG. 1 is an explanatory diagram showing a schematic configuration of a route search system 10 according to the first embodiment of the present invention. The route search system 10 of the present embodiment includes a server 100 and a mobile phone 200 as a mobile terminal device. Although only one mobile phone 200 is shown in FIG. 1, the route search system 10 includes various mobile phones 200 and mobile game machines, PND (Personal Navigation Device), PDA (Personal Digital Assistant), and the like. A mobile terminal device may be included.

  The mobile phone 200 includes a GPS receiver 201, a display panel 202, an audio output unit 203, a wireless communication circuit 205, an operation unit 206, a main control unit 210, and a call control unit 220.

  The GPS receiver 201 receives departure point information that specifies the current position (latitude, longitude) of the mobile phone 200 measured using an artificial satellite constituting a GPS (Global Positioning System) by radio waves.

  The display panel 202 includes a liquid crystal display and a drive circuit that drives the liquid crystal display. The display panel 202 is not limited to a liquid crystal display, and various display devices such as an organic EL display can be employed. The audio output unit 203 includes a speaker for outputting audio, a drive circuit for driving the speaker, and the like. The wireless communication circuit 205 wirelessly performs data communication or voice communication with the base station BS. The operation unit 206 is an input device that includes a numeric keypad 206a, a cursor key 206b, a touch panel, and the like. The operation unit 206 receives an arrival time at which the user wants to arrive at an arrival point that is the same as the departure point, a setting input of a facility that the user wants to visit, and the like. Hereinafter, the departure point and the arrival point are also referred to as start and end points. The call control unit 220 is a circuit that performs incoming calls and calls for voice calls, conversion of voice signals and electric signals, and the like.

  The main control unit 210 controls each unit of the mobile phone 200. The main control unit 210 includes a CPU 211, a RAM 212, and a ROM 213. The CPU 211 implements a function for executing various processes described later by loading a program stored in the ROM 213 into the RAM 212 and executing the program. For example, the main control unit 210 controls the display panel 202 to display a map image, a recommended route, a current position, and the like. The main control unit 210 controls the wireless communication circuit 205 to store information on the Internet INT via the base station BS (more specifically, via a transmission / reception antenna, a base station BS, and an exchange). Communicates with unit 110 and route search unit 120. Further, the main control unit 210 receives the current position information of the mobile phone 200 measured using the GPS via the GPS receiver 201 at regular intervals, and generates start / end point information for specifying the start / end point.

  The server 100 includes a communication unit 102 that communicates with the mobile phone 200 via the Internet INT, an information storage unit 110, and a route search unit 120. The information storage unit 110 includes a control unit configured by a CPU, a RAM, and a ROM, and includes a storage device 118 that stores information. The storage device 118 is constituted by, for example, a hard disk device. In the storage device 118, a map information database (DB) 114, a node-specific route information database (DB) 115, and a POI information database (DB) 116 are constructed. The map information DB 114 stores, for example, link information, node information, and map image data as image data.

  The node-specific route information DB 115 is arbitrarily selected within a preset route search range that is a target of route search when searching for a route from a starting point to a starting point until reaching the starting point. Information included in a label given to a specific node that is a node is stored. The information contained in the label given to a specific node is the cumulative value of the link cost from the departure point to the specific node (hereinafter also referred to as the “cost total value”) and the arrival at the specific node on the route. Information including a previous label, which is a label given to the previous node before. In addition, the numerical value of the link cost memorize | stored in path | route information DB115 classified by node represents time. In this embodiment, the link cost is stored as a numerical value representing “minute”, which is an absolute time, but in other embodiments, it is “hour” or “second” which is a unit other than “minute”. Alternatively, it may be stored as a numerical value representing relative time.

  The POI information DB 116 stores various types of facility information associated with link information and node information stored in the map information DB 114. Further, the POI information DB 116 specifies and stores various information stored in the facility associated with the searched route for each route. The details of various facility information stored in the POI information DB 116 will be described later. The server 100 corresponds to the route search device in the claims, and the information storage unit 110 corresponds to the route information storage unit in the claims. The POI information DB 116 corresponds to the facility information storage unit in the claims.

  The route search unit 120 includes a control unit configured by a CPU, a RAM, and a ROM, and includes a label attaching unit 122 and a similar route setting unit 124. When the start / end point is set in the mobile phone 200 and the start / end point information is transmitted from the mobile phone 200, the route search unit 120 receives the start / end point information via the communication unit 102. The route search unit 120 calculates the link cost of each link based on the route information stored in the map information DB 114 and the received start / end information, and searches for the route from the start / end point to the start / end point. . The label assigning unit 122 of the route search unit 120 selects specific nodes in order from the start and end points, and assigns labels to the selected specific nodes.

  The similar route setting unit 124 of the route search unit 120 starts and ends from the start and end points based on the route information stored in the map information DB 114, the received start and end point information, the confirmed label, and the losing label. A similar route to be described later is set as the route to the point. The route search unit 120 transmits route information including a similar route to the mobile phone 200 via the communication unit 102. The similar route corresponds to the allowable route in the claims, and the route search unit 120 corresponds to the allowable route setting unit in the claims.

A-2. Route search process:
2 and 3 are explanatory diagrams showing the flow of the route search process. In the route search process, a route that can reach the start and end points by the time at which the user of the mobile phone 200 wants to arrive is searched. FIG. 4 is an explanatory diagram illustrating an example of the start / end point SG, the node, and the link. FIG. 4 shows the names of links and nodes, and the link cost for each link. For example, the node N41 and the node N31 are connected by a link L2, and the link cost of the link L2 is 10. In this embodiment, since the link cost is set to be the same as the time (minute), when the user of the mobile phone 200 moves from the node N41 to the node N31, the link cost of 10 minutes moves. Elapsed as necessary time. The label assigning unit 122 assigns a label including information on the accumulated cost value and the immediately preceding label to each node. In the present embodiment, the information of the immediately preceding label is specified by the accumulated cost value at the specific node and the link that has passed before arriving at the specific node.

  In the route search process, first, the route search unit 120 acquires a start / end point from the mobile phone 200 carried by the user, and sets a temporary label at the start / end point (step S11 in FIG. 2). At the initial stage when the route search process is started, since there is no immediately preceding node, the label assigning unit 122 assigns a temporary label including a cost total value of 0 to the start / end SG. In the following, a label including a cost total value of 0 is also referred to as a label having a cost total value of 0. Next, the route search unit 120 sets an allowable cost based on the time when the user wants to arrive at the start / end point input to the mobile phone 200 (step S12). In this embodiment, the allowable cost is set to 100, but in other embodiments, a different value may be used. The allowable cost corresponds to the route cost in the claims, and the route search unit 120 corresponds to the route cost setting unit in the claims.

  Next, the label assigning unit 122 determines whether there is a node to which a temporary label is assigned (step S13). Since a temporary label is assigned to the start / end SG (step S13: YES), the label assigning unit 122 then sets the provisional label assigned to the start / end SG with the minimum cost accumulated value as a confirmed label. (Step S14). The confirmed label corresponds to the minimum cost label in the claims. When it is determined in step S13 that there is no node to which a temporary label is assigned (step S13: NO), the route search unit 120 ends the route search processing.

  When a confirmed label is set in the process of step S14, the label assigning unit 122 determines whether or not a value obtained by doubling the cumulative value of the confirmed label assigned to the start / end point SG is smaller than the allowable cost. (Step S15). Since the value twice the accumulated cost value of the confirmed label assigned to the start / end SG is 0 and smaller than the allowable cost server 100 (step S15: YES), the similar route setting unit 124 uses the confirmed label as the confirmed label. Based on the similar route, step S16 is set. However, since the confirmed label assigned to the start / end point SG does not pass through any link, a similar route based on the confirmed label assigned to the start / end point SG is not set. Details of the similar route setting process will be described later. Next, the label assigning unit 122 assigns a new label to an adjacent node that is an adjacent node other than the immediately preceding node from the start / end point SG to which the confirmed label is assigned (step S17). The label assigning unit 122 assigns a new label to the node N41 that is one of the adjacent nodes.

  Each of FIGS. 5 to 7 is an explanatory diagram showing an outline of label assignment for each node. FIG. 5A shows a state in which temporary labels are assigned to the node N41 and the node N31 based on the confirmed label assigned to the start / end point SG. In each of the drawings from FIG. 5 to FIG. 7, the finalized label is displayed with the accumulated cost value surrounded by a rectangle. As shown in FIG. 5A, since the label given to the node N41 passes through the link L2 having a link cost of 10, the cumulative cost value is 10.

  Next, the label assigning unit 122 determines whether or not a confirmed label has already been assigned to the node N41 that is one of the adjacent nodes of the start / end SG (step S18 in FIG. 3). Since the confirmed label is not assigned to the node N41 (step S18: NO), the label assigning unit 122 determines whether or not the temporary label is already assigned to the node N41 (step S19). In the process of step S18, when a confirmed label is assigned to the adjacent node (step S18: YES), the label assigning unit 122 sets a new label as a losing label (step S22). Next, the similar route setting unit 124 sets a similar route based on the losing label, which will be described later, based on the set losing label (step S23). Note that the losing label corresponds to the non-minimum cost label in the claims.

  In the process of step S19, since no temporary label is assigned to the node N41 (step S19: NO), the label assigning unit 122 sets the new label assigned to the node N41 as a temporary label (step S20). As shown in FIG. 5 (a), the new label given to the node N41 is set as a temporary label, and the accumulated cost value of the temporary label is displayed in a pentagon with the direction entering the node N41 as a vertex. The Specifically, the temporary label given to the node N41 is displayed in a pentagon having a vertex directed from the start / end point SG to the node N41, with the accumulated cost value 10 surrounded.

  Next, the label assigning unit 122 determines whether there is an unprocessed adjacent node to which no label is assigned (step S21). Since the node N31 that is the adjacent node of the start / end SG is not assigned a label and is not processed (step S21: YES), the label assigning unit 122 is one of the adjacent nodes. A new label is assigned to the node N31 (step S17). The new label given to the node N31 is set as the temporary label given to the node N31, similarly to the temporary label given to the node N41.

  Next, since there is a provisional label assigned to the node (step S13: YES), the label assignment unit 122 sets the provisional label assigned to the node N41 having the smallest accumulated cost value as the confirmed label (step S14). . The double value of the total cost value of the confirmed label assigned to the node N41 is 20, which is smaller than the allowable cost 100 (step S15: YES), so the similar route setting unit 124 is assigned to the node N41. A similar route based on the confirmed label is set (step S16).

  FIG. 8 is an explanatory diagram showing the flow of the similar route setting process based on the confirmed label. In the similar route setting process based on the confirmed label, first, based on the confirmed label assigned to the node, a similar route from the immediately preceding node to the node assigned with the confirmed label is set (step S31). The similar route setting unit 124 uses a route that is turned back at the node N41, that is, a route that starts from the start / end point SG, passes through the link L1, the node N41, and the link L1 and reaches the start / end point SG as a confirmed label. Set as a similar route based on. As shown in FIG. 5B, the set similar path is thicker than each link and is indicated by a solid line having an arrow. Next, it is determined whether or not there is a losing label in the node N41 to which the confirmed label is assigned (step S32). Since the node N41 has no losing label (step S32: NO), the similar route setting unit 124 ends the similar route setting process based on the confirmed label.

  Next, the label assigning unit 122 assigns a new label to the adjacent node N31 based on the confirmed label assigned to the node N41 (step S17 in FIG. 3). As shown in FIG. 5B, since the node N31 has no confirmed label (step S18: NO in FIG. 3) and has a temporary label (step S19: YES), the label assigning unit 122 has already received the node N31. It is determined whether or not the total cost value of the temporary label assigned to is larger than the total cost value of the label newly assigned to the node N31 (step S24). The accumulated cost value of the label newly assigned to the node N31 is 20 obtained by adding the link cost of the link L2 to 10 that is the accumulated cost value of the confirmed label assigned to the node N41. Therefore, the accumulated cost value of the temporary label already assigned to the node N31 is 21, which is larger than 20 which is the accumulated cost value of the label newly assigned to the node N31 (step S24: YES). The unit 122 sets the temporary label already assigned to the node N31 as a losing label (step S25). The label assigning unit 122 sets a label newly given to the node N31 as a temporary label (step S20). In FIG. 6A, the assigned temporary label is displayed at the node N31, and the assigned losing label is displayed in a circle.

  Next, the label assigning unit 122 sets the temporary label assigned to the node N31 as a confirmed label (step S14 in FIG. 2). Since 40, which is twice the cost total value of the confirmed label assigned to the node N31, is smaller than the allowable cost 100 (step S15: YES), the similar route setting unit 124 determines the similar route based on the confirmed label. Is set (step S16). As shown in FIG. 6B, the similar route setting unit 124 sets a route including the link L1 that is a route from the node N41 as the immediately preceding node to the node N31 as a similar route (step S31 in FIG. 8). In FIG. 6B, the link L1 included in the newly set similar route is indicated by a one-dot chain line that is thicker than the link. Next, since the node N31 has a losing label (step S32 in FIG. 8: YES), the similar route setting unit 124 sets a similar route based on the losing label (step S33). If it is determined that there is no losing label in the node to which the confirmed label is assigned (step S32: NO), the similar route setting unit 124 ends the similar route setting process based on the confirmed label.

  FIG. 9 is an explanatory diagram showing the flow of the similar route setting process based on the losing label. In the similar route setting process based on the losing label, first, the similar route setting unit 124 adds the cost difference for each route to a value obtained by doubling the accumulated cost value of the confirmed label given to the node N31. It is determined whether it is smaller than (step S41). The path-specific cost difference is a value obtained by subtracting the cost accumulated value of the confirmed label from the cost accumulated value of the losing label given to the node. In the node N31, 1 obtained by subtracting 40 from 41 corresponds to the cost difference for each route. As shown in FIG. 7, in the node N31, 41 obtained by adding 1 which is the cost difference for each route to 40 which is twice the accumulated cost value of the confirmed label is smaller than 100 of the allowable cost (step S41 in FIG. 9: YES) In this case, the similar route setting unit 124 sets a route including the link L3 that is a route from the start / end point SG that is the immediately preceding node to the node N31 to which the losing label is assigned, as the similar route. In FIG. 6B, the link L3 included in the newly set similar route is indicated by a thicker dotted line than the link. When the value obtained by adding the cost difference for each route to the value obtained by doubling the cost cumulative value of the confirmed label is not smaller than the allowable cost (step S41 in FIG. 9), the similar route setting unit 124 The similar route setting process based on is terminated.

  Next, as shown in FIG. 7, the label assigning unit 122 assigns a label to the adjacent node from the confirmed label assigned to the node N31 (step S17 in FIG. 3). Thereafter, the node including the node N31, to which the temporary label is assigned, is subjected to the same processing as the confirmed label assigned to the node N31, and the route search process is performed.

  FIG. 10 is an explanatory diagram showing the outline of labels given to each node and the set similar paths. In FIG. 10, the route search processing is completed, and various types of processing are performed on all temporary labels. The links and nodes after the route search processing, the labels assigned to each node, and the set similar routes An example is shown. As shown in FIG. 10, among routes that start from the start / end point SG and arrive at the start / end point SG, a route having an allowable cost smaller than 100 is a route that combines a plurality of similar routes. For example, a similar route with a cumulative cost value of 90 is assigned to the node N32 and a route including the link L1, the link L2, and the link L5 that are specified based on the confirmed label assigned to the node N32. This is a route that passes through a route that is a combination of the route including the link L8 specified based on the determined label and the losing label.

  As described above, in the server 100 according to the present embodiment, the label assigning unit 122 selects a specific node in order from the start / end point SG, the cost accumulated value up to the route to the selected specific node, and the immediately preceding value. And a label that is information including the label. Based on the label given to the node, the similar route setting unit 124 sets a similar route having a cumulative cost value that departs from the start / end point SG and arrives at the start / end point SG with an allowable cost or less. For this reason, in the server 100 according to the present embodiment, a label including information on the link cost set for the link is assigned to a node included in the route, and a similar route is set based on the assigned label. A similar route that arrives at the start / end point SG by the correct arrival time can be set. In addition, since a plurality of similar routes are set based on the labels given to the nodes, more routes that reach the start / end point SG by the arrival time are set efficiently.

  Further, in the server 100 according to the present embodiment, the label assigning unit 122 sets a label having the smallest accumulated cost value as a confirmed label for each node. The similar route setting unit 124 sets, as a similar route, a route specified based on the confirmed label given to the node when a value twice the accumulated cost of the confirmed label given to the node is smaller than the allowable cost. To do. For this reason, in the server 100 according to the present embodiment, since a label needs to be assigned to a node until the accumulated cost value included in the label becomes half or less of the allowable cost, a similar route is efficiently set.

  Further, in the server 100 according to the present embodiment, the label assigning unit 122 assigns a label other than the confirmed label having the minimum cost accumulated value to each node as a losing label. When the value obtained by adding the cost difference for each route to the value obtained by doubling the cost cumulative value of the confirmed label given to the specific node is equal to or less than the allowable cost, the similar route setting unit 124 Then, a route obtained by combining the route specified based on the assigned definite label and the route specified based on the assigned losing label is set as a similar route. Therefore, in the server 100 in the present embodiment, similar routes are set based on a plurality of labels given to the nodes, and more similar routes are set efficiently.

B. Second embodiment:
FIG. 11 is an explanatory diagram illustrating an example of a start / end point SG, a node, and a link in the second embodiment. As shown in FIG. 11, in the second embodiment, restriction of the traveling direction is set for the link L5, and the link L5 can pass in the direction from the node N31 to the node N32, but from the node N32 to the node N31. The point which cannot pass in the direction of is different from 1st Embodiment, and the other point is the same as 1st Embodiment.

  12 and 13 are explanatory diagrams showing the flow of route search processing in the second embodiment. In the route search process in the second embodiment, first, as in the first embodiment, the route search unit 120 acquires the start / end point SG and sets a temporary label for the start / end point SG (step S51). The allowable cost is set to 100 (step S52). Next, the label assigning unit 122 sets the start / end point SG to which the temporary label is assigned as the similarity waiting node (step S53). The similar waiting node is a node waiting for a loss label to be given from all the adjacent nodes via a link that can pass to a specific node on the allowable route. Note that the similar waiting node corresponds to a label addition waiting node in the claims.

  Each of FIGS. 14 to 19 is an explanatory diagram showing an outline of label assignment for each node. In FIG. 14A, a temporary label is set for the start / end point SG, the start / end point SG is added as a similar waiting node, and the temporary labels are set for the node N41 and the node N31 based on the temporary label set for the start / end point SG. The state where is given is shown. Since a temporary label with a cumulative cost value of 0 is assigned to the start / end SG (step S54 in FIG. 12: YES), the label assigning unit 122 determines whether there is a similar waiting node waiting for the loss label. Determination is made (step S55). Since the start / end point SG is a similar waiting node that waits for the loss label to be attached (step S55: YES), the label assigning unit 122 sets the temporary label having the smallest cost accumulated value assigned to the start / end point SG as the confirmed label. (Step S56). As shown in FIG. 14A, in each of the drawings from FIG. 14 to FIG. 19, the confirmed label given to the similar waiting node is displayed with the accumulated cost value surrounded by a thick solid line.

  Next, the label assigning unit 122 assigns a label to the node N41 with the node N41 adjacent to the node to which the confirmed label is assigned as the target node (step S59 in FIG. 13). Since the node N41 has no confirmed label (step S60: NO) and no temporary label (step S61: NO), as shown in FIG. 14A, the label attaching unit 122 determines the link cost of the link L1. The provisional label whose added cost accumulated value is 10 is given to the node N41 (step S62 in FIG. 13). Next, since there is a node N31 that is an unprocessed adjacent node (step S63: YES), the label assigning unit 122 assigns a label to the node N31 with the node N31 as a target node (step S59). Since the node N31 has no confirmed label (step S60: NO) and no temporary label (step S61: NO), as shown in FIG. 14A, the label attaching unit 122 determines the link cost of the link L3. The provisional label whose added cost accumulated value is 21 is given to the node N31 (step S62 in FIG. 13).

  Next, there is no unprocessed node to which a label is assigned based on the confirmed label assigned to the start / end SG (step S63: NO), and there is a temporary label assigned to the node (step S54 in FIG. 12: YES). Since there is a start / end point SG waiting for the losing label (step S55: YES), the label assigning unit 122 sets the provisional label assigned to the node N41 having the smallest accumulated cost value as the confirmed label (step S56). As shown in FIG. 14B, in the second embodiment, the solid line surrounding the set cumulative cost value of the fixed label is thicker than the solid line surrounding the temporary label cost cumulative value, and the cost cumulative value of the similar waiting node It is a pentagon that is thinner than the solid line that surrounds it. The label assigning unit 122 assigns a label with the start / end point SG, which is a node adjacent to the node N41, as the target node (step S59 in FIG. 13). Since a confirmed label is assigned to the start / end point SG (step S60: YES), a label to be newly assigned to the start / end point SG is set as a losing label (step S64). The label assigning unit 122 determines whether or not the start / end point SG that is the node of interest is a similarity waiting node (step S65). Since the start / end point SG is a similar waiting node (step S65: YES), the similar route setting unit 124 sets a similar route based on the losing label (step S66).

  FIG. 20 is an explanatory diagram showing the flow of the similar route setting process based on the losing label. In the similar setting process based on the losing label, first, the similar path setting unit 124 determines whether or not the value obtained by adding the cost difference for each path to the addition cost of the similar waiting node is smaller than 100 of the allowable cost ( Step S71). The added cost is a cost that starts from the start / end point SG, passes through a similar route, and returns to the start / end point SG in the shortest time. The addition cost of the start / end SG is 0. Since the losing label is assigned to the start / end point SG based on the confirmed label given to the node N41, the path-specific cost difference is the link cost of the link L1 to 10 which is the accumulated cost of the confirmed label given to the node N41. It is 20 which added 10 which is. Therefore, the value obtained by adding the path-specific cost difference to the addition cost of the similar waiting node is 20, which is smaller than the allowable cost 100 (step S71: YES). Therefore, as illustrated in FIG. The setting unit 124 starts from the route specified based on the losing label assigned to the start / end point SG, that is, the start / end point SG, passes through the link L1, the node N41, and the link L1, and starts and ends. A route arriving at SG is set as a similar route. Further, as the added cost of the set similar route, a value obtained by adding the route-specific cost difference at the node N41 to the added cost of the similar waiting node is given (step S72 in FIG. 20). Next, the label assigning unit 122 sets the node N41 to which the confirmed label that is the basis for setting the similar route is set as the similar waiting node (step S73). In the process of step S71 of FIG. 20, when it is determined that the value obtained by adding the cost difference for each route to the addition cost of the similar waiting node is not smaller than the allowable cost (step S71: NO), the label assigning unit 122. Finishes the similar route setting process based on the losing label without setting the similar route.

  Next, the label assigning unit 122 assigns a label with the node N31 that is an unprocessed adjacent node as the target node (step S59 in FIG. 13). Since the node N31 has not been given a definitive label (step S60: NO) and has been given a temporary label (step S61: YES), the label assigning unit 122 has already given a temporary label to the node N31. It is determined whether the total cost value is larger than the total cost value of the newly assigned label (step S67). As shown in FIG. 14B, the cost accumulated value of the temporary label already assigned to the node N31 is 21, which is larger than the cost accumulated value 20 of the label newly given to the node N31 ( In step S67 of FIG. 13: YES), the label assigning unit 122 sets the temporary label already assigned to the node N31 as a losing label (step S68). Next, the label assigning unit 122 sets a label newly given to the node N31 as a temporary label (step S62).

  Next, there is no unprocessed node that gives a label based on the confirmed label given to the node N41 (step S63: NO), and there is a temporary label given to the node (step S54: FIG. 12: YES). Since there is a node N41 waiting for a losing label and a start / end SG (step S55: YES), as shown in FIG. 15 (a), the label assigning unit 122 assigns the provisional value assigned to the node N31 having the smallest accumulated cost value. The label is set as a confirmed label (step S56 in FIG. 12). The label assigning unit 122 assigns a label with the start / end point SG that is an adjacent node of the node N31 as a target node (step S59 in FIG. 13). Since the confirmed label is assigned to the start / end point SG (step S60), the label assigned to the start / end point SG is set as a losing label (step S64), and the start / end point SG is a similar waiting node (step S65: YES), the similar route setting unit 124 sets a similar route having an addition cost of 41 passing through the link L3 (step S66). Similarly, the label assigning unit 122 assigns a label with the node N41 that is an adjacent node of the node N31 as a target node (step S60). Since the confirmed label is assigned to the node N41 (step S60: YES), the label assigned to the node N41 is set as a losing label (step S64), and the node N41 is a similar waiting node (step S65: YES). ), The similar route setting unit 124 sets a similar route having an additional cost of 40 passing through the link L2 (step S66). Next, the label assigning unit 122 sets the node N31 to which the confirmed label that is the basis for setting the similar route is set as the similar waiting node (step S73). Next, the label assigning unit 122 assigns a temporary label with a cumulative cost value of 29 to the node N21 and a temporary label with a cumulative cost value of 35 to the node N32 (step S62). As shown in FIG. 15B, since each of the start / end point SG and the node N41 is given a label from all the adjacent nodes, it is not a similar waiting node, and the confirmed label given to the start / end point SG and the node N41 Each is displayed in white letters as a definite label assigned to a node that does not wait for a loss label to be assigned.

  Next, as shown in FIG. 15B, there is no unprocessed node to which a label is assigned based on the confirmed label assigned to the node N31 (step S63: NO), and there is a temporary label assigned to the node. (Step S54 in FIG. 12: YES) Since there is a node N31 that waits for a losing label (Step S55: YES), the label assigning unit 122 determines the provisional label assigned to the node N21 having the smallest accumulated cost value as a definite label. (Step S56 in FIG. 12). The label assigning unit 122 assigns a label with the node N31 that is an adjacent node of the node N21 as a target node (step S59 in FIG. 13). Since the confirmed label is assigned to the node N31 (step S60: YES), the label assigned to the node N31 is set as a losing label (step S64), and the node N31 is a similar waiting node (step S65: YES). ), The similar route setting unit 124 sets a similar route having an additional cost of 58 passing through the link L4 (step S66). Next, the label assigning unit 122 sets the node N21 to which the confirmed label as a basis for setting the similar route is set as a similar waiting node (step S73 in FIG. 20). Next, the label assigning unit 122 assigns a temporary label with a cumulative cost value of 38 to the node N11 and a temporary label with a cumulative cost value of 44 to the node N22.

  Next, as shown in FIG. 16A, there is no unprocessed node to which a label is assigned based on the confirmed label assigned to the node N21 (step S63: NO in FIG. 13), and the temporary assigned to the node. Since there is a label (step S54 in FIG. 12: YES) and there are nodes N21 and N31 waiting for a losing label (step S55: YES), the label assigning unit 122 is assigned to the node N32 having the smallest accumulated cost value. The provisional label is set as a confirmed label (step S56 in FIG. 12). Here, since the link L5 cannot pass from the node N32 to the node N31, the label attaching unit 122 cannot attach a label to the node N31 based on the confirmed label assigned to the node N32. The label assigning unit 122 assigns a loss label with a cumulative cost value of 46 to the node N22, a temporary label with a cumulative cost value of 44 to the node N33, and a temporary label with a cumulative cost value of 55 to the node N43. To do. Since the node N31 is assigned with a label based on all adjacent nodes, the node N31 is not a similar waiting node, and the confirmed label assigned to the node N31 becomes a confirmed label assigned to a node that does not wait for the losing label.

  Next, as shown in FIG. 16B, there is no unprocessed node to which a label is assigned based on the confirmed label assigned to the node N32 (step S63: NO in FIG. 13), and the temporary assigned to the node. Since there is a label (step S54 in FIG. 12: YES) and there is a node N21 waiting for a losing label (step S55: YES), the label assigning unit 122 provides a temporary label attached to the node N11 with the minimum accumulated cost value. Is set as a confirmed label (step S56 in FIG. 12). The label assigning unit 122 assigns a label with the node N21 that is an adjacent node of the node N11 as a target node (step S59 in FIG. 13). Since the confirmed label is assigned to the node N21 (step S60: YES), the label assigned to the node N21 is set as a losing label (step S64), and the node N21 is a similar waiting node (step S65: YES). ), The similar route setting unit 124 sets a similar route having an addition cost of 76 passing through the link L6 (step S66). Next, the label assigning unit 122 sets the node N11 to which the confirmed label that is the basis for setting the similar route is set as a similar waiting node (step S73 in FIG. 20). The label assigning unit 122 assigns a temporary label having a cumulative cost value of 62 to the node N13.

  Next, as shown in FIG. 17A, there is no unprocessed node to which a label is assigned based on the confirmed label assigned to the node N11 (step S63: NO in FIG. 13), and the temporary assigned to the node. Since there is a label (step S54 in FIG. 12: YES) and there are a node N11 and a node N21 waiting for a losing label (step S55: YES), the label assigning unit 122 is assigned to the node N22 having the smallest accumulated cost value. The provisional label is set as a confirmed label (step S56 in FIG. 12). The label assigning unit 122 assigns a label with the node N21 that is an adjacent node of the node N22 as the target node (step S59 in FIG. 13). Since the confirmed label is assigned to the node N21 (step S60: YES), the label assigned to the node N21 is set as a losing label (step S64), and the node N21 is a similar waiting node (step S65: YES). ), The similar route setting unit 124 sets a similar route having an added cost of 88 passing through the link L7 (step S66). Next, the label assigning unit 122 sets the node N22, to which the confirmed label, which is a basis for setting the similar route, is set as the similarity waiting node (step S73 in FIG. 20). Further, as illustrated in FIG. 17B, the similar route setting unit 124, based on the confirmed label and the losing label given to the node N22, the similar route having the addition cost of 90 passing through the link L5 and the link L8. Is set (step S66 in FIG. 13). Next, the label assigning unit 122 sets the node N32 to which the confirmed label that is a basis for setting the similar route is set as the similar waiting node (step S73 in FIG. 20). The label assigning unit 122 assigns a temporary label whose accumulated cost value is 54 to the node N23 and a losing label whose accumulated cost value is 55 to the node N32. Since the node N21 is assigned a label based on all the adjacent nodes, the node N21 is not a similar waiting node, and the confirmed label assigned to the node N21 is a confirmed label that does not wait for the losing label.

  Next, as shown in FIG. 18A, there is no unprocessed node to which a label is assigned based on the confirmed label assigned to the node N22 (step S63: NO in FIG. 13), and the temporary assigned to the node. Because there is a label (step S54 in FIG. 12: YES) and there are nodes N11, N22, and N23 waiting for a losing label (step S55: YES), the label assigning unit 122 has a node N33 that has the smallest accumulated cost value. The provisional label assigned to is set as a confirmed label (step S56 in FIG. 12). The label assigning unit 122 has a loss label whose accumulated cost value is 54 at the node N23, a temporary label whose accumulated cost value is 69 at the node N34, a temporary label whose accumulated cost value is 54 at the node N43, and a node N32. And a losing label with a cumulative cost value of 53. The path-specific cost difference of the losing label given to the node N32 is 18 obtained by subtracting 35, which is the cost accumulated value of the confirmed label, from 53, which is the cost accumulated value of the losing label. Is 90. Therefore, the value obtained by adding the path-specific cost difference to 90 of the added cost is 108, which is larger than the allowable cost of 100, and therefore a similar route is not set.

  Similarly to the above, the label assigning unit 122 sets a node having the smallest cost accumulated value as a confirmed label, and assigns a temporary label or a losing label to an adjacent node. Then, when a similar route is set from the losing label given to the similar waiting node, the value obtained by adding the route-specific cost to the addition cost of the similar route becomes larger than the allowable cost, and thus the similar route is not set. As a result of repeating the above processing, although there is a temporary label (step S54 in FIG. 12: YES), all similar waiting nodes become nodes that do not wait for the loss label (step S55: NO), and FIG. ), The route search unit 120 ends the route search process. In FIG. 19A, the route search processing in the second embodiment is completed, and various types of processing are performed on all temporary labels, and the links and nodes after the route search processing are assigned to each node. A label and an example of a set similar route are shown. FIG. 19B shows the correspondence between the similar route shown in FIG. 19A and the addition cost of the similar route.

  As described above, in the server 100 according to the second embodiment, the label assigning unit 122 assigns a label to each node in consideration of the restriction of the traveling direction set for the link. The similar route setting unit 124 sets a similar route for each node based on the accumulated cost value of the given definite label and the accumulated cost value of the given losing label. For this reason, in the server 100 according to the second embodiment, a similar route is set in consideration of various restrictions set for the link, so an accurate route that can be reached from the start / end point SG and set at the start / end point SG is set. Is done.

  In the server 100 according to the second embodiment, the label assigning unit 122 sets a similar waiting node. When a certain node is a similar waiting node (step S65 in FIG. 13: YES), the similar route setting unit 124 Then, a similar route based on the losing label is set (step S66). When all the similar waiting nodes become nodes that do not wait for the loss label assignment (step S55 in FIG. 12: NO), the label assignment unit 122 does not assign a new label, and the route search process ends. . Therefore, in the server 100 according to the second embodiment, a label is not assigned to a node until a set allowable cost is exceeded, and useless label assignment is not performed, so a similar route is set quickly and efficiently.

C. Third embodiment:
In the third embodiment, the route search unit 120 is connected to a node or a link, specifies a facility to be used, and sets an allowable cost based on the specified facility. The similar route setting unit 124 newly sets a similar route based on the set allowable cost. FIG. 21 is an explanatory diagram showing an example of the positional relationship between nodes and links and each facility. FIG. 21A shows each node stored in the POI information DB 116, each link, the link cost of each link, and the facility connected to the node or link. FIG. 21B shows a list of facility names, facility classifications, facility contents, and average usage time when the facilities are used. For example, the facility A is a temple, and when used, the average usage time is 20 minutes. The average usage time corresponds to the facility usage cost in the claims.

  In the third embodiment, the mobile phone 200 has an allowable cost of 70 and is set for a route search condition that uses four or more facilities. As shown in FIG. 21 (a), when four facilities are used, the total value of the average usage time of the facilities requires a minimum of 20 minutes using the facilities B, C, E, and F as a minimum. is there. Therefore, the route search unit 120 sets the cost total value of the similar route to 50 or less obtained by subtracting 20 (minutes) from the allowable cost of 70.

  FIG. 22 is an explanatory diagram showing an outline of the allowable route updated based on the use facility. FIG. 22A shows a similar route set by the similar route setting unit 124 when the allowable cost is 50. Each of the similar paths is indicated by a thick line having arrows with different line types, and the cumulative value of the addition cost is also indicated. For example, when the facility F is used, 45 is obtained by adding 5 (minutes) of the average usage time of the facility F to 40 that is the cumulative value of the additional cost. Note that, in the third embodiment, a similar route may be narrowed down by regarding a dead end link that is not connected to a facility as an unnecessary link. In FIG. 22A, the link L35 is regarded as unnecessary and a cross is indicated on the link. As shown in FIG. 22A, the facility E cannot be used on a similar route having a cumulative cost value of 50 or less. For this reason, in FIG. 22B, “x” is shown above the facility E, indicating that the facility E cannot be used. Since the facility E cannot be used, the minimum total value of the average usage time of the facility is 25 minutes using the facilities B, C, D, and F. Therefore, the route search unit 120 sets the cost total value of the similar route to 45 obtained by subtracting 25 (minutes) from the allowable cost of 70.

  FIG. 22C shows a similar route newly set by the similar route setting unit 124 when the allowable cost is set to 45. As shown in FIG. 22 (c), it is shown that the similar route passing through the links L50 and L51 in which the accumulated cost value of the similar route is 46 cannot pass. The facility D that the link L50 is no longer included in the similar route can no longer be used, and FIG. 22D shows that the facility D cannot be used. When the facility D cannot be used, the minimum total value of the average usage time of the facility is 30 minutes using the facilities B, C, F, and G. Therefore, the route search unit 120 sets the cost accumulated value of the similar route to 40 obtained by subtracting 30 (minutes) from the allowable cost 70. The similar route setting unit 124 newly sets a similar route based on the newly set allowable cost. FIG. 22D shows a newly set similar route presented to the user.

  FIG. 23 is an explanatory diagram illustrating an example of a similar route presented to the user. FIG. 23 shows a similar route using 70 or more facilities with an allowable cost set for the mobile phone 200. This similar route is a route that starts from the start / end point SG and arrives at the start / end point SG using the facility G, the facility A, the facility C, and the facility B.

  As described above, in the server 100 according to the third embodiment, the similar route setting unit 124 sets a similar route based on the allowable cost and the average usage time of the facility stored in the POI information DB 116. For this reason, in the server 100 according to the third embodiment, a similar route is set by adding the time required to use the facility to the link cost of each link, so the arrival at the start / end point SG by the correct arrival time. A similar route is set.

  Further, in the server 100 in the third embodiment, the condition of the facility where the route search unit 120 is used is set, and a value obtained by subtracting the total value of the average use time of the facility from the allowable cost is set based on the set condition. Set as a new allowable cost. The similar path setting unit 124 sets a similar path that is a cumulative cost value that is less than or equal to the newly set allowable cost. Each of the route search unit 120 and the similar route setting unit 124 repeats the setting of the new allowable cost and the setting of the similar route based on the newly set allowable cost until the set facility condition is satisfied. Therefore, in the server 100 of the third embodiment, the similar route set based on the allowable cost based on the total value of the average usage time of the facility used until the similar route satisfying the set condition is set. Therefore, similar routes satisfying the conditions are set efficiently.

D. Fourth embodiment:
In the fourth embodiment, as compared with the above-described embodiment, when the start / end point SG is a station or a commercial facility having a plurality of entrances / exits, the route after specifying the entrance / exit in the start / end point SG is searched. The point is different. FIG. 24 is an explanatory diagram showing an outline of label assignment for each node in the fourth embodiment. FIG. 24 shows nodes and links in a state where the start / end point SG shown in FIG. 4 is enlarged. In the fourth embodiment, the start / end point SG is a train station, and includes a west ticket gate ET1 and a north ticket gate ET2, as shown in FIG. The start / end point SG includes a west entrance SG1 on the outer boundary of the west ticket gate ET1 and a north entrance SG2 outside the north ticket gate ET2. A straight line in the start / end point SG is a link in the station premises, and a circle in the start / end point SG is a node in the station premises. In the fourth embodiment, description of route search for nodes and links in the station premises is omitted.

  In the route search process of the fourth embodiment, first, the label assigning unit 122 of the route search unit 120 sets temporary labels at the west entrance SG1 and the north entrance SG2 as start and end points (step S11 in FIG. 2). When the same allowable cost as 100 in the first embodiment is set (step S12), temporary labels are given to the west entrance SG1 and the north entrance SG2 (step S13: YES), and therefore, as shown in FIG. Thus, the label provision part 122 sets the temporary label provided to the west entrance SG1 and the north exit SG2 to a definite label (step S14). In FIG. 24 (b), the confirmed labels given to the west entrance SG1 and the north entrance SG2 are shown with the accumulated cost values surrounded by squares.

  0, which is twice the accumulated cost of the confirmed labels assigned to the west entrance SG1 and the north entrance SG2, is smaller than the allowable cost 100 (NO in step S15), and is similar based on the confirmed labels of the west entrance SG1 and the north entrance SG2. Since there is no route (step S16), the label assigning unit 122 assigns a new label to the adjacent node from each of the west entrance SG1 and the north entrance SG2. Since the node N31 and the node N41 that are adjacent nodes of the west entrance SG1 and the north entrance SG2 are not given a definitive label (step S18: NO), and are not given a temporary label (step S19: NO) ), The label assigning unit 122 sets the new labels assigned to the adjacent nodes N31 and N41 as temporary labels (step S20). As shown in FIG. 24B, the temporary labels set in the node N31 and the node N41 have the accumulated cost value surrounded by a pentagon. The label assigning unit 122 sets a temporary label with a cost total value of 21 obtained by adding the link cost of the link L3 to the node N31 that is an adjacent node of the west entrance SG1. Similarly, the label assigning unit 122 sets a temporary label with a cumulative cost value of 10 obtained by adding the link cost of the link L1 to the node N41 that is an adjacent node of the north entrance SG2. Thereafter, the route search unit 120 assigns a label and sets a similar route, as in the first embodiment.

  FIG. 25 is an explanatory diagram showing an outline of labels given to each node and a part of set similar routes in the fourth embodiment. As shown in FIG. 25, similar routes corresponding to three types of accumulated cost values are set. One is a similar route that accompanies the passage of the link L1 indicated by a solid line, and is a similar route having a cost total value of 20 starting from the north entrance SG2 and turning back at the node N41. The other is a similar route that accompanies the passage of the link L2 indicated by the alternate long and short dash line, and starts from the north entrance SG2, passes through the link L1, the node N41, and the link L2, and accumulates the cost at the node N31. A similar path with a value of 40. The last one is a route associated with the passage of the link L3 indicated by a broken line, and starts from the west entrance SG1 and passes through the link L3, the node N31, the link L2, the node N41, and the link L1, and then goes to the north entrance. When arriving at SG2 and when arriving at the west entrance SG1 via the link L1, the node N41, the link L2, the node N31, the link L3, departing from the north entrance SG2 There are two similar routes with a total cost value of 41. This similar route of the accumulated cost value 41 can be said to be a route that starts from the same start / end point SG and then returns, but actually starts from one of two entrances that are different points and goes to the other. This is a return route.

  As described above, in the server 100 in the fourth embodiment, the label assigning unit 122 assigns labels to a plurality of nodes in the start / end point SG, and the similar route setting unit 124 is provided in the start / end point SG. A similar route is selected based on the label. Therefore, in the server 100 according to the fourth embodiment, even if the route returns after leaving the start / end point SG, a plurality of nodes in the start / end point SG can be identified and the route can be presented to the user. In other words, the user's conceptual desire to return to the same “location” can be presented with a flexible route that does not require returning to the exact same point, improving the convenience for the user. .

E. Variations:
The present invention is not limited to the above-described examples and embodiments, and can be implemented in various modes without departing from the gist thereof. For example, the following modifications are possible.

E1. Modification 1:
In the above embodiment, the user sets the start / end point SG by operating the operation unit 206 of the mobile phone 200. However, the start / end point SG and the input means for various settings are not limited thereto, and various modifications can be made. is there. For example, the mobile phone 200 may include a voice input unit that receives a voice input of the user, and various settings such as setting of the start / end SG may be performed by voice.

  In the above embodiment, the server 100 includes the information storage unit 110 and the route search unit 120 as illustrated in FIG. 1, but the apparatus including the information storage unit 110 and the route search unit 120 is not limited to this mode. Various modifications are possible. For example, the information storage unit 110 and the route search unit 120 may be provided in different servers, or the route search unit 120 may be mounted on the mobile phone 200. Further, the label assignment unit 122 and the similar route setting unit 124 in the route search unit 120 may be provided in different servers 100, respectively. Further, the map information DB 114 and the node-specific route information DB 115 may be stored in the same database.

  The present invention is not limited to the above-described embodiments and modifications, and can be realized with various configurations without departing from the spirit of the present invention. For example, the technical features in the embodiments and the modifications corresponding to the technical features in each form described in the summary section of the invention are to solve some or all of the above-described problems, or In order to achieve part or all of the effects, replacement or combination can be performed as appropriate. Further, if the technical feature is not described as essential in the present specification, it can be deleted as appropriate.

DESCRIPTION OF SYMBOLS 10 ... Route search system 100 ... Server 102 ... Communication part 110 ... Information storage part 116 ... POI information DB
DESCRIPTION OF SYMBOLS 118 ... Memory | storage device 120 ... Path | route search part 122 ... Label provision part 124 ... Similar path | route setting part 200 ... Mobile telephone 201 ... GPS receiver 202 ... Display panel 203 ... Audio | voice output part 205 ... Radio | wireless communication circuit 206 ... Operation part 206a ... Numeric keypad 206b ... Cursor key 210 ... Main control unit 211 ... CPU
220 ... Call control unit SG ... Start / end point GL ... Arrival point BS ... Base station A, B, C, D, E, F, G ... Facility INT ... Internet SG1 ... West entrance SG2 ... North entrance ET1 ... West ticket gate ET2 ... North Ticket gate

Claims (3)

A route search device for searching a route starting from a first point which is an arbitrary point on the network and arriving at the first point,
A path information storage unit for storing data for specifying nodes and links constituting the path, and data for specifying a link cost representing the time required for each link to pass;
A point setting unit for setting the first point;
A route cost setting unit that sets a route cost that is a cumulative value of link costs allowed from the first point to the arrival at the first point;
A label attaching unit that assigns a label to each of a plurality of specific nodes, wherein the label includes a cumulative value of a link cost in a specific route from the first point to the specific node; A label assigning unit including a previous label that is the label given to the immediately preceding node that is a node adjacent to the specific node via a link included in the route;
An allowable route setting unit that sets a route whose cumulative cost of a link starting from the first point and arriving at the first point is equal to or less than the route cost as an allowable route, and for a specific node, When the allowable route from the first point to the previous node is set based on the immediately preceding label, the new allowable route is set based on the set allowable route and the label assigned to the specific node. A route search device comprising: an allowable route setting unit that sets a route. The route search device according to claim 1,
The label assigning unit takes into account the restriction set based on the direction of the traveling direction for each link, and for each of the specific nodes, the adjacent node adjacent to the specific node from the specific node Give the label to the adjacent node through a link that can pass to
The permissible route setting unit is configured to determine the permissible path based on a minimum value and a value other than the minimum value among cumulative values of link costs included in a plurality of labels assigned to the specific nodes. A route search device for setting a route. The route search device according to claim 1 or 2 , further comprising:
A facility information storage unit that stores data identifying a facility associated with at least one of a node and a link, and data identifying a facility use cost representing a time required when the facility is used;
The allowable route setting unit is a route search device that sets the allowable route based on the route cost and the facility use cost associated with nodes and links included in the allowable route.

Images