Transport Task Management System

Abstract

To propose a transfer task management system capable of completing a priority transfer task in the shortest time and efficiently executing the transfer task. [Solution] When a priority transfer task occurs, a robot 41-44 that can transport the item of the priority transfer task and reach the source of the priority transfer task (manufacturing site 31-34) in the shortest time is selected from among the robots 41-44 executing transfer tasks of lower priority than the priority transfer task and the standby robots 41-44, and the priority task is assigned to this robot 41-44. Information about the priority transfer task is then output to the assigned robot 41-44. This minimizes the time required to complete the priority transfer task, and enables efficient operation and management of the robots 41-44 performing the transfer task.

Description

[Technical Field]

[0001] The present invention relates to a transport task management system that manages transport tasks for transporting items by a plurality of transport means. [Background technology]

[0002] In a production factory, products, parts, and the like are generally transported by conveyance machines (forklifts, etc.) between multiple manufacturing locations and receiving / shipping locations located within the factory premises. It is necessary to manage the conveyance work of the conveyance machines so that the appropriate amount of goods is transported to each location at the appropriate time. A management device for managing such conveyance work by conveyance machines is proposed, for example, in Patent Document 1. In this configuration, when a conveyance machine requests a destination, it assigns a highly urgent conveyance work to the conveyance machine with priority and instructs the conveyance machine to the destination. This allows the conveyance machine to perform the highly urgent conveyance work with priority. [Prior art documents] [Patent documents]

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

[0004] In the conventional configuration of Patent Document 1, when each transport machine completes transporting to its destination, it requests the management device to instruct the destination, and the management device then instructs the requested transport machine on the destination. In other words, transport work with high urgency is assigned only to transport machines that are not currently performing transport work. However, there are cases where the transport vehicle that requested destination instructions is located far from the destination of the highly urgent transport work. In this case, since it takes time to move from this far location, it may be possible to complete the highly urgent transport work more quickly by assigning the highly urgent transport work to another transport vehicle that is currently performing transport work nearby after the other transport vehicle has completed the other transport work. In this way, if transport work is assigned only to transport vehicles that are not currently performing transport work, it takes a long time to complete the highly urgent transport work, and transport efficiency cannot be optimized.

[0005] The present invention proposes a transport task management system that can complete a prioritized transport task (corresponding to a transportation operation) in the shortest time possible and can execute the transport task efficiently. [Means for solving the problem]

[0006] The present invention is a transport task management system that manages transport tasks for transporting goods by multiple transport means each having a predetermined maximum load capacity, and includes a task setting means that sets multiple transport tasks and assigns each transport task to the transport means, and an information output means that outputs information about the transport task set by the task setting means. The transport task management system further includes a position information detection means that detects position information of each transport means, and when a priority transport task occurs that takes priority over a transport task that is currently being executed or has not yet been executed, the task setting means selects a transport means that can reach the transport source that constitutes the priority transport task in the shortest time while being able to execute the priority transport task based on the position information and load capacity of each transport means that is executing a transport task of a lower priority than the priority transport task, and assigns the priority transport task to the transport means, and the information output means includes processing content that outputs information about the priority transport task set in the task interrupt processing content to the transport means to which the priority transport task has been assigned. Here, the transport means may be an automated means such as a robot, or may be operated by a worker. The priority transport task may be a newly generated transport task, or a previously set, unexecuted transport task that has been changed to have priority. The loadable capacity indicates the amount of goods that the transport means can carry, and is equivalent to the maximum load capacity when no goods are being transported, and is equivalent to the maximum load capacity minus the load capacity during transport when goods are being transported.

[0007] In this configuration, when a priority transfer task occurs, the priority transfer task is assigned to a transfer means that can reach the transfer source in the shortest time while the priority transfer task is executable, thereby minimizing the time required to complete the priority transfer task. As a result, when a priority transfer task is interrupted and executed preferentially, an optimal assignment can be made that enables the priority transfer task to be completed as quickly as possible, and transfer tasks can be executed more efficiently than in the conventional configuration described above.

[0008] In this configuration, a state in which a priority transfer task can be executed refers to a state in which the item for the priority transfer task can be loaded, and includes not only a state in which the transfer means is not loaded with items, but also a state in which there is room to load additional items up to the maximum load capacity. Therefore, a waiting transfer means or a transfer means with room to load can move directly from its current position to the transfer origin, while a transfer means with room to load will move to the transfer origin after making itself available for loading (after unloading the items currently loaded).

[0009] In addition, in this configuration, it is preferable that the targets selected based on the task interrupt processing contents include not only transfer means executing transfer tasks with lower priority than the priority transfer task, but also transfer means on standby, thereby enabling more accurate selection of the transfer means that can complete the priority transfer task most quickly.

[0010] In the transport task management system of the present invention described above, a configuration is proposed in which the task interrupt processing content includes processing content that, when a priority transport task is newly generated, sets the time that a transport means that is executing a transport task of lower priority than the priority transport task and is unable to load the transport amount of items that make up the priority transport task as the time required to reach the source of the priority transport task by passing through the destination of the items currently being loaded.

[0011] In this configuration, the time required for a transfer means executing a transfer task to reach the transfer source of a priority transfer task is defined as the time required for the transfer means to reach the transfer source after completing the transfer task in progress, and this time can be used to select a transfer means that can reach the transfer source in the shortest time. This allows the transfer means executing a transfer task to accurately determine the time required to reach the transfer source of the priority transfer task, and accurately predicts the completion time of the priority transfer task. Therefore, this configuration allows the transfer task that can complete the priority transfer task most quickly to be accurately determined, allowing the transfer tasks to be executed more efficiently.

[0012] In this configuration, if the transport means is currently executing multiple transport tasks, the time required to reach the source of the priority transport task after completing at least one of the currently executing transport tasks so that the item of the priority transport task can be loaded is the time required to reach the source of the priority transport task. [Effects of the Invention]

[0013] As described above, in the transfer task management system of the present invention, priority transfer tasks are assigned to the transfer means that can complete them the fastest, so that transfer tasks can be executed more efficiently than in the conventional configuration described above. [Brief explanation of the drawings]

[0014] [Figure 1] 1 is a block diagram showing a transfer task management system 1 according to an embodiment of the present invention; [Figure 2]FIG. 10 is a flowchart showing a task setting process for a transportation task. [Figure 3] FIG. 10 is a flowchart showing a priority task setting process. [Figure 4] FIG. 2 is an explanatory diagram showing a factory area 30 where a transportation task is performed. [Figure 5] FIG. 2 is a data configuration diagram in the transfer task management system 1. [Figure 6] 10 is a diagram showing a distance table. [Figure 7] 1A is a list of transportation tasks, and FIG. 1B is a diagram showing the assignment of each robot 41 to 44. FIG. [Figure 8] 10A is a diagram showing a list of transportation tasks when a priority task is generated, and FIG. 10B is a diagram showing the allocation of tasks to robots 41 to 44. DETAILED DESCRIPTION OF THE INVENTION

[0015] DETAILED DESCRIPTION OF THE PREFERRED EMBODIMENTS An embodiment of the present invention will now be described with reference to the accompanying drawings. The transfer task management system 1 of this embodiment is for operating and managing transport robots 41 to 44 that transport items (products) in a factory area 30, and includes a management server 2 managed by an administrator, as shown in Fig. 1. This management server 2 has general server functions and is configured from one or more computers equipped with a central control unit (CPU), storage devices (RAM, ROM), communication devices, etc.

[0016] The management server 2 is communicably connected to a plurality of the robots 41 to 44 and a terminal 10 capable of inputting and outputting data via a communication network (for example, the Internet) 9. The terminal 10 is configured by a personal computer, tablet, smartphone, or the like having a communication function, and is managed by an ID, a password, etc. It is possible to connect a plurality of terminals 10.

[0017] In this embodiment, as shown in FIG. 4 , the factory area 30 is provided with a plurality of manufacturing locations 31-34 and a plurality of shipping locations 36, 37, and a plurality of robots 41-44 transport items manufactured at each of the manufacturing locations 31-34 to the shipping locations 36, 37. In this factory area 30, transport tasks indicating the transport work are set according to the production volume of each of the manufacturing locations 31-34 and the performance of each of the robots 41-44, and items are transported according to the transport tasks. The transport task management system 1 of this embodiment can manage the overall transport of items in the factory area 30 by managing the setting of the transport tasks and the operation of the robots 41-44. The factory area 30 of this embodiment is provided with first to fourth manufacturing locations 31-34 and first and second shipping locations 36, 37.

[0018] The robots 41 to 44 are configured to carry and transport the items, and have a set maximum load capacity. Each of the robots 41 to 44 has a movement function, a collection function for loading the items, a loading / unloading function for unloading the items, a sensor function and a drive control function for performing these functions with precision, and also has a function for communicating with the management server 2. These robots 41 to 44 operate according to instructions from the management server 2, thereby automatically transporting the items.

[0019] 1, the management server 2 of the transfer task management system 1 includes an information input means 3, a task setting means 4, an information output means 5, and a data storage means 6. Furthermore, the transfer task management system 1 includes a position information detection means 7 that can communicate with the management server 2 via the communication network 9. This position information detection means 7 is composed of a plurality of sensors and cameras with communication capabilities, and is installed in the factory area 30 so that it can constantly detect each of the robots 41 to 44 moving within the factory area 30.

[0020] The information input means 3 processes input data received from the terminal 10, input data input by an administrator at the management server 2, and position data received from the position information detection means 7, and is provided with a data input process (S10) described later. The task setting means 4 sets the transportation task and assigns it to each of the robots 41 to 44, and is provided with task setting processes S20 to S60 described later. The information output means 5 processes the robots 41 to 44 to transmit instruction signals to execute the transportation task set by the task setting means 4, and is provided with a task information output process (S70) described later. The data storage means 6 stores data input by the information input means 3 and processing results by the task setting means 4.

[0021] The management server 2 executes a process of storing basic information input by an administrator in the data storage means 6, and a task setting process of setting the transportation task and assigning it to the robots 41 to 44. Here, the basic information is input in advance before the transportation task is executed and stored in the data storage means 6. As shown in FIG. 5, this basic information is preset information and includes manufacturing base information, robot performance information, and area information.

[0022] The manufacturing base information of the basic information includes location information indicating the loading location of items at each manufacturing location 31-34, manufacturing information related to manufacturing at each manufacturing location 31-34, and maximum inventory amount indicating the upper limit of the number of items that can be stored at each manufacturing location 31-34. Here, the location information is indicated by position information in XY coordinates that define the plane of the factory area 30. The manufacturing information includes information on the items manufactured at each manufacturing location 31-34 (such as the type and size of the items) and the manufacturing capacity of each manufacturing location 31-34 (for example, the number of items manufactured per unit time).

[0023] The robot performance information of the basic information includes ID information of each robot 41 to 44, the movement speed of each robot 41 to 44, the loading / unloading speed indicating the speed at which goods are loaded and unloaded (loading speed and unloading speed), and the maximum load capacity of each robot 41 to 44. Furthermore, it may include position information indicating the waiting location of each robot 41 to 44, and the waiting location is indicated by the position information in the XY coordinates described above.

[0024] The area information of the basic information includes shipping location information indicating unloading locations at each shipping location 36, 37, path information along which the robots 41-44 will move, information on obstacles that may impede the movement of the robots 41-44, and weather information indicating the weather in the factory area 30. Here, the shipping location information is indicated by the position information in the XY coordinates described above. The obstacle information includes position information of obstacles in the XY coordinates.

[0025] The task setting process is a process that is mainly executed by the management server 2 while the factory area 30 is in operation, and is a process that sets and assigns the transportation tasks based on data (so-called dynamic data) that is input to the management server 2 as needed during the operation. In this embodiment, the task setting process is executed by the management server 2 inputting predetermined information from the terminal 10. Here, the information used to execute the task setting process includes, for example, information on the production volume (inventory volume) at each of the production locations 31 to 34 (manufacturing base information in the input information, which will be described later) and priority task information, which will be described later.

[0026] This task setting process executes a data input process (S10) as shown in Fig. 2. In this data input process, input information (manufacturing base information, robot information, area information, priority task information, etc.) shown in Fig. 4 is input.

[0027] The manufacturing base information of the input information is information indicating the manufacturing status of goods at each manufacturing location 31-34, and includes manufacturing status information and inventory information. Here, the manufacturing status information is information indicating the manufacturing status at each manufacturing location 31-34, and includes information on the goods being manufactured and the progress of the manufacturing process, etc. The inventory information includes the inventory amount of goods manufactured at each manufacturing location 31-34, etc.

[0028] The robot information in the input information is information indicating the status of each robot 41-44, and includes task progress information, position information, and payload. Here, the task progress information includes information on whether a transport task is being executed or is on standby, and, if it is being executed, information on the progress of the transport task (collecting, transporting, unloading). The position information indicates the position of each robot 41-44 at the time of input, and is expressed by the XY coordinates. The payload is information indicating the amount of goods loaded.

[0029] The area information of the input information includes the frequency of people passing through and obstacle information in the factory area 30. Since this information is related to the movement of the robots 41 to 44, it can be used appropriately in the route analysis process described later.

[0030] The priority task information of the input information is information indicating a transportation task that should be prioritized, and includes base information and transportation volume. Here, the base information indicates information about the manufacturing locations 31-34 where the goods are loaded and the shipping locations 36, 37 where the goods are unloaded. The transportation volume indicates the amount of goods to be loaded. Furthermore, the priority task information includes information indicating the priority of the transportation task.

[0031] As shown in Fig. 2, the data input process (S10) is followed by a task list creation process (S20). The task list creation process sets transportation tasks for transporting items from the first to fourth manufacturing locations 31-34 to the first and second shipping locations 36, 37 according to the information input in the data input process. Here, the transportation tasks are composed of the work of loading items at each manufacturing location 31-34, the work of moving items from the manufacturing locations 31-34 to the shipping locations 36, 37, and the work of unloading items at the shipping locations 36, 37. That is, as shown in Fig. 7(A), the transportation task includes information on the first to fourth manufacturing locations 31-34 from which the items are loaded, information on the first and second shipping locations 36, 37 from which the items are unloaded, and the transportation amount (load amount) of the items. In addition, the transportation task shown in this embodiment is a task of transporting goods from one manufacturing location to one shipping location, but this is not limited to this, and a task of transporting goods to a shipping location via multiple manufacturing locations may also be set.

[0032] Furthermore, in this task list creation process, when priority task information is input in the data input process, the transportation task is set according to the priority task information, and the priority is determined for this transportation task, and it is set as a transportation task that takes priority over other transportation tasks (hereinafter referred to as a priority task).

[0033] Following the task list creation process (S20), a distance table update process (S30) is executed. The distance table update process is a process for calculating distance data between the current position of each robot 41-44 and each manufacturing location 31-34, distance data between the current position of each robot 41-44 and each shipping location 36, 37, and distance data between each manufacturing location 31-34 and each shipping location 36, 37, and updates the distance table shown in Fig. 6. The distance data is data indicating the distance traveled by the robots 41-44 along the passages through the factory area 30, and is calculated from the position information of each robot 41-44 input in the data input process, the location information of each manufacturing location 31-34 stored in the data storage means 6, and the shipping location information of each shipping location 36, 37. Furthermore, since the location information of each manufacturing location 31-34 and each shipping location 36, 37 is fixed, these distance data are constant values, while the position information of each robot 41-44 changes, so the distance data between each robot 41-44 and each manufacturing location 31-34 and each shipping location 36, 37 changes from time to time.

[0034] 2, when the distance table update process (S30) is completed, it is determined whether or not priority task information has been input in the data input process (S40). If the result of this determination is affirmative (Yes), the process proceeds to priority task setting process (S50), and if the result is negative (No), the process proceeds to route analysis process (S60).

[0035] The route analysis process (S60) derives an optimal route for each robot 41-44 to perform the transport task based on the transport task set in the task list creation process, the distance table, the robot information and area information entered in the data input process, and the robot performance information and area information stored in the data storage unit 6. Then, the robots 41-44 are assigned to the transport task based on the optimal route. The optimal route derivation process derives the most efficient route by taking into consideration factors such as the time (speed) required for the transport task, the amount of transport, safety during transport (such as the frequency of human traffic), and cost. For example, optimization tools such as OrTools and VROOM can be used for this process. This route analysis process determines an assignment list in which the transport tasks are assigned to each robot 41-44, as shown in FIG. 7(B). Furthermore, in this embodiment, the execution time period during which each robot 41-44 performs the transport task is determined. This execution time period is set by relative time (time from a reference time) or time, and includes the time period for collecting the item at the delivery source and the time period for unloading the item at the delivery destination.

[0036] Following the path analysis process (S60), a task information output process (S70) is executed. The task information output process is a process of outputting an instruction signal for executing the transport task to the robots 41 to 44 assigned to the transport task. This instruction signal includes information necessary for the robots 41 to 44 to execute the transport task, and upon receiving this instruction signal, the robots 41 to 44 execute the transport task according to the information in the instruction signal.

[0037] Meanwhile, in the priority task setting process (S50), a robot candidate selection process (S110) is executed as shown in Fig. 3. The robot candidate selection process selects robots 41-44 assigned to transportation tasks with lower priority than the priority task based on the priority of the priority task information input in the data input process, and robots 41-44 on standby (in a state where no transportation task is assigned).

[0038] After the robot candidate selection process (S110) is completed, one robot is selected from all robots 41-44 selected in the robot candidate selection process (S120). Then, a determination is made as to whether the selected robot can carry the amount of goods to be transported in the priority task (S130). If the determination result is a positive determination (Yes), the process proceeds to a direct information calculation process (S150), and if the determination result is a negative determination (No), the process proceeds to a route information calculation process (S140). Here, a positive determination is made for a waiting robot and a robot that has not yet loaded goods for the transport task. Note that this determination uses the load capacity input in the data input process and the maximum load capacity of the basic information.

[0039] In the direct information calculation process (S150), the time required for one robot to reach the source of the priority task is calculated using the current position information of the robot extracted in S120, the location information of the source (manufacturing location) of the priority task, and the robot's movement speed, etc. In other words, this direct information calculation process is a process for calculating the time required for the robot to travel the shortest distance from its current position to the source of the priority task.

[0040] On the other hand, the route information calculation process (S140) calculates the time required to reach the transport source of the priority task using the current position information of one robot extracted in S120, location information of the transport destination (shipping location) of the currently executing transport task, location information of the transport source (manufacturing location) of the priority task, and the robot's movement speed, loading and unloading speed, etc. In other words, this route information calculation process calculates the time required for the robot to travel the shortest distance from its current position to the transport source of the priority task via the transport destination of the transport task.

[0041] When S140 or S150 is completed, it is determined whether S140 or S150 has been executed for all robots selected in the robot candidate selection process (S160). If the determination result is a positive determination (Yes), the process proceeds to robot determination process (S170), and if the determination result is a negative determination (No), the process proceeds to S120. If the process proceeds to S120, the robot before executing the process of S140 or S150 is extracted, and the process proceeds to S130. In this way, S120 to S160 are executed for all robots selected in the robot candidate selection process, and the time required for each robot to arrive at the transport source of the priority task is calculated by the route information calculation process or the direct information calculation process.

[0042] The robot determination process (S170) determines, from among all the robots selected in the robot candidate selection process, the robot that takes the shortest time to reach the source of the priority task as the robot that can reach the source in the shortest time.

[0043] Following the robot determination process, a list update process (S180) is executed. In the list update process, the robot (ID) determined in the robot determination process and the path information of the robot are added in association with the priority task.

[0044] When the priority task setting process (S50) is thus completed, the route analysis process (S60) is executed as shown in FIG. 2. In this route analysis process, a robot that will perform the priority task is assigned according to the information added in the list update process, and an optimal route for the robot to execute the priority task with priority is derived. This process re-derives an optimized route for executing other transportation tasks. As a result, an updated assignment list is determined by assigning the priority task, as shown in FIG. 8(B). Even when this priority task is executed, the execution time slot for executing the priority task is determined as described above. Furthermore, if the execution time slot for another transportation task is changed, this execution time slot is updated.

[0045] Following the path analysis process (S60), the task information output process (S70) is executed, and an instruction signal for executing the priority task is output to the robot assigned to the priority task.

[0046] The flow of how the transfer task management system 1 of this embodiment manages the operation of priority tasks will be explained below using a specific example.

[0047] For example, as shown in Fig. 7(A), a plurality of transport tasks (1) to (5) are set, and as shown in Fig. 7(B), each of the transport tasks (1) to (5) is assigned to a robot 41 to 44. As shown in Fig. 4, robot 43 is currently executing transport task (1), robot 41 is currently executing transport task (2), and robot 44 is currently executing transport task (3). Robot 42 is about to start executing transport task (5). In this embodiment, the maximum load capacity of each of robots 41 to 44 is 20 items.

[0048] In this state, when the management server 2 receives the priority task information, the above-mentioned task setting process (Fig. 2) is executed. In the task setting process, the priority task information is input, and the position information of each robot 41-44 is input from the position information detection means 7. Then, based on the priority task information, a priority task is set as shown in Fig. 8(A), and the distance table is updated as shown in Fig. 6 based on the input position information of each robot 41-44. Next, the priority task setting process (Fig. 3) is executed.

[0049] As described above, the priority task setting process selects all robots 41-44 that are currently executing or waiting for a transport task with a lower priority than the priority task. This priority task is assumed to have a higher priority than all transport tasks that are currently executing or have not yet been executed. As a result, all robots 41-44 are selected, and a determination is made as to whether each robot is currently capable of loading the item to be transported by the priority task. Based on the determination result, the direct information calculation process or route information calculation process is performed, and the time required for each robot to reach the transport source (first manufacturing location 31) of the priority task is calculated.

[0050] Here, robot 41 is currently loading 10 items, robot 43 is currently loading 15 items, and robot 44 is currently loading 12 items. Robot 42 is not loading any items. As a result, robots 41, 43, and 44 are currently unable to load the items (18 items) for the priority task, while robot 42 is able to load these items. Therefore, for robots 41, 43, and 44, the time it takes for each to reach the first manufacturing location 31 (the source of the priority task) is calculated by the route information calculation process, and for robot 42, the time it takes to reach the first manufacturing location 31 is calculated by the direct information calculation process.

[0051] In the direct information calculation process, the distance between the robot 42 and the first manufacturing location 31 is obtained from the distance table (see FIG. 6), and the arrival time is calculated from this distance and the movement speed of the robot 42. On the other hand, in the route information calculation process, the distance that the robot 41 takes to reach the first manufacturing location 31 via the first shipping location 36 is obtained from the distance table, and the travel time is calculated from this distance and the movement speed of the robot 41. This travel time is then added to the time it takes to unload the goods at the first shipping location 36 to calculate the arrival time of the robot 41 at the first manufacturing location 31. Similarly, the travel time is calculated from the distance that the robot 43 takes to reach the first manufacturing location 31 via the second shipping location 37 and the movement speed of the robot 43, and this travel time is added to the time it takes to unload the goods at the second shipping location 37 to calculate the arrival time of the robot 43. Similarly, the travel time is calculated using the distance traveled by the robot 44 to the first manufacturing location 31 via the first shipping location 36, and the arrival time of the robot 44 is calculated by adding this travel time to the unloading time at the first shipping location 36.

[0052] In this way, the arrival time required for each robot 41 to 44 to reach the first manufacturing location 31 (the delivery source of the priority task) is calculated, and the robot showing the shortest arrival time is selected. Here, for example, if the arrival time of robot 41 is the shortest, that robot 41 is selected and determined to execute the priority task. In accordance with this determination, the robot 41 is assigned to the priority task by the path analysis process, the path is optimized, and the assignment list shown in FIG. 8(B) is updated. Furthermore, the execution time period of the priority task is determined. Then, an instruction signal to execute the priority task is output to robot 41 by the task information output process.

[0053] As described above, when priority task information is input, the transport task management system 1 of this embodiment calculates the arrival time for all robots 41-44 currently executing or waiting for transport tasks with a lower priority than the priority task to arrive at the destination of the priority task while still able to load the items. The system then assigns the priority task to the robot with the shortest arrival time. In this embodiment, if the items cannot be loaded because they are currently loaded, the arrival time is determined as the time it takes to unload the items and move them to the destination of the priority task. This allows for accurate selection of the robot that can complete the priority task most quickly. Thus, the configuration of this embodiment minimizes the time required to complete the priority task even when an interruption occurs. Therefore, the configuration of this embodiment allows for optimal operation to complete the priority task in the shortest time, thereby efficiently managing the robots 41-44 performing the transport tasks.

[0054] In the above-described embodiment, the transportation task corresponds to the transfer task according to the present invention, and the priority task corresponds to the priority transfer task according to the present invention. The robots 41 to 44 correspond to the transfer means according to the present invention. The priority task setting process corresponds to the task interruption process content according to the present invention. The manufacturing locations 41 to 44 correspond to the transfer source according to the present invention, and the shipping locations 36 and 37 correspond to the transfer destination according to the present invention.

[0055] The present invention is not limited to the above-described embodiments, and can be modified as appropriate within the scope of the present invention. For example, the number of robots, the number of manufacturing locations, and the number of shipping locations managed by the transfer task management system can be changed as needed. Also, the performance of the robots (maximum payload and movement speed) can be changed as needed.

[0056] In the embodiment, the position information of the robots is detected by multiple sensors and cameras installed in the factory area, but this is not limiting, and for example, the position information of each robot may be detected by GPS.

[0057] In the embodiment, the transportation of goods is performed only by the robot, but this is not limiting. The goods may be transported by a worker operating a transport device. In this case, instruction signals (information) that assign transport tasks and priority tasks can be transmitted to the worker. Furthermore, the goods may be transported using both the robot and a transport device operated by the worker.

[0058] In the embodiment, the task setting process is executed by inputting dynamic data (e.g., information on production volume) to the management server, but the execution conditions of the task setting process can be changed as appropriate. For example, a transportation task in the organization may be set by inputting a production plan for a predetermined period (e.g., one day).

[0059] In the embodiment, one transportation task is assigned to one robot, but this is not limiting, and one transportation task may be assigned to multiple robots. As a result, for example, if two robots capable of transporting goods in separate loads arrive at the destination of the priority task faster than the time it takes for one robot to arrive at the destination, the priority task can be assigned to the two robots.

[0060] In the embodiment, the manufacturing location is the source of transportation and the shipping location is the destination of transportation, but this is not limited to this. The transport task management system of the present invention can also be applied to cases where the manufacturing location serves as both the source of transportation and the destination of transportation, or where the shipping location serves as both the destination of transportation and the source of transportation.

[0061] In the embodiment, the transportation of goods (products) in a factory area is exemplified as a management target, but this is not limiting, and the transportation of other goods can also be managed. For example, the transportation task management system of the present invention can be applied to the transportation of goods in a logistics warehouse (area) as a management target. Furthermore, the present invention can also be applied to the task of transporting goods by truck or the like to multiple delivery locations as a management target. [Explanation of symbols]

[0062] 1. Transport Task Management System 3. Information input processing means 4 Task setting methods 5. Information output means 31~34 Manufacturing location (transfer origin) 36,37 Shipping location (destination) 41~44 Robot (Transportation)

Claims

1. A method for managing a transport task of transporting items by a plurality of transport means each having a predetermined maximum load capacity, comprising: a task setting means for setting a plurality of transfer tasks and assigning each transfer task to the transfer means; an information output means for outputting information about the transfer task set by the task setting means; In a transport task management system comprising: a position information detection means for detecting the position information of each transport means; The task setting means When a priority transfer task that takes priority over a transfer task that is currently being executed or has not yet been executed occurs, a task interrupt process is performed to select a transfer means that can reach the transfer source that constitutes the priority transfer task in the shortest time while the priority transfer task is executable, based on the position information and load capacity of each transfer means that is executing a transfer task that has a lower priority than the priority transfer task, and to assign the priority transfer task to the transfer means; A transfer task management system characterized in that the information output means has processing content to output information of the priority transfer task set in the task interrupt processing content to the transfer means to which the priority transfer task is assigned.

2. The task interrupt processing content is:

2. The transport task management system according to claim 1, characterized in that, when a priority transport task occurs, the time it takes for a transport means that is executing a transport task of lower priority than the priority transport task and is unable to load the amount of items that constitute the priority transport task to reach the source of the priority transport task is set to the time required for the transport means to reach the source via the destination of the items being loaded.

Images