CN114282841A - Scheduling method, device, system, control equipment and readable storage medium - Google Patents
Scheduling method, device, system, control equipment and readable storage medium Download PDFInfo
- Publication number
- CN114282841A CN114282841A CN202111665211.3A CN202111665211A CN114282841A CN 114282841 A CN114282841 A CN 114282841A CN 202111665211 A CN202111665211 A CN 202111665211A CN 114282841 A CN114282841 A CN 114282841A
- Authority
- CN
- China
- Prior art keywords
- target
- task
- storage position
- target task
- preset condition
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Pending
Links
- 238000000034 method Methods 0.000 title claims abstract description 62
- 238000004590 computer program Methods 0.000 claims description 8
- 238000004891 communication Methods 0.000 claims description 4
- 230000005012 migration Effects 0.000 claims description 4
- 238000013508 migration Methods 0.000 claims description 4
- 230000008569 process Effects 0.000 description 11
- 238000010586 diagram Methods 0.000 description 10
- 238000012546 transfer Methods 0.000 description 8
- 230000006870 function Effects 0.000 description 4
- 230000009471 action Effects 0.000 description 3
- 230000003993 interaction Effects 0.000 description 3
- 238000011161 development Methods 0.000 description 2
- 230000004048 modification Effects 0.000 description 2
- 238000012986 modification Methods 0.000 description 2
- 238000012545 processing Methods 0.000 description 2
- 230000005540 biological transmission Effects 0.000 description 1
- 230000006872 improvement Effects 0.000 description 1
- 230000003287 optical effect Effects 0.000 description 1
- 239000000126 substance Substances 0.000 description 1
- 238000006467 substitution reaction Methods 0.000 description 1
Images
Classifications
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06Q—INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
- G06Q10/00—Administration; Management
- G06Q10/06—Resources, workflows, human or project management; Enterprise or organisation planning; Enterprise or organisation modelling
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06Q—INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
- G06Q10/00—Administration; Management
- G06Q10/08—Logistics, e.g. warehousing, loading or distribution; Inventory or stock management
Landscapes
- Business, Economics & Management (AREA)
- Engineering & Computer Science (AREA)
- Economics (AREA)
- Strategic Management (AREA)
- Entrepreneurship & Innovation (AREA)
- Human Resources & Organizations (AREA)
- Quality & Reliability (AREA)
- Operations Research (AREA)
- Marketing (AREA)
- Development Economics (AREA)
- Tourism & Hospitality (AREA)
- Physics & Mathematics (AREA)
- General Business, Economics & Management (AREA)
- General Physics & Mathematics (AREA)
- Theoretical Computer Science (AREA)
- Educational Administration (AREA)
- Game Theory and Decision Science (AREA)
- General Factory Administration (AREA)
Abstract
The application provides a scheduling method, a device, a system, a control device and a readable storage medium, comprising: determining a first target task according to the task instruction; judging whether the first target task meets a first preset condition or not; if the first target task meets a first preset condition, writing the first target task into a task pool to be executed; judging whether idle equipment exists in equipment in a target area; if the idle equipment exists, determining first target equipment required by the first target task from the idle equipment; and controlling the first target equipment to execute the first target task. According to the embodiment of the application, the tasks are matched with the first preset conditions and the equipment, the tasks meeting the conditions are matched with the equipment, the intelligent scheduling of the equipment is achieved, the full utilization of the equipment is guaranteed, and the warehousing scheduling efficiency is improved.
Description
Technical Field
The application relates to the field of warehousing scheduling, in particular to a scheduling method, a scheduling device, a scheduling system, a scheduling control device and a readable storage medium.
Background
With the development of automation, in the field of warehouse scheduling, tasks such as warehouse-out, warehouse-in, warehouse moving and the like of a warehouse are often executed through an intelligent trolley. However, with the diversification of tasks and the complicated development of warehouse positions, how to more intelligently schedule the intelligent freight cars so as to realize the business mode of 'cars waiting for goods' is a problem to be solved urgently in the field of warehouse scheduling.
Disclosure of Invention
In view of the above, an object of the embodiments of the present application is to provide a scheduling method, apparatus, system, control device and readable storage medium. The intelligent freight car can be flexibly dispatched to realize the business mode of 'freight waiting for cars'.
In a first aspect, an embodiment of the present application provides a scheduling method, including: determining a first target task according to the task instruction; judging whether the first target task meets a first preset condition or not; if the first target task meets a first preset condition, writing the first target task into a task pool to be executed; judging whether idle equipment exists in equipment in a target area; if the idle equipment exists, determining first target equipment required by the first target task from the idle equipment; and controlling the first target equipment to execute the first target task.
In the implementation process, by comparing the task with the first preset condition, the task which can be executed is determined, the task is put into a task pool to be executed to wait for execution, whether idle equipment exists is judged, target equipment which can execute the task is determined from the idle equipment, the target equipment is controlled to execute the task, the task and the equipment are reasonably scheduled, the generation of the idle equipment is reduced, and the working efficiency is improved.
With reference to the first aspect, an embodiment of the present application provides a first possible implementation manner of the first aspect, where: the method further comprises the following steps: if the first target task does not accord with a first preset condition, judging whether a second target task exists or not; if the second target task does not exist, generating a second target task according to the first target task and a preset rule; judging whether the second target task meets a second preset condition or not; if the second target task meets the second preset condition, writing the second target task into a task pool to be executed; judging whether idle equipment exists in equipment in a target area; if the idle equipment exists, determining second target equipment required by the second target task from the idle equipment; and controlling the second target equipment to execute the second target task.
In the implementation process, when the first target task does not meet the condition, whether a second target task exists is judged, if the second target task exists, equipment capable of executing the second target task is determined from the idle equipment, and the equipment is controlled to execute the second target task, so that the equipment is fully utilized, and the working efficiency is improved.
With reference to the first possible implementation manner of the first aspect, an embodiment of the present application provides a second possible implementation manner of the first aspect, where: if the first target task is a warehousing task, the judging whether the first target task meets a first preset condition includes: determining a first library position according to the first target task; judging whether the first storage position is a first target storage position, wherein the first target storage position is an inner layer storage position of a shelf where the first storage position is located; and if the first library position is a first target library position, representing that the first target task meets a first preset condition.
In the implementation process, the library position where the task is located is determined through the task, whether the library position is a lining library position is judged, when the library position is the lining library position, the library position meets the condition is indicated, the warehousing task of the lining library position is executed preferentially, the lining library position is prevented from being idle, and the occupancy rate of the library position is improved.
With reference to the second possible implementation manner of the first aspect, an embodiment of the present application provides a third possible implementation manner of the first aspect, where if the second target task is an ex-warehouse task, the determining whether the second target task meets a second preset condition includes: if the first storage position is a second target storage position, judging whether the second target storage position has the ex-warehouse task, wherein the second target storage position is the outermost storage position of the goods shelf where the first storage position is located; and if the second target library position has the ex-warehouse task, representing that the second target task meets the second preset condition.
In the implementation process, whether the warehouse-out task exists in the outermost layer of the target warehouse location or not is determined, if the warehouse-out task exists in the outermost layer, the condition is firstly judged to be met, and the warehouse-out task in the outermost layer is executed firstly. The method has the advantages that the outermost library position can be vacated, corresponding tasks can be completed by completing the inner library position, the smoothness of task completion is guaranteed, the efficiency of task completion is improved, and the utilization rate of the library position is improved.
With reference to the third possible implementation manner of the first aspect, an embodiment of the present application provides a fourth possible implementation manner of the first aspect, where if the first target task is a ex-warehouse task, the determining whether the first target task meets a first preset condition includes: determining a second library position according to the first target task; judging whether the second storage position is a third target storage position, wherein the third target storage position is the outermost storage position of the shelf where the second storage position is located; and if the second library position is a third target library position, representing that the first target task meets a first preset condition.
In the implementation process, the warehouse location where the task is located is determined through the task, whether the warehouse location is the outermost warehouse location is judged, when the warehouse location is the outermost warehouse location, the warehouse location meets the condition is indicated, and the warehouse exiting task of the outermost warehouse location is executed preferentially, so that the situation that goods exist on the outermost warehouse location and influence on the task executed by the inner layer warehouse location is prevented, the working efficiency is improved, and meanwhile, the occupancy rate of the warehouse location is improved.
With reference to the fourth possible implementation manner of the first aspect, an embodiment of the present application provides a fifth possible implementation manner of the first aspect, where if the second target task is a library migration task, the determining whether the second target task meets a second preset condition includes: if the second storage position is a fourth target storage position, judging whether goods exist in the third target storage position, wherein the fourth target storage position is an inner layer storage position of a goods shelf where the second storage position is located; if goods exist in the third target storage position, judging whether a storage moving task exists in the third target storage position; and if the third target library position has the library moving task, representing that the second target task meets the second preset condition.
In the implementation process, if the target library position of the second target task is the inner-layer library position, whether goods exist in the outermost layer library position of the target library position is determined firstly, if the goods exist in the outermost layer library position, whether a library shifting task exists in the outermost layer library position is further judged, and if the library shifting task exists, the outermost layer library shifting task is executed firstly. The outmost storehouse position can be vacated to accomplish the task that the nexine storehouse position corresponds, guarantee the smoothness of task completion, improve the efficiency that the task was accomplished, improve the utilization ratio of storehouse position.
In a second aspect, an embodiment of the present application further provides a scheduling apparatus, including: a determination module: the task instruction is used for determining a first target task according to the task instruction; a first judgment module: the first target task is used for judging whether the first target task meets a first preset condition or not; a writing module: the task pool management module is used for writing the first target task into a task pool to be executed if the first target task meets a first preset condition; a second judging module: the device is used for judging whether idle devices exist in the devices in the target area; a determination module: if the idle equipment exists, determining first target equipment required by the first target task from the idle equipment; a control module: for controlling the first target device to perform the first target task.
In a third aspect, an embodiment of the present application further provides a scheduling system, including: intelligent freight equipment; control equipment, the control equipment and the intelligent freight car communication connection, the control equipment through control the intelligent freight car, realizes the above-mentioned first aspect, or the steps of the method in any one of the possible embodiments of the first aspect.
In a fourth aspect, an embodiment of the present application further provides a control device, including: a processor, a memory storing machine-readable instructions executable by the processor, the machine-readable instructions, when executed by the processor, to perform the steps of the method of the first aspect described above, or any possible implementation of the first aspect, when the control device is run.
In a fifth aspect, this embodiment of the present application further provides a computer-readable storage medium, where a computer program is stored on the computer-readable storage medium, and the computer program is executed by a processor to perform the steps of the scheduling method in the foregoing first aspect or any possible implementation manner of the first aspect.
In order to make the aforementioned objects, features and advantages of the present application more comprehensible, embodiments accompanied with figures are described in detail below.
Drawings
In order to more clearly illustrate the technical solutions of the embodiments of the present application, the drawings that are required to be used in the embodiments will be briefly described below, it should be understood that the following drawings only illustrate some embodiments of the present application and therefore should not be considered as limiting the scope, and for those skilled in the art, other related drawings can be obtained from the drawings without inventive effort.
Fig. 1 is a block schematic diagram of a control device provided in an embodiment of the present application;
fig. 2 is a schematic diagram illustrating interaction between an intelligent cargo transportation device and a control device provided in an embodiment of the present application;
fig. 3 is a flowchart of a scheduling method according to an embodiment of the present application;
fig. 4 is a flowchart of a warehousing method provided in an embodiment of the present application;
FIG. 5 is a flowchart of a ex-warehouse method according to an embodiment of the present application;
FIG. 6 is a flowchart of a method for transferring libraries according to an embodiment of the present application;
fig. 7 is a functional block diagram of a scheduling apparatus according to an embodiment of the present application.
Detailed Description
The technical solution in the embodiments of the present application will be described below with reference to the drawings in the embodiments of the present application.
It should be noted that: like reference numbers and letters refer to like items in the following figures, and thus, once an item is defined in one figure, it need not be further defined and explained in subsequent figures. Meanwhile, in the description of the present application, the terms "first", "second", and the like are used only for distinguishing the description, and are not to be construed as indicating or implying relative importance.
To facilitate understanding of the present embodiment, a detailed description is first given of a control device that executes the scheduling method disclosed in the embodiments of the present application.
As shown in fig. 1, is a block schematic diagram of a control device. The control device 100 may include a memory 111, a processor 113. It will be understood by those of ordinary skill in the art that the configuration shown in fig. 1 is merely an illustration and is not intended to limit the configuration of the control apparatus 100. For example, the control device 100 may also include more or fewer components than shown in FIG. 1, or have a different configuration than shown in FIG. 1.
The aforementioned components of the memory 111 and the processor 113 are electrically connected to each other directly or indirectly to realize data transmission or interaction. For example, the components may be electrically connected to each other via one or more communication buses or signal lines. The processor 113 is used to execute the executable modules stored in the memory.
The Memory 111 may be, but is not limited to, a Random Access Memory (RAM), a Read Only Memory (ROM), a Programmable Read-Only Memory (PROM), an Erasable Read-Only Memory (EPROM), an electrically Erasable Read-Only Memory (EEPROM), and the like. The memory 111 is configured to store a program, and the processor 113 executes the program after receiving an execution instruction, and the method executed by the control device 100 defined by the process disclosed in any embodiment of the present application may be applied to the processor 113, or implemented by the processor 113.
The processor 113 may be an integrated circuit chip having signal processing capability. The Processor 113 may be a general-purpose Processor, and includes a Central Processing Unit (CPU), a Network Processor (NP), and the like; the Integrated Circuit may also be a Digital Signal Processor (DSP), an Application Specific Integrated Circuit (ASIC), a Field Programmable Gate Array (FPGA) or other programmable logic device, a discrete gate or transistor logic device, or a discrete hardware component. The various methods, steps, and logic blocks disclosed in the embodiments of the present application may be implemented or performed. A general purpose processor may be a microprocessor or the processor may be any conventional processor or the like.
The control device 100 in this embodiment may be configured to execute each step in each method provided in this embodiment. The implementation of the scheduling method is described in detail by several embodiments.
As shown in fig. 2, it is a schematic diagram of the intelligent cargo transportation device 200 provided in the embodiment of the present application interacting with the control device 100. The control device 100 is communicatively coupled to one or more intelligent cargo devices 200 via a network for data communication or interaction.
The intelligent transportation device 200 may be an RGV (Rail Guided Vehicle, chinese name: Guided Vehicle), an AGV (Automated Guided Vehicle, chinese name: automatic guidance device), or the like. The control device 100 may be a computer, a mobile phone, a tablet, or other intelligent terminal. The control device 100 may be a control device such as a single chip microcomputer or a programmable controller provided in the intelligent cargo device 200. The control device 100 may also be a web server, a database server, or the like.
Please refer to fig. 3, which is a flowchart illustrating a scheduling method according to an embodiment of the present application. The specific process shown in fig. 2 will be described in detail below.
Wherein, the task instruction may include a task type, a task location, and the like, and the first target task may include: ex-warehouse tasks, in-warehouse tasks, transfer tasks and the like.
Alternatively, the task instruction may be obtained after being parsed by the upper system.
The first preset conditions corresponding to different first target tasks are different. The first preset condition can be set according to actual conditions.
For example, if the first target task is a warehousing task, the corresponding first preset condition may be set that the target library position of the first target task is a deep-layer task. If the first target task is an ex-warehouse task, the corresponding first preset condition may be set that the target warehouse location of the first target task is the outermost task. If the first target task is a move library task, the corresponding first preset condition may be set that the target library position of the first target task is a back layer task.
The task pool to be executed comprises all tasks to be executed.
And step 204, judging whether the equipment in the target area has idle equipment.
Wherein, the target area can be a warehouse, a factory building and the like.
Optionally, step 204 may include: receiving task execution state information of the equipment, determining whether the equipment has executed a task according to the task execution state information of the equipment, and if the equipment has executed the current task, judging that the equipment is idle.
Alternatively, the status information may be ex-warehouse, in-warehouse, moving warehouse, out-warehouse, in-warehouse, moving warehouse, and the like.
If there is an idle device, step 205 is executed.
If the scheduled device is an RGV car, for example, if the task execution status information of the idle RGV car is "ex warehouse", it is determined that the tasks executable by the idle RGV car may include "warehousing", "moving warehouse", and the like. And if the task execution state information of the idle RGV trolley is 'warehoused', determining that the tasks executable by the idle RGV trolley can comprise 'warehouse-out', 'warehouse-moving', and the like.
For example, if the executable task of the idle RGV car a at this time is "entering" or "moving to storage", the executable task of the idle RGV car B at this time is "exiting" or "moving to storage", and the executable task of the idle RGV car C at this time is "entering" or "exiting". If the first target task at this time is an ex-warehouse task, it may be determined that the first target RGV car may be an idle RGV car B and an idle RGV car C. If the first target task at this time is the warehousing task, it may be determined that the first target RGV car may be an idle RGV car a and an idle RGV car C.
Optionally, when there are a plurality of first target devices, the selection may be performed according to the distance between the plurality of first target devices and the last task time, or may be performed according to the distance between the plurality of first target devices and the first target task position.
In the above steps 201 to 206, when the first target task satisfies the first preset condition, the first target task may be executed directly by controlling the first target device; but not all the first target tasks can meet the first preset condition, and on the basis, the scheduling method further comprises the following steps:
if the first target task does not accord with a first preset condition, judging whether a second target task exists or not; if the second target task does not exist, generating a second target task according to the first target task and a preset rule; judging whether the second target task meets a second preset condition or not; if the second target task meets a second preset condition, writing the second target task into a task pool to be executed; judging whether idle equipment exists in equipment in a target area; if the idle equipment exists, determining second target equipment required by a second target task from the idle equipment; and controlling the second target device to execute the second target task.
Optionally, the second target task is a task other than the first target task, and the second target task may be an ex-warehouse task, an in-warehouse task, a move-warehouse task, or the like.
Illustratively, when the first target task is an ex-warehouse task, the second target task may be a move-warehouse task; when the first target task is a warehousing task, the second target task can be an ex-warehouse task; when the first target task is a migration task, the second target task may be an ex-warehouse task.
And the second preset conditions corresponding to different second target tasks are different. The second preset condition can be set according to actual conditions.
For example, if the second target task is a warehousing task, the corresponding second preset condition may be set that the target library position of the second target task is the outermost task. If the second target task is an ex-warehouse task, the corresponding second preset condition can be set that the target warehouse location of the second target task is a back-layer task. If the second target task is a move library task, the corresponding second preset condition may be set that the target library position of the second target task is the outermost task.
Optionally, after the second target task is executed, the method further includes: judging whether the first target task meets a first preset condition, if so, writing the first target task into a task pool to be executed, judging whether idle equipment exists in equipment in a target area, and if so, determining first target equipment required by the first target task from the idle equipment. If the first target task does not accord with the first preset condition, judging whether a second target task exists or not; if the second target task does not exist, generating a second target task according to the first target task and a preset rule; judging whether the second target task meets a second preset condition or not; if the second target task meets a second preset condition, writing the second target task into a task pool to be executed; judging whether idle equipment exists in equipment in a target area; if the idle equipment exists, determining second target equipment required by a second target task from the idle equipment; and controlling the second target equipment to execute the second target task until the first target task meets the first preset condition.
The first preset condition and the second preset condition corresponding to different first target tasks and second target tasks are different, and embodiments of the present application are further described below by using several specific embodiments.
In a possible implementation manner, as shown in fig. 4, if the first target task is a warehousing task, step 202 includes: determining a first library position according to the first target task; judging whether the first storage position is a first target storage position, wherein the first target storage position is an inner layer storage position of a shelf where the first storage position is located; if the first library position is the first target library position, the first target task is represented to meet a first preset condition.
If the scheduled device is an RGV car, exemplarily, if the first target task is an in-storage task, the method includes: determining a first storage position according to the warehousing task, judging whether the first storage position is the inner layer storage position of the shelf where the first storage position is located, if so, indicating that the warehousing task meets a first preset condition, further judging whether an idle RGV (small target vehicle) is present in a target area, if so, determining an RGV (small target vehicle) capable of executing the warehousing task from the idle RGV, and controlling the RGV to execute the warehousing task.
In a possible implementation manner, if the second target task is an ex-warehouse task, determining whether the second target task meets a second preset condition includes: judging whether the first warehouse location has an ex-warehouse task; and if the first library position has the ex-library task, representing that the second target task meets a second preset condition.
Illustratively, if the first storage position is the outermost storage position of the shelf where the first storage position is located, it indicates that the warehousing task does not meet the first preset condition, further, it is determined whether an ex-warehouse task exists in the inner storage position, if the ex-warehouse task exists in the inner storage position, it indicates that the second target task meets the second preset condition, further, it is determined whether an idle RGV car exists in the target area, if an idle RGV car exists, an RGV car capable of executing the ex-warehouse task is determined in the idle RGV car, and the RGV car is controlled to execute the ex-warehouse task until the inner storage position of the shelf where the first storage position is located is idle, and the RGV car can be used for executing the warehousing task.
In one possible implementation, as shown in fig. 5, if the first target task is an ex-warehouse task, step 202 includes: determining a second library position according to the first target task; judging whether the second storage position is a third target storage position, wherein the third target storage position is the outermost storage position of the shelf where the second storage position is located; and if the second library position is a third target library position, representing that the first target task meets a first preset condition.
If the scheduled device is an RGV car, for example, if the first target task is an ex-warehouse task, the method includes: determining a first storage position according to the ex-warehouse task, judging whether the first storage position is the outermost storage position of a shelf where the first storage position is located, if so, indicating that the ex-warehouse task meets a first preset condition, further judging whether an idle RGV (traffic group vehicle) trolley exists in a target area, if so, determining an RGV trolley which can execute the ex-warehouse task from the idle RGV trolley, and controlling the RGV trolley to execute the ex-warehouse task.
In a possible implementation manner, if the second target task is a library migration task, determining whether the second target task meets a second preset condition includes: if the second storage position is a fourth target storage position, judging whether goods exist in the third target storage position, wherein the fourth target storage position is an inner layer storage position of a goods shelf where the second storage position is located; if goods exist in the third target storage position, judging whether a transfer task exists in the third target storage position; and if the third target library position has a library shifting task, representing that the second target task meets a second preset condition.
Illustratively, if the first storage location is an inner storage location of a shelf where the first storage location is located, it indicates that the ex-storage task does not satisfy a first preset condition, further, it is determined whether goods exist in the outermost storage location, if the goods exist in the outermost storage location, it is determined whether a transfer task exists in the outermost storage location, if a transfer task exists in a third target storage location, it indicates that the second target task meets a second preset condition, further, it is determined whether an idle RGV car exists in the target area, if an idle RGV car exists, an RGV car which can execute the transfer task is determined in the idle RGV car, and the RGV car is controlled to execute the transfer task until no goods exist in the outer storage location corresponding to the inner storage location of the shelf where the first storage location is located. And if the third target library position does not have the library shifting task, indicating that the second target task does not accord with a second preset condition, and generating the library shifting task. And further, judging whether an idle RGV trolley exists in the target area, if so, determining the RGV trolley capable of executing the garage moving task from the idle RGV trolleys, and controlling the RGV trolleys to execute the garage moving task until the outer layer storehouse position corresponding to the inner layer storehouse position of the shelf where the first storehouse position is located is free of goods.
In one possible implementation, as shown in fig. 6, if the first target task is a library transfer task, step 202 includes: determining a first library position according to the first target task; judging whether the first storage position is a first target storage position, wherein the first target storage position is an inner layer storage position of a shelf where the first storage position is located; if the first library position is the first target library position, the first target task is represented to meet a first preset condition.
If the scheduled device is an RGV car, for example, if the first target task is a garage transfer task, the method includes: determining a first storage position according to the garage moving task, judging whether the first storage position is the inner layer storage position of the goods shelf where the first storage position is located, if so, indicating that the garage moving task meets a first preset condition, further judging whether an idle RGV (traffic group vehicle) trolley exists in a target area, if so, determining an RGV trolley which can execute the garage moving task from the idle RGV trolley, and controlling the RGV trolley to execute the garage moving task.
In a possible implementation manner, if the second target task is an ex-warehouse task, determining whether the second target task meets a second preset condition includes: if the first storage position is a second target storage position, judging whether the second target storage position has a storage-out task, wherein the second target storage position is the outermost storage position of the shelf where the first storage position is located; and if the second target library position has the ex-warehouse task, representing that the second target task meets a second preset condition.
Illustratively, if the first storage position is the outermost storage position of the shelf where the first storage position is located, it indicates that the warehouse moving task does not meet a first preset condition, further, it is determined whether an ex-warehouse task exists in the inner storage position, if the ex-warehouse task exists in the inner storage position, it indicates that the second target task meets a second preset condition, further, it is determined whether an idle RGV car exists in the target area, if an idle RGV car exists, an RGV car capable of executing the ex-warehouse task is determined in the idle RGV car, and the RGV car is controlled to execute the ex-warehouse task until no ex-warehouse task exists in the inner storage position of the shelf where the first storage position is located.
Based on the same application concept, a scheduling apparatus corresponding to the scheduling method is also provided in the embodiments of the present application, and since the principle of the apparatus in the embodiments of the present application to solve the problem is similar to that in the embodiments of the scheduling method, the implementation of the apparatus in the embodiments of the present application may refer to the description in the embodiments of the foregoing method, and repeated details are not described again.
Please refer to fig. 7, which is a schematic diagram illustrating functional modules of a scheduling apparatus according to an embodiment of the present application. Each module in the scheduling apparatus in this embodiment is configured to execute each step in the foregoing method embodiment. The scheduling device comprises a determining module 301, a first judging module 302, a writing module 303, a second judging module 304, a determining module 305 and a control module 306; wherein the content of the first and second substances,
the determining module 301 is configured to determine a first target task according to the task instruction.
The first determining module 302 is configured to determine whether the first target task meets a first preset condition.
The writing module 303 is configured to write the first target task into the to-be-executed task pool if the first target task meets a first preset condition.
A second judging module 304, configured to judge whether there is an idle device in the target area.
The determining module 305 is configured to determine, if there is an idle device, a first target device required by the first target task from the idle device.
A control module 306 for controlling the first target device to perform the first target task.
In a possible implementation manner, the first determining module 302 is further configured to: if the first target task does not accord with a first preset condition, judging whether a second target task exists or not; and if the second target task does not exist, generating the second target task according to the first target task and a preset rule. And judging whether the second target task meets a second preset condition or not. The writing module 303 is further configured to write the second target task into a task pool to be executed if the second target task meets the second preset condition. The second determining module 304 is further configured to determine whether there is an idle device in the devices in the target area. The determining module 305 is further configured to determine, if there is an idle device, a second target device required by the second target task from the idle device. The control module 306 is further configured to control the second target device to execute the second target task.
In a possible implementation manner, the first determining module 302 is specifically configured to: determining a first library position according to the first target task; judging whether the first storage position is a first target storage position, wherein the first target storage position is an inner layer storage position of a shelf where the first storage position is located; and if the first library position is a first target library position, representing that the first target task meets a first preset condition.
In a possible implementation manner, the first determining module 302 is specifically configured to: if the first storage position is a second target storage position, judging whether the second target storage position has the ex-warehouse task, wherein the second target storage position is the outermost storage position of the goods shelf where the first storage position is located; and if the second target library position has the ex-warehouse task, representing that the second target task meets the second preset condition.
In a possible implementation manner, the first determining module 302 is specifically configured to: determining a second library position according to the first target task; judging whether the second storage position is a third target storage position, wherein the third target storage position is the outermost storage position of the shelf where the second storage position is located; and if the second library position is a third target library position, representing that the first target task meets a first preset condition.
In a possible implementation manner, the first determining module 302 is specifically configured to: if the second storage position is a fourth target storage position, judging whether goods exist in the third target storage position, wherein the fourth target storage position is an inner layer storage position of a goods shelf where the second storage position is located; if goods exist in the third target storage position, judging whether a storage moving task exists in the third target storage position; and if the third target library position has the library moving task, representing that the second target task meets the second preset condition.
In addition, an embodiment of the present application further provides a computer-readable storage medium, where a computer program is stored on the computer-readable storage medium, and when the computer program is executed by a processor, the computer program performs the steps of the scheduling method in the foregoing method embodiment.
The computer program product of the scheduling method provided in the embodiment of the present application includes a computer-readable storage medium storing a program code, where instructions included in the program code may be used to execute the steps of the scheduling method in the foregoing method embodiment, which may be specifically referred to in the foregoing method embodiment, and details are not described here again.
In the embodiments provided in the present application, it should be understood that the disclosed apparatus and method can be implemented in other ways. The apparatus embodiments described above are merely illustrative, and for example, the flowchart and block diagrams in the figures illustrate the architecture, functionality, and operation of possible implementations of apparatus, methods and computer program products according to various embodiments of the present application. In this regard, each block in the flowchart or block diagrams may represent a module, segment, or portion of code, which comprises one or more executable instructions for implementing the specified logical function(s). It should also be noted that, in some alternative implementations, the functions noted in the block may occur out of the order noted in the figures. For example, two blocks shown in succession may, in fact, be executed substantially concurrently, or the blocks may sometimes be executed in the reverse order, depending upon the functionality involved. It will also be noted that each block of the block diagrams and/or flowchart illustration, and combinations of blocks in the block diagrams and/or flowchart illustration, can be implemented by special purpose hardware-based systems which perform the specified functions or acts, or combinations of special purpose hardware and computer instructions.
In addition, functional modules in the embodiments of the present application may be integrated together to form an independent part, or each module may exist separately, or two or more modules may be integrated to form an independent part.
The functions, if implemented in the form of software functional modules and sold or used as a stand-alone product, may be stored in a computer readable storage medium. Based on such understanding, the technical solution of the present application or portions thereof that substantially contribute to the prior art may be embodied in the form of a software product stored in a storage medium and including instructions for causing a computer device (which may be a personal computer, a server, or a network device) to execute all or part of the steps of the method according to the embodiments of the present application. And the aforementioned storage medium includes: a U-disk, a removable hard disk, a Read-Only Memory (ROM), a Random Access Memory (RAM), a magnetic disk or an optical disk, and other various media capable of storing program codes. It is noted that, herein, relational terms such as first and second, and the like may be used solely to distinguish one entity or action from another entity or action without necessarily requiring or implying any actual such relationship or order between such entities or actions. Also, the terms "comprises," "comprising," or any other variation thereof, are intended to cover a non-exclusive inclusion, such that a process, method, article, or apparatus that comprises a list of elements does not include only those elements but may include other elements not expressly listed or inherent to such process, method, article, or apparatus. Without further limitation, an element defined by the phrase "comprising … …" does not exclude the presence of other identical elements in a process, method, article, or apparatus that comprises the element.
The above description is only a preferred embodiment of the present application and is not intended to limit the present application, and various modifications and changes may be made by those skilled in the art. Any modification, equivalent replacement, improvement and the like made within the spirit and principle of the present application shall be included in the protection scope of the present application. It should be noted that: like reference numbers and letters refer to like items in the following figures, and thus, once an item is defined in one figure, it need not be further defined and explained in subsequent figures.
The above description is only for the specific embodiments of the present application, but the scope of the present application is not limited thereto, and any person skilled in the art can easily conceive of the changes or substitutions within the technical scope of the present application, and shall be covered by the scope of the present application. Therefore, the protection scope of the present application shall be subject to the protection scope of the claims.
Claims (10)
1. A method of scheduling, comprising:
determining a first target task according to the task instruction;
judging whether the first target task meets a first preset condition or not;
if the first target task meets a first preset condition, writing the first target task into a task pool to be executed;
judging whether idle equipment exists in equipment in a target area;
if the idle equipment exists, determining first target equipment required by the first target task from the idle equipment;
and controlling the first target equipment to execute the first target task.
2. The method of claim 1, further comprising:
if the first target task does not accord with a first preset condition, judging whether a second target task exists or not;
if the second target task does not exist, generating a second target task according to the first target task and a preset rule;
judging whether the second target task meets a second preset condition or not;
if the second target task meets the second preset condition, writing the second target task into a task pool to be executed;
judging whether idle equipment exists in equipment in a target area;
if the idle equipment exists, determining second target equipment required by the second target task from the idle equipment;
and controlling the second target equipment to execute the second target task.
3. The method according to claim 2, wherein if the first target task is a warehousing task, the determining whether the first target task meets a first preset condition includes:
determining a first library position according to the first target task;
judging whether the first storage position is a first target storage position, wherein the first target storage position is an inner layer storage position of a shelf where the first storage position is located;
and if the first library position is a first target library position, representing that the first target task meets a first preset condition.
4. The method according to claim 3, wherein if the second target task is an ex-warehouse task, the determining whether the second target task meets a second preset condition includes:
if the first storage position is a second target storage position, judging whether the second target storage position has the ex-warehouse task, wherein the second target storage position is the outermost storage position of the goods shelf where the first storage position is located;
and if the second target library position has the ex-warehouse task, representing that the second target task meets the second preset condition.
5. The method of claim 2, wherein if the first target task is an ex-warehouse task, the determining whether the first target task meets a first preset condition comprises:
determining a second library position according to the first target task;
judging whether the second storage position is a third target storage position, wherein the third target storage position is the outermost storage position of the shelf where the second storage position is located;
and if the second library position is a third target library position, representing that the first target task meets a first preset condition.
6. The method according to claim 5, wherein if the second target task is a migration task, the determining whether the second target task meets a second preset condition includes:
if the second storage position is a fourth target storage position, judging whether goods exist in the third target storage position, wherein the fourth target storage position is an inner layer storage position of a goods shelf where the second storage position is located;
if goods exist in the third target storage position, judging whether a storage moving task exists in the third target storage position;
and if the third target library position has the library moving task, representing that the second target task meets the second preset condition.
7. A scheduling apparatus, comprising:
a determination module: the task instruction is used for determining a first target task according to the task instruction;
a first judgment module: the first target task is used for judging whether the first target task meets a first preset condition or not;
a writing module: the task pool management module is used for writing the first target task into a task pool to be executed if the first target task meets a first preset condition;
a second judging module: the device is used for judging whether idle devices exist in the devices in the target area;
a determination module: if the idle equipment exists, determining first target equipment required by the first target task from the idle equipment;
a control module: for controlling the first target device to perform the first target task.
8. A scheduling system, comprising:
intelligent freight equipment;
the control device is in communication connection with the intelligent freight device, and the control device controls the intelligent freight device to realize the steps in the scheduling method of any one of claims 1 to 6.
9. A control apparatus, characterized by comprising: a processor, a memory storing machine readable instructions executable by the processor, the machine readable instructions when executed by the processor performing the steps of the method of any of claims 1 to 6 when the control device is run.
10. A computer-readable storage medium, having stored thereon a computer program which, when being executed by a processor, is adapted to carry out the steps of the method according to any one of claims 1 to 6.
Priority Applications (2)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202111665211.3A CN114282841A (en) | 2021-12-31 | 2021-12-31 | Scheduling method, device, system, control equipment and readable storage medium |
| PCT/CN2022/139639 WO2023125076A1 (en) | 2021-12-31 | 2022-12-16 | Scheduling method, apparatus, system, control device, and readable storage medium |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202111665211.3A CN114282841A (en) | 2021-12-31 | 2021-12-31 | Scheduling method, device, system, control equipment and readable storage medium |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN114282841A true CN114282841A (en) | 2022-04-05 |
Family
ID=80879264
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202111665211.3A Pending CN114282841A (en) | 2021-12-31 | 2021-12-31 | Scheduling method, device, system, control equipment and readable storage medium |
Country Status (2)
| Country | Link |
|---|---|
| CN (1) | CN114282841A (en) |
| WO (1) | WO2023125076A1 (en) |
Cited By (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| WO2023125076A1 (en) * | 2021-12-31 | 2023-07-06 | 广东利元亨智能装备股份有限公司 | Scheduling method, apparatus, system, control device, and readable storage medium |
Families Citing this family (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN117022970B (en) * | 2023-10-09 | 2023-12-22 | 成都思越智能装备股份有限公司 | Material dynamic storage method and device |
Citations (6)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN109190840A (en) * | 2018-09-21 | 2019-01-11 | 中电科技（合肥）博微信息发展有限责任公司 | A kind of freezer shuttle dispatching management information system and dispatching method |
| CN110550359A (en) * | 2019-08-12 | 2019-12-10 | 珠海格力智能装备有限公司 | Warehousing system, method for goods entering and leaving warehouse by using warehousing system and terminal |
| CN111105193A (en) * | 2019-12-16 | 2020-05-05 | 广东利元亨智能装备股份有限公司 | Article transfer method and device, electronic equipment and storage medium |
| CN112801565A (en) * | 2021-04-14 | 2021-05-14 | 浙江明度智控科技有限公司 | Goods allocation dispatching method, system and storage medium for intelligent storage |
| CN113537851A (en) * | 2020-04-14 | 2021-10-22 | 北京京东乾石科技有限公司 | Goods warehouse-in and warehouse-out scheduling method and device and storage medium |
| WO2021249568A1 (en) * | 2020-06-12 | 2021-12-16 | 深圳市海柔创新科技有限公司 | Warehouse robot control method and apparatus, device and readable storage medium |
Family Cites Families (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN113443314B (en) * | 2020-06-17 | 2023-04-07 | 深圳市海柔创新科技有限公司 | Storage system, goods collecting method and device, material box moving device and control terminal |
| CN111798183A (en) * | 2020-07-07 | 2020-10-20 | 深圳市海柔创新科技有限公司 | Library management method, device, system and storage medium |
| CN114282841A (en) * | 2021-12-31 | 2022-04-05 | 广东利元亨智能装备股份有限公司 | Scheduling method, device, system, control equipment and readable storage medium |
-
2021
- 2021-12-31 CN CN202111665211.3A patent/CN114282841A/en active Pending
-
2022
- 2022-12-16 WO PCT/CN2022/139639 patent/WO2023125076A1/en unknown
Patent Citations (6)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN109190840A (en) * | 2018-09-21 | 2019-01-11 | 中电科技（合肥）博微信息发展有限责任公司 | A kind of freezer shuttle dispatching management information system and dispatching method |
| CN110550359A (en) * | 2019-08-12 | 2019-12-10 | 珠海格力智能装备有限公司 | Warehousing system, method for goods entering and leaving warehouse by using warehousing system and terminal |
| CN111105193A (en) * | 2019-12-16 | 2020-05-05 | 广东利元亨智能装备股份有限公司 | Article transfer method and device, electronic equipment and storage medium |
| CN113537851A (en) * | 2020-04-14 | 2021-10-22 | 北京京东乾石科技有限公司 | Goods warehouse-in and warehouse-out scheduling method and device and storage medium |
| WO2021249568A1 (en) * | 2020-06-12 | 2021-12-16 | 深圳市海柔创新科技有限公司 | Warehouse robot control method and apparatus, device and readable storage medium |
| CN112801565A (en) * | 2021-04-14 | 2021-05-14 | 浙江明度智控科技有限公司 | Goods allocation dispatching method, system and storage medium for intelligent storage |
Non-Patent Citations (2)
| Title |
|---|
| 张桂琴等: "直线往复式轨道自动导引车智能调度算法", 《计算机工程》 * |
| 顾红等: "环行穿梭车优化调度问题的自学习算法", 《系统工程理论与实践》 * |
Cited By (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| WO2023125076A1 (en) * | 2021-12-31 | 2023-07-06 | 广东利元亨智能装备股份有限公司 | Scheduling method, apparatus, system, control device, and readable storage medium |
Also Published As
| Publication number | Publication date |
|---|---|
| WO2023125076A1 (en) | 2023-07-06 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN114282841A (en) | Scheduling method, device, system, control equipment and readable storage medium | |
| US11052539B2 (en) | Method, server and storage medium for robot routing | |
| CN108596540B (en) | Replenishment method and device, computer-readable storage medium and electronic equipment | |
| CN107544513B (en) | Anti-deadlock scheduling method and device for multi-capacity automatic guided vehicle | |
| Lehmann et al. | Deadlock handling for real-time control of AGVs at automated container terminals | |
| US20210312359A1 (en) | Method and device for scheduling automated guided vehicle | |
| CN114415610B (en) | Scheduling method and device for robot, electronic equipment and storage medium | |
| CN111860919A (en) | Method, device, medium and electronic equipment for determining storage strategy of library shelf | |
| Kim et al. | An adaptive dispatching algorithm for automated guided vehicles based on an evolutionary process | |
| CN108364100A (en) | A kind of more AGV dispatching methods based on dynamic node detection | |
| Dotoli et al. | Deadlock detection and avoidance strategies for automated storage and retrieval systems | |
| CN114692939A (en) | Multi-AGV task scheduling method based on double-layer strategy | |
| US9195955B2 (en) | Expedited process execution using probabilities | |
| CN113534750B (en) | Job scheduling method, device, system, equipment and medium under intensive storage | |
| CN112434875A (en) | Equipment path management method, system and server for intelligent warehousing | |
| WO2023116573A1 (en) | Scheduling method and apparatus, electronic device, and readable storage medium | |
| Hu et al. | A dynamic integrated scheduling method based on hierarchical planning for heterogeneous AGV fleets in warehouses | |
| Hu et al. | Performance analysis on transfer platforms in frame bridge based automated container terminals | |
| CN113256025B (en) | Cargo transportation method, device, terminal and storage medium | |
| JP4445272B2 (en) | Crane simulator, computer program and computer-readable recording medium | |
| CN114358680A (en) | Task allocation method, electronic device and computer program product | |
| CN113420922A (en) | Automatic freight vehicle weighing method based on node process | |
| Ungern-Sternberg et al. | Backlog Oriented Bottleneck Management–Practical Guide for Production Managers | |
| WO2024098515A1 (en) | Deadlock-free amr path planning method based on dynamic time window insertion | |
| CN115796553B (en) | AGV task scheduling method, device and AGV scheduling system |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| PB01 | Publication | ||
| PB01 | Publication | ||
| SE01 | Entry into force of request for substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| RJ01 | Rejection of invention patent application after publication | ||
| RJ01 | Rejection of invention patent application after publication |
Application publication date: 20220405 |