Information processing device, generation method, and generation program
Patent Information
- Application Number
- JP2024545954
- Authority / Receiving Office
- JP · JP
- Patent Type
- Patents
- Current Assignee / Owner
- Filing Date
- 2023-01-05
- Publication Date
- 2024-12-03
- Estimated Expiration
- 2043-01-05
AI Technical Summary
Existing movement plans generated based on static movement costs may not be optimal due to varying travel costs over time, particularly influenced by factors like traffic congestion.
An information processing device generates a spatio-temporal graph that accounts for changing travel costs over time, using a processor to convert a point graph into a spatio-temporal graph, and employs a route search unit to find optimal routes considering current location, destination, and search conditions, followed by a plan generation unit to create an optimal movement plan.
The device generates an optimal movement plan that considers time-varying travel costs, ensuring the plan remains effective even when costs change, thereby improving efficiency and reducing unnecessary delays.
Abstract
Description
[Technical field]
[0001] The present disclosure relates to an information processing device, a generation method, and a generation program. [Background technology]
[0002] It is important to efficiently collect or deliver packages. Therefore, a plan must be made. When making a plan, factors such as collection time, delivery time, loading capacity of a moving object (e.g., a car), and congestion status of a collection area or a delivery area are taken into consideration. In some cases, a plan is made by solving an optimization problem. Note that an optimization problem is called a vehicle routing problem (VRP) or a delivery planning problem. In this regard, a technology for generating a delivery plan has been proposed (see Patent Document 1). [Prior art documents] [Patent documents]
[0003] [Patent Document 1] JP 2003-141222 A [Non-patent literature]
[0004] [Non-Patent Document 1] Mutsumi Iwaasa, Yuichiro Toda, Naoyuki Kubota, "Global Path Planning and Action Planning Using Spatio-Temporal Graphs in Environments with Predictable Moving Obstacles," Transactions of the Japan Society of Mechanical Engineers, 2019 Summary of the Invention [Problem to be solved by the invention]
[0005] Incidentally, when a plan (hereinafter, a movement plan) is generated, the movement plan may be generated based on a movement cost. The movement cost may change with time. For example, during a certain time period, traffic congestion occurs on a certain route. Therefore, during that time period, the movement cost increases. In this way, the movement cost may change with time. Therefore, when a movement plan is generated based on the movement cost at a certain point in time, the movement plan may not be optimal.
[0006] The objective of this disclosure is to generate an optimal movement plan. [Means for solving the problem]
[0007] An information processing device according to an embodiment of the present disclosure is provided. The information processing device includes an acquisition unit that acquires a generated spatio-temporal graph, first current location information indicating a first current location of an object, destination information indicating a destination, and search conditions based on a location graph including a plurality of nodes indicating a plurality of locations and a plurality of edges, a route search unit that searches for a route from the first current location to the destination using the spatio-temporal graph, the first current location information, the destination information, and the search conditions, and a plan generation unit that generates a movement plan for the object based on the route detected by the search. A plurality of movement costs are associated with the plurality of edges. At least one of the plurality of movement costs changes with time. Effect of the Invention
[0008] According to the present disclosure, an optimal travel plan can be generated. [Brief description of the drawings]
[0009] [Figure 1] FIG. 2 is a diagram showing an overview of a space-time graph according to the first embodiment. [Diagram 2] FIG. 2 is a diagram illustrating hardware included in an information processing device according to the first embodiment. [Diagram 3] 1 is a block diagram showing functions of an information processing device according to a first embodiment; [Figure 4] 13A and 13B are diagrams (part 1) illustrating a specific example of the process of generating a spatio-temporal graph according to the first embodiment. [Diagram 5] FIG. 2 is a diagram (part 2) illustrating a specific example of the generation process of the spatio-temporal graph according to the first embodiment. [Figure 6] FIG. 4 is a diagram showing a specific example of a route search in the first embodiment. [Figure 7] FIG. 4 is a diagram showing a specific example of the conversion process according to the first embodiment. [Figure 8] 4 is a flowchart showing an example of processing executed by the information processing device according to the first embodiment. [Figure 9] FIG. 2 is a diagram for explaining the effect of the first embodiment. [Figure 10] FIG. 11 is a diagram showing a specific example of a search abort process according to the second embodiment. [Figure 11] FIG. 11 is a block diagram showing the functions of an information processing device according to a third embodiment. [Figure 12] FIG. 13 is a diagram illustrating a specific example of a process of changing a movement plan in the third embodiment. [Figure 13] FIG. 13 is a diagram showing a specific example of a change process according to the fourth embodiment. DETAILED DESCRIPTION OF THE PREFERRED EMBODIMENTS
[0010] Hereinafter, an embodiment will be described with reference to the drawings. The following embodiment is merely an example, and various modifications are possible within the scope of the present disclosure.
[0011] Embodiment 1 In the following description, a space-time graph will be used. Before describing the first embodiment in detail, a space-time graph will be briefly described. FIG. 1 is a diagram showing an overview of a space-time graph according to the first embodiment. First, the upper diagram in FIG. 1 shows a normal graph. This graph is called a point graph. A point graph indicates geographical information. A point graph includes multiple nodes indicating multiple points and multiple edges. A point graph may be expressed as being composed of multiple nodes indicating multiple points and multiple edges. Multiple edges are associated with multiple travel costs. The travel cost indicates the time required for travel. For example, node v 1 From node v 2 The cost of moving to node v is 1. “1” represents 1 time. For example, 1 time means 10 minutes, 1 hour, etc. 1 From node v 3 The cost of moving to node v is 3. 1 From node v 3 It takes 3 hours to move to.
[0012] The bottom diagram in Figure 1 shows a space-time graph. The bottom diagram in Figure 1 shows the point graph converted into a space-time graph. The space-time graph also shows the state of the point graph over a period of five time periods. "t=0" represents the present time. The positive direction of the time axis indicates the future.
[0013] Each node in the space-time graph represents a node in the location graph at a certain time. For example, v 1,2 is the node v at time 2. 1 Between nodes in the space-time graph, the travel cost of the location graph is represented by a directed edge in the positive direction. For example, node v 1 From node v 3 The cost of moving to node v is 3. 1,0 and node v 3,3 and are connected by a directed edge. Also, if you stay in a place, a time cost will be incurred. The fact that a time cost is incurred when staying is expressed in a space-time graph. For example, if you stay in node v1 for one time, node v 1,0 and node v 1,1are connected by a directed edge. The cost of one time spent staying is equivalent to the travel cost of "1". In this way, the cost of the time spent staying is included in the travel cost. In a space-time graph, it is not possible to go back in time. Also, in a space-time graph, it is not possible to travel to a distant point with a cost of "0".
[0014] Here, Non-Patent Document 1 describes a space-time graph. The space-time graph in Non-Patent Document 1 is a multidimensional structure in which the horizontal direction indicates the extent of physical space and the vertical direction indicates the axis of time passage. However, the space-time graph in Non-Patent Document 1 is different from the space-time graph in FIG.
[0015] Next, an information processing device capable of generating a spatiotemporal graph will be described. First, the hardware included in the information processing device will be described. 2 is a diagram showing hardware included in the information processing device of embodiment 1. The information processing device 100 is a device that executes the generation method. The information processing device 100 includes a processor 101, a volatile storage device 102, a non-volatile storage device 103, and an input device 104.
[0016] The processor 101 controls the entire information processing device 100. For example, the processor 101 is a central processing unit (CPU) or a field programmable gate array (FPGA). The processor 101 may be a multiprocessor. The information processing device 100 may also include a processing circuit.
[0017] The volatile storage device 102 is a main storage device of the information processing device 100. For example, the volatile storage device 102 is a random access memory (RAM). The non-volatile storage device 103 is an auxiliary storage device of the information processing device 100. For example, the non-volatile storage device 103 is a hard disk drive (HDD) or a solid state drive (SSD).
[0018] The input device 104 is a device for inputting commands and the like to the information processing device 100. The input device 104 may be present outside the information processing device 100.
[0019] Next, functions of the information processing device 100 will be described. 3 is a block diagram showing functions of the information processing device of embodiment 1. The information processing device 100 has a storage unit 110, an acquisition unit 120, a graph generation unit 130, a route search unit 140, a plan generation unit 150, a conversion unit 160, and an output unit 170.
[0020] The storage unit 110 may be realized as a storage area secured in the volatile storage device 102 or the non-volatile storage device 103 . A part or all of the acquisition unit 120, the graph generation unit 130, the route search unit 140, the plan generation unit 150, the conversion unit 160, and the output unit 170 may be realized by a processing circuit. Also, a part or all of the acquisition unit 120, the graph generation unit 130, the route search unit 140, the plan generation unit 150, the conversion unit 160, and the output unit 170 may be realized as a module of a program executed by the processor 101. For example, the program executed by the processor 101 is also called a generation program. For example, the generation program is recorded on a recording medium.
[0021] The acquisition unit 120 may acquire the point graph. For example, the acquisition unit 120 acquires the point graph from the storage unit 110. Also, for example, the acquisition unit 120 acquires the point graph from an external device. Note that, for example, the external device is a cloud server. Illustration of the external device is omitted.
[0022] The graph generating unit 130 generates a spatio-temporal graph based on the point graph. The process of generating the spatio-temporal graph will be described with reference to the drawings. 4A and 4B are diagrams (part 1) showing a specific example of the generation process of the spatio-temporal graph according to the first embodiment. 1 and node v 2 The point graph shows that the node v 1 From node v2 Also, the location graph shows that we can move to node v 2 From node v 1 This shows that we can move to node v. 1 and node v 2 The travel cost between node v and node v is 1. The graph generation unit 130 connects the state traveled to one time later with a directed edge. 1,0 and node v 2,1 The graph generation unit 130 connects the node v 2,0 and node v 1,1 In addition, the graph generation unit 130 connects the states that remain stagnant after one time with a directed edge. That is, the graph generation unit 130 connects the states of the node v 1,0 and node v 1,1 The graph generation unit 130 connects the node v 2,0 and node v 2,1 This creates the space-time graph shown on the right side of Figure 4(A).
[0023] Figure 4(B) shows the node v in the location graph. 1 and node v 2 Node v 1 From node v 2 The cost of moving to node v is 1. 2 From node v 1 The travel cost to is 2. The graph generation unit 130 generates a space-time graph based on the point graph. As a result, the space-time graph shown in the right diagram of FIG. 4(B) is generated.
[0024] FIG. 5 is a diagram (part 2) showing a specific example of the generation process of the spatio-temporal graph in the first embodiment. The point graph in FIG. 5 shows a case where the travel cost changes with time. When time t is 0, node v 1 and node v 2 The travel cost between node v and node t is 1. 1 and node v 2The travel cost between is 2. For example, the travel cost changes depending on the time when traffic congestion occurs depending on the time.
[0025] The graph generation unit 130 generates a space-time graph based on the point graph. As a result, the space-time graph shown on the right side of FIG. 5 is generated. As shown in the space-time graph, at time t1, the travel cost changes to 2, so that the node v 1,1 and node v 2,3 and are connected by a directed edge. Also, node v 2,1 and node v 1,3 and are connected by a directed edge.
[0026] In this way, the graph generating unit 130 generates a time-space graph based on the location graph. At least one of the multiple travel costs included in the location graph varies with time. At least one of the multiple travel costs included in the location graph may be expressed as varying with the time period. The graph generating unit 130 may store the time-space graph in the storage unit 110. Also, the graph generating unit 130 may store the time-space graph in an external device.
[0027] The acquiring unit 120 may acquire the spatio-temporal graph from the graph generating unit 130. Furthermore, the acquiring unit 120 may acquire the spatio-temporal graph from the storage unit 110 or an external device.
[0028] Next, a route search using a space-time graph will be described. The acquisition unit 120 acquires current location information. The current location information indicates the current location of an object. Here, the current location information is also referred to as first current location information. The current location is also referred to as the first current location. In addition, for example, the object is a person, a moving object (e.g., a car), etc. The acquisition unit 120 acquires destination information. The destination information indicates a destination.
[0029] The acquiring unit 120 acquires the search conditions. For example, the acquiring unit 120 acquires the search conditions input by a user operation. Also, for example, if the search conditions are determined in advance, the acquiring unit 120 acquires the search conditions from the storage unit 110.
[0030] The route search unit 140 searches for a route from the current location to the destination using the time-space graph, the current location information, the destination information, and the search conditions. The route search will be described using a specific example.
[0031] FIG. 6 is a diagram showing a specific example of a route search according to the first embodiment. For example, when a node v 1 The destination is the node v. 4 The route search unit 140 searches for the node v 1,0 The starting point is indicated by a circle 10 in Fig. 6. The destination is node v 4,t (t>0). That is, the destination is any node in frame 11.
[0032] A case where the search condition is to search for the shortest route will be described. When searching for the shortest route, the route search unit 140 searches for a route whose time t is close to "0". Then, the route search unit 140 searches for a route whose time t is close to "0". 1,0 , node v 2,1 , node v 3,2 , node v 4,4 (i.e., dashed line 12).
[0033] Let us consider the case where an arrival condition is set in the search condition. For example, the arrival condition is “5” or later. Therefore, the destination is node v. 4,t (t≧5). The route search unit 140 performs a search. Then, the route search unit 140 searches for a node v 1,0 , node v 3,3 , node v 4,5 (i.e., dashed line 13).
[0034] Also, for example, a search condition is that the number of transit points is equal to or less than a certain number.
[0035] The route search unit 140 may perform the search using a known technique, for example, a breadth-first search.
[0036] If no route that satisfies the search condition is found, the route search unit 140 uses the time-space graph to find a route that is closest to the search condition. For example, the search condition is set to an arrival condition of "3" or less. Therefore, the destination is the node v 4,t (t≦3). However, there is no route that satisfies the search condition. Therefore, the route search unit 140 detects the route (that is, the dashed line 12) that is closest to the search condition.
[0037] The plan generating unit 150 generates a movement plan for the object based on the route detected by the search. The sentence may include the following meaning. As described later, the conversion unit 160 may convert the detected route into a route in a point graph. The plan generating unit 150 may generate a movement plan for the object based on the point graph. The generation of the movement plan will be specifically described.
[0038] When the search condition is to search for the shortest path, the plan generating unit 150 1 , node v 2 , node v 3 , node v 4 If the search condition is set to arrive at node v on or after “5”, the plan generation unit 150 generates a travel plan indicating a route to node v. 1 Wait for 2 seconds, and then wait for node v 3 , node v 4 A travel plan is generated that indicates travel along the route.
[0039] The conversion unit 160 may convert the route detected by the search into a route in a point graph. In other words, the conversion unit 160 may convert the route detected by the route search unit 140 into a route in a point graph. The conversion process will be described with reference to the drawings.
[0040] FIG. 7 is a diagram showing a specific example of the conversion process according to the first embodiment. The dashed line 12 indicates the node v 1,0, node v 2,1 , node v 3,2 , node v 4,4 The conversion unit 160 converts the path of the dashed line 12 into a path that follows the node v 1 , node v 2 , node v 3 , node v 4 In addition, the conversion unit 160 associates movement costs with edges of the point graph based on the route of the dashed line 12.
[0041] Also, the dashed line 13 indicates the node v 1,0 , node v 3,3 , node v 4,5 The conversion unit 160 converts the path of the dashed line 13 into a path that follows the node v 1 , node v 3 , node v 4 In addition, the conversion unit 160 associates movement costs with edges of the point graph based on the route of the chain line 13.
[0042] The plan generating unit 150 may generate a travel plan based on the point graph. For example, when the search condition is a search for the shortest route, the plan generating unit 150 may generate a travel plan based on the point graph. 1 , node v 2 , node v 3 , node v 4 A travel plan is generated that shows the route of the
[0043] The output unit 170 outputs the movement plan. For example, the output unit 170 outputs the movement plan to a display connected to the information processing device 100. Also, for example, the output unit 170 outputs the movement plan to an external device.
[0044] Next, the process executed by the information processing device 100 will be described with reference to a flowchart. FIG. 8 is a flowchart illustrating an example of processing executed by the information processing device according to the first embodiment. (Step S11) The acquisition unit 120 acquires a point graph. (Step S12) The graph generating unit 130 generates a space-time graph based on the point graph. (Step S13) The acquisition unit 120 acquires current location information, destination information, and search conditions.
[0045] (Step S14) The route search unit 140 searches for a route from the current location to the destination using the space-time graph, the current location information, the destination information, and the search conditions. (Step S15) The route search unit 140 determines whether or not a route that satisfies the search conditions is detected. If a route that satisfies the search conditions is not detected, the process proceeds to step S16. If a route that satisfies the search conditions is detected, the process proceeds to step S17. (Step S16) The route search unit 140 uses the space-time graph to detect a route that is closest to the search condition.
[0046] (Step S17) The conversion unit 160 converts the route detected by the search into a route in a point graph. (Step S18) The plan generating unit 150 generates a movement plan based on the point graph. (Step S19) The output unit 170 outputs the movement plan.
[0047] Next, the effects will be explained with reference to the drawings. FIG. 9 is a diagram for explaining the effect of the first embodiment. The movement cost changes with time. The upper diagram of FIG. 9 shows the situation at the current time (i.e., time t=0). The upper diagram of FIG. 9 also shows the situation at the next time (i.e., time t=1). At “time t=1”, node v 2 and node v 3 The travel cost between node v and node v changes from 1 to 3. 1 and node v 3 The travel cost between v and v changes from 3 to 1. In this way, the effect of the first embodiment will be explained using a point graph that changes with time. In the following explanation, a case where the shortest route is searched will be explained. Note that the current location is node v. 1 The destination is node v. 4Also, assume that the car moves from its current location to its destination.
[0048] Conventionally, the shortest path is searched for based on the travel cost at the current time (i.e., time t=0). 1 , node v 2 , node v 3 , node v 4 The travel cost of the path (i.e., the path of dashed line 21) is 3. 1 , node v 3 , node v 4 The travel cost of the route indicated by dashed line 21 is 4. As the travel cost of the route indicated by dashed line 21 is the smallest, the route indicated by dashed line 21 is detected as the shortest route. A travel plan showing the route indicated by dashed line 21 is then generated. However, at "time t=1", the travel cost of the route indicated by dashed line 21 changes to 5. Therefore, the route indicated by dashed line 21 cannot be said to be the shortest route. In this way, when a travel plan is generated based on the travel cost at a certain point in time, the travel plan may not be optimal.
[0049] On the other hand, the information processing device 100 searches for the shortest route using the space-time graph. The information processing device 100 detects the route of the dashed line 22 as the shortest route. That is, the car travels between the node v 1 After waiting, the car waits at node v 3 and node v 4 Such a route is detected as the shortest route. The lower diagram in FIG. 9 shows the detected route converted into a route in the point graph. The converted route is the route indicated by the dashed line 23. The travel cost of the route indicated by the dashed line 23 is the travel cost associated with waiting, “1”, and the travel cost associated with the node v 1 , node v 3 , node v 4 This is the sum of the cost of travel of the route indicated by dashed line 23, which is "2." In other words, the cost of travel of the route indicated by dashed line 23 is "3." Therefore, the cost of travel of the route indicated by dashed line 23 is smaller than the conventional travel cost.
[0050] According to the first embodiment, the space-time graph is a graph that takes into consideration the case where the travel cost changes with time. Therefore, the travel plan generated based on the space-time graph takes into consideration the case where the travel cost changes with time. Therefore, the travel plan is an optimal travel plan. Therefore, the information processing device 100 can generate an optimal travel plan.
[0051] In the above, a case has been shown in which nodes of a point graph are represented in two dimensions. For example, a node represented in two dimensions is a node represented by latitude and longitude. A node of a point graph may be represented in three dimensions. For example, a node represented in three dimensions is a node represented by latitude, longitude, and altitude. The information processing device 100 may generate a space-time graph based on a point graph including nodes represented in three dimensions. The information processing device 100 may generate a movement plan based on the space-time graph. For example, the movement plan is a movement plan for an air vehicle such as a drone.
[0052] Furthermore, one or more nodes in the location graph may appear over time. One or more nodes in the location graph may disappear over time. One or more nodes in the location graph may change to a different position over time. These nodes occur in the following situations. For example, a situation in which luggage is delivered to a user who changes his / her location at a travel destination. The user's position (i.e., the node) appears in an area indicated by the location graph at a certain point in time. As the user moves, the node changes to a different position. As the user moves out of the area, the node disappears from the location graph. Another example is a situation in which delivery is made to replenish products in a mobile sales vehicle. Even in this situation, the appearance of a node occurs. The information processing device 100 may generate a space-time graph based on the location graph in which the appearance of a node occurs. Furthermore, the information processing device 100 may generate a movement plan based on the space-time graph.
[0053] Embodiment 2 Next, a description will be given of embodiment 2. In embodiment 2, differences from embodiment 1 will be mainly described. In embodiment 2, descriptions of matters common to embodiment 1 will be omitted. When the search condition is a search for the shortest route and a route that reaches the destination is detected during the search for the shortest route, the route search unit 140 stops searching for a route that does not reach the destination at a time before the time that the detected route reaches the destination. The process will be specifically described with reference to the drawings.
[0054] FIG. 10 is a diagram showing a specific example of a search termination process according to the second embodiment. 4 The destination is any node in the frame 31. The search condition is to search for the shortest route.
[0055] During the search for the shortest route, the route search unit 140 detects a route 32 that reaches the destination. The time at which the destination is reached on the route 32 is t0. A route that does not reach the destination before time t0 is not the shortest route. Therefore, the route search unit 140 stops searching for such a route.
[0056] For example, path 33 is 1,t1 The route 33 passes through the following points. Time t1 is earlier than time t0. Therefore, the route 33 may reach the destination at a time earlier than time t0. Therefore, the route searching unit 140 does not stop searching the route 33.
[0057] Path 34 is node v 2,t0 On the route 34, the time becomes t0 before the destination is reached. Therefore, the route 34 does not reach the destination before the time t0. Therefore, the route searching unit 140 stops searching the route 34.
[0058] Route 35 is node v 3,t3 The time t3 is later than the time t0. Therefore, the route 35 does not reach the destination before the time t0. Therefore, the route searching unit 140 stops searching for the route 35.
[0059] In this way, the routes 34 and 35 are not the shortest routes. Therefore, the route search unit 140 stops searching the routes 34 and 35. By stopping the search, the information processing device 100 can reduce the calculation time.
[0060] Furthermore, the route search unit 140 may execute the following process. When the search condition is a search for the shortest route, and when the route search unit 140 detects a route that reaches the destination during the search for the shortest route, the route search unit 140 stops searching for a route that includes more nodes than the number of nodes included in the detected route. For example, the number of nodes included in the route 32 is assumed to be 5. The route search unit 140 stops searching for the route 33 when the number of nodes included in the route 33 exceeds 5. The fact that the number of nodes included in the route 33 exceeds 5 means that the route 33 is not the shortest route. Therefore, the route search unit 140 stops searching for the route 33. This allows the information processing device 100 to reduce the calculation time.
[0061] Embodiment 3 Next, a description will be given of embodiment 3. In embodiment 3, differences from embodiment 1 will be mainly described. In embodiment 3, descriptions of matters common to embodiment 1 will be omitted.
[0062] 11 is a block diagram showing functions of an information processing device according to embodiment 3. The information processing device 100 further includes a graph adding unit 180. As shown in FIG. A part or the whole of the graph adding unit 180 may be realized by a processing circuit. Also, a part or the whole of the graph adding unit 180 may be realized as a module of a program executed by the processor 101. The function of the graph adding unit 180 will be described in detail later.
[0063] After the movement plan is generated by the information processing device 100, movement is performed based on the movement plan. During movement, a change may occur to the movement plan. For example, the destination is changed. Also, for example, the arrival condition is changed. For example, the arrival condition is changed from time t4 to time t3. In the third embodiment, a case where a change occurs to the movement plan will be described. The third embodiment will be described with reference to the drawings.
[0064] FIG. 12 is a diagram showing a specific example of a process of changing a moving plan in the third embodiment. The diagram in the upper left of FIG. 12 shows a case where a car moves based on a moving plan. The time t is 0. The current location is node v. 1 The destination is node v. 2 Node v 1 and node v 2 The cost of moving between is 3.
[0065] The diagram in the upper right of FIG. 12 shows a situation where time t is 1. Here, it is assumed that a change has occurred in the travel plan. The acquisition unit 120 acquires the change content. For example, the acquisition unit 120 acquires the change content input by a user operation. Also, for example, the acquisition unit 120 acquires the change content from an external device. Note that, for example, the change content is content indicating a change in the destination, content indicating a change in the arrival conditions, etc. The acquisition unit 120 acquires current location information indicating the current location of the car. This current location is also referred to as a second current location. This current location information is also referred to as second current location information. In FIG. 12, the current location of the car is stored in node v. a1 It is.
[0066] The graph addition unit 180 adds the current location information to the spatio-temporal graph. a1,1 has been added to the space-time graph. The graph addition unit 180 may add a directed edge 41 to the space-time graph in order to return the car to the starting point. The route search unit 140 determines the current location (i.e., node v) based on the change and the space-time graph. a1,1 ) to the destination. That is, the route search unit 140 searches for a route according to the changes.
[0067] The plan generation unit 150 generates a new moving plan based on the route detected by the search. Note that the starting point of the moving plan is the current location (i.e., node v a1 ). The output unit 170 outputs the movement plan.
[0068] According to the third embodiment, the information processing device 100 can generate an optimal moving plan even when a change occurs in the moving plan.
[0069] Embodiment 4 Next, a fourth embodiment will be described. In the fourth embodiment, differences from the first embodiment will be mainly described. In the fourth embodiment, descriptions of the same matters as the first embodiment will be omitted.
[0070] If the routes detected by the search include a route that returns to the same point, the route search unit 140 changes the route so that the vehicle waits. The change process will be described with reference to the drawings.
[0071] FIG. 13 is a diagram showing a specific example of the change process according to the fourth embodiment. FIG. 13 shows a route 51 detected by the route search unit 140. The route 51 is a route between a node v 1,0 , node v 2,1 , node v 1,2 , node v 3,3 If the route 51 is represented as a point graph, the route 51 is 1 , node v 2 , node v 1 , node v 3 Path 51 includes node v 1In other words, route 51 includes a route that returns to the same point. Returning to the same point is a heavy burden. For example, if the object is a car, the burden on the driver is heavy. Also, for example, if the object is a person, the burden of moving the person is heavy. Also, if the object is a mobile object, returning to the same point means that the mobile object's fuel consumption is wasted. In this way, returning to the same point is undesirable. Therefore, route search unit 140 changes the route so as to wait. Specifically, route search unit 140 changes the route so as to wait for node v. 1 13 shows the modified route 52.
[0072] The plan generating unit 150 generates a movement plan based on the changed route. Specifically, the plan generating unit 150 generates a movement plan based on the route 52.
[0073] According to the fourth embodiment, the information processing device 100 can reduce the burden. Furthermore, if the object is a moving object, the information processing device 100 can reduce fuel consumption.
[0074] The features of each of the embodiments described above can be combined with each other as appropriate. [Explanation of symbols]
[0075] 10 circle, 11 frame, 12 dashed line, 13 chain line, 21 dashed line, 22 dashed line, 23 dashed line, 31 frame, 32 route, 33 route, 34 route, 35 route, 41 directed edge, 51 route, 52 route, 100 information processing device, 101 processor, 102 volatile storage device, 103 non-volatile storage device, 104 input device, 110 memory unit, 120 acquisition unit, 130 graph generation unit, 140 route search unit, 150 plan generation unit, 160 conversion unit, 170 output unit, 180 graph addition unit.
Claims
1. an acquisition unit that acquires the generated space-time graph, first current location information indicating a first current location of the object, destination information indicating a destination, and a search condition based on a location graph including a plurality of nodes and a plurality of edges indicating a plurality of locations; a route search unit that searches for a route from the first current location to the destination by using the time-space graph, the first current location information, the destination information, and the search condition; a plan generation unit that generates a movement plan for the object based on a route detected by the search; having A plurality of movement costs are associated with the plurality of edges; At least one of the plurality of travel costs varies with time. Information processing device.
2. A graph generating unit is further included, The acquisition unit acquires the point graph, The graph generation unit generates the space-time graph based on the point graph. The information processing device according to claim 1 .
3. A conversion unit converts a route detected by the search into a route in the point graph, The plan generation unit generates the movement plan based on the point graph.
3. The information processing device according to claim 1 or 2.
4. Each of the plurality of nodes is a node represented in three dimensions.
3. The information processing device according to claim 1 or 2.
5. One or more of the nodes of the plurality of nodes are nodes that appear, disappear, or change to different positions over time.
3. The information processing device according to claim 1 or 2.
6. the route search unit, when the search condition is a search for a shortest route and a route that reaches the destination is detected during the search for the shortest route, terminates the search for a route that does not reach the destination at a time prior to the time at which the detected route reaches the destination; 3. The information processing device according to claim 1 or 2.
7. the route search unit, when the search condition is a search for a shortest route and a route that reaches the destination is detected during the search for the shortest route, stops searching for a route that includes more nodes than the number of nodes included in the detected route; 3. The information processing device according to claim 1 or 2.
8. the route search unit changes the route so as to wait when a route that returns to the same point is included in the routes detected by the search; The plan generation unit generates a movement plan for the object based on the changed route.
3. The information processing device according to claim 1 or 2.
9. A graph adding unit is further included, The acquisition unit acquires, after the movement plan is generated, a change content and second current location information indicating a second current location of the object; The graph addition unit adds the second current location information to the spatio-temporal graph; The route search unit searches for a route from the second current location to the destination based on the change content and the space-time graph; and The plan generation unit regenerates a movement plan for the object based on the route detected by the search.
3. The information processing device according to claim 1 or 2.
10. Further comprising an output unit that outputs the movement plan.
3. The information processing device according to claim 1 or 2.
11. An information processing device, Based on a location graph including a plurality of nodes and a plurality of edges indicating a plurality of locations, a generated space-time graph, first current location information indicating a first current location of the object, destination information indicating a destination, and a search condition are obtained; searching for a route from the first current location to the destination using the space-time graph, the first current location information, the destination information, and the search conditions; generating a movement plan for the object based on the path detected by the search; A plurality of movement costs are associated with the plurality of edges; At least one of the plurality of travel costs varies with time. Generation method.
12. In the information processing device, Based on a location graph including a plurality of nodes and a plurality of edges indicating a plurality of locations, a generated space-time graph, first current location information indicating a first current location of the object, destination information indicating a destination, and a search condition are obtained; searching for a route from the first current location to the destination using the space-time graph, the first current location information, the destination information, and the search conditions; generating a movement plan for the object based on the path detected by the search; A generator program that performs processing, A plurality of movement costs are associated with the plurality of edges; At least one of the plurality of travel costs varies with time. Generator.
