Information processing device, information processing method, and program
By dividing movement areas into zones and generating travel plans within each zone, the system efficiently prevents collisions and deadlocks among multiple moving objects, addressing computational challenges and enabling faster plan generation.
Patent Information
- Application Number
- JP2024038594
- Authority / Receiving Office
- JP · JP
- Patent Type
- Patents
- Current Assignee / Owner
- Filing Date
- 2024-03-13
- Publication Date
- 2024-12-09
- Estimated Expiration
- 2044-03-13
AI Technical Summary
Existing technologies face challenges in generating movement plans for multiple moving objects in a narrow area efficiently, leading to collisions and deadlocks due to high computational load and real-time management difficulties as the scale increases.
The system divides the movement area into zones and generates travel plans independently for each zone, adjusting boundaries to ensure conflict-free movement by specifying the timing of object movements within each zone, thereby reducing computational load and enabling faster plan generation.
This approach allows for efficient and rapid generation of movement plans that prevent collisions and deadlocks, even in large areas, by parallel processing of travel plans within zones, ensuring real-time management of multiple moving objects.
Smart Images

Figure 0007596576000001_ABST
Abstract
Description
[Technical field]
[0001] An embodiment of the present invention relates to an information processing device, an information processing method, and a program. [Background technology]
[0002] When multiple moving objects, such as mobile objects, mobile robots, and autonomous vehicles, are moved simultaneously within a small area, if each moving object moves along a free path and at a free timing, conflicts between the moving objects, such as collisions and deadlocks, may occur.
[0003] To avoid such conflicts, a technology has been proposed that generates detailed driving plans for all moving bodies at once, and then iteratively replans the driving plans so that no conflicts occur for a certain period of time into the future. [Prior art documents] [Patent documents]
[0004] [Patent Document 1] Patent No. 7228420 [Patent Document 2] Patent No. 7204631 [Patent Document 3] Patent Publication No. 2021-071891 [Patent Document 4] Patent Publication No. 2021-149216 [Patent Document 5] Patent Publication No. 2021-184210 Summary of the Invention [Problem to be solved by the invention]
[0005] An object of the present invention is to provide an information processing device, an information processing method, and a program that can generate a movement plan for a moving object at a higher speed. [Means for solving the problem]
[0006] An information processing device according to an embodiment includes a processing unit. The processing unit uses a route plan representing a plan of a route along which each of the multiple moving bodies travel among a plurality of routes included in a moving area in which the multiple moving bodies travel to determine whether or not a first partial area, which is a partial area to which a first position where the moving body exists belongs, is different from a second partial area, which is a partial area to which a second position to which the moving body moves after the first position belongs, among a plurality of partial areas included in the moving area. When the first partial area and the second partial area are different, the processing unit changes a boundary between the first partial area and the second partial area so that the first position is included in the second partial area. The processing unit generates a travel plan that specifies the timing at which the multiple moving bodies move along the route included in the partial area so that competition between the multiple moving bodies does not occur for each of the plurality of partial areas. [Brief description of the drawings]
[0007] [Figure 1] FIG. 1 is a block diagram of an information processing system according to an embodiment. [Diagram 2] FIG. 4 is a diagram showing an example of road structure information. [Diagram 3] FIG. 1 is a diagram for explaining an example of a moving area and a plurality of zones. [Figure 4] 11 is a flowchart of a plan generation process according to an embodiment. [Diagram 5] 13 is a flowchart of a zone determination process. [Figure 6] 11A and 11B are diagrams for explaining a specific example of a zone determination process. [Figure 7] FIG. 13 is a diagram showing an example of extraction of a route within a zone to which a mobile object belongs. [Figure 8] FIG. 2 is a hardware configuration diagram of the apparatus according to the embodiment. DETAILED DESCRIPTION OF THE PREFERRED EMBODIMENTS
[0008] DETAILED DESCRIPTION OF THE PREFERRED EMBODIMENTS Hereinafter, preferred embodiments of an information processing apparatus according to the present invention will be described in detail with reference to the accompanying drawings.
[0009] The technology for generating detailed driving plans for all moving objects collectively and generating replans uses high-load calculations such as optimization calculations and combinatorial searches. Such calculations are easily affected by the scale of the system, such as the number of moving objects and the size of the movement area (map) in which the moving objects can move. For example, as the scale increases, the calculation time required to generate a driving plan becomes excessive, making it difficult to manage the movement (driving, operation) of the moving objects in real time.
[0010] The information processing device of the embodiment uses a route plan that indicates a route plan for each of the multiple moving bodies in the entire moving area, and generates a travel plan for the moving body in each of the multiple partial areas into which the entire moving area is divided. Hereinafter, the partial area is referred to as a zone. For a moving body for which a route across multiple zones is planned, the boundaries between the multiple zones are changed so that the generation of the travel plan for the moving body can be handed over to the next zone to which the moving body will move. This makes it possible to generate a travel plan for each of the multiple zones, for example. As a result, even if the size of the moving area increases, it becomes possible to generate a travel plan for the moving body more quickly without excessive calculation time.
[0011] The prerequisites of this embodiment will be further described. In this embodiment, two plans, a route plan and a driving plan, which have different levels of detail, are used. The route plan corresponds to a plan of a route for the movement of multiple moving bodies in the entire moving area. The driving plan is generated to ensure that the moving bodies do not cause conflicts with each other, and is a plan with a level of detail that can be converted into a movement command for each moving body.
[0012] A route plan is a plan of the route (travel route) that each moving body will take in a moving area, and there is low dependency between moving bodies. Therefore, there is little possibility of problems occurring even if multiple moving bodies are configured to freely adopt routes or update them at their own timing. In other words, a route plan can be a long-term plan for moving across multiple zones.
[0013] On the other hand, a driving plan is a plan with a level of detail that each moving body can execute even if it interprets it as a movement command as it is. For example, a driving plan is a plan in which one moving body avoids another moving body by waiting or adjusting its speed.
[0014] As described above, the generation of a driving plan is a process that requires a high calculation load. For this reason, in this embodiment, the driving plan is limited to a plan regarding movement within a zone. In addition, in this embodiment, the overlapping parts between multiple zones are eliminated, and the interdependence of the generation of driving plans for each of the multiple zones is eliminated, so that the generation of driving plans can be processed in parallel.
[0015] 1 is a block diagram showing an example of a configuration of an information processing system 1 according to an embodiment. As shown in FIG.
[0016] The information processing system 1 is a system (operation planning system) that generates a plan for controlling the movements of multiple moving objects 301-1 to 301-N (N is an integer of 2 or more) and controls the movements (operation) of the moving objects in accordance with the generated plan. The information processing system 1 generates the plan and so on using information acquired from multiple sensors 401-1 to 401-M (M is an integer of 2 or more) and multiple communication devices 501-1 to 501-K (K is an integer of 2 or more).
[0017] When there is no need to distinguish between the multiple moving objects 301-1 to 301-N, they are simply referred to as moving objects 301. When there is no need to distinguish between the multiple sensors 401-1 to 401-M, they are simply referred to as sensors 401. When there is no need to distinguish between the multiple communication devices 501-1 to 501-K, they are simply referred to as communication devices 501.
[0018] The mobile object 301 is a mobile object that can move under the control of the information processing system 1, such as an AGV (Automatic Guided Vehicle), an autonomous mobile robot, and an automatically traveling vehicle (e.g., an automatic traveling car). The mobile object 301 moves along a plurality of routes (travel paths) arranged in a movement area, such as a factory, a warehouse, and a facility site. The mobile object 301 may be equipped with a storage battery and operate using power stored in the battery.
[0019] The sensor 401 is a sensor for detecting the state of the moving object 301. For example, the sensor 401 is a roadside sensor such as a proximity sensor, a pressure sensor, or a photoelectric sensor. The sensor 401 detects the arrival, passage, and direction of the moving object 301 at the location where the sensor 401 is installed, as well as the presence or absence of an article (such as baggage) on board. The sensor 401 may be, for example, a camera (imaging device) installed on the ceiling of the facility.
[0020] The communication device 501 is a device capable of communicating with the mobile object 301. The communication device 501 communicates with the mobile object 301 at a relatively short distance, for example, by close proximity wireless communication or infrared communication. The communication device 501 can wirelessly communicate with the mobile object 301 that is present within a communication range.
[0021] The sensor 401 and the communication device 501 are used to transmit information (status information) indicating the status of the mobile object 301 to the information processing system 1. For example, the sensor 401 transmits a signal representing information detected from the mobile object 301 to the information processing system 1. The communication device 501 transmits information received from the mobile object 301 to the information processing system 1.
[0022] The sensor 401 and the communication device 501 are arranged, for example, at positions (locations) where they can detect state information used when the information processing system 1 generates a plan. For example, the sensor 401 and the communication device 501 are arranged at a location on the route where a temporary stop may occur. Only one of the sensor 401 and the communication device 501 may be provided as long as the state information of each moving object 301 can be detected.
[0023] The information processing device 100 generates a route plan indicating a route along which each moving body 301 should move, based on the contents of work to be performed by each moving body 301 and the order of the work. The route plan may be provided from a system (apparatus) other than the information processing device 100. Furthermore, based on the route plan, the information processing device 100 generates a driving plan that determines the timing for each moving body 301 to move along each route so as to prevent collisions and deadlocks among the moving bodies 301.
[0024] The management device 200 controls the movement of each moving body 301 by transmitting movement commands (such as commands converted from the driving plan) based on the driving plan of each moving body 301 to each moving body 301. In addition, the management device 200 detects the state of each moving body 301 and manages the movement (operation) of each moving body 301 (operation management device). The management device 200 includes a communication control unit 201 and a state detection unit 202.
[0025] The communication control unit 201 controls communication between the information processing device 100 and an external device such as a mobile object 301. For example, the communication control unit 201 transmits and receives information to and from the information processing device 100 through at least one of wireless communication and wired communication. For example, the communication control unit 201 transmits and receives information to and from the mobile object 301 through wireless communication.
[0026] The state detection unit 202 acquires information (state information) indicating the state of the moving object 301 from the communication device 501 or the sensor 401. The state detection unit 202 may acquire the state information of the moving object 301 using the communication control unit 201. The state detection unit 202 transmits the state information of each moving object 301 to the information processing device 100 via the communication control unit 201. The state information may include the time when the traveling state of each moving object 301 is detected.
[0027] Next, a description will be given of functions of the information processing device 100. As shown in Fig. 1, the information processing device 100 includes a road structure storage unit 131, a zone storage unit 132, a route plan storage unit 133, a state storage unit 134, a driving plan storage unit 135, a route planning unit 101, a replanning determination unit 102, a zone determination unit 110, driving plan units 121-1 to 121-J (J is an integer of 2 or more), and a communication control unit 122.
[0028] The road structure storage unit 131 stores information (road structure information) that represents the structure of a road. The road structure information can be expressed, for example, as a graph structure including a plurality of nodes and a plurality of arcs (roads) that connect the plurality of nodes. Note that the format of the road structure information is not limited to the graph structure, and may be any other format.
[0029] FIG. 2 is a diagram showing an example of road structure information. Each road is represented by straight lines connecting multiple nodes. In FIG. 2, each circle represents a node, and a line segment connecting multiple circles represents an arc (road). A node represents the end of a road or an intersection of multiple roads. The letters in the circles represent node IDs, which are identification information for identifying the nodes.
[0030] Detailed information 21 shows an example of detailed information of each node. In the example of Fig. 2, detailed information 21 includes a node ID, an X coordinate, and a Y coordinate. For example, the coordinates of a node whose node ID is A are (X, Y) = (20, 20).
[0031] The detailed information 22 shows an example of detailed information about a road. In the example of FIG. 2, the detailed information 22 shows a road ID and node IDs of nodes at both ends of the road. The road ID is identification information that identifies a road. For example, the road ID of a road between a node with a node ID of A and a node with a node ID of B is 1, and the node IDs of the nodes at both ends of the road are A and B.
[0032] The road structure information in FIG. 2 is an example and is not limited thereto. For example, the road structure information may include detailed information 22 in which distances between multiple nodes (arc distances) are associated with road IDs. The arc distances may be calculated based on the positions of the nodes on both sides of the arc. The road structure information may include detailed information 22 in which a standard time required to travel a road is associated with a road ID.
[0033] Returning to the description of Fig. 1, the zone storage unit 132 stores zone information for dividing the entire movement area into a plurality of zones. The zone information is, for example, information indicating the positions (coordinates) of the plurality of zones included in the movement area.
[0034] FIG. 3 is a diagram for explaining an example of a moving area and a plurality of zones. FIG. 3 corresponds to an example of a moving area observed from above. The moving area is represented by, for example, two-dimensional coordinates (X, Y). In the example of FIG. 3, the moving area corresponds to the area from X0 to X71 and Y0 to Y53. The moving area includes five zones ZA, ZB, ZC, ZD, and ZE. Zones ZA, ZB, ZC, and ZD are rectangular areas. Zone ZE corresponds to the moving area excluding the other zones ZA, ZB, ZC, and ZD.
[0035] 3 shows an example in which a moving area is a warehouse where a moving object 301 such as an AGV transports movable shelves on which items are stored to a station where picking is performed. The gray rectangular areas correspond to the locations where the shelves are installed, and the white areas between the shelves correspond to the routes along which the moving object 301 can move. Stations WS1 to WS20 correspond to the stations to which the moving object 301 can move.
[0036] 3 corresponds to an area including the boundary between zone ZA and zone ZE. In this embodiment, when there is a moving object that moves across such a boundary, the boundary between multiple zones may be changed.
[0037] The zone storage unit 132 stores zone information in which each of the zones ZA, ZB, ZC, ZD, and ZE in a moving area as shown in Fig. 3 is represented by coordinate values. The boundaries of the zones represented by the zone information may be changed by the zone determination unit 110. Therefore, the zone information stored in the zone storage unit 132 corresponds to the initial values of the multiple zones. Hereinafter, the zone represented by the zone information corresponding to the initial values may be referred to as the basic zone.
[0038] The route plan storage unit 133 stores, for example, a route plan generated by the route planning unit 101. For example, the route plan storage unit 133 stores a route plan generated for each moving body 301. The route plan may be expressed in any format. For example, when the travel path structure information is expressed in a graph structure as shown in FIG. 2, the route plan may be in a format in which a plurality of nodes are arranged in accordance with the order in which the moving body 301 moves through the nodes.
[0039] For example, a route plan for a route along which a moving object 301 moves from a node with a node ID of L to a node with a node ID of A is expressed as "L, K, I, G, E, C, A." The route plan may include information indicating the work to be performed at the nodes. For example, if the work of loading an item is performed at a node with a node ID of L and the work of unloading the item is performed at a node with a node ID of A, the route plan may be expressed as "L-Load, K, I, G, E, C, A-Unload."
[0040] The status storage unit 134 stores status information indicating the status of each moving object 301. The status information includes, for example, the current location of the moving object 301 and a running status indicating whether the moving object is running or stopped. The status storage unit 134 stores, for example, the status information acquired by the status detection unit 202 of the management device 200 and transmitted from the management device 200 via the communication control unit 201.
[0041] The driving plan storage unit 135 stores the driving plans generated by the driving planners 121-1 to 121-J. As described later, the driving plan is generated for each of a plurality of zones. Therefore, the driving plan storage unit 135 stores the driving plan for each of a plurality of zones.
[0042] Each memory unit (roadway structure memory unit 131, zone memory unit 132, route plan memory unit 133, status memory unit 134, and driving plan memory unit 135) can be composed of any commonly used storage medium such as a flash memory, a memory card, a RAM (Random Access Memory), a HDD (Hard Disk Drive), and an optical disk.
[0043] The storage units may be physically different storage media, or may be realized as different storage areas of the same physically identical storage medium.
[0044] The route planning unit 101 generates a route plan. For example, the route planning unit 101 generates a route plan that indicates a route along which each moving body 301 should travel, based on information regarding the content of work to be performed by each moving body 301 and the sequence of the work, which are determined in advance. The route planning unit 101 stores data of the generated route plan in the route plan storage unit 133. Any method may be used for generating a route plan. For example, the route planning unit 101 generates a route plan for each moving body 301, using as an evaluation criterion the reduction of the distance traveled by the multiple moving bodies 301 traveling in opposite directions along the same travel route.
[0045] The route plan may be generated by an external device or a user. In this case, the route planning unit 101 acquires the route plan and stores it in the route plan storage unit 133. The route planning unit 101 may receive data of the route plan from an external device via the communication control unit 122. The route planning unit 101 may acquire data of the route plan via an input device operated by the user.
[0046] The re-planning determination unit 102 determines whether or not to execute a re-plan to update the driving plan. For example, the re-planning determination unit 102 compares the driving plan stored in the driving plan storage unit 135 with the driving state of the moving object 301 detected by the state detection unit 202 to determine whether or not to execute a re-plan. For example, when the following conditions are satisfied, the re-planning determination unit 102 determines to execute a re-plan and generates a re-planning trigger. -After a pre-determined period of time (at regular intervals) When it is determined that at least one moving object 301 is unable to keep the driving plan When new work needs to be done or new items need to be transported When a moving object 301, whose route is planned to cross multiple zones, moves near the boundary between the multiple zones.
[0047] When a re-planning trigger occurs, that is, when it is decided to perform re-planning, a zone that is a unit for performing re-planning is decided by the zone decision unit 110. After that, the driving planners 121-1 to 121-J execute re-planning to update the driving plan for each decided zone.
[0048] The zone determination unit 110 includes a determination unit 111 , a change unit 112 , and an extraction unit 113 .
[0049] The determination unit 111 uses the route plan to determine whether the moving body 301 moves across zones. For example, the determination unit 111 uses the route plan to determine whether a zone Z1 (first partial area) to which a position P1 (first position) where the moving body 301 exists belongs and a zone Z2 (second partial area) to which a position P2 (second position) to which the moving body 301 moves next to the position P1 belongs are different from each other among the multiple zones for each of the multiple moving bodies 301. The position P1 is, for example, the current position of the moving body 301, a position to which the moving body 301 is instructed to next update the travel plan, and a position where the moving body 301 exists at the time when a replanning trigger is generated. The determination unit 111 can specify the zone to which the position P1 or the position P2 belongs by referring to the zone information (basic zone) stored in the zone storage unit 132, for example.
[0050] When a route plan is expressed as an order of moving through nodes included in a graph structure, the position P2 to move to next after the position P1 can be specified as a position corresponding to a node that is next in the moving order to the node corresponding to the position P1. The method of specifying the position P2 to move to next after the position P1 is not limited to this, and any method may be used. For example, the position P2 may be specified as a position after the moving object 301 moves from the position P1 at the moving speed of the moving object 301 for a specified time.
[0051] The change unit 112 changes the boundary between zones according to the result of the determination by the determination unit 111. For example, when the zones Z1 and Z2 are different, the change unit 112 changes the boundary between the zones Z1 and Z2 so that the position P1 is included in the zone Z2.
[0052] As described above, the determination unit 111 performs a determination for each of the multiple moving objects 301. Therefore, when it is determined that the multiple moving objects 301 move across zones, the change unit 112 may execute the process of changing the boundary between the zones multiple times. Therefore, the change unit 112 may set an upper limit value for the number of times the boundary is changed. For example, when the number of times the boundary is changed is equal to or less than the upper limit value and zone Z1 and zone Z2 are different, the change unit 112 changes the boundary between zone Z1 and zone Z2 so that position P1 is included in zone Z2.
[0053] The extraction unit 113 extracts a route of the moving body 301 within a zone to which the moving body 301 belongs. For example, the extraction unit 113 extracts, for each of the multiple moving bodies 301, a route within a zone to which the moving body 301 belongs among the multiple zones after the boundary has been changed. The extracted route is referred to, for example, when the driving planners 121-1 to 121-J generate a driving plan.
[0054] The driving planners 121-1 to 121-J generate driving plans independently for each of the multiple zones after the boundaries have been changed. Since the driving planners 121-1 to 121-J have similar functions except for the target zones, they may be simply referred to as the driving planner 121 when there is no need to distinguish between them.
[0055] One driving planner 121 may be provided for one zone, or one for two or more zones. By providing at least two or more (J≧2) driving planners 121, driving plans can be generated in parallel. This allows a plan for the movement of a moving object to be generated more quickly. Note that the multiple driving planners 121 may be realized by multiple computers (electronic devices, processors, circuits, etc.), or may be realized by a configuration in which one computer executes the generation of driving plans for multiple zones in parallel.
[0056] Any method may be used for generating a driving plan by the driving planner 121. For example, the driving planner 121 generates a driving plan for each of a plurality of zones, specifying the timing at which the plurality of moving bodies 301 move along a route included in the zone so that the plurality of moving bodies 301 do not compete with each other on a route included in the zone.
[0057] The driving planner 121 may generate a driving plan when the number of times the boundary is changed by the changer 112 exceeds a threshold value. Such processing corresponds to further using the number of times the boundary is changed exceeding a threshold value as a re-planning trigger.
[0058] The driving planner 121 does not need to generate driving plans for all zones, and may generate driving plans for some zones including, for example, zones Z1 and Z2 whose boundaries have been changed.
[0059] The communication control unit 122 controls communication with external devices such as the management device 200. For example, the communication control unit 122 transmits the driving plan generated by the driving planner 121 to the management device 200.
[0060] At least a part of each of the above units (route planning unit 101, replanning determination unit 102, zone determination unit 110, driving plan unit 121, and communication control unit 122) may be realized by one or more processing units. Each of the above units is realized, for example, by one or more processors. For example, each of the above units may be realized by having a processor such as a CPU (Central Processing Unit) and a GPU (Graphics Processing Unit) execute a program, that is, by software. Each of the above units may be realized by a processor such as a dedicated IC (Integrated Circuit), that is, by hardware. Each of the above units may be realized by using both software and hardware. When multiple processors are used, each processor may realize one of the units, or two or more of the units.
[0061] The information processing device 100 may be physically configured by one device, or may be physically configured by multiple devices. For example, the information processing device 100 may be constructed on a cloud environment. Furthermore, each unit in the information processing device 100 may be provided in a distributed manner in multiple devices.
[0062] Furthermore, the information processing device 100 and the management device 200 may exist on the same physical device (computer system), or may exist on different physically different devices (computer systems) and be connected to each other via a network.
[0063] Next, a plan generation process by the information processing device 100 according to the embodiment will be described. Fig. 4 is a flowchart showing an example of the plan generation process according to the embodiment. The plan generation process in Fig. 4 is executed, for example, when the re-planning decision unit 102 decides to execute a re-plan, that is, when a re-planning trigger is generated.
[0064] The zone determination unit 110 acquires data required for generating a travel plan, such as a travel road structure and zone information, from, for example, the travel road structure storage unit 131 and the zone storage unit 132 (step S101).
[0065] The zone determination unit 110, for example, acquires state information (such as the current position) of each moving object 301 detected by the state detection unit 202 and stored in the state storage unit 134 (step S102).
[0066] The zone determination unit 110 executes a zone determination process for determining a zone to be used for generating a driving plan (step S103). The details of the zone determination process will be described later.
[0067] The zone determination unit 110 (determination unit 111) determines the zone to which each moving object 301 belongs among the determined multiple zones (step S104). The extraction unit 113 extracts the route of the moving object 301 within the zone to which the moving object 301 belongs (step S105).
[0068] The driving planner 121 generates a driving plan for each of the multiple zones (step S106). The communication controller 122 outputs the generated driving plan to the management device 200 (step S107), and ends the plan generation process.
[0069] When the next plan generating process is executed, the determination unit 111 again acquires zone information from the zone storage unit 132. In other words, the zone whose boundary has been changed is returned to the initial value (basic zone).
[0070] Next, the zone determination process in step S103 will be described in detail with reference to Fig. 5. Fig. 5 is a flow chart showing an example of the zone determination process.
[0071] The determination unit 111 identifies an unprocessed moving body 301 from among the multiple moving bodies 301 (step S201). The determination unit 111 determines the zone Z1 to which the initial position of the identified moving body 301 belongs (step S202). The initial position corresponds to the position P1 where the moving body 301 is present. As described above, the initial position (position P1) is, for example, the current position of the moving body 301 and the position where the moving body 301 is instructed to next update its travel plan.
[0072] The determination unit 111 determines the zone Z2 to which the position P2 to be moved next to the initial position belongs (step S203). The determination unit 111 determines whether the zone Z1 and the zone Z2 are different (step S204).
[0073] If zone Z1 and zone Z2 are different (step S204: Yes), the change unit 112 changes the boundary between zone Z1 and zone Z2 so that zone Z2 includes the initial position (position P1) (step S205).
[0074] The change unit 112 determines whether the number of changes to the boundary is equal to or less than the upper limit (step S206). If the number of changes is equal to or less than the upper limit (step S206: Yes) and if zone Z1 and zone Z2 are the same (step S204: No), the determination unit 111 determines whether all moving objects 301 have been processed (step S207).
[0075] If all the moving objects 301 have not been processed (step S207: No), the determination unit 111 returns to step S201 and repeats the process.
[0076] When all the moving objects 301 have been processed (step S207: Yes) or when the number of changes exceeds the upper limit (step S206: No), the zone determination process ends.
[0077] FIG. 6 is a diagram for explaining a specific example of the zone determination process. The dashed line represents the boundary between two zones. The squares and arrows correspond to, for example, nodes and arcs (paths). FIG. 6 shows an example of a situation in which three moving objects 301-1, 301-2, and 301-3 are moving.
[0078] 6 shows a situation where each moving object 301 belongs to the lower of the two basic zones when replanning is started. Each moving object 301 is given a route plan to move to the upper of the two basic zones.
[0079] 6, the determination unit 111 determines that the lower zone (zone Z1) to which the initial position (position P1) of the moving object 301-1 belongs is different from the upper zone (zone Z2) to which the next position P2, to which the moving object 301-1 will move, belongs. Therefore, the change unit 112 changes the boundary between zone Z1 and zone Z2 so that the upper zone Z2 includes position P1.
[0080] 6 shows a state in which the boundary has been changed in this way. In this state, the determination unit 111 further determines that, for the next moving object 301-2, the lower zone (zone Z1) to which the initial position (position P1) belongs is different from the upper zone (zone Z2) to which the next moving object 301-2 will move to position P2. Therefore, the change unit 112 further changes the boundary between zone Z1 and zone Z2 so that position P1 is included in zone Z2.
[0081] Similarly, the boundary change is performed for the moving body 301-3. The right part of Fig. 6 shows the situation after the boundaries are changed for the three moving bodies 301-1, 301-2, and 301-3. After this, a driving plan is generated for the three moving bodies 301-1, 301-2, and 301-3 by the driving planner 121 corresponding to zone Z2.
[0082] Fig. 7 is a diagram showing an example of extraction of a route within a zone to which the mobile object 301 belongs. Fig. 7 shows an example in which a movement area is divided into four zones ZA, ZB, ZC, and ZD. The left part of Fig. 7 shows examples of routes 71, 72, and 73 set in a route plan for the mobile objects 301-1 to 301-3. Route 71 is a route that crosses multiple zones ZA and ZC. Route 72 is a route that crosses multiple zones ZB, ZD, and ZC. Meanwhile, route 73 is a route within one zone ZD.
[0083] The extraction unit 113 extracts the route of each mobile object 301 within the zone to which the mobile object 301 belongs. The right part of FIG. 7 shows a state in which the route within the zone is extracted by the extraction unit 113. In this example, for the mobile object 301-1, a route 71b from the current position of the mobile object 301-1 to the boundary between zone ZA and zone ZC is extracted. In this manner, the extraction unit 113 extracts the route of the portion including the current position of the mobile object 301. That is, the extraction unit 113 does not extract the portion of the route within zone ZA after the mobile object 301-1 returns from zone ZC. For the mobile object 301-2, a route 72b from the current position of the mobile object 301-2 to the boundary between zone ZB and zone ZD is extracted.
[0084] (Variation 1) The basic zone (initial value of multiple zones) does not have to be one, and may be multiple. For example, the judgment unit 111 may select one or more initial values (basic zones) of the multiple zones, and perform judgment using the selected basic zone. Any method may be used to select the basic zone, but for example, the following method may be used. (M1) Select a basic zone according to the time period during which the judgment (replanning) will be performed. (M2) When a predetermined condition is satisfied, a basic zone different from the basic zone being used is selected.
[0085] For example, depending on the time period, only some of the multiple zones in the movement area may be used. For example, a transport system that transports shelves in a warehouse may be configured to use only picking stations included in some zones during a certain time period. (M1) above can be applied to such a situation. For example, only the zones used for each time period are defined as basic zones, and the determination unit 111 selects the basic zone defined for the time period at the time of replanning.
[0086] The above (M2) will be further explained. The judgment unit 111 first selects a certain basic zone as an initial value I1 (first initial value) and performs judgment. When executing the plan generation process using this basic zone, if a predetermined condition is satisfied, the judgment unit 111 selects a basic zone different from the basic zone being used as an initial value I2 (second initial value) and uses it in the subsequent judgments.
[0087] The initial value I2 includes, for example, a plurality of zones obtained by dividing at least a portion of the plurality of zones corresponding to the initial value I1. The condition indicates, for example, at least one of the following conditions. A condition indicating that the number of moving objects 301 included in multiple zones exceeds a prescribed number - Conditions indicating that the generation of a driving plan is not completed within the specified time
[0088] According to (M2), for example, when the number of moving bodies 301 belonging to a certain zone increases, the load of generating a driving plan for that zone increases, and it is possible to avoid a situation in which the generation of the driving plan cannot be completed within the required time.
[0089] (Variation 2) In the example of FIG. 3, the zone ZE is a zone including a narrower area than the other zones. Therefore, by repeating the process of changing the boundary with the other zones, a situation may occur in which the zone ZE is divided into a plurality of zones. In order to avoid the occurrence of such a situation, a configuration may be made in which a position (permitted position) at which the boundary change is permitted is determined, and the boundary change is permitted when the position P1 is included in the permitted position. If the position P1 is not included in the permitted position, the boundary is not changed, and a situation may occur in which the moving body 301 stops, but by returning to the basic zone and repeating replanning, a plan for moving the moving body 301 is eventually created, and the moving body 301 can move toward the next zone.
[0090] For example, the change unit 112 changes the boundary when the zones Z1 and Z2 are different and the position P1 is included in one or more permitted positions defined as positions where a change of the boundary is permitted.
[0091] As described above, in the embodiment, a travel plan for a moving body within a zone is generated for each of a plurality of partial regions (zones) obtained by dividing the entire movement area. This makes it possible to generate a travel plan for a moving body that has a route across a plurality of zones in less calculation time while ensuring the generation of a travel plan that does not cause conflicts within each zone. In other words, it becomes possible to generate a travel plan for a moving body more quickly.
[0092] Next, a hardware configuration of an apparatus (information processing apparatus, management apparatus) according to an embodiment will be described with reference to Fig. 8. Fig. 8 is an explanatory diagram showing an example of a hardware configuration of an apparatus according to an embodiment.
[0093] The device of the embodiment includes a control device such as a CPU (Central Processing Unit) 51, a storage device such as a ROM (Read Only Memory) 52 and a RAM (Random Access Memory) 53, a communication I / F 54 that connects to a network and communicates, and a bus 61 that connects each part.
[0094] The programs executed by the device of the embodiment are provided in a state that they are pre-installed in the ROM 52 or the like.
[0095] The programs executed by the devices of the embodiments may be configured to be provided as a computer program product by being recorded in an installable or executable format on a computer-readable recording medium such as a CD-ROM (Compact Disk Read Only Memory), a flexible disk (FD), a CD-R (Compact Disk Recordable), or a DVD (Digital Versatile Disk).
[0096] Furthermore, the program executed by the device of the embodiment may be stored on a computer connected to a network such as the Internet and provided by being downloaded via the network. Also, the program executed by the device of the embodiment may be provided or distributed via a network such as the Internet.
[0097] The programs executed by the apparatus of the embodiment can cause a computer to function as each unit of the apparatus described above. In this computer, the CPU 51 can read the programs from a computer-readable storage medium onto a main storage device and execute the programs.
[0098] A configuration example of the embodiment will be described below. (Configuration example 1) using a route plan representing a plan of a route along which each of the plurality of moving bodies moves among a plurality of routes included in a movement area along which the plurality of moving bodies moves, for each of the plurality of moving bodies, whether or not a first partial area, which is a partial area to which a first position where the moving body exists belongs, among a plurality of partial areas included in the movement area, differs from a second partial area, which is a partial area to which a second position to which the moving body moves next to the first position belongs; When the first partial region and the second partial region are different, a boundary between the first partial region and the second partial region is changed so that the second partial region includes the first position; A travel plan is generated for each of the plurality of partial regions, in which a timing for the plurality of moving bodies to move along the route included in the partial region is specified so that contention between the plurality of moving bodies does not occur along the route included in the partial region. Processing section, An information processing device comprising: (Configuration example 2) The processing unit includes: when the number of times the boundary is changed is equal to or less than an upper limit value and the first partial region and the second partial region are different, changing the boundary so that the second partial region includes the first position. The information processing device according to claim 1. (Configuration example 3) The processing unit includes: When the number of times the boundary is changed exceeds a threshold, the driving plan is generated. The information processing device according to configuration example 1 or 2. (Configuration Example 4) The processing unit includes: generating the driving plan for the first partial area and the second partial area whose boundaries have been changed; The information processing device according to configuration example 3. (Configuration Example 5) The processing unit includes: changing the boundary when the first partial region and the second partial region are different and the first position is included in one or more permitted positions defined as positions at which the change of the boundary is permitted; The information processing device according to any one of configuration examples 1 to 4. (Configuration Example 6) The processing unit includes: determining whether the first partial region and the second partial region are different from each other among the plurality of partial regions corresponding to any of the one or more initial values of the plurality of partial regions; 6. The information processing device according to any one of configuration examples 1 to 5. (Configuration Example 7) The processing unit includes: Among the one or more initial values, an initial value corresponding to a time period for which the determination is performed is used. The information processing device according to configuration example 6. (Configuration Example 8) The processing unit includes: determining whether the first partial region and the second partial region are different from each other by using the first initial value out of a first initial value and a second initial value including a partial region obtained by dividing at least a part of the plurality of partial regions corresponding to the first initial value into a plurality of partial regions; if a predetermined condition is satisfied, further determining whether the first partial region and the second partial region are different from each other by using the second initial value; The information processing device according to configuration example 6. (Configuration Example 9) The condition is represents at least one of a condition indicating that the number of the moving objects included in the plurality of partial regions exceeds a prescribed number, and a condition indicating that the generation of the driving plan is not completed within a prescribed time, The information processing device according to configuration example 8. (Configuration Example 10) An information processing method executed by an information processing device, a step of determining, for each of the multiple moving bodies, whether or not a first partial area, which is a partial area to which a first position where the moving body exists belongs, and a second partial area, which is a partial area to which a second position to which the moving body moves next after the first position belongs, are different from each other among a plurality of partial areas included in the movement area of the multiple moving bodies, using a route plan that represents a plan of the route along which each of the multiple moving bodies moves among a plurality of routes included in the movement area of the multiple moving bodies; When the first partial region and the second partial region are different, changing a boundary between the first partial region and the second partial region such that the second partial region includes the first position; generating a travel plan for each of the plurality of partial regions, the travel plan specifying a timing for the plurality of moving bodies to move along the route included in the partial region so that contention between the plurality of moving bodies does not occur on the route; An information processing method comprising: (Configuration Example 11) On the computer, a step of determining, for each of the multiple moving bodies, whether or not a first partial area, which is a partial area to which a first position where the moving body exists belongs, and a second partial area, which is a partial area to which a second position to which the moving body moves next after the first position belongs, are different from each other among a plurality of partial areas included in the movement area of the multiple moving bodies, using a route plan that represents a plan of the route along which each of the multiple moving bodies moves among a plurality of routes included in the movement area of the multiple moving bodies; When the first partial region and the second partial region are different, changing a boundary between the first partial region and the second partial region such that the second partial region includes the first position; generating a travel plan for each of the plurality of partial regions, the travel plan specifying a timing for the plurality of moving bodies to move along the route included in the partial region so that contention between the plurality of moving bodies does not occur on the route; A program for executing.
[0099] Although some embodiments of the present invention have been described, these embodiments are presented as examples and are not intended to limit the scope of the invention. These novel embodiments can be implemented in various other forms, and various omissions, substitutions, and modifications can be made without departing from the spirit of the invention. These embodiments and their modifications are included in the scope and spirit of the invention, and are included in the scope of the invention and its equivalents described in the claims. [Explanation of symbols]
[0100] 1. Information Processing Systems 100 Information processing device 101 Route Planning Department 102 Replanning Decision Section 110 Zone Determination Unit 111 Judgment section 112 Changes 113 Extraction part 121-1~121-J Driving Planning Department 122 Communication control section 131 Road structure memory unit 132 Zone Memory Unit 133 Route planning memory unit 134 Status memory unit 135 Driving plan memory unit 200 Management device 201 Communication control section 202 Status detection unit 301-1~301-N Mobile 401-1~401-M Sensors 501-1~501-K Communication equipment
Claims
1. using a route plan representing a plan of a route along which each of the plurality of moving bodies moves among a plurality of routes included in a movement area along which the plurality of moving bodies moves, it is determined for each of the plurality of moving bodies whether or not a first partial area, which is a partial area to which a first position where the moving body exists belongs, is different from a second partial area, which is a partial area to which a second position to which the moving body moves next to the first position belongs, among a plurality of partial areas included in the movement area; When the first partial region and the second partial region are different, a boundary between the first partial region and the second partial region is changed before the moving body moves from the first position to the second position so that the second partial region includes the first position; A travel plan is generated for each of the plurality of partial regions, in which a timing for the plurality of moving bodies to move along the route included in the partial region is specified so that contention between the plurality of moving bodies does not occur along the route included in the partial region. Processing section, An information processing device comprising:
2. Using a route plan representing a plan of the route along which each of the multiple moving bodies moves among a plurality of routes included in a moving area in which the multiple moving bodies move, it is determined for each of the multiple moving bodies whether or not a first partial area, which is the partial area to which a first position at which the moving body exists belongs, and a second partial area, which is the partial area to which a second position to which the moving body moves next after the first position belongs, are different among a plurality of partial areas included in the moving area; When the first partial region and the second partial region are different, a boundary between the first partial region and the second partial region is changed so that the second partial region includes the first position; A travel plan is generated for each of the plurality of partial regions, in which a timing for the plurality of moving bodies to move along the route included in the partial region is specified so that contention between the plurality of moving bodies does not occur along the route included in the partial region. a processing unit; The processing unit includes: when the number of times the boundary is changed is equal to or less than an upper limit value and the first partial region and the second partial region are different, the boundary is changed so that the second partial region includes the first position. Information processing device.
3. Using a route plan representing a plan of the route along which each of the multiple moving bodies moves among a plurality of routes included in a moving area in which the multiple moving bodies move, it is determined for each of the multiple moving bodies whether or not a first partial area, which is the partial area to which a first position at which the moving body exists belongs, and a second partial area, which is the partial area to which a second position to which the moving body moves next to the first position belongs, are different among a plurality of partial areas included in the moving area; When the first partial region and the second partial region are different, a boundary between the first partial region and the second partial region is changed so that the second partial region includes the first position; A travel plan is generated for each of the plurality of partial regions, in which a timing for the plurality of moving bodies to move along the route included in the partial region is specified so that contention between the plurality of moving bodies does not occur along the route included in the partial region. a processing unit; The processing unit includes: When the number of times the boundary is changed exceeds a threshold, the driving plan is generated. Information processing device.
4. The processing unit includes: generating the driving plan for the first partial area and the second partial area whose boundaries have been changed; The information processing device according to claim 3 .
5. The processing unit includes: changing the boundary when the first partial region and the second partial region are different and the first position is included in one or more permitted positions defined as positions at which the change of the boundary is permitted; 4. The information processing apparatus according to claim 1.
6. The processing unit includes: determining whether the first partial region and the second partial region are different from each other among a plurality of partial regions corresponding to any of one or more initial values of the plurality of partial regions; 4. The information processing apparatus according to claim 1.
7. The processing unit includes: Among the one or more initial values, an initial value corresponding to a time period for which the determination is performed is used. The information processing device according to claim 6.
8. Using a route plan representing a plan of the route along which each of the multiple moving bodies moves among a plurality of routes included in a moving area in which the multiple moving bodies move, it is determined for each of the multiple moving bodies whether or not a first partial area, which is the partial area to which a first position at which the moving body exists belongs, and a second partial area, which is the partial area to which a second position to which the moving body moves next to the first position belongs, are different among a plurality of partial areas included in the moving area; When the first partial region and the second partial region are different, a boundary between the first partial region and the second partial region is changed so that the second partial region includes the first position; A travel plan is generated for each of the plurality of partial regions, in which a timing for the plurality of moving bodies to move along the route included in the partial region is specified so that contention between the plurality of moving bodies does not occur along the route included in the partial region. a processing unit; The processing unit includes: determining whether the first partial region and the second partial region are different from each other by using the first initial value out of a first initial value and a second initial value including a partial region obtained by dividing at least a part of the plurality of partial regions corresponding to the first initial value into a plurality of partial regions; and when a predetermined condition is satisfied, further determining whether or not the first partial region and the second partial region are different using the second initial value. Information processing device.
9. The condition is represents at least one of a condition indicating that the number of the moving objects included in the plurality of partial regions exceeds a prescribed number, and a condition indicating that the generation of the driving plan is not completed within a prescribed time, The information processing device according to claim 8.
10. An information processing method executed by an information processing device, a step of determining, for each of the plurality of moving bodies, whether or not a first partial area, which is a partial area to which a first position where the moving body exists belongs, and a second partial area, which is a partial area to which a second position to which the moving body moves next after the first position belongs, are different from each other among a plurality of partial areas included in the movement area of the plurality of moving bodies, using a route plan that represents a plan of the route along which each of the plurality of moving bodies moves among a plurality of routes included in the movement area of the plurality of moving bodies; When the first partial region and the second partial region are different, changing a boundary between the first partial region and the second partial region before the moving object moves from the first position to the second position so that the second partial region includes the first position; generating a travel plan for each of the plurality of partial regions, the travel plan specifying a timing for the plurality of moving bodies to move along the route included in the partial region so that contention between the plurality of moving bodies does not occur on the route; An information processing method comprising:
11. An information processing method executed by an information processing device, comprising: a step of determining, for each of the plurality of moving bodies, whether or not a first partial area, which is a partial area to which a first position where the moving body exists belongs, and a second partial area, which is a partial area to which a second position to which the moving body moves next after the first position belongs, are different from each other among a plurality of partial areas included in the movement area of the plurality of moving bodies, using a route plan that represents a plan of the route along which each of the plurality of moving bodies moves among a plurality of routes included in the movement area of the plurality of moving bodies; changing a boundary between the first partial region and the second partial region such that the second partial region includes the first position when the first partial region and the second partial region are different; generating a travel plan for each of the plurality of partial regions, the travel plan specifying a timing for the plurality of moving bodies to move along the route included in the partial region so as to prevent competition between the plurality of moving bodies along the route included in the partial region; and changing the boundary, when the number of times the boundary is changed is equal to or less than an upper limit value and the first partial region and the second partial region are different, changing the boundary so that the second partial region includes the first position. Information processing methods.
12. An information processing method executed by an information processing device, comprising: a step of determining, for each of the plurality of moving bodies, whether or not a first partial area, which is a partial area to which a first position where the moving body exists belongs, and a second partial area, which is a partial area to which a second position to which the moving body moves next after the first position belongs, are different from each other among a plurality of partial areas included in the movement area of the plurality of moving bodies, using a route plan that represents a plan of the route along which each of the plurality of moving bodies moves among a plurality of routes included in the movement area of the plurality of moving bodies; changing a boundary between the first partial region and the second partial region such that the second partial region includes the first position when the first partial region and the second partial region are different; generating a travel plan for each of the plurality of partial regions, the travel plan specifying a timing for the plurality of moving bodies to move along the route included in the partial region so as to prevent competition between the plurality of moving bodies along the route included in the partial region; The step of generating a driving plan generates the driving plan when the number of times the boundary is changed exceeds a threshold. Information processing methods.
13. An information processing method executed by an information processing device, comprising: a step of determining, for each of the plurality of moving bodies, whether or not a first partial area, which is a partial area to which a first position where the moving body exists belongs, and a second partial area, which is a partial area to which a second position to which the moving body moves next after the first position belongs, are different from each other among a plurality of partial areas included in the movement area of the plurality of moving bodies, using a route plan that represents a plan of the route along which each of the plurality of moving bodies moves among a plurality of routes included in the movement area of the plurality of moving bodies; changing a boundary between the first partial region and the second partial region such that the second partial region includes the first position when the first partial region and the second partial region are different; generating a travel plan for each of the plurality of partial regions, the travel plan specifying a timing for the plurality of moving bodies to move along the route included in the partial region so as to prevent competition between the plurality of moving bodies along the route included in the partial region; The step of determining whether the first partial region and the second partial region are different includes: determining whether the first partial region and the second partial region are different from each other by using the first initial value out of a first initial value and a second initial value including a partial region obtained by dividing at least a part of the plurality of partial regions corresponding to the first initial value into a plurality of partial regions; and when a predetermined condition is satisfied, further determining whether or not the first partial region and the second partial region are different using the second initial value. Information processing methods.
14. On the computer, a step of determining, for each of the plurality of moving bodies, whether or not a first partial area, which is a partial area to which a first position where the moving body exists belongs, and a second partial area, which is a partial area to which a second position to which the moving body moves next after the first position belongs, are different from each other among a plurality of partial areas included in the movement area of the plurality of moving bodies, using a route plan that represents a plan of the route along which each of the plurality of moving bodies moves among a plurality of routes included in the movement area of the plurality of moving bodies; When the first partial region and the second partial region are different, changing a boundary between the first partial region and the second partial region before the moving object moves from the first position to the second position so that the second partial region includes the first position; generating a travel plan for each of the plurality of partial regions, the travel plan specifying a timing for the plurality of moving bodies to move along the route included in the partial region so that contention between the plurality of moving bodies does not occur on the route; A program for executing the above.
15. A computer comprising: a step of determining, for each of the plurality of moving bodies, whether or not a first partial area, which is a partial area to which a first position where the moving body exists belongs, and a second partial area, which is a partial area to which a second position to which the moving body moves next after the first position belongs, are different from each other among a plurality of partial areas included in the movement area of the plurality of moving bodies, using a route plan that represents a plan of the route along which each of the plurality of moving bodies moves among a plurality of routes included in the movement area of the plurality of moving bodies; changing a boundary between the first partial region and the second partial region such that the second partial region includes the first position when the first partial region and the second partial region are different; generating a travel plan for each of the plurality of partial regions, the travel plan specifying a timing for the plurality of moving bodies to move along the route included in the partial region so as to prevent competition between the plurality of moving bodies along the route included in the partial region; and changing the boundary, when the number of times the boundary is changed is equal to or less than an upper limit value and the first partial region and the second partial region are different, changing the boundary so that the second partial region includes the first position. program.
16. A computer comprising: a step of determining, for each of the plurality of moving bodies, whether or not a first partial area, which is a partial area to which a first position where the moving body exists belongs, and a second partial area, which is a partial area to which a second position to which the moving body moves next after the first position belongs, are different from each other among a plurality of partial areas included in the movement area of the plurality of moving bodies, using a route plan that represents a plan of the route along which each of the plurality of moving bodies moves among a plurality of routes included in the movement area of the plurality of moving bodies; changing a boundary between the first partial region and the second partial region such that the second partial region includes the first position when the first partial region and the second partial region are different; generating a travel plan for each of the plurality of partial regions, the travel plan specifying a timing for the plurality of moving bodies to move along the route included in the partial region so as to prevent competition between the plurality of moving bodies along the route included in the partial region; The step of generating a driving plan generates the driving plan when the number of times the boundary is changed exceeds a threshold. program.
17. A computer comprising: a step of determining, for each of the plurality of moving bodies, whether or not a first partial area, which is a partial area to which a first position where the moving body exists belongs, and a second partial area, which is a partial area to which a second position to which the moving body moves next after the first position belongs, are different from each other among a plurality of partial areas included in the movement area of the plurality of moving bodies, using a route plan that represents a plan of the route along which each of the plurality of moving bodies moves among a plurality of routes included in the movement area of the plurality of moving bodies; changing a boundary between the first partial region and the second partial region such that the second partial region includes the first position when the first partial region and the second partial region are different; generating a travel plan for each of the plurality of partial regions, the travel plan specifying a timing for the plurality of moving bodies to move along the route included in the partial region so as to prevent competition between the plurality of moving bodies along the route included in the partial region; The step of determining whether the first partial region and the second partial region are different includes: determining whether the first partial region and the second partial region are different from each other by using the first initial value out of a first initial value and a second initial value including a partial region obtained by dividing at least a part of the plurality of partial regions corresponding to the first initial value into a plurality of partial regions; and when a predetermined condition is satisfied, further determining whether or not the first partial region and the second partial region are different using the second initial value. program.
Citation Information
Patent Citations
Systems and methods for coordinating movement of mobile drive units
JP2009541177A
Travel control device, travel control method, and computer program
JP2021071891A
Running control device, running control method and computer program
JP2021149216A
Information processing device, information processing method, information processing system, and computer program
JP2021184210A
Control device, moving body, and distributed control program for moving body
JP2023004006A
