A sorting scheduling method and device, electronic equipment and storage medium

Abstract

The application discloses a kind of sorting scheduling method, device, electronic equipment and storage medium, method includes: in response to the task request instruction of target robot, the task number in task queue and the state data of target robot are acquired;State data includes the state of plate and continuous task number;The task response state of target robot is determined based on the task number and state data in combination with preset determination condition;Based on task response state, target task is issued to target robot.The application can efficiently and accurately realize sorting scheduling by acquiring the task quantity in task queue and robot state data (including the availability of plate and continuous task number) in real time, and the current load capacity of robot can be dynamically evaluated by the system, and the application can be widely applied in data processing technical field.

Description

TECHNICAL FIELD

[0001] The present application relates to the technical field of data processing, and in particular to a sorting scheduling method and device, electronic equipment and storage medium. BACKGROUND

[0002] Panel sorting is a crucial process in furniture manufacturing, and the efficiency of this process directly affects the production efficiency and cost of the entire production line. Traditional manual sorting and simple rule scheduling are inefficient or prone to human error, leading to production delays or quality problems, which cannot meet the requirements of large-scale and efficient sorting. SUMMARY

[0003] The main purpose of the embodiments of the present application is to provide a sorting scheduling method, device, electronic equipment and storage medium to solve at least one problem in the prior art. The present application can efficiently and accurately realize sorting scheduling.

[0004] To achieve the above-mentioned purpose, one aspect of an embodiment of the present application provides a sorting scheduling method, the method comprising:

[0005] In response to the task request instruction of the target robot, the number of tasks in the task queue and the state data of the target robot are obtained; the state data includes the panel placing position state and the number of consecutive tasks;

[0006] Based on the number of tasks and the state data in combination with the preset determination condition, the task response state of the target robot is determined;

[0007] Based on the task response state, the target task is issued to the target robot.

[0008] In some embodiments, the number of tasks includes the number of tasks for loading and the number of tasks for unloading. Based on the number of tasks and the state data in combination with the preset determination condition, the task response state of the target robot is determined, including the following steps:

[0009] When the number of tasks for loading and the number of tasks for unloading are both 0, or when the number of tasks for loading is 0, the number of tasks for unloading is greater than 0, and the panel placing position state is occupied, it is determined that the task response state of the target robot is no task response.

[0010] In some embodiments, the task response state includes no task response and data state exception. Based on the task response state, the target task is issued to the target robot, including the following steps:

[0011] When the task response state is no task response or data state exception, an empty task is issued to the target robot;

[0012] When the number of tasks and / or state data cannot be obtained, or when the number of tasks and / or state data appears data exception, it is determined that the task response state of the target robot is data state exception.

[0013] In some embodiments, the number of tasks includes the number of tasks for loading and the number of tasks for unloading, and the number of continuous tasks includes the number of times of loading and the number of times of unloading; the task response state of the target robot is determined based on the number of tasks and the state data in combination with a preset determination condition, including the following steps:

[0014] When the number of tasks for loading is greater than 0 and the number of tasks for unloading is 0, or when the number of tasks for loading and the number of tasks for unloading are both greater than 0 and the number of times of loading is less than a preset maximum number of continuous times of loading, or when the number of tasks for loading and the number of tasks for unloading are both greater than 0 and the board placing state is occupied, it is determined that the task response state of the target robot is a loading task response.

[0015] In some embodiments, the task response state includes a loading task response, and a target task is issued to the target robot based on the task response state, including the following steps:

[0016] When the task response state is a loading task response, a loading task is taken out from a loading queue of the task queue and issued to the target robot for processing.

[0017] In some embodiments, the number of tasks includes the number of tasks for loading and the number of tasks for unloading, and the number of continuous tasks includes the number of times of loading and the number of times of unloading; the task response state of the target robot is determined based on the number of tasks and the state data in combination with a preset determination condition, including the following steps:

[0018] When the number of tasks for loading is 0, the number of tasks for unloading is greater than 0, and the board placing state is idle, or when the number of tasks for loading and the number of tasks for unloading are both greater than 0, the board placing state is idle, the number of times of unloading is less than a preset maximum number of continuous times of unloading, and the number of times of loading is 0, it is determined that the task response state of the target robot is an unloading task response.

[0019] In some embodiments, the task response state includes an unloading task response, and a target task is issued to the target robot based on the task response state, including the following steps:

[0020] When the task response state is an unloading task response, an unloading task is taken out from an unloading queue of the task queue and issued to the target robot for processing.

[0021] To achieve the above-mentioned purpose, another aspect of the embodiment of the present application proposes a sorting scheduling device, the device comprising:

[0022] A first module is configured to obtain the number of tasks in the task queue and the state data of the target robot in response to the task request instruction of the target robot; the state data includes the board placing state and the number of continuous tasks;

[0023] A second module is configured to determine the task response state of the target robot based on the number of tasks and the state data in combination with a preset determination condition.

[0024] The third module is configured to issue a target task to the target robot based on the task response state.

[0025] To achieve the above object, another aspect of the embodiment of the present application provides an electronic device, which comprises a memory and a processor, the memory stores a computer program, and the processor implements the above method when executing the computer program.

[0026] To achieve the above object, another aspect of the embodiment of the present application provides a computer readable storage medium, which stores a computer program, and the computer program is executed by a processor to implement the above method.

[0027] The embodiment of the present application at least has the following beneficial effects: the present application provides a sorting scheduling method and device, electronic equipment and storage medium, the scheme responds to the task request instruction of the target robot, obtains the task number in the task queue and the state data of the target robot; the state data includes the board placing position state and the continuous task number; the task response state of the target robot is determined based on the task number and the state data combined with the preset determination condition; and the target task is issued to the target robot based on the task response state. The present application obtains the task number in the task queue and the robot state data (including the board placing position availability and the continuous task number) in real time, and the system can dynamically evaluate the current load capacity of the robot. Combined with the preset determination condition, multi-dimensional decision is made to avoid the resource idling or overload problem caused by the traditional static allocation. Moreover, the present application pre-judges the hardware execution capacity before the task is issued by monitoring the board placing position state (such as mechanical jam, material full load and other physical states). Compared with the allocation strategy which only depends on the software task queue, the present application brings the hardware state into the decision-making closed loop, significantly reduces the interruption risk caused by the hardware exception in the task execution process, and improves the task completion success rate. The present application can efficiently and accurately realize sorting scheduling. BRIEF DESCRIPTION OF DRAWINGS

[0028] Figure 1 is a flow chart of the sorting scheduling method provided by the embodiment of the present application;

[0029] Figure 2 is a schematic diagram of the working process of the sorting scheduling provided by the embodiment of the present application;

[0030] Figure 3 is a structural schematic diagram of the sorting scheduling device provided by the embodiment of the present application;

[0031] Figure 4 is a hardware structural schematic diagram of the electronic equipment provided by the embodiment of the present application. DETAILED DESCRIPTION

[0032] To make the objectives, technical solutions, and advantages of this invention clearer, the invention will be further described in detail below with reference to the accompanying drawings and embodiments. It should be understood that the specific embodiments described herein are merely illustrative of the invention and are not intended to limit the invention. In the following description, when referring to the accompanying drawings, unless otherwise indicated, the same numbers in different drawings represent the same or similar elements. The embodiments described in the following exemplary embodiments do not represent all embodiments consistent with the embodiments of this invention; they are merely examples of apparatuses and methods consistent with some aspects of the embodiments of this invention as detailed in the appended claims.

[0033] It is understood that the terms "first," "second," etc., used in this invention may be used to describe various concepts, but unless specifically stated otherwise, these concepts are not limited by these terms. These terms are only used to distinguish one concept from another. For example, without departing from the scope of embodiments of this invention, first information may also be referred to as second information, and similarly, second information may also be referred to as first information. Depending on the context, the words "if" or "when" as used herein may be interpreted as "when," "in response to determination," or "in the event of a determination."

[0034] The terms “at least one,” “multiple,” “each,” “any,” etc., used in this invention, “at least one” includes one, two, or more than two; “multiple” includes two or more than two; “each” refers to each of the corresponding multiple; and “any” refers to any one of the multiple.

[0035] Unless otherwise defined, all technical and scientific terms used in this invention have the same meaning as commonly understood by one of ordinary skill in the art to which this invention pertains. The terminology used in this invention is for descriptive purposes only and is not intended to limit the invention.

[0036] The sorting and scheduling method provided in this invention relates to the field of data processing technology. This method can be applied to a terminal, a server, or software running on either a terminal or a server. In some embodiments, the terminal can be a smartphone, tablet, laptop, desktop computer, smart speaker, smartwatch, or vehicle terminal, but is not limited thereto. The server can be configured as an independent physical server, a server cluster or distributed system composed of multiple physical servers, or a cloud server providing basic cloud computing services such as cloud services, cloud databases, cloud computing, cloud functions, cloud storage, network services, cloud communication, middleware services, domain name services, security services, CDN, and big data and artificial intelligence platforms. The server can also be a node server in a blockchain network. The software can be an application implementing the sorting and scheduling method, but is not limited to the above forms.

[0037] This invention can be used in a wide variety of general-purpose or special-purpose computer system environments or configurations. Examples include: personal computers, server computers, handheld or portable devices, tablet devices, multiprocessor systems, microprocessor-based systems, set-top boxes, programmable consumer electronics, network PCs, minicomputers, mainframe computers, and distributed computing environments including any of the above systems or devices. This invention can be described in the general context of computer-executable instructions, such as program modules, that are executed by a computer. Generally, program modules include routines, programs, objects, components, data structures, etc., that perform specific tasks or implement specific abstract data types. This invention can also be practiced in distributed computing environments where tasks are performed by remote processing devices connected via a communication network. In distributed computing environments, program modules can reside in local and remote computer storage media, including storage devices.

[0038] Figure 1 This is an optional flowchart of the sorting and scheduling method provided in the embodiments of the present invention. Figure 1 The method may include, but is not limited to, steps S100 to S300.

[0039] S100: In response to the task request command from the target robot, obtain the number of tasks in the task queue and the status data of the target robot;

[0040] The status data includes the placement position status and the number of consecutive tasks. Specifically, the task queue includes the loading queue and the unloading queue, and the task count includes the corresponding loading task count and unloading task count. The placement position status includes occupied and idle. For example, whether the placement position is idle is determined by collecting data on whether there are boards on the robot placement line (production line or assembly line), which can be determined by infrared detection or visual detection. The number of consecutive tasks includes the number of loading and unloading. It should also be noted that each robot is preset with a maximum number of consecutive loading and unloading times. If not configured, the default is 1 in and 1 out.

[0041] For example, in some specific implementations, it is assumed that there is a U number of tasks uploaded. i There are D tasks that have been removed from the platform. i Robot R i Robot r i Plate placement status S i (Occupied, idle). Robot r i Maximum consecutive listing count x, robot R i Maximum consecutive delisting count y, current listing count x1, current delisting count y1.

[0042] S200: Determine the task response status of the target robot based on the number of tasks and status data combined with preset judgment conditions;

[0043] In some embodiments, the number of tasks includes the number of tasks to be put on the shelf and the number of tasks to be taken off the shelf. Step S200 may include the following steps: when the number of tasks to be put on the shelf and the number of tasks to be taken off the shelf are both 0, or when the number of tasks to be put on the shelf is 0, the number of tasks to be taken off the shelf is greater than 0 and the shelf position is occupied, the task response status of the target robot is determined to be no task response.

[0044] For example, in some specific embodiments, robot R i The state determination of no task response can be implemented as follows:

[0045]

[0046] In some embodiments, the number of tasks includes the number of tasks to be put on the shelf and the number of tasks to be taken off the shelf, and the number of consecutive tasks includes the number of times to be put on the shelf and the number of times to be taken off the shelf; step S200 may include the following steps: when the number of tasks to be put on the shelf is greater than 0 and the number of tasks to be taken off the shelf is 0, or when both the number of tasks to be put on the shelf and the number of tasks to be taken off the shelf are greater than 0 and the number of times to be put on the shelf is less than the preset maximum number of consecutive times to be put on the shelf, or when both the number of tasks to be put on the shelf and the number of tasks to be taken off the shelf are greater than 0 and the shelf placement position is occupied, the task response status of the target robot is determined to be the task to be put on the shelf response.

[0047] For example, in some specific embodiments, robot R i The status determination of the upload task response can be implemented as follows:

[0048]

[0049] In some embodiments, the number of tasks includes the number of tasks to be put on the shelf and the number of tasks to be taken off the shelf, and the number of consecutive tasks includes the number of times to be put on the shelf and the number of times to be taken off the shelf; step S200 may include the following steps: when the number of tasks to be put on the shelf is 0, the number of tasks to be taken off the shelf is greater than 0 and the shelf placement position is idle, or when the number of tasks to be put on the shelf and the number of tasks to be taken off the shelf are both greater than 0, the shelf placement position is idle, the number of times to be taken off the shelf is less than the preset maximum number of consecutive times to be taken off the shelf and the number of times to be put on the shelf is 0, the task response status of the target robot is determined to be the task to be taken off the shelf response.

[0050] For example, in some specific embodiments, robot R u The status determination of the delisting task response can be implemented as follows:

[0051]

[0052] S300: Based on the task response status, issue the target task to the target robot;

[0053] In some embodiments, the task response status includes no task response and data status abnormality. Step S300 may include the following steps: when the task response status is no task response or data status abnormality, issue an empty task to the target robot; wherein, when the task number and / or status data cannot be obtained, or when the task number and / or status data shows data abnormality, the task response status of the target robot is determined to be data status abnormality; data abnormality includes data missing and data garbled characters.

[0054] For example, in some specific implementations, if any of the aforementioned steps encounters a problem, an empty task signal will be issued, and the system operation log will display the problem. In addition, when the task response status determined by the data is no task response, an empty task signal will also be issued, and then the real-time task number and status data will be collected periodically for cyclical determination until the task is successfully obtained.

[0055] In some embodiments, the task response status includes a task placement response, and step S300 may include the following steps: when the task response status is a task placement response, retrieve the task from the task placement queue of the task queue and send it to the target robot for processing.

[0056] In some embodiments, the task response status includes a delisting task response, and step S300 may include the following steps: when the task response status is a delisting task response, retrieve the delisting task from the delisting queue of the task queue and send it to the target robot for processing.

[0057] For example, in some specific implementations, based on the status of the task upload response (i.e., there is a task upload in the task upload queue and the robot's status meets the requirements of the task upload), the corresponding task upload is retrieved from the task upload queue and sent to the robot; or, based on the status of the task take-off response (i.e., there is a task take-off in the task take-off queue and the robot's status meets the requirements of the task take-off), the corresponding task take-off is retrieved from the task take-off queue and sent to the robot.

[0058] To explain in detail the principle of the technical solution of the present invention, the overall process of the present invention will be described below with reference to some specific embodiments. It is easy to understand that the following is an explanation of the technical principle of the present invention and should not be regarded as a limitation of the present invention.

[0059] First and foremost, it's important to note that board sorting is a crucial step in furniture manufacturing, and its efficiency directly impacts the overall production line's efficiency and cost. Traditional manual sorting and simple rule-based scheduling are inefficient, and human error leading to production delays or quality issues is no longer sufficient for large-scale, high-efficiency sorting. Furthermore, robotic arm scheduling is a key factor affecting sorting efficiency.

[0060] In view of this, embodiments of the present invention provide an efficient and flexible robotic arm scheduling algorithm to optimize task allocation, reduce sorting time, and improve resource utilization.

[0061] like Figure 2 The sorting and scheduling workflow of the embodiment of the present invention shown can be implemented as follows:

[0062] 1) When the number of tasks listed is 0 and the number of tasks delisted is 0, then an empty task is issued.

[0063] 2) When the number of listing tasks > 0 and the number of delisting tasks = 0, then a listing task is issued (the specific listing location is determined by the listing algorithm).

[0064] 3) When the number of unloaded tasks is greater than 0 and the number of loaded tasks is 0, and the robot's placement position is idle (meaning that the sensor detects whether there is a board on the placement line when the robot arm unloads the board; if there is a board, it is not idle; if there is no board, it is idle), then an unloaded task is issued (which unloaded task is executed is determined by the unloaded task algorithm, which can be implemented based on condition matching, but is not the core of this invention and will not be elaborated here).

[0065] 4) If the number of tasks placed is greater than 0 and the number of tasks assigned is 0, and the robotic arm's placement position is not idle, then an empty task will be assigned.

[0066] 5) When the number of outgoing tasks is greater than 0 and the number of incoming tasks is greater than 0, and the robotic arm's placement position is not idle, an incoming task is issued (the specific placement position is determined by the placement algorithm; if the placement position is not idle, it means that the line from the placement position to the packaging port is congested, so in this case, the outgoing task is given priority. The placement algorithm can be implemented based on condition matching, which is not the core of this invention and will not be elaborated here).

[0067] 6) When the number of outgoing tasks is greater than 0 and the number of incoming tasks is greater than 0, and the robot's pallet placement position is idle, the sorting auxiliary system is checked to determine whether to perform an inbound or outbound operation. If not configured, the default is 1 inbound and 1 outbound. (If the robotic arm's pallet placement position is idle, it means that there is no congestion from the placement position to the packaging opening, which meets the most basic condition for de-out. At this time, it can operate normally according to the 1 inbound and 1 outbound rule.)

[0068] 7) If any of the above steps encounters a problem, an empty task signal will be issued, and the system operation log will display the problem until the task is successfully obtained.

[0069] In practical applications, this invention addresses the problem of deciding whether a robotic arm should perform shelving or unshelving tasks in automated board sorting, ensuring efficient operation of each robotic arm and maintaining a balance between shelving and unshelving. The availability of a placement position is determined by monitoring the presence of boards along the robot's placement line. If a board is present at the placement position, it indicates congestion at the packaging port (unshelving speed exceeds packaging efficiency), and the placement task is prioritized. Placement queue data is generated when boards arrive at the robot and report their arrival to the industrial control computer, indicating the available placement tasks. Unshelving queue data is generated automatically by the industrial control computer after determining that all boards with the same package number have been placed. Users can configure the number of inbound and outbound operations for the robotic arm via an interface; the default is typically one inbound and one outbound, as this minimizes the movement path when the robotic arm places a board and simultaneously retrieves it for unshelving.

[0070] The specific implementation algorithm is as follows:

[0071] Assume there are U tasks uploaded. u There are D tasks that have been removed from the platform. u Robot R u Robot R u Plate placement status S u (Occupied, Idle). Robot R u Maximum consecutive listing count x, robot R u Maximum consecutive delisting count y, current listing count x1, current delisting count y1.

[0072] Robot R u No task:

[0073] Listing Task:

[0074] Task to remove from shelves:

[0075] In summary, the purpose of this invention is to solve the problem of robot arm task allocation in automated sorting lines, aiming to improve robot arm operating efficiency, increase resource utilization, and ensure rapid loading and unloading of workpieces. This invention uses inbound and outbound queue data (corresponding to the loading and unloading queues of the task queue), and collects data on whether the placement position is occupied, and determines whether the robot is currently performing loading or unloading tasks based on the user-configured number of inbound and outbound operations. This controls the rhythm of inbound and outbound operations, ensuring that sorting inbound and outbound operations do not become congested. Compared to existing technologies, this invention has at least the following beneficial effects:

[0076] 1. High adaptability: Through parameter configuration, it can adapt to various different business needs;

[0077] 2. High efficiency: Sorting speed is significantly improved to meet the needs of large-scale production;

[0078] 3. Intelligent: Supports dynamic environmental perception and real-time adjustment to adapt to complex production scenarios.

[0079] like Figure 3 As shown, this embodiment of the invention also provides a sorting and scheduling device 900, which may include:

[0080] The first module 901 is used to respond to the task request command of the target robot, and obtain the number of tasks in the task queue and the status data of the target robot; the status data includes the placement position status and the number of consecutive tasks.

[0081] The second module 902 is used to determine the task response status of the target robot based on the number of tasks and status data combined with preset judgment conditions.

[0082] The third module 903 is used to issue target tasks to the target robot based on the task response status.

[0083] The content of the method embodiments of the present invention is applicable to the device embodiments. The specific functions implemented by the device embodiments are the same as those of the above method embodiments, and the beneficial effects achieved are also the same as those achieved by the above methods.

[0084] This invention also provides an electronic device, which includes a memory and a processor. The memory stores a computer program, and the processor executes the computer program to implement the above-described sorting and scheduling method. This electronic device can be any smart terminal, including tablet computers, in-vehicle computers, etc.

[0085] It is understood that the content of the above method embodiments is applicable to this device embodiment. The specific functions implemented by this device embodiment are the same as those of the above method embodiments, and the beneficial effects achieved are also the same as those achieved by the above method embodiments.

[0086] Please see Figure 4 , Figure 4 The hardware structure of an electronic device 1000 according to another embodiment is illustrated. The electronic device 1000 includes:

[0087] The processor 1001 can be implemented using a general-purpose CPU (Central Processing Unit), microprocessor, application-specific integrated circuit (ASIC), or one or more integrated circuits, and is used to execute relevant programs to implement the technical solutions provided in the embodiments of the present invention.

[0088] The memory 1002 can be implemented as a read-only memory (ROM), static storage device, dynamic storage device, or random access memory (RAM). The memory 1002 can store the operating system and other application programs. When the technical solutions provided in the embodiments of this specification are implemented through software or firmware, the relevant program code is stored in the memory 1002 and is called and executed by the processor 1001 to execute the sorting and scheduling method of the embodiments of this invention.

[0089] Input / output interface 1003 is used to implement information input and output;

[0090] The communication interface 1004 is used to enable communication and interaction between this device and other devices. Communication can be achieved through wired means (such as USB, network cable, etc.) or wireless means (such as mobile network, WIFI, Bluetooth, etc.).

[0091] Bus 1005 transmits information between various components of the device (e.g., processor 1001, memory 1002, input / output interface 1003, and communication interface 1004);

[0092] The processor 1001, memory 1002, input / output interface 1003 and communication interface 1004 are connected to each other within the device via bus 1005.

[0093] This invention also provides a computer-readable storage medium storing a computer program that, when executed by a processor, implements the sorting and scheduling method described above.

[0094] It is understood that the content of the above method embodiments is applicable to this storage medium embodiment. The specific functions implemented in this storage medium embodiment are the same as those in the above method embodiments, and the beneficial effects achieved are also the same as those achieved in the above method embodiments.

[0095] Memory, as a non-transitory computer-readable storage medium, can be used to store non-transitory software programs and non-transitory computer-executable programs. Furthermore, memory may include high-speed random access memory, and may also include non-transitory memory, such as at least one disk storage device, flash memory device, or other non-transitory solid-state storage device. In some embodiments, memory may optionally include memory remotely located relative to the processor, and these remote memories can be connected to the processor via a network. Examples of such networks include, but are not limited to, the Internet, intranets, local area networks, mobile communication networks, and combinations thereof.

[0096] The sorting scheduling method, sorting scheduling device, electronic device, and storage medium provided in this invention determine all sorting channels connected to the location of the board to be assigned in response to the location information of the board to be assigned; obtain the sorting rack configuration set and task quantity corresponding to each sorting channel; the sorting rack configuration set includes the storage space information and status information of each cell on the relevant sorting rack; in response to the size information of the board to be assigned, filter the target cells contained in all sorting channels based on the storage space information; determine the idle rate of the target cells of all sorting channels and the number of idle cells in each sorting channel according to the status information of the target cells; when the idle rate is less than or equal to a preset threshold, determine the target sorting channel based on the number of idle cells and the channel priority of each sorting channel; the channel priority level is negatively correlated with the distance of the sorting channel from the location of the board to be assigned; when the idle rate is greater than the preset threshold, determine the target sorting channel based on the number of tasks and the channel priority of each sorting channel. The embodiments of the present invention improve sorting efficiency and accuracy through intelligent and scenario-based sorting methods, and also optimize the sorting process, providing strong technical support for the automation development of the furniture manufacturing industry.

[0097] The embodiments described in this invention are for the purpose of more clearly illustrating the technical solutions of the embodiments of this invention, and do not constitute a limitation on the technical solutions provided by the embodiments of this invention. As those skilled in the art will know, with the evolution of technology and the emergence of new application scenarios, the technical solutions provided by the embodiments of this invention are also applicable to similar technical problems.

[0098] Those skilled in the art will understand that the technical solutions shown in the figures do not constitute a limitation on the embodiments of the present invention, and may include more or fewer steps than shown, or combine certain steps, or different steps.

[0099] The system embodiments described above are merely illustrative. The units described as separate components may or may not be physically separate; that is, they may be located in one place or distributed across multiple network units. Some or all of the modules can be selected to achieve the purpose of this embodiment according to actual needs.

[0100] Those skilled in the art will understand that all or some of the steps in the methods disclosed above, as well as the functional modules / units in the systems and devices, can be implemented as software, firmware, hardware, or suitable combinations thereof.

[0101] The terms "first," "second," "third," "fourth," etc. (if present) in the specification and accompanying drawings of this invention are used to distinguish similar objects and are not necessarily used to describe a specific order or sequence. It should be understood that such data can be interchanged where appropriate so that embodiments of the invention described herein can be implemented in orders other than those illustrated or described herein. Furthermore, the terms "comprising" and "having," and any variations thereof, are intended to cover a non-exclusive inclusion; for example, a process, method, system, product, or apparatus that comprises a series of steps or units is not necessarily limited to those steps or units explicitly listed, but may include other steps or units not explicitly listed or inherent to such processes, methods, products, or apparatus.

[0102] It should be understood that in this invention, "at least one (item)" refers to one or more, and "more than one" refers to two or more. "And / or" describes the relationship between related objects, indicating that three relationships can exist. For example, "A and / or B" can represent three cases: only A exists, only B exists, and both A and B exist simultaneously, where A and B can be singular or plural. The character " / " generally indicates that the preceding and following related objects are in an "or" relationship. "At least one (item) of the following" or similar expressions refer to any combination of these items, including any combination of single or plural items. For example, at least one (item) of a, b, or c can represent: a, b, c, "a and b", "a and c", "b and c", or "a and b and c", where a, b, and c can be single or multiple.

[0103] In the embodiments provided by this invention, it should be understood that the disclosed systems and methods can be implemented in other ways. For example, the system embodiments described above are merely illustrative; for instance, the division of the units described above is only a logical functional division, and in actual implementation, there may be other division methods. For example, multiple units or components may be combined or integrated into another system, or some features may be ignored or not executed. Furthermore, the coupling or direct coupling or communication connection shown or discussed may be through some interfaces; the indirect coupling or communication connection between systems or units may be electrical, mechanical, or other forms.

[0104] The units described above as separate components may or may not be physically separate. The components shown as units may or may not be physical units; that is, they may be located in one place or distributed across multiple network units. Some or all of the units can be selected to achieve the purpose of this embodiment according to actual needs.

[0105] Furthermore, the functional units in the various embodiments of the present invention can be integrated into one processing unit, or each unit can exist physically separately, or two or more units can be integrated into one unit. The integrated unit can be implemented in hardware or as a software functional unit.

[0106] If the integrated unit is implemented as a software functional unit and sold or used as an independent product, it can be stored in a computer-readable storage medium. Based on this understanding, the technical solution of the present invention, in essence, or the part that contributes to the prior art, or all or part of the technical solution, can be embodied in the form of a software product. This computer software product is stored in a storage medium and includes multiple instructions to cause a computer device (which may be a personal computer, server, or network device, etc.) to execute all or part of the steps of the methods of the various embodiments of the present invention. The aforementioned storage medium includes various media capable of storing programs, such as USB flash drives, portable hard drives, read-only memory (ROM), random access memory (RAM), magnetic disks, or optical disks.

[0107] The preferred embodiments of the present invention have been described above with reference to the accompanying drawings, but this does not limit the scope of the claims of the present invention. Any modifications, equivalent substitutions, and improvements made by those skilled in the art without departing from the scope and spirit of the present invention should be within the scope of the claims of the present invention.

Claims

1. A sorting and scheduling method, characterized in that, The method includes the following steps: In response to a task request command from the target robot, the number of tasks in the task queue and the status data of the target robot are obtained; the status data includes the placement position status and the number of consecutive tasks. The task response status of the target robot is determined based on the number of tasks and the status data, combined with preset judgment conditions. The number of tasks includes the number of tasks uploaded and the number of tasks removed from the platform, and the number of consecutive tasks includes the number of times tasks are uploaded and the number of times tasks are removed from the platform. Determining the task response status of the target robot based on the number of tasks and the status data, combined with preset judgment conditions, includes the following steps: When the number of tasks put on the shelf is greater than 0 and the number of tasks taken off the shelf is 0, or when both the number of tasks put on the shelf and the number of tasks taken off the shelf are greater than 0 and the number of times the shelf is put on the shelf is less than the preset maximum number of consecutive times, or when both the number of tasks put on the shelf and the number of tasks taken off the shelf are greater than 0 and the shelf placement position is occupied, the task response status of the target robot is determined to be a shelf task response. Based on the task response status, the target task is issued to the target robot.

2. The sorting and scheduling method according to claim 1, characterized in that, The number of tasks includes the number of tasks uploaded and the number of tasks removed. Determining the task response status of the target robot based on the number of tasks and the status data, combined with preset judgment conditions, includes the following steps: When both the number of tasks put on the shelf and the number of tasks taken off the shelf are 0, or when the number of tasks put on the shelf is 0, the number of tasks taken off the shelf is greater than 0, and the placement position is occupied, the task response status of the target robot is determined to be no task response.

3. The sorting and scheduling method according to claim 1 or 2, characterized in that, The task response status includes no task response and abnormal data status. The step of issuing the target task to the target robot based on the task response status includes the following steps: When the task response status is "no task response" or the data status is abnormal, an empty task is issued to the target robot. Specifically, if the number of tasks and / or the status data cannot be obtained, or if the number of tasks and / or the status data shows abnormality, the task response status of the target robot is determined to be an abnormal data status.

4. The sorting and scheduling method according to claim 1, characterized in that, The task response status includes an assigned task response. The step of issuing a target task to the target robot based on the task response status includes the following steps: When the task response status is the "listing task response", the listing task is retrieved from the listing queue of the task queue and sent to the target robot for processing.

5. The sorting and scheduling method according to claim 1, characterized in that, The number of tasks includes the number of tasks uploaded and the number of tasks removed, and the number of consecutive tasks includes the number of times tasks are uploaded and the number of times tasks are removed; determining the task response status of the target robot based on the number of tasks and the status data combined with preset judgment conditions includes the following steps: When the number of tasks to be put on the shelf is 0, the number of tasks to be taken off the shelf is greater than 0 and the shelf placement position is idle, or when both the number of tasks to be put on the shelf and the number of tasks to be taken off the shelf are greater than 0, the shelf placement position is idle, the number of times the shelf is taken off the shelf is less than the preset maximum number of consecutive times the shelf is taken off the shelf and the number of times the shelf is put on the shelf is 0, the task response status of the target robot is determined to be a shelf taking off task response.

6. The sorting and scheduling method according to claim 1 or 5, characterized in that, The task response status includes a task removal response. The step of issuing a target task to the target robot based on the task response status includes the following steps: When the task response status is the delisting task response, the delisting task is retrieved from the delisting queue of the task queue and sent to the target robot for processing.

7. A sorting and scheduling device, characterized in that, The device includes: The first module is used to respond to the task request command of the target robot, and obtain the number of tasks in the task queue and the status data of the target robot; the status data includes the placement position status and the number of consecutive tasks. The second module is used to determine the task response status of the target robot based on the number of tasks and the status data combined with preset judgment conditions; The number of tasks includes the number of tasks uploaded and the number of tasks removed from the platform, and the number of consecutive tasks includes the number of times tasks are uploaded and the number of times tasks are removed from the platform. Determining the task response status of the target robot based on the number of tasks and the status data, combined with preset judgment conditions, includes the following steps: When the number of tasks put on the shelf is greater than 0 and the number of tasks taken off the shelf is 0, or when both the number of tasks put on the shelf and the number of tasks taken off the shelf are greater than 0 and the number of times the shelf is put on the shelf is less than the preset maximum number of consecutive times, or when both the number of tasks put on the shelf and the number of tasks taken off the shelf are greater than 0 and the shelf placement position is occupied, the task response status of the target robot is determined to be a shelf task response. The third module is used to issue a target task to the target robot based on the task response status.

8. An electronic device, characterized in that, The electronic device includes a memory and a processor, the memory storing a computer program, and the processor executing the computer program to implement the sorting and scheduling method according to any one of claims 1 to 6.

9. A computer-readable storage medium storing a computer program, characterized in that, When the computer program is executed by the processor, it implements the sorting and scheduling method according to any one of claims 1 to 6.

Images