Information processing device

Abstract

To determine the order of patrol when patrolling a plurality of stop-by destinations.SOLUTION: In a first cost calculation for determining the order of patrol when patrolling a plurality of stop-by destinations, for each of the plurality of stop-by destinations, the cost of a route in which the stop-by destination is located on a first side of traveling direction when departing from the stop-by destination is made to be higher than the cost of a route in which the stop-by destination is located on a second side of traveling direction when departing from the stop-by destination, and the cost of a route in which the stop-by destination is located on the first side of traveling direction when arriving at the stop-by destination is made to be higher than the cost of a route in which the stop-by destination is located on the second side of traveling direction when arriving at the stop-by destination.SELECTED DRAWING: Figure 8

Description

[Technical Field]

[0001] The present invention relates to an information processing device. [Background technology]

[0002] Patent Document 1 discloses a technique for determining the order of travel when visiting multiple destinations (waypoints). In the technique disclosed in Patent Document 1, the minimum cost is first calculated for each route between a starting point, a destination point, and two of the multiple destinations, and a cost matrix is ​​created that records the minimum cost for each route between the two points. Then, by adding up the minimum costs recorded in the cost matrix, the cost is calculated for each route that visits multiple destinations (a route that starts from the starting point, visits multiple destinations, and then arrives at the destination point), and the order of travel for the route with the lowest cost is determined as the order of travel when visiting the multiple destinations. [Prior art documents] [Patent documents]

[0003] [Patent Document 1] Japanese Patent Application Laid-Open No. 2001-91284 Summary of the Invention [Problem to be solved by the invention]

[0004] In the method disclosed in Patent Document 1, when calculating the minimum cost for each route between two points, the direction of travel when departing from a destination and the direction of travel when arriving at a destination were not taken into consideration. As a result, the direction of travel at a destination for the route with the lowest cost among routes arriving at a destination could be opposite to the direction of travel at the destination for the route with the lowest cost among routes departing from the destination. In other words, a route that requires a U-turn at a destination could be the lowest cost route. When traveling by mobile object, it is desirable to avoid routes that include U-turns.

[0005] One example of a problem to be solved by the present invention is determining the order in which to visit a plurality of destinations. [Means for solving the problem]

[0006] In order to solve the above problem, the invention described in claim 1 has a tour order determination unit that determines the order in which to visit a plurality of destinations by a first cost calculation, and in the first cost calculation, the tour order determination unit makes the cost of a route in which the destination is located on a first side of the traveling direction when departing from the destination higher than the cost of a route in which the destination is located on a second side of the traveling direction when departing from the destination, and makes the cost of a route in which the destination is located on the first side of the traveling direction when arriving at the destination higher than the cost of a route in which the destination is located on the second side of the traveling direction when arriving at the destination.

[0007] The invention described in claim 5 is an information processing method executed by a computer, comprising a tour order determination step of determining the order in which to visit a plurality of destinations by a first cost calculation, wherein in the first cost calculation, for each of the plurality of destinations, the cost of a route in which the destination is located on a first side of the traveling direction when departing from the destination is made higher than the cost of a route in which the destination is located on a second side of the traveling direction when departing from the destination, and the cost of a route in which the destination is located on the first side of the traveling direction when arriving at the destination is made higher than the cost of a route in which the destination is located on the second side of the traveling direction when arriving at the destination.

[0008] The invention described in claim 6 is an information processing program that causes a computer to execute the information processing method described in claim 5.

[0009] The invention described in claim 7 is a computer-readable storage medium storing the information processing program described in claim 6. [Brief explanation of the drawings]

[0010] [Figure 1] 1 is a diagram illustrating a route search device 100 according to an embodiment of the present invention. [Figure 2] FIG. 2 illustrates an example of a control unit 110. [Figure 3] 10 is a diagram showing an example of a processing operation executed by a control unit 110. FIG. [Figure 4] FIG. 10 illustrates an example of a circulating order determination unit 113. [Figure 5] 1 is a diagram illustrating an example of a departure point S, stops T1, T2, and T3, and a destination point D. FIG. [Figure 6] FIG. 10 is a diagram illustrating an example of the minimum cost for each route between two points. [Figure 7] FIG. 2 is a diagram illustrating an example of a route from a departure point S to a destination T1. [Figure 8] FIG. 2 is a diagram illustrating an example of a route from a departure point S to a destination T1. [Figure 9] FIG. 2 is a diagram illustrating an example of a route from destination T1 to destination T2. [Figure 10] FIG. 2 is a diagram illustrating an example of a route from destination T1 to destination T2. [Figure 11] FIG. 10 is a diagram showing an example of processing operations executed in the circulating order determination unit 113. DETAILED DESCRIPTION OF THE INVENTION

[0011] An information processing device according to an embodiment of the present invention includes a tour order determination unit that determines an order in which to visit a plurality of destinations by a first cost calculation. In the first cost calculation, the tour order determination unit, for each of the plurality of destinations, sets a higher cost for a route in which the destination is located on a first side of the traveling direction when departing from the destination than a cost for a route in which the destination is located on a second side of the traveling direction when departing from the destination, and sets a higher cost for a route in which the destination is located on the first side of the traveling direction when arriving at the destination than a cost for a route in which the destination is located on the second side of the traveling direction when arriving at the destination. The first side may be the right side, and the second side may be the left side. Therefore, in this embodiment, if the first side of the traveling direction is set to the right side, for example, a route in which the destination is arrived at while viewing the destination on the left side and departs while viewing the destination on the left side is likely to be extracted as the route with the lowest cost in the first cost calculation for determining the tour order. That is, in this embodiment, in the first cost calculation when determining the tour order, a route that does not include a U-turn is extracted as the route with the lowest cost.

[0012] The vehicle may further include a route determination unit that determines a route for visiting the plurality of stops in the determined order by a second cost calculation different from the first cost calculation, wherein the route determination unit uses at least one of congestion information and road regulation information in the second cost calculation. In the second cost calculation, the route determination unit may set, for each of the plurality of stops, a cost of a route in which the stop is located on the first side of the traveling direction when departing from the stop, higher than a cost of a route in which the stop is located on the second side of the traveling direction when departing from the stop, and may set a cost of a route in which the stop is located on the first side of the traveling direction when arriving at the stop, higher than a cost of a route in which the stop is located on the second side of the traveling direction when arriving at the stop. By doing this, for example, if the first side of the direction of travel is the right side, a route that arrives at each of the multiple destinations while seeing the destination on the left side and departs while seeing the destination on the left side will be determined as the route that travels around the multiple destinations.

[0013] An information processing method according to one embodiment of the present invention is a computer-executed information processing method, the computer-executed information processing method including a touring order determination step of determining an order for touring a plurality of destinations by a first cost calculation, wherein, for each of the plurality of destinations, the cost of a route in which the destination is located on a first side of the traveling direction when departing from the destination is set higher than the cost of a route in which the destination is located on a second side of the traveling direction when departing from the destination, and the cost of a route in which the destination is located on the first side of the traveling direction when arriving at the destination is set higher than the cost of a route in which the destination is located on the second side of the traveling direction when arriving at the destination. Therefore, in this embodiment, for example, if the first side of the traveling direction is the right side, then in the first cost calculation for determining the touring order, a route in which the destination is arrived at while looking to the left and departs while looking to the left is likely to be extracted as the route with the lowest cost. That is, in this embodiment, in the first cost calculation when determining the tour order, a route that does not include a U-turn is extracted as the route with the lowest cost.

[0014] An information processing program according to an embodiment of the present invention causes a computer to execute the above-described information processing method. Therefore, in this embodiment, in the first cost calculation when determining the tour order, a route that does not include a U-turn is extracted as the route with the lowest cost.

[0015] A storage medium according to one embodiment of the present invention stores the information processing program, which allows the information processing program to be distributed as a standalone program rather than being incorporated into a device, making it easy to perform version upgrades, etc. [Example]

[0016] <Travel route search device 100> FIG. 1 is a diagram showing a route search device 100 according to an embodiment of the present invention. Route search device 100 includes a control unit 110, an input unit 120, a storage unit 130, a communication unit 140, and an output unit 150. Route search device 100 is a device that searches for a route to be taken by a mobile object to visit multiple destinations, for example. Route search device 100 may be a device installed in the mobile object, or may be a device installed outside the mobile object.

[0017] The control unit 110 is an information processing device that processes information from a computer or the like. The input unit 120 is an input device that receives information input from a button, keyboard, touch panel, microphone, or the like. The storage unit 130 is a storage device that stores information, such as a memory, hard disk, or solid state drive. The communication unit 140 is a communication device that transmits and receives information to and from other devices. The output unit 150 is an output device that outputs information (an audio output device that outputs audio related to information, such as a speaker, or a display device that displays information, such as a display).

[0018] 2 is a diagram illustrating an example of the control unit 110. The control unit 110 includes a departure / destination information acquisition processing unit 111, a stop information acquisition processing unit 112, a tour order determination unit 113, a route determination unit 114, and an output processing unit 115.

[0019] The departure / destination information acquisition processing unit 111 acquires information about the departure point and the destination point. The departure point and the destination point may be the same point or different points. The departure / destination information acquisition processing unit 111 may, for example, acquire information about the departure point and the destination point input by the user to the input unit 120, or may acquire information about the departure point and the destination point stored in the storage unit 130, or may acquire information about the departure point and the destination point from another device (e.g., a mobile object) using communication with the communication unit 140.

[0020] The stop information acquisition processor 112 acquires information about points (stops) to be stopped at on the way from the departure point to the destination point. The stop information acquisition processor 112 may acquire information about stop information input by the user to the input unit 120, or may acquire information about stop information stored in the storage unit 130, or may acquire information about stop information from another device (e.g., a mobile object) using communication with the communication unit 140.

[0021] The visiting order determination unit 113 determines the order in which to visit the multiple destinations by a first cost calculation. In the first cost calculation, as described in detail below, the minimum cost is calculated for each route that travels between the departure point, the destination point, and two of the multiple destinations, and the cost is calculated for each route that visits the multiple destinations (a route that departs from the departure point, visits the multiple destinations, and arrives at the destination point) by adding up the calculated minimum costs, and the route with the lowest cost is extracted from the routes for which the cost has been calculated, and the visiting order for the extracted route with the lowest cost is determined as the order in which to visit the multiple destinations.

[0022] The route determination unit 114 uses the second cost calculation to determine a route for visiting the multiple destinations in the order determined by the visiting order determination unit 113. That is, the route determination unit 114 uses the second cost calculation to calculate the cost for each route for visiting the multiple destinations, extracts the route with the lowest cost from the routes for which the costs have been calculated, and determines the extracted route with the lowest cost as the route for visiting the multiple destinations in the order determined by the visiting order determination unit 113. The second cost calculation may be a cost calculation different from the first cost calculation, and may use information (e.g., traffic congestion information, road regulation information) that is not used in the first cost calculation.

[0023] The output processing unit 115 outputs information about the route determined by the route determination unit 114. The departure / destination information acquisition processing unit 111 may output information about the route from the output unit 150, or may output the route from an output device installed in another device using communication with another device (e.g., a mobile object) via the communication unit 140.

[0024] In this embodiment, in the first cost calculation, when calculating the cost for each route traveling between a starting point, a destination point, and two of a plurality of stops, for each of the plurality of stops, a route in which the stop is located on a first side of the direction of travel (e.g., the right side) when departing from the stop is given priority over a route in which the stop is located on a second side of the direction of travel (e.g., the left side) when departing from the stop, and a route in which the stop is located on the first side of the direction of travel when arriving at the stop is given priority over a route in which the stop is located on the second side of the direction of travel when arriving at the stop.

[0025] For example, in this embodiment, in the first cost calculation, when calculating the cost for each route traveling between a starting point, a destination point, and two of a plurality of stops, for each of the plurality of stops, the cost of a route in which the stop is located on the first side of the direction of travel when departing from the stop is set higher than the cost of a route in which the stop is located on the second side of the direction of travel when departing from the stop, and the cost of a route in which the stop is located on the first side of the direction of travel when arriving at the stop is set higher than the cost of a route in which the stop is located on the second side of the direction of travel when arriving at the stop.

[0026] For this reason, in this embodiment, if the first side of the direction of travel is the right side, for example, in the first cost calculation when determining the tour order, a route in which the destination is arrived at and departed from while looking at the destination on the left side is likely to be extracted as the route with the lowest cost. In other words, in this embodiment, in the first cost calculation when determining the tour order, a route that does not include a U-turn is extracted as the route with the lowest cost.

[0027] In the second cost calculation in the route determination unit 114, when calculating the cost for each route between the departure point, the destination point, and two of the multiple stops, for each of the multiple stops, the cost of a route in which the stop is located on a first side of the traveling direction when departing from the stop may be set higher than the cost of a route in which the stop is located on a second side of the traveling direction when departing from the stop, and the cost of a route in which the stop is located on the first side of the traveling direction when arriving at the stop may be set higher than the cost of a route in which the stop is located on the second side of the traveling direction when arriving at the stop. In this way, at each of the multiple stops, a route in which the stop is arrived at while looking at the stop on the left and departs while looking at the stop on the left is determined as the route that travels around the multiple stops.

[0028] 3 is a diagram showing an example of processing operations executed by the control unit 110. The departure / destination information acquisition processing unit 111 acquires information about the departure point and the destination, and the stop information acquisition processing unit 112 acquires information about the stop (step S301). The tour order determination unit 113 determines the order in which to visit the multiple stop (step S302). The route determination unit 114 determines a route for visiting the multiple stop in the order determined by the tour order determination unit 113 (step S303).

[0029] <Cycling order determining unit 113> The visiting order determination unit 113 includes, for example, a two-point route cost calculation unit 1131, a total route cost calculation unit 1132, and a determination unit 1133, as shown in FIG.

[0030] The two-point route cost calculation unit 1131 calculates the minimum cost for each route between the departure point, the destination point, and two points among the multiple stop-off points. At this time, the two-point route cost calculation unit 1131 calculates the cost for each of the departure point, the destination point, and two points among the multiple stop-off points for multiple routes between the two points, and sets the smallest value of the calculated costs as the minimum cost.

[0031] For example, as shown in Figure 5, when searching for a route from a starting point S to a destination point D after visiting three destinations T1, T2, and T3, the two-point route cost calculation unit 1131 calculates, as shown in Figure 6, the minimum cost Cs1 of the route from the starting point S to the destination T1, the minimum cost Cs2 of the route from the starting point S to the destination T2, the minimum cost Cs3 of the route from the starting point S to the destination T3, the minimum cost C12 of the route from the destination T1 to the destination T2, the minimum cost C13 of the route from the destination T1 to the destination T3, the minimum cost C1d of the route from the destination T1 to the destination point D, ..., the minimum cost C32 of the route from the destination T3 to the destination T2, and the minimum cost C3d of the route from the destination T3 to the destination point D.

[0032] At this time, when the two-point route cost calculation unit 1131 calculates the costs for multiple routes traveling between two points (i.e., in the first cost calculation), for each of multiple destinations, it sets the cost of a route in which the destination is located on the first side of the traveling direction when departing from the destination to be higher than the cost of a route in which the destination is located on the second side of the traveling direction when departing from the destination, and sets the cost of a route in which the destination is located on the first side of the traveling direction when arriving at the destination to be higher than the cost of a route in which the destination is located on the second side of the traveling direction when arriving at the destination.

[0033] For example, in the example shown in Fig. 5, when calculating the cost of a route from the departure point S to the destination T1, the two-point route cost calculation unit 1131 sets the cost of the route Rs1-1 in which the destination T1 is located on the right side of the traveling direction as shown in Fig. 7 to be higher than the cost Rs1-2 of the route in which the destination T1 is located on the left side of the traveling direction as shown in Fig. 8. Therefore, the route with the lowest cost among the routes from the departure point S to the destination T1 is the route in which the destination T1 is located on the left side of the traveling direction.

[0034] When calculating the cost of the route from destination T1 to destination T2, the two-point route cost calculation unit 1131 sets the cost of routes R12-1, R12-2, and R12-3, in which at least one of destinations T1 and T2 is located on the right side of the traveling direction, as shown in Fig. 9, to be higher than the cost of route R12-4, in which both destinations T1 and T2 are located on the left side of the traveling direction, as shown in Fig. 10. Therefore, the route with the lowest cost among the routes from destination T1 to destination T2 is the route in which both destinations T1 and T2 are located on the left side of the traveling direction.

[0035] The total route cost calculation unit 1132 calculates the cost for each route that visits multiple destinations (a route that starts from a starting point, visits multiple destinations, and then arrives at a destination point) by adding up the minimum costs calculated by the two-point route cost calculation unit 1131.

[0036] The determination unit 1133 extracts the route with the smallest cost from among the routes whose costs have been calculated by the total route cost calculation unit 1132, and determines the order of visiting the extracted route as the order of visiting the multiple destinations.

[0037] For example, in the example shown in FIG. 5, the total route cost calculation unit 1132 calculates the cost C123 (=Cs1+C12+C23+C3d) of the route R123 that visits the destinations in the order of T1-T2-T3, the cost C132 (=Cs1+C13+C32+C2d) of the route R132 that visits the destinations in the order of T1-T3-T2, the cost C231 (=Cs2+C2d) of the route R231 that visits the destinations in the order of T2-T3-T1, The cost C213 (=Cs2+C21+C13+C3d) of the route R213 that stops at destinations in the order of T2-T1-T3, the cost C312 (=Cs3+C31+C12+C3d) of the route R312 that stops at destinations in the order of T3-T1-T2, and the cost C321 (=Cs3+C32+C21+C1d) of the route R321 that stops at destinations in the order of T3-T2-T1 are calculated.

[0038] If the smallest cost among the calculated costs C123, C132, C231, C213, C312, and C321 is C123, the determination unit 1133 extracts the route R123 with the smallest cost from the routes R123, R132, R231, R213, R312, and R321 whose costs have been calculated. The determination unit 1133 then determines the visiting order T1-T2-T3 for the route R123 as the order for visiting the destinations T1, T2, and T3.

[0039] 11 is a diagram showing an example of processing operations executed by the visiting order determination unit 113. The two-point route cost calculation unit 1131 calculates the minimum cost for each route traveling between a departure point, a destination point, and two of the multiple destinations (step S1101). The total route cost calculation unit 1132 calculates the cost for each route visiting the multiple destinations by adding up the minimum costs calculated by the two-point route cost calculation unit 1131 (step S1102). The determination unit 1133 extracts the route with the smallest cost from the routes whose costs have been calculated by the total route cost calculation unit 1132, and determines the visiting order of the extracted route as the order for visiting the multiple destinations (step S1103).

[0040] The present invention has been described above in terms of preferred embodiments thereof. While the present invention has been described herein with reference to specific examples, various modifications and variations can be made to these examples without departing from the spirit and scope of the present invention as set forth in the claims. [Explanation of symbols]

[0041] 100 Circulating route search device 110 control section 111 Departure / destination information acquisition processing unit 112 Stopover information acquisition processing unit 113 Cycling order determination unit 1331 Two-Point Route Cost Calculation Unit 1332 Total Route Cost Calculation Unit 1333 Decision Section 114 Route determination unit 115 Output Processing Unit 120 Input section 130 Storage section 140 Communications Department 150 Output section

Claims

1. a visiting order determination unit that determines an order in which to visit the plurality of destinations based on the first cost calculation; The information processing device, in the first cost calculation, the tour order determination unit sets, for each of the plurality of destinations, the cost of a route in which the destination is located on a first side of the traveling direction when departing from the destination to be higher than the cost of a route in which the destination is located on a second side of the traveling direction when departing from the destination, and sets the cost of a route in which the destination is located on the first side of the traveling direction when arriving at the destination to be higher than the cost of a route in which the destination is located on the second side of the traveling direction when arriving at the destination.

2. the first side is the right side; The information processing device of claim 1 , wherein the second side is a left side.

3. a route determination unit that determines a route for visiting the plurality of destinations in the determined order by a second cost calculation that is different from the first cost calculation; The information processing device according to claim 1 , wherein the route determination unit uses at least one of congestion information and road regulation information in the second cost calculation.

4. 4. The information processing device according to claim 3, wherein, in the second cost calculation, the route determination unit sets, for each of the plurality of destinations, a cost of a route in which the destination is located on the first side of the traveling direction when departing from the destination to be higher than a cost of a route in which the destination is located on the second side of the traveling direction when departing from the destination, and sets a cost of a route in which the destination is located on the first side of the traveling direction when arriving at the destination to be higher than a cost of a route in which the destination is located on the second side of the traveling direction when arriving at the destination.

5. 1. A computer-implemented information processing method, comprising: a visiting order determination step of determining an order of visiting the plurality of destinations based on the first cost calculation; An information processing method, in which, in the first cost calculation, for each of the plurality of destinations, the cost of a route in which the destination is located on a first side of the direction of travel when departing from the destination is made higher than the cost of a route in which the destination is located on a second side of the direction of travel when departing from the destination, and the cost of a route in which the destination is located on the first side of the direction of travel when arriving at the destination is made higher than the cost of a route in which the destination is located on the second side of the direction of travel when arriving at the destination.

6. An information processing program that causes a computer to execute the information processing method according to claim 5.

7. A computer-readable storage medium storing the information processing program according to claim 6.

Images