CN117057581A - Scheduling method and system for warehouse automation equipment - Google Patents
Scheduling method and system for warehouse automation equipment Download PDFInfo
- Publication number
- CN117057581A CN117057581A CN202311142654.3A CN202311142654A CN117057581A CN 117057581 A CN117057581 A CN 117057581A CN 202311142654 A CN202311142654 A CN 202311142654A CN 117057581 A CN117057581 A CN 117057581A
- Authority
- CN
- China
- Prior art keywords
- task
- execution
- tasks
- scheduling
- information
- 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 41
- 238000012545 processing Methods 0.000 claims abstract description 31
- 238000012958 reprocessing Methods 0.000 claims abstract description 10
- 230000005856 abnormality Effects 0.000 claims description 17
- 238000004590 computer program Methods 0.000 claims description 7
- 210000001503 joint Anatomy 0.000 abstract description 9
- 238000005457 optimization Methods 0.000 description 10
- 238000010586 diagram Methods 0.000 description 8
- 230000002159 abnormal effect Effects 0.000 description 6
- 238000012163 sequencing technique Methods 0.000 description 6
- 238000013461 design Methods 0.000 description 5
- 238000007726 management method Methods 0.000 description 4
- 230000000694 effects Effects 0.000 description 3
- 238000012986 modification Methods 0.000 description 3
- 230000004048 modification Effects 0.000 description 3
- 208000033748 Device issues Diseases 0.000 description 2
- 230000005540 biological transmission Effects 0.000 description 2
- 238000011161 development Methods 0.000 description 2
- 230000006870 function Effects 0.000 description 2
- 238000003032 molecular docking Methods 0.000 description 2
- 230000003287 optical effect Effects 0.000 description 2
- 239000000969 carrier Substances 0.000 description 1
- 238000004891 communication Methods 0.000 description 1
- 125000004122 cyclic group Chemical group 0.000 description 1
- 230000008030 elimination Effects 0.000 description 1
- 238000003379 elimination reaction Methods 0.000 description 1
- 239000003550 marker Substances 0.000 description 1
- 230000008520 organization Effects 0.000 description 1
- 230000008569 process Effects 0.000 description 1
- 238000012360 testing method Methods 0.000 description 1
- 238000012795 verification Methods 0.000 description 1
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
- G06Q10/063—Operations research, analysis or management
- G06Q10/0631—Resource planning, allocation, distributing or scheduling for enterprises or organisations
- G06Q10/06311—Scheduling, planning or task assignment for a person or group
-
- 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
- G06Q10/063—Operations research, analysis or management
- G06Q10/0631—Resource planning, allocation, distributing or scheduling for enterprises or organisations
- G06Q10/06315—Needs-based resource requirements planning or analysis
-
- 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
- G06Q10/087—Inventory or stock management, e.g. order filling, procurement or balancing against orders
Landscapes
- Business, Economics & Management (AREA)
- Human Resources & Organizations (AREA)
- Engineering & Computer Science (AREA)
- Economics (AREA)
- Entrepreneurship & Innovation (AREA)
- Strategic Management (AREA)
- General Physics & Mathematics (AREA)
- Physics & Mathematics (AREA)
- Theoretical Computer Science (AREA)
- Marketing (AREA)
- Operations Research (AREA)
- Quality & Reliability (AREA)
- Tourism & Hospitality (AREA)
- Development Economics (AREA)
- General Business, Economics & Management (AREA)
- Game Theory and Decision Science (AREA)
- Educational Administration (AREA)
- Accounting & Taxation (AREA)
- Finance (AREA)
- Information Retrieval, Db Structures And Fs Structures Therefor (AREA)
Abstract
The embodiment of the invention discloses a dispatching method and a dispatching system of warehouse automation equipment, wherein a business system sends order information to a dispatching system; the scheduling system acquires task information based on the order information, performs task disassembly and task merging operation on the task information to acquire at least one task to be executed, and stores the task into a task buffer pool; performing de-duplication treatment on tasks in the task buffer pool at regular time; the task after the reprocessing is issued to the equipment for executing the task in the execution system through the task issuing interface; after the equipment executes the task, feeding back an execution result to the scheduling system through a task execution feedback interface; and the scheduling system performs subsequent task processing operation based on the execution result and feeds back the execution result of the order demand information to the service system. The dispatching method of the warehouse automation equipment solves the problems that in the prior art, the butt joint with a dispatching system cannot be realized through a unified standard interface, and robots operate the same point position at the same time frequently.
Description
Technical Field
The invention relates to the technical field of computers, in particular to a scheduling method and system of warehouse automation equipment, electronic equipment and a storage medium.
Background
The existing intelligent warehousing system generally uses carriers such as robots, conveyor belts and the like to convey cargoes to corresponding sorting work tables according to a designed path, and the method can realize no manual operation in warehousing operation and has high automation degree;
however, different warehouse automation equipment in the existing intelligent warehouse system cannot realize the butt joint with the dispatching system through a unified standard interface, the development and joint debugging workload of the butt joint of the equipment and the dispatching system is large, and the situation that the robot operates the same point at the same time, so that accidents or faults are caused frequently occurs;
what is needed is a method for dispatching warehouse automation equipment that can interface different warehouse automation equipment with a dispatching system through a unified standard interface and avoid robots operating the same points at the same time.
Disclosure of Invention
The embodiment of the invention aims to provide a scheduling method, a scheduling system, electronic equipment and a storage medium of storage automation equipment, which are used for solving the problems that in the prior art, the butt joint of different storage automation equipment and a scheduling system cannot be realized through a unified standard interface, and robots always operate the same point at the same time.
In order to achieve the above object, an embodiment of the present invention provides a scheduling method for a warehouse automation device, where the method specifically includes:
the business system sends order information to the dispatching system;
the scheduling system acquires task information based on the order information, performs task disassembly and task merging operation on the task information to acquire at least one task to be executed, and stores the task into a task buffer pool;
performing de-duplication treatment on tasks of the task buffer pool at regular time;
the task after the reprocessing is issued to equipment for executing the task in an execution system through a task issuing interface;
after the equipment executes the task, feeding back an execution result to a scheduling system through the task execution feedback interface;
and the scheduling system performs subsequent task processing operation based on the execution result and feeds back the execution result of the order demand information to the service system.
Based on the technical scheme, the invention can also be improved as follows:
further, the timing performs deduplication processing on the tasks of the task buffer pool, including:
the searching state is a task with the same target point position in execution or an initial task with the same target point position;
judging whether the container numbers of the tasks are the same, if so, repeating the tasks, reserving one task based on a reservation rule, and deleting the rest invalid tasks;
and calling a task issuing interface to issue the task to the execution system, and updating the task state into execution after successful issuing.
Further, the timing performs deduplication processing on the tasks in the task buffer pool, and the method further includes:
if the container numbers of the tasks are different, after the tasks are ordered based on the reservation rule, the first task is issued as an effective task, and the other tasks call an allocation algorithm to reallocate the target points;
and calling a task issuing interface to issue the task to the execution system, and updating the task state into execution after successful issuing.
Further, the issuing the processed task to the device executing the task through the task issuing interface includes:
extracting a certain number of tasks from the task buffer pool at regular time through a scheduling rule, and transmitting the tasks to an execution system for execution;
judging whether the task in the task buffer pool is issued to an execution system, if so, updating the task state of the task into execution, otherwise, initializing the task state of the task;
and after the execution system completes execution, updating the task state of the task to complete.
Further, the task issuing device issues the task after reprocessing to the device executing the task in the execution system through a task issuing interface, and the task issuing device further includes:
responding to a searching request of a task, searching a task data table to obtain a task with an initial state and a warehouse-in type, and storing the task into a data set;
defining a data set based on the number of existing roadways in a warehouse, circulating the data set, and grouping according to roadway numbers of data items to obtain a roadway grouping data set;
sorting the tunnel grouping data sets based on a sorting rule, wherein the sorting rule is that a warehouse entry is used as a starting point, and the tunnel number is a task group number of a task before the position number is close to the warehouse entry;
and calling a task issuing interface to issue the task to an execution system, and updating the task state into the execution state after successful issuing.
Further, the task issuing device issues the task after reprocessing to the device executing the task in the execution system through a task issuing interface, and the task issuing device further includes:
responding to a searching request of a task, searching a task state initial from a task data table, wherein the type is a task which is out of a library, and storing the task state initial into a data set;
defining a data set based on the number of existing lanes of the warehouse, circulating the data set, and grouping according to the lane numbers of the data items;
sorting the tunnel grouping data sets based on a sorting rule, wherein the sorting rule is that a delivery port is used as a starting point, and the tunnel number is a task group number of a task before the position number is close to the delivery port;
and calling a task issuing interface to issue the task to an execution system, and updating the task state into the execution state after successful issuing.
Further, the dispatching method of the warehouse automation equipment further comprises the following steps:
acquiring task execution abnormality information fed back by an execution system, and acquiring a cause of task execution abnormality based on the task execution abnormality information;
and executing corresponding task abnormality processing operation based on the task execution abnormality reasons.
A warehouse automation equipment scheduling system, comprising:
the business system is used for sending the order information to the scheduling system;
the scheduling system is used for acquiring task information based on the order information, performing task disassembly and task combination operation on the task information to obtain at least one task to be executed, and storing the task into a task buffer pool;
the processing module is used for carrying out de-duplication processing on the tasks in the task buffer pool at regular time;
the task issuing interface is used for issuing the processed task to equipment for executing the task in the execution system;
the task execution feedback interface is used for feeding back an execution result to the scheduling system after the equipment executes the task;
the scheduling system is further configured to:
and carrying out subsequent task processing operation based on the execution result, and feeding back the execution result of the order demand information to a service system.
An electronic device comprising a memory, a processor and a computer program stored on the memory and executable on the processor, the processor implementing the steps of the method when the computer program is executed.
A non-transitory computer readable storage medium having stored thereon a computer program which, when executed by a processor, implements the steps of the method.
The embodiment of the invention has the following advantages:
according to the scheduling method of the warehouse automation equipment, a service system sends order information to a scheduling system; the scheduling system acquires task information based on the order information, performs task disassembly and task merging operation on the task information to acquire at least one task to be executed, and stores the task into a task buffer pool; performing de-duplication treatment on tasks of the task buffer pool at regular time; the task after the reprocessing is issued to equipment for executing the task in an execution system through a task issuing interface; after the equipment executes the task, feeding back an execution result to a scheduling system through the task execution feedback interface; the scheduling system performs subsequent task processing operation based on the execution result and feeds back the execution result of the order demand information to the service system, so that the problem that in the prior art, different warehouse automation equipment and the scheduling system cannot be connected through a unified standard interface, and the robot can operate the same point at the same time frequently occurs is solved.
Drawings
In order to more clearly illustrate the embodiments of the present invention or the technical solutions in the prior art, the drawings used in the description of the embodiments or the prior art will be briefly described below. It will be apparent to those skilled in the art from this disclosure that the drawings described below are merely exemplary and that other embodiments may be derived from the drawings provided without undue effort.
The structures, proportions, sizes, etc. shown in the present specification are shown only for the purposes of illustration and description, and are not intended to limit the scope of the invention, which is defined by the claims, so that any structural modifications, changes in proportions, or adjustments of sizes, which do not affect the efficacy or the achievement of the present invention, should fall within the scope of the invention.
FIG. 1 is a flow chart of a scheduling method of a warehouse automation device of the present invention;
FIG. 2 is a first architecture diagram of a dispatch system of the warehouse automation equipment of the present invention;
FIG. 3 is a second architecture diagram of a dispatch system of the warehouse automation equipment of the present invention;
FIG. 4 is a schematic diagram of the definition of a roadway according to the present invention;
FIG. 5 is a task path performed by the pre-optimization device of the present invention;
FIG. 6 is a task path performed by the optimized device of the present invention;
fig. 7 is a schematic diagram of an entity structure of an electronic device according to the present invention.
Wherein the reference numerals are as follows:
business system 10, dispatch system 20, task buffer pool 30, processing module 40, task issuing interface 50, execution system 60, task execution feedback interface 70, exception handling module 80, electronic device 90, processor 901, memory 902, bus 903.
Detailed Description
Other advantages and advantages of the present invention will become apparent to those skilled in the art from the following detailed description, which, by way of illustration, is to be read in connection with certain specific embodiments, but not all embodiments. All other embodiments, which can be made by those skilled in the art based on the embodiments of the invention without making any inventive effort, are intended to be within the scope of the invention.
The task execution of different warehouse automation equipment can be essentially decomposed into point-to-point handling actions. The invention adopts a universal data structure through standard interface design to realize the butt joint with different equipment management systems and realize the connection between the service and the equipment. And the functions of task management, scheduling, de-duplication, priority adjustment and the like are realized.
Examples
Fig. 1 is a flowchart of an embodiment of a dispatching method of a warehouse automation device according to the present invention, and as shown in fig. 1, the dispatching method of the warehouse automation device according to the embodiment of the present invention includes the following steps:
s101, the business system 10 sends order information to the scheduling system 20;
specifically, the service system 10 includes a plurality of service subsystems, and the plurality of service subsystems generate order information based on the demand information and send the order information to the scheduling system 20.
S102, the scheduling system 20 acquires task information based on order information, performs task disassembly and task merging operation on the task information to acquire at least one task to be executed, and stores the task into the task buffer pool 30;
specifically, after receiving the order information of the service system 10, the scheduling system 20 disassembles the order information into a single-equipment single-executable maximum task, generally disassembles and merges the task numbers according to the starting point, the target point and the transport container number, generates a unique task number according to the equipment type, and stores the unique task number in the task buffer pool 30.
S103, performing de-duplication processing on tasks of the task buffer pool 30 at regular time;
specifically, a preemption mode is implemented; in order to avoid that the tasks generating the same target position in the multi-device and high-concurrency scene cause the devices to crash, a preemption mode is used, i.e. the tasks in the same target position are rejected after the tasks are issued to the execution system 60. In the method for allocating the target position, the point number with the initial/executing state is excluded when the target position is searched.
Assigning a random ordering of target positions: under the condition that a plurality of target positions are available, the probability of distributing the same position can be reduced by randomly acquiring the target positions, the more the available target positions are, the more the repetition probability can be obviously reduced, and if the number of the available target positions is smaller, the higher the probability of repeated distribution is.
Task deduplication and reassignment: random ordering does not completely avoid different tasks being assigned to the same target location, and therefore requires de-duplication of the tasks generated.
High concurrency task management and deduplication; when the concurrency is high (for example, two tasks are issued simultaneously within 50 ms), and the algorithm for allocating the library bits takes a long time, the pre-occupation mode cannot ensure the generation of the same target library bit task, and the tasks possibly allocated to two same target points still need to be solved by using the following algorithm:
the algorithm logic is as follows:
the searching state is a task which is in execution or initial and has the same target point position;
judging whether the container numbers of the tasks are the same, if so, repeating the tasks, reserving one task based on a reservation rule, and deleting the rest invalid tasks; the reservation rule is to reserve the task in execution preferentially, and reserve the task with earlier creation time preferentially;
the task issuing interface 50 is called to issue the task to the execution system 60, and the task state is updated to be in execution after the task is issued successfully.
If the container numbers of the tasks are different, the first task is issued as an effective task after the tasks are ordered according to the time early priority principle in the effective execution of the tasks, and other tasks are respectively redistributed.
The task issuing interface 50 is called to issue the task to the execution system 60, and the task state is updated to be in execution after the task is issued successfully.
S104, the task after the reprocessing is issued to the device for executing the task in the execution system 60 through the task issuing interface 50.
Specifically, although the interfaces of different devices are slightly different, the whole structure is basically carrying instructions, so that the standard interface mainly comprises two interfaces: task issuing interface 50, task execution feedback interface 70.
Task issuing interface 50: an example of parameters (Json structure) for dispatch system 20 to issue tasks to execution system 60 of a given device is as follows:
the interface is designed to support batch issuing of a plurality of tasks and to support priority processing, and each field is annotated for use.
Most devices do not support changing after receiving the instruction, and related task priorities are adjusted in execution sequence, so that the execution sequence is scheduled before the instruction is issued to the devices;
the invention designs a task pool for management. The task is first put down to the task pool, the task state is initial, a certain number of tasks are extracted at regular time through the scheduling rule, and the tasks are sent to the execution system 60 for execution. The dispatching dimension comprises a task issuing sequence, and the tasks are balanced and are divided into an output dispatching algorithm and an input dispatching algorithm.
Extracting a certain number of tasks from the task buffer pool 30 by scheduling rules at regular time and sending the tasks to the execution system 60 for execution;
judging whether the task in the task buffer pool 30 is issued to the execution system 60, if yes, updating the task state of the task into execution, otherwise, initializing the task state of the task;
when execution of the task by the execution system 60 is completed, the task state of the task is updated to complete.
Task scheduling timer: the timer is set to be executed regularly, for example, 3 minutes, and the timer is set to be configurable and adjusted according to the actual operation scene.
Defining an operation roadway: the lane refers to a channel when equipment works, if the shelf has two rows, and the two rows can work, the lane is defined as a lane, fig. 4 is a definition schematic diagram of the lane, 9 lanes are defined in total, and the information is bound with a carrying point:
and (5) warehouse entry scheduling: the main aim is to realize the highest warehousing efficiency and improve the utilization rate of equipment. The core thought is to make the running path of the equipment shortest, and make the task number of each equipment as balanced as possible under the scene of multiple equipment, i.e. the efficiency is preferential and balanced. The algorithm implementation logic is as follows:
responding to a searching request of a task, searching a task data table for which the task state is initial and the type is not more than 50 of the tasks in storage (the task is set to be configurable and is adjusted according to an actual operation scene), and storing the task data table into a data set dataList;
defining a data set based on the number of existing roadways in a warehouse, circulating the data set, and grouping according to roadway numbers of data items to obtain a roadway grouping data set; for example, there are 9 lanes in the warehouse, the data set aisle1[ ] -aisle9[ ], the cyclic data set dataList [ ], the data items are grouped by lane number 1, aisle1[ ], lane number 2, aisle2[ ], and so on are defined.
Device task balancing: searching and counting the number of tasks in execution of each device, arranging the tasks from small to large according to the number of the tasks, issuing the tasks to the corresponding devices according to the task groups, and issuing one group each time.
Sorting the tunnel grouping data sets based on a sorting rule, wherein the sorting rule is that a warehouse entry is used as a starting point, and the tunnel number is a task group number of a task before the position number is close to the warehouse entry;
and (3) respectively sequencing the tunnel grouping data sets aisle1[ ] -aisle9[ ], wherein the sequencing rule is that the warehouse entry is used as a starting point, the task group number of the corresponding task is set as a tunnel number, and the sequencing rule is that the position number is from left to right as shown in the figure.
The task issuing interface 50 is called to issue the task to the execution system 60, and the task state is updated to be in execution after the task is issued successfully.
And (5) warehouse-out scheduling: the method has the main aim of realizing the highest ex-warehouse efficiency, balancing the tasks of each ex-warehouse opening, and avoiding overlong execution period under the scene of a plurality of tasks of the same order. The algorithm implementation logic is as follows:
responding to a searching request of a task, searching a task data table for the task state initialization, wherein the type is that no more than 50 task tasks for ex-warehouse are set (the task is configurable and is adjusted according to an actual operation scene), and storing the task tasks into a data set dataList;
the job of leaving warehouse is balanced: searching and counting the number of tasks in execution of each delivery port, arranging the delivery ports with small number of tasks according to the number of the tasks from small to large, and preferentially extracting the tasks.
Defining a data set based on the number of existing lanes of the warehouse, circulating the data set, and grouping according to the lane numbers of the data items; for example, there are 9 lanes in the warehouse, the data set aisle1[ ] -aisle9[ ] is defined. The data items are grouped according to the lane number of the data item, the lane number is 1, the lane number is stored in the table 1, the lane number is 2, the lane number is stored in the table 2, and so on.
Sorting the tunnel grouping data sets based on a sorting rule, wherein the sorting rule is that a delivery port is used as a starting point, and the tunnel number is a task group number of a task before the position number is close to the delivery port;
and (3) respectively sequencing the tunnel packet data sets aisle1[ ] -aisle9[ ], wherein the sequencing rule is that a delivery port is used as a starting point, the task group number of the corresponding task is set as a lane number, and the sequencing rule is that the position number is from right to left as shown in the upper graph.
The task issuing interface 50 is called to issue the task to the execution system 60, and the task state is updated to be in execution after the task is issued successfully.
S105, after the equipment executes the task, the execution result is fed back to the scheduling system 20 through the task execution feedback interface 70.
Specifically, task execution feedback interface 70: the parameters example (Json structure) for the device execution system 60 to feed back the task execution results (including in-execution, exception, etc.) to the dispatch system 20 are as follows:
the dispatch system 20 is based on a unique identification number: the task number, the fed back event code and the task state are subjected to data updating and service order updating, for example, the event is the starting point and is used for indicating that the equipment has moved the container away from the starting point, the event is the ending point and is used for indicating that the equipment has moved the container to the ending point, and the task is completed.
The task is used as core data of the dispatching system 20, has the functions of up-bearing service orders and following the execution system 60, and meanwhile, the data structure of the task needs to be concise because of larger dispatching frequent data quantity in certain application scenes, and the structural design of the task is shown in the table 1:
the field name field description primary key label field type allows for null
organization ID Y varchar (20) N
WareHouseid warehouse number Y varchar (20) N
task code task number Y varchar (40) N
task type N varchar (20) Y
task group N varchar (40) Y
deviceType docking device type N varchar (20) Y
task priority N int Y
BizRefCode service document number N varchar (100) Y
bizRefType service type N varchar (20) Y
StartLocationId Start point N varchar (60) Y
EndLocationId endpoint N varchar (60) Y
status task state N varchar (20) Y
sendStatus issue status N varchar (20) Y
sendTime down time N datetime Y
feedback status N varchar (20) Y
Container number N varchar (40) Y
deviceId execution device N varchar (40) Y
startTime start time N datetime Y
finish time N datetime Y
ExceptionMsg anomaly information N text Y
noteText remark N text Y
OprSeqFlag operation pipeline marker N varchar (65) N
currentVersion current version number N int N
active flag activity flag N char (1) N
udf01 custom 01N varchar (500) Y
udf02 custom 02N varchar (500) Y
udf03 custom 03N varchar (500) Y
udf04 custom 04N varchar (500) Y
udf05 custom 05N varchar (500) Y
AddWho Adplus N varchar (40) Y
AddTime New time N datetime Y
editWho editors N varchar (40) Y
editTime edit time N datetime Y
The failure times of the ediFailedTimes interface N int Y
ediSendFlag interface issue state N VARCHAR2 (20) Y
ediSendTime interface issue time N datetime Y
error message interface error message N varchar (500) Y
TABLE 1
The data structure design can effectively support the task data acquisition and then the task data transmission by using the task transmission interface 50 and the data writing after the result feedback is executed.
S106, the scheduling system 20 performs subsequent task processing operation based on the execution result, and feeds back the execution result of the order demand information to the service system 10;
in particular, it is a kind of concrete one.
The scheduling method of the warehouse automation equipment further comprises the following steps:
acquiring task execution abnormality information fed back by the execution system 60, and acquiring a cause of task execution abnormality based on the task execution abnormality information;
and executing corresponding task abnormality processing operation based on the task execution abnormality reasons.
The system is designed to guide the user to solve by using a unique means according to the abnormal information of task execution:
when the task execution abnormal information is the starting point failure, the container is in the original position, and the user is guided to cancel the task and issue again;
and when the task execution abnormal information is used as a starting point to finish but fails in the execution process, guiding a user to take the container from the equipment and put the container into an available space. The task is completed.
And when the abnormal task execution information is the end point failure, guiding the user to take the container from the equipment and put the container into available space. The task is completed.
The invention passes test verification in a warehouse system project of a certain company in the Shanghai, and table 2 is the comparison of operation data of one month before and after optimization:
total number of tasks abnormal task number task average time-consuming failure rate
24464637 11.78 2.60% before optimization
29614 124 5.4457 0.42% after optimization
The lifting ratio is 21.05% -80.53% -53.77% -83.92%
TABLE 2
Compared with the prior art, after optimization, the number of the jobs is increased by 21.05%, the number of abnormal tasks is reduced by 80.53%, the average task time consumption is reduced by 53.77%, the equipment failure rate is reduced by 83.92%, and the lifting effect is obvious.
Fig. 5 and 6 are schematic diagrams of path optimization effect comparison:
FIG. 5 is a diagram of the device performing tasks before optimization, following the path, inefficiency:
FIG. 6 shows that after optimization, the dispatch system 20 performs path optimization according to the principle of vicinity, and assigns the path optimization to different devices to execute tasks according to the following paths, and the driving paths are greatly reduced.
In the dispatching method of the warehouse automation equipment, the business system 10 sends order information to the dispatching system 20; the scheduling system 20 obtains task information based on the order information, performs task disassembly and task merging operations on the task information to obtain at least one task to be executed, and stores the task into a task buffer pool 30; performing de-duplication treatment on tasks of the task buffer pool 30 at regular time; the task after the reprocessing is issued to the equipment for executing the task in the execution system 60 through the task issuing interface 50; after the device executes the task, the execution result is fed back to the scheduling system 20 through the task execution feedback interface 70; the scheduling system 20 performs subsequent task processing operations based on the execution results, and feeds back the execution results of the order requirement information to the service system 10. The problem that the butt joint with the dispatching system 20 cannot be realized through a unified standard interface in the prior art, and the robot can operate the same point position at the same time frequently occurs is solved.
The common point of the common warehouse automation equipment is comprehensively extracted: point-to-point handling enables a unified dispatch system 20 for different warehouse automation equipment. The standard data structure design can meet the technical parameters of the butt joint of most devices and has expansibility; the unified standard interface can reduce development and joint debugging workload of a large number of equipment butt joints; parameters and configuration items are adjustable, and the requirements of docking and scheduling of different application scenes can be met; different scheduling strategy algorithms for entering and exiting can greatly improve the equipment operation efficiency; the task balancing algorithm can reduce equipment loss and balance personnel workload; the occupation and task duplication elimination algorithm can effectively avoid equipment position robbing faults and car collision accidents.
FIGS. 2-3 are flowcharts of an embodiment of a dispatch system 20 for a warehouse automation device in accordance with the present invention; as shown in fig. 2-3, a dispatching system 20 of warehouse automation equipment according to an embodiment of the present invention includes the following steps:
a business system 10 for transmitting order information to a scheduling system 20;
the scheduling system 20 is configured to obtain task information based on the order information, perform task disassembly and task merging operations on the task information, obtain at least one task to be executed, and store the task in the task buffer pool 30;
a processing module 40, configured to perform deduplication processing on tasks in the task buffer pool 30 at regular time;
a task issuing interface 50, configured to issue the processed task to a device that executes the task in the execution system 60;
a task execution feedback interface 70, configured to feedback an execution result to the scheduling system 20 after the device executes the task;
the scheduling system 20 is further configured to:
and carrying out subsequent task processing operation based on the execution result, and feeding back the execution result of the order requirement information to the service system 10.
The processing module 40 is further configured to:
the searching state is a task which is in execution or initial and has the same target point position;
judging whether the container numbers of the tasks are the same, if so, repeating the tasks, reserving one task based on a reservation rule, and deleting the rest invalid tasks;
the task issuing interface 50 is called to issue the task to the execution system 60, and the task state is updated to be in execution after the task is issued successfully.
If the container numbers of the tasks are different, after the tasks are ordered based on the reservation rule, the first task is issued as an effective task, and the other tasks call an allocation algorithm to reallocate the target points;
the task issuing interface 50 is called to issue the task to the execution system 60, and the task state is updated to be in execution after the task is issued successfully.
The scheduling system 20 is further configured to:
extracting a certain number of tasks from the task buffer pool 30 by scheduling rules at regular time and sending the tasks to the execution system 60 for execution;
judging whether the task in the task buffer pool 30 is issued to the execution system 60, if yes, updating the task state of the task into execution, otherwise, initializing the task state of the task;
when execution of the task by the execution system 60 is completed, the task state of the task is updated to complete.
Responding to a searching request of a task, searching a task data table to obtain a task with an initial state and a warehouse-in type, and storing the task into a data set;
defining a data set based on the number of existing roadways in a warehouse, circulating the data set, and grouping according to roadway numbers of data items to obtain a roadway grouping data set;
sorting the tunnel grouping data sets based on a sorting rule, wherein the sorting rule is that a warehouse entry is used as a starting point, and the tunnel number is a task group number of a task before the position number is close to the warehouse entry;
the task issuing interface 50 is called to issue the task to the execution system 60, and the task state is updated to be in execution after the task is issued successfully.
Responding to a searching request of a task, searching a task state initial from a task data table, wherein the type is a task which is out of a library, and storing the task state initial into a data set;
defining a data set based on the number of existing lanes of the warehouse, circulating the data set, and grouping according to the lane numbers of the data items;
sorting the tunnel grouping data sets based on a sorting rule, wherein the sorting rule is that a delivery port is used as a starting point, and the tunnel number is a task group number of a task before the position number is close to the delivery port;
the task issuing interface 50 is called to issue the task to the execution system 60, and the task state is updated to be in execution after the task is issued successfully.
The warehouse automation equipment scheduling system 20 further includes:
the exception handling module 8040 is configured to obtain task execution exception information fed back by the execution system 60, and obtain a cause of the task execution exception based on the task execution exception information; and executing corresponding task abnormality processing operation based on the task execution abnormality reasons.
The dispatching system 20 of the warehouse automation equipment sends order information to the dispatching system 20 through the service system 10; task information is acquired through the scheduling system 20 based on the order information, task disassembly and task combination operations are carried out on the task information, at least one task to be executed is obtained, and the task is stored in the task buffer pool 30; performing de-duplication processing on tasks of the task buffer pool 30 at regular time through a processing module 40; the processed task is issued to equipment for executing the task in the execution system 60 through the task issuing interface 50; after the device executes the task, the execution result is fed back to the scheduling system 20 through the task execution feedback interface 70; and performing subsequent task processing operations based on the execution results through the scheduling system 20, and feeding back the execution results of the order requirement information to the service system 10. The dispatching method of the warehouse automation equipment solves the problems that in the prior art, the butt joint of different warehouse automation equipment and the dispatching system 20 cannot be realized through a unified standard interface, and robots operate the same point at the same time frequently.
Fig. 7 is a schematic diagram of an entity structure of an electronic device according to an embodiment of the present invention, as shown in fig. 7, an electronic device 90 includes: a processor 901 (processor), a memory 902 (memory), and a bus 903;
the processor 901 and the memory 902 complete communication with each other through the bus 903;
the processor 901 is configured to call program instructions in the memory 902 to perform the methods provided in the above method embodiments, for example, including: the business system 10 sends the order information to the dispatch system 20; the scheduling system 20 obtains task information based on the order information, performs task disassembly and task merging operations on the task information to obtain at least one task to be executed, and stores the task into a task buffer pool 30; performing de-duplication treatment on tasks of the task buffer pool 30 at regular time; the task after the reprocessing is issued to the equipment for executing the task in the execution system 60 through the task issuing interface 50; after the device executes the task, the execution result is fed back to the scheduling system 20 through the task execution feedback interface 70; the scheduling system 20 performs subsequent task processing operations based on the execution results, and feeds back the execution results of the order requirement information to the service system 10.
The present embodiment provides a non-transitory computer readable storage medium storing computer instructions that cause a computer to perform the methods provided by the above-described method embodiments, for example, including: the business system 10 sends the order information to the dispatch system 20; the scheduling system 20 obtains task information based on the order information, performs task disassembly and task merging operations on the task information to obtain at least one task to be executed, and stores the task into a task buffer pool 30; performing de-duplication treatment on tasks of the task buffer pool 30 at regular time; the task after the reprocessing is issued to the equipment for executing the task in the execution system 60 through the task issuing interface 50; after the device executes the task, the execution result is fed back to the scheduling system 20 through the task execution feedback interface 70; the scheduling system 20 performs subsequent task processing operations based on the execution results, and feeds back the execution results of the order requirement information to the service system 10.
Those of ordinary skill in the art will appreciate that: all or part of the steps for implementing the above method embodiments may be implemented by hardware associated with program instructions, where the foregoing program may be stored in a computer readable storage medium, and when executed, the program performs steps including the above method embodiments; and the aforementioned storage medium includes: various storage media such as ROM, RAM, magnetic or optical disks may store program code.
The apparatus embodiments described above are merely illustrative, wherein elements illustrated as separate elements may or may not be physically separate, and elements shown as elements may or may not be physical elements, may be located in one place, or may be distributed over a plurality of network elements. Some or all of the modules may be selected according to actual needs to achieve the purpose of the solution of this embodiment. Those of ordinary skill in the art will understand and implement the present invention without undue burden.
From the above description of the embodiments, it will be apparent to those skilled in the art that the embodiments may be implemented by means of software plus necessary general hardware platforms, or of course may be implemented by means of hardware. Based on such understanding, the foregoing technical solution may be embodied essentially or in a part contributing to the prior art in the form of a software product, which may be stored in a computer readable storage medium, such as ROM/RAM, a magnetic disk, an optical disk, etc., including several instructions for causing a computer device (which may be a personal computer, a server, or a network device, etc.) to execute the embodiments or the methods of some parts of the embodiments.
While the invention has been described in detail in the foregoing general description and specific examples, it will be apparent to those skilled in the art that modifications and improvements can be made thereto. Accordingly, such modifications or improvements may be made without departing from the spirit of the invention and are intended to be within the scope of the invention as claimed.
Claims (10)
1. A method for scheduling warehouse automation equipment, the method comprising:
the business system sends order information to the dispatching system;
the scheduling system acquires task information based on the order information, performs task disassembly and task merging operation on the task information to acquire at least one task to be executed, and stores the task into a task buffer pool;
performing de-duplication treatment on tasks of the task buffer pool at regular time;
the task after the reprocessing is issued to equipment for executing the task in an execution system through a task issuing interface;
after the equipment executes the task, feeding back an execution result to a scheduling system through the task execution feedback interface;
and the scheduling system performs subsequent task processing operation based on the execution result and feeds back the execution result of the order demand information to the service system.
2. The method for scheduling warehouse automation equipment according to claim 1, wherein the timing for performing deduplication processing on the tasks in the task buffer pool comprises:
the searching state is a task with the same target point position in execution or an initial task with the same target point position;
judging whether the container numbers of the tasks are the same, if so, repeating the tasks, reserving one task based on a reservation rule, and deleting the rest invalid tasks;
and calling a task issuing interface to issue the task to the execution system, and updating the task state into execution after successful issuing.
3. The method for scheduling warehouse automation equipment of claim 2, wherein the timing de-duplicated tasks in the task buffer pool further comprises:
if the container numbers of the tasks are different, after the tasks are ordered based on the reservation rule, the first task is issued as an effective task, and the other tasks call an allocation algorithm to reallocate the target points;
and calling a task issuing interface to issue the task to the execution system, and updating the task state into execution after successful issuing.
4. The method for scheduling warehouse automation equipment according to claim 1, wherein the issuing the processed task to the equipment executing the task through the task issuing interface comprises:
extracting a certain number of tasks from the task buffer pool at regular time through a scheduling rule, and transmitting the tasks to an execution system for execution;
judging whether the task in the task buffer pool is issued to an execution system, if so, updating the task state of the task into execution, otherwise, initializing the task state of the task;
and after the execution system completes execution, updating the task state of the task to complete.
5. The method for scheduling warehouse automation equipment according to claim 4, wherein the task after being reprocessed is issued to the equipment in the execution system by the task issuing interface, further comprising:
responding to a searching request of a task, searching a task data table to obtain a task with an initial state and a warehouse-in type, and storing the task into a data set;
defining a data set based on the number of existing roadways in a warehouse, circulating the data set, and grouping according to roadway numbers of data items to obtain a roadway grouping data set;
sorting the tunnel grouping data sets based on a sorting rule, wherein the sorting rule is that a warehouse entry is used as a starting point, and the tunnel number is a task group number of a task before the position number is close to the warehouse entry;
and calling a task issuing interface to issue the task to an execution system, and updating the task state into the execution state after successful issuing.
6. The method for scheduling warehouse automation equipment according to claim 5, wherein the task after being reprocessed is issued to the equipment in the execution system by the task issuing interface, further comprising:
responding to a searching request of a task, searching a task state initial from a task data table, wherein the type is a task which is out of a library, and storing the task state initial into a data set;
defining a data set based on the number of existing lanes of the warehouse, circulating the data set, and grouping according to the lane numbers of the data items;
sorting the tunnel grouping data sets based on a sorting rule, wherein the sorting rule is that a delivery port is used as a starting point, and the tunnel number is a task group number of a task before the position number is close to the delivery port;
and calling a task issuing interface to issue the task to an execution system, and updating the task state into the execution state after successful issuing.
7. The method for scheduling warehouse automation equipment of claim 1, further comprising:
acquiring task execution abnormality information fed back by an execution system, and acquiring a cause of task execution abnormality based on the task execution abnormality information;
and executing corresponding task abnormality processing operation based on the task execution abnormality reasons.
8. A warehouse automation equipment scheduling system, comprising:
the business system is used for sending the order information to the scheduling system;
the scheduling system is used for acquiring task information based on the order information, performing task disassembly and task combination operation on the task information to obtain at least one task to be executed, and storing the task into a task buffer pool;
the processing module is used for carrying out de-duplication processing on the tasks in the task buffer pool at regular time;
the task issuing interface is used for issuing the processed task to equipment for executing the task in the execution system;
the task execution feedback interface is used for feeding back an execution result to the scheduling system after the equipment executes the task;
the scheduling system is further configured to:
and carrying out subsequent task processing operation based on the execution result, and feeding back the execution result of the order demand information to a service system.
9. An electronic device comprising a memory, a processor and a computer program stored on the memory and executable on the processor, characterized in that the processor implements the steps of the method according to any one of claims 1 to 7 when the computer program is executed.
10. A non-transitory computer readable storage medium, on which a computer program is stored, characterized in that the computer program, when being executed by a processor, implements the steps of the method according to any of claims 1 to 7.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202311142654.3A CN117057581A (en) | 2023-09-05 | 2023-09-05 | Scheduling method and system for warehouse automation equipment |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202311142654.3A CN117057581A (en) | 2023-09-05 | 2023-09-05 | Scheduling method and system for warehouse automation equipment |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN117057581A true CN117057581A (en) | 2023-11-14 |
Family
ID=88653561
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202311142654.3A Pending CN117057581A (en) | 2023-09-05 | 2023-09-05 | Scheduling method and system for warehouse automation equipment |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN117057581A (en) |
-
2023
- 2023-09-05 CN CN202311142654.3A patent/CN117057581A/en active Pending
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| KR102353518B1 (en) | Order processing method, apparatus, device, system and storage medium | |
| CN108792387B (en) | Shelf hit method, apparatus, server and medium | |
| EP4207012A1 (en) | Order processing and warehouse dispatch method, device, system, and storage medium | |
| US9454401B2 (en) | Resource allocation method and apparatus of GPU | |
| CN107105009A (en) | Job scheduling method and device based on Kubernetes system docking workflow engines | |
| US9430285B2 (en) | Dividing and parallel processing record sets using a plurality of sub-tasks executing across different computers | |
| CN109902975A (en) | Dispatching method, system, device and computer readable storage medium | |
| CN105094972A (en) | Method and device for processing database operation tasks | |
| CN113627775B (en) | Scheduling method, device, equipment and storage medium of robot | |
| CN103392165B (en) | Storage system | |
| CN107239342A (en) | A kind of storage cluster task management method and device | |
| CN107577534A (en) | A kind of resource regulating method and device | |
| WO2021197477A1 (en) | Device scheduling method and apparatus for high-bay warehouse | |
| CN106227469A (en) | Data-erasure method and system for distributed storage cluster | |
| CN110928696B (en) | User-level thread control system and method thereof | |
| KR102032895B1 (en) | Apparatus and method for sharing functional logic between functional units, and reconfigurable processor | |
| KR102350785B1 (en) | Method, apparatus, device, and storage medium for performing processing task | |
| CN107102966B (en) | Multi-core processor chip, interrupt control method and controller | |
| CN117057581A (en) | Scheduling method and system for warehouse automation equipment | |
| CN116341886B (en) | Method, system, device, equipment and medium for processing photomask resources | |
| CN110390450B (en) | Storage scheduling method and device, storage medium and electronic equipment | |
| CN114035930B (en) | Method and device for task scheduling, electronic equipment and readable storage medium | |
| CN115170026A (en) | Task processing method and device | |
| CN115168012A (en) | Thread pool concurrent thread number determining method and related product | |
| CN104915246A (en) | High-configurable distributed real-time calculation engine based on workflow and control method |
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 |