Transport Task Management System

Abstract

We propose a transport task management system that can complete priority transport tasks in the shortest possible time and execute transport tasks efficiently. [Solution] When a priority transport task arises, from among the robots 41-44 currently executing transport tasks with lower priority than the priority transport task, and the robots 41-44 that are on standby, the robot 41-44 that can reach the source of the priority transport task (manufacturing location 31-34) in the shortest time while being able to transport the items of the priority transport task is selected, and the priority task is assigned to this robot 41-44. Then, information about the priority transport task is output to the assigned robot 41-44. This minimizes the time required to complete the priority transport task and allows for efficient operation and management of the robots 41-44 performing the transport tasks.

Description

Technical Field

[0004] , , , , , ,

[0003] , ,

[0001] The present invention relates to a transfer task management system for managing a transfer task of transferring an article by a plurality of transfer means.

Background Art

[0002] In a production factory, generally, products, parts, etc. are transported by a transporter (such as a forklift) between places such as a plurality of manufacturing places and loading / unloading places provided within the factory site. And it is required to manage the transportation work of the transporter so that an appropriate amount is transported to each place at an appropriate time. A management device for managing such transportation work of the transporter has been proposed, for example, in Patent Document 1. Such a configuration, when requested to instruct a destination from the transporter, assigns the transportation work with a high urgency priority to the transporter and instructs the destination to the transporter. Thereby, it is possible to cause the transporter to perform the transportation work with a high urgency priority.

Prior Art Documents

Patent Documents

[0003]

Patent Document 1

Summary of the Invention

Problems to be Solved by the Invention

[0004] In the conventional configuration of the above-described Patent Document 1, when each transporter completes the transportation to the destination, it makes a request to the management device to instruct the destination, and the management device instructs the destination to the transporter that made the request. That is, a highly urgent transportation work is assigned only to transporters that are not performing transportation work. However, sometimes a transporter that requests destination instructions is located far from the destination of a high-priority transport operation. In this case, because it takes time to travel from this distant location, it may be possible to complete the high-priority transport operation more quickly by assigning it to another transporter that is currently performing a transport operation nearby, after the first transporter has completed its current operation. If transport operations are assigned only to transporters that are not currently performing any transport operations, it will take a long time to complete the high-priority transport operation, and the transport efficiency will not be optimized.

[0005] This invention proposes a transport task management system that can complete priority transport tasks (corresponding to transportation work) in the shortest possible time and efficiently execute said transport tasks. [Means for solving the problem]

[0006] The present invention relates to a transport task management system for transporting goods using a plurality of transport means having a predetermined maximum load capacity, and comprises a task setting means for setting a plurality of transport tasks and assigning each transport task to the transport means, and an information output means for outputting information about the transport tasks set by the task setting means, wherein the system further comprises a location information detection means for detecting the location information of each transport means, the task setting means includes a task interrupt processing content that, when a priority transport task arises that takes precedence over transport tasks currently being executed and before execution, selects a transport means that can reach the source constituting the priority transport task in the shortest time in a state in which the priority transport task can be executed, based on the respective location information and load capacity of the transport means currently executing a transport task with a lower priority than the priority transport task, and assigns the priority transport task to the transport means, and the information output means includes a processing content for outputting the information of the priority transport task set by the task interrupt processing content to the transport means to which the priority transport task has been assigned. Here, the transport means may be automated, such as a robot, or it may be operated by a worker. The priority transport task may be a newly created transport task, or it may be a previously set transport task that has been changed to take priority. The load capacity indicates the amount of goods that the transport means can load. If no goods are being transported, it corresponds to the maximum load capacity, and if goods are being transported, it corresponds to the maximum load capacity minus the amount being transported.

[0007] In this configuration, when a priority transport task occurs, the priority transport task is assigned to the transport means that can reach the transport source in the shortest time while the priority transport task is in an executable state, thereby minimizing the time required to complete the priority transport task. As a result, when a priority transport task is interrupted and executed preferentially, the optimal assignment can be made to ensure the earliest possible completion time for the priority transport task, allowing transport tasks to be executed more efficiently compared to the conventional configuration described above.

[0008] In this configuration, the state in which a priority transfer task can be executed means that the goods for that priority transfer task can be loaded. This includes not only the state in which the transfer means is not loaded with goods, but also the state in which there is enough capacity to load additional goods up to the maximum load capacity. Therefore, transfer means that are in standby or have sufficient loading capacity can move directly from their current location to the transfer source, while transfer means that do not have sufficient loading capacity will move to the transfer source only after being made ready to load goods (after unloading the goods currently loaded).

[0009] Furthermore, in this configuration, it is preferable that the target selected based on the task interrupt processing content includes not only transport means currently executing transport tasks with a lower priority than the priority transport task, but also transport means that are in standby mode. This allows for the selection of the transport means that can complete the priority transport task as quickly as possible with even greater precision.

[0010] In the transfer task management system of the present invention described above, the proposed configuration includes a task interrupt processing function in which, when a new priority transfer task arises, the time required for a transfer means that is currently executing a transfer task with a lower priority than the priority transfer task and is unable to load the amount of items constituting the priority transfer task to reach the source of the priority transfer task is the time required to reach the source via the destination of the loaded items.

[0011] In this configuration, the time it takes for a transport means executing a transport task to reach the source of a priority transport task is defined as the time required to reach the source after completing the transport task being executed. This time can then be used to select the transport means that can reach the source in the shortest time. This allows the transport means executing a transport task to accurately know the time it will take to reach the source of the priority transport task, and to correctly predict the completion time of the priority transport task. Therefore, this configuration allows for the accurate determination of the transport task that can complete the priority transport task the fastest, enabling more efficient execution of transport tasks.

[0012] Furthermore, in this configuration, if a transport means is performing multiple transport tasks, the time it takes to reach the source of the priority transport task after completing at least one of the transport tasks so that the goods for the priority transport task can be loaded is considered the time it takes to reach the source. [Effects of the Invention]

[0013] As described above, the transfer task management system of the present invention assigns priority transfer tasks to the transfer means that can complete them the fastest, thereby enabling more efficient execution of transfer tasks compared to the conventional configuration described above. [Brief explanation of the drawing]

[0014] [Figure 1] This is a block diagram showing the transport task management system 1 of this embodiment. [Figure 2]It is a flowchart showing the task setting process of the transportation task. [Figure 3] It is a flowchart showing the priority task setting process. [Figure 4] It is an explanatory diagram showing the factory area 30 where the transportation task is executed. [Figure 5] It is a data configuration diagram in the transfer task management system 1. [Figure 6] It is a chart showing the distance table. [Figure 7] (A) It is a chart showing the list of transportation tasks and (B) the allocation of each robot 41 to 44. [Figure 8] (A) It is a chart showing the list of transportation tasks and (B) the allocation of each robot 41 to 44 when a priority task occurs.

Mode for Carrying Out the Invention

[0015] An embodiment embodying the present invention will be described using the accompanying drawings. The transfer task management system 1 of this embodiment is for operation management of the transport robots 41 to 44 that transport articles (manufactured products) in the factory area 30. As shown in FIG. 1, it includes a management server 2 that is managed by an administrator. This management server 2 has general server functions and is composed of one or more computers equipped with a central control device (CPU), a storage device (RAM, ROM), and a communication device, etc.

[0016] A plurality of the robots 41 to 44 and a terminal 10 capable of inputting and outputting data are communicably connected to the management server 2 via a communication network (for example, the Internet, etc.) 9. The terminal 10 is composed of a personal computer, a tablet, a smartphone, etc. having a communication function and is managed by an ID, a password, etc. Note that a plurality of terminals 10 can be connected.

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

[0018] The robots 41 to 44 load and transport the items, and the maximum loading capacity is determined. Each of the robots 41 to 44 has a moving function, a collecting function for loading the items, an unloading function for unloading the items, a sensor function and a drive control function for accurately performing these functions, and further has a function of communicating with the management server 2. By operating according to the instructions of the management server 2, such robots 41 to 44 automatically transport the items.

[0019] As shown in FIG. 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. Further, 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, cameras, etc. having a communication function, and is installed in the factory area 30 so as to be able to constantly detect each of the robots 41 to 44 moving in the factory area 30.

[0020] The information input means 3 processes input data received from the terminal 10, input data entered by the administrator on the management server 2, and location data received from the location information detection means 7, and includes data input processing (S10) described later. The task setting means 4 processes setting the transport tasks and assigning them to each of the robots 41 to 44, and includes task setting processing S20 to S60 described later. The information output means 5 processes sending instruction signals to the robots 41 to 44 to execute the transport tasks set by the task setting means 4, and includes task information output processing (S70) described later. The data storage means 6 stores the data entered by the information input means 3 and the processing results of the task setting means 4.

[0021] The management server 2 performs the following processes: storing basic information entered by the administrator in the data storage means 6, and setting the transport tasks and assigning them to the robots 41-44. Here, the basic information is entered in advance before the transport task is executed and stored in the data storage means 6. As shown in Figure 5, this basic information is pre-configured information and includes manufacturing site information, robot performance information, and area information.

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

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

[0024] The area information of the basic information includes shipping location information indicating the unloading work positions at each shipping location 36, 37, passage information for the robots 41-44 to move, obstacle information that may hinder 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 location information in the aforementioned XY coordinates. The obstacle information includes the location information of obstacles in the aforementioned XY coordinates.

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

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

[0027] The manufacturing location information in the input information is information indicating the manufacturing status of goods at each manufacturing location 31 to 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 to 34, and includes information on the goods being manufactured and the progress of the manufacturing process. The inventory information includes the inventory quantity of goods manufactured at each manufacturing location 31 to 34.

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

[0029] The area information of the input information includes the frequency of human traffic in the factory area 30 and information on obstacles. Since this information is related to the movement of robots 41-44, it can be used as appropriate in the path analysis process described later.

[0030] The priority task information in the input information is information indicating the priority transport task, and includes location information and transport volume. Here, location information indicates the manufacturing locations 31-34 where the goods are loaded and the shipping locations 36,37 where the goods are unloaded. Transport volume indicates the quantity of goods to be loaded. Furthermore, the priority task information includes information indicating the priority of the transport task.

[0031] As shown in Figure 2, the task list creation process (S20) is executed after the data input process (S10). The task list creation process sets up a transport task to transport goods from the first to fourth manufacturing locations 31 to 34 to the first and second shipping locations 36 and 37, according to the information entered in the data input process. Here, the transport task consists of loading goods at each manufacturing location 31 to 34, moving goods from the manufacturing locations 31 to 34 to each shipping location 36 and 37, and unloading goods at the shipping locations 36 and 37. That is, as shown in Figure 7(A), the transport task includes information on the first to fourth manufacturing locations 31 to 34, which are the source locations for loading goods, information on the first and second shipping locations 36 and 37, which are the destination locations for unloading goods, and the amount of goods to be transported (loading capacity). In this embodiment, the transportation task described is the task of transporting goods from one manufacturing location to one shipping location. However, the task is not limited to this, and a task may be set up to transport goods to a shipping location via multiple manufacturing locations.

[0032] Furthermore, in this task list creation process, if priority task information is entered in the data input process, the transport tasks are set according to the priority task information. Then, a priority is assigned to these transport tasks, and they are set as transport tasks that have priority over other transport tasks (hereinafter referred to as priority tasks).

[0033] Following the task list creation process (S20), the distance table update process (S30) is executed. The distance table update process calculates 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, updating the distance table shown in Figure 6. The distance data is data indicating the distance traveled by robots 41-44 along the passages they travel through in the factory area 30, and is calculated using the position information of each robot 41-44 entered in the data input process, the location information of each manufacturing location 31-34 and the shipping location information of each shipping location 36,37 stored in the data storage means 6. Furthermore, since the location information for each manufacturing location 31-34 and each shipping location 36,37 is fixed, the distance data for these locations remains constant. However, since the location information for each robot 41-44 changes, the distance data between each robot 41-44 and each manufacturing location 31-34 and each shipping location 36,37 changes as it progresses.

[0034] As shown in Figure 2, after the distance table update process (S30) is completed, it is determined whether or not priority task information was entered in the data input process (S40). If the result of this determination is positive (Yes), the process proceeds to the priority task setting process (S50); if it is negative (No), the process proceeds to the path analysis process (S60).

[0035] In the aforementioned path analysis process (S60), the optimal path for each robot 41-44 to perform the transport task is derived 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 means 6. Then, based on this optimal path, the robots 41-44 are assigned to the transport task. In this optimal path derivation process, the most efficient path is derived by considering the time required for the transport task (speed), the amount to be transported, safety during transport (frequency of human traffic, etc.), and cost. For example, optimization tools such as OrTools or VROOM can be used for this process. Through this path analysis process, an assignment list in which each robot 41-44 is assigned the transport task is determined, as shown in Figure 7(B). Furthermore, in this embodiment, the execution time period in which each robot 41-44 performs the transport task is determined. This execution time is set based on relative time (time from a reference point) or specific time intervals, including the time for collecting goods at the source and the time for unloading goods at the destination.

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

[0037] On the other hand, in the priority task setting process (S50), a robot candidate selection process (S110) is executed as shown in Figure 3. The robot candidate selection process selects robots 41-44 that are assigned to transport tasks with a lower priority than the priority task, and robots 41-44 that are on standby (not assigned to a transport task), based on the priority of the priority task information entered in the data input process.

[0038] After the robot candidate selection process (S110) is completed, one robot is selected from all the robots 41-44 selected in the robot candidate selection process (S120). Then, it is determined whether the selected robot can carry the amount of goods to be transported in the priority task (S130). If the result of this determination is affirmative (Yes), the process proceeds to direct information calculation processing (S150); if it is negative (No), the process proceeds to intermediate information calculation processing (S140). Here, robots that are on standby and robots that have not yet loaded the goods for the transport task are determined to be affirmative. The load amount entered in the data input process and the maximum load amount from the basic information are used in this determination.

[0039] In the direct information calculation process (S150), the time required to reach the source of the priority task is calculated using the current position information of a robot extracted in S120, the location information of the source (manufacturing location) of the priority task, and the robot's movement speed. In other words, this direct information calculation process calculates 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 transit information calculation process (S140) uses the current position information of one robot extracted in S120, the location information of the destination (shipping location) of the transport task currently being executed, the location information of the source (manufacturing location) of the priority task, and the robot's movement speed and loading / unloading speed to calculate the time required to reach the source of the priority task. In other words, this transit information calculation process calculates the time required for the robot to travel the shortest distance from its current position, via the destination of the transport task, to the source of the priority task.

[0041] When S140 or S150 is completed, it is determined (S160) whether S140 or S150 has been executed for all robots selected in the robot candidate selection process. If the determination result is positive (Yes), the process proceeds to the robot decision process (S170); if negative (No), the process proceeds to S120. In S120, robots that have not yet undergone the process of S140 or S150 are 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 reach the source of the priority task is calculated by the intermediary 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 can reach the source of the priority task in the shortest time, and designates it 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 route information of that robot are added in association with the priority task.

[0044] Once the priority task setting process (S50) is completed, the route analysis process (S60) is executed as shown in Figure 2. In this route analysis process, a robot is assigned to perform the priority task according to the information added in the list update process, and the optimal route for that robot to preferentially perform the priority task is derived. This process again derives the optimization of the route for performing other transport tasks. As a result, the assignment list updated with the assigned priority task is determined, as shown in Figure 8(B). Even when this priority task is to be executed, the execution time period for performing the priority task is determined as described above. Furthermore, if the execution time period for other transport tasks is changed, this execution time period is updated.

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

[0046] The process by which the transport 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 Figure 7(A), multiple transport tasks (1) to (5) are set, and as shown in Figure 7(B), each transport task (1) to (5) is assigned to each robot 41 to 44. As shown in Figure 4, robot 43 is executing transport task (1), robot 41 is executing transport task (2), and robot 44 is executing transport task (3). Robot 42 is also in a state where it is about to start executing transport task (5). In this embodiment, the maximum load capacity of each robot 41 to 44 is 20 items.

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

[0049] In the priority task setting process, as described above, all robots 41-44 that are currently executing or waiting for transport tasks with a lower priority than the priority task are selected. This priority task is given a higher priority than all transport tasks that are currently executing or awaiting execution. As a result, all robots 41-44 are selected, and it is determined whether each of them is currently capable of loading the items to be transported by the priority task. Based on this determination, the direct information calculation process or the indirect information calculation process is executed, and the time required for each robot to reach the transport source (first manufacturing location 31) of the priority task is calculated.

[0050] At this point, robot 41 is loading 10 items, robot 43 is loading 15 items, and robot 44 is loading 12 items. Robot 42 is not loading any items. As a result, currently robots 41, 43, and 44 are unable to load the items for the priority task (18 items), while robot 42 is able to load those items. Therefore, the time it will take for robots 41, 43, and 44 to reach the first manufacturing location 31 (the source of the priority task) is calculated by the transit information calculation process, and the time it will take for robot 42 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 robot 42 and the first manufacturing location 31 is obtained from the distance table (see Figure 6), and the arrival time is calculated from this distance and the robot 42's movement speed. On the other hand, in the route information calculation process, the distance that robot 41 travels to 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 robot 41's movement speed. Then, this travel time is added to the time it takes to unload the goods at the first shipping location 36 to calculate the robot 41's arrival time at the first manufacturing location 31. Similarly, the distance that robot 43 travels to the first manufacturing location 31 via the second shipping location 37 and the robot 43's movement speed are used to calculate the travel time, and this travel time is added to the unloading time at the second shipping location 37 to calculate the robot 43's arrival time. Similarly, the travel time is calculated using the distance the robot 44 travels from the first shipping location 36 to the first manufacturing location 31. This travel time is then added to the unloading time at the first shipping location 36 to calculate the robot 44's arrival time.

[0052] The system calculates the arrival time for each robot 41-44 to reach the first manufacturing location 31 (the source of the priority task), and selects the robot with the shortest arrival time. For example, if robot 41 has the shortest arrival time, robot 41 is selected and determined to perform the priority task. In accordance with this decision, the path analysis process assigns robot 41 to the priority task, optimizes the path, and updates the assignment list shown in Figure 8(B). Furthermore, the execution time period for the priority task is determined. Finally, the task information output process outputs an instruction signal to robot 41 to execute the priority task.

[0053] In the transport task management system 1 of this embodiment, as described above, when priority task information is input, the system calculates the arrival time for each of the robots 41-44 that are currently executing or waiting for transport tasks with a lower priority than the priority task, so that they can reach the source of the priority task in a state where they can load the items of the priority task, and assigns the priority task to the robot that shows the shortest arrival time. In this embodiment, if a robot cannot load the items of the priority task because it is already loading items, the arrival time is calculated to include the time it takes to move to the source of the priority task after unloading the loaded items, thus accurately selecting the robot that can complete the priority task the fastest. Thus, with the configuration of this embodiment, even if an interruption to a priority task occurs, the time required to complete the priority task can be minimized. Therefore, the configuration of this embodiment enables optimal operation that allows priority tasks to be completed in the shortest time, and enables efficient operation and management of each robot 41-44 that performs transport tasks.

[0054] In the embodiment described above, the transport 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. Robots 41-44 correspond to the transfer means according to the present invention. The priority task setting process corresponds to the task interrupt processing content according to the present invention. Manufacturing locations 41-44 correspond to the transfer source according to the present invention, and shipping locations 36,37 correspond to the transfer destination according to the present invention.

[0055] The present invention is not limited to the embodiments described above, and can be modified as appropriate without departing from the spirit of the invention. For example, the number of robots, manufacturing locations, and shipping locations managed by the transfer task management system can be changed as needed. Furthermore, the robots' performance (maximum load capacity and travel speed) can also be changed as needed.

[0056] In this embodiment, the robot's location information is detected using multiple sensors and cameras installed in the factory area, but the system is not limited to this; for example, the location information of each robot could be detected using GPS.

[0057] In this embodiment, the transportation of goods is performed solely by a robot, but the invention is not limited to this, and goods may be transported by an operator operating transport equipment. In this case, this can be achieved by transmitting instruction signals (information) assigned to the transport task or priority task to the operator. Alternatively, goods may be transported using both the robot and transport equipment operated by an operator.

[0058] In this embodiment, task setting processing is executed when dynamic data (e.g., information on production volume) is input to the management server. However, the execution conditions for task setting processing can be changed as appropriate. For example, transportation tasks at the facility may be set when a production plan for a predetermined period (e.g., one day) is input.

[0059] In this embodiment, one transport task is assigned to one robot, but the system is not limited to this, and one transport task may be assigned to multiple robots. This allows, for example, if two robots capable of transporting items separately can reach the source of the priority task faster than one robot can reach the source, the priority task can be assigned to those two robots.

[0060] In the embodiment, the manufacturing location was designated as the source of transport and the shipping location as the destination. However, the present invention is not limited to this, and the transport task management system can also be applied when the manufacturing location serves as both the source and destination, or when the shipping location serves as both the destination and source.

[0061] In the examples, the transportation of goods (products) within a factory area was used as an example of the managed activity, but the system is not limited to this, and other types of goods can also be managed. For example, the transportation task management system of the present invention can be applied to the transportation of goods within a logistics warehouse (area). Furthermore, the present invention can be applied to the job of transporting goods by truck or the like to multiple delivery locations. [Explanation of Symbols]

[0062] 1. Transport Task Management System 3. Information input processing means 4. Task setting means 5. Information output means 31-34 Place of manufacture (source of transfer) 36,37 Shipping location (destination) 41-44 Robots (Transportation means)

Claims

1. This system manages a transfer task that involves transferring goods using multiple transfer means having a predetermined maximum load capacity. A task setting means for setting up multiple transfer tasks and assigning each transfer task to the transfer means, Information output means that outputs information about the transport task set by the task setting means. In a transport task management system equipped with, It is equipped with a location information detection means for detecting the location information of each transport means, The task setting means is When a priority transport task arises that takes precedence over transport tasks currently being executed or not yet executed, the system includes a task interrupt processing function that, based on the respective location information and load capacity of transport means currently executing transport tasks with lower priority than the priority transport task, selects a transport means that can reach the transport source constituting the priority transport task in the shortest time while in a state where the priority transport task can be executed, and assigns the priority transport task to that transport means. A transport task management system characterized in that the information output means includes a processing function that outputs information of the priority transport task set in the task interrupt processing content to the transport means to which the priority transport task was assigned.

2. The contents of the aforementioned task interrupt processing are as follows: The transfer task management system according to claim 1, characterized in that when the aforementioned priority transfer task occurs, the transfer means that is currently executing a transfer task with a lower priority than the priority transfer task and is unable to load the amount of items constituting the priority transfer task can reach the source of the priority transfer task, and the time required to reach the source via the destination of the loaded items is the time required to reach the source.

Images