CN113537654A - Task allocation method, device and system - Google Patents
Task allocation method, device and system Download PDFInfo
- Publication number
- CN113537654A CN113537654A CN202010286408.5A CN202010286408A CN113537654A CN 113537654 A CN113537654 A CN 113537654A CN 202010286408 A CN202010286408 A CN 202010286408A CN 113537654 A CN113537654 A CN 113537654A
- Authority
- CN
- China
- Prior art keywords
- picking
- task
- picker
- point
- tasks
- 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 58
- 230000008569 process Effects 0.000 claims description 16
- 239000006185 dispersion Substances 0.000 claims description 14
- 238000004590 computer program Methods 0.000 claims description 9
- 238000012216 screening Methods 0.000 claims description 7
- 239000000126 substance Substances 0.000 claims 1
- 238000010586 diagram Methods 0.000 description 14
- 238000004891 communication Methods 0.000 description 7
- 230000006870 function Effects 0.000 description 7
- 230000008901 benefit Effects 0.000 description 5
- 230000003287 optical effect Effects 0.000 description 4
- 238000012545 processing Methods 0.000 description 4
- 230000032258 transport Effects 0.000 description 4
- 230000004048 modification Effects 0.000 description 3
- 238000012986 modification Methods 0.000 description 3
- 239000000835 fiber Substances 0.000 description 2
- 230000003993 interaction Effects 0.000 description 2
- 238000012856 packing Methods 0.000 description 2
- 230000000644 propagated effect Effects 0.000 description 2
- 239000004065 semiconductor Substances 0.000 description 2
- 238000010276 construction Methods 0.000 description 1
- 230000003111 delayed effect Effects 0.000 description 1
- 238000013461 design Methods 0.000 description 1
- 230000000694 effects Effects 0.000 description 1
- 230000006872 improvement Effects 0.000 description 1
- 239000004973 liquid crystal related substance Substances 0.000 description 1
- 239000013307 optical fiber Substances 0.000 description 1
- 238000004806 packaging method and process Methods 0.000 description 1
- 238000011160 research Methods 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
- G06Q10/063—Operations research, analysis or management
- G06Q10/0631—Resource planning, allocation, distributing or scheduling for enterprises or organisations
-
- 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/083—Shipping
- G06Q10/0835—Relationships between shipper or supplier and carriers
- G06Q10/08355—Routing methods
Landscapes
- Business, Economics & Management (AREA)
- Human Resources & Organizations (AREA)
- Engineering & Computer Science (AREA)
- Economics (AREA)
- Strategic Management (AREA)
- Entrepreneurship & Innovation (AREA)
- Development Economics (AREA)
- Marketing (AREA)
- Operations Research (AREA)
- Quality & Reliability (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)
Abstract
The invention discloses a task allocation method, a task allocation device and a task allocation system, and relates to the technical field of warehousing. One embodiment of the method comprises: acquiring shelf identifiers uploaded by code scanning equipment carried by each picker, and positioning the current position of each picker; according to the current position of each picker and the picking point position of the items in each picking task, distributing each picking task to the picker nearest to the picking point; and acquiring the current position of each storage robot, and distributing each picking task to the storage robot closest to the picking point according to the picking point position of the article in each picking task and the current position of each storage robot. The embodiment can solve the technical problem of low sorting efficiency.
Description
Technical Field
The invention relates to the technical field of warehousing, in particular to a task allocation method, a task allocation device and a task allocation system.
Background
Currently, it is more and more common to utilize a warehousing robot to operate in a warehouse and pick items in the warehouse in cooperation with a picker.
One of them is "Swarm me" mode (i.e. man-in-the-car mode), in which a large number of robots deployed in a warehouse automatically run to a picking point, wait for a picker to pick an article to a carrier, and the robot carries the carrier to gradually enter the next picking point until the whole task is completed and then the robot transports the article to a packing area for operation. The other type of the 'Lead me' mode (the car counting and leading mode) is that the robot automatically moves to a picking point according to a system instruction and leads a picker to move in a warehouse, the picker picks articles along with the robot, and the robot conveys the articles to a packing area for operation after the whole task is completed.
In the process of implementing the invention, the inventor finds that at least the following problems exist in the prior art:
the system lacks effective scheduling management to the storage robot, resulting in low picking efficiency.
Disclosure of Invention
In view of this, embodiments of the present invention provide a task allocation method, device and system to solve the technical problem of low picking efficiency.
To achieve the above object, according to an aspect of an embodiment of the present invention, there is provided a task allocation method including:
acquiring shelf identifiers uploaded by code scanning equipment carried by each picker, and positioning the current position of each picker;
according to the current position of each picker and the picking point position of the items in each picking task, distributing each picking task to the picker nearest to the picking point;
and acquiring the current position of each storage robot, and distributing each picking task to the storage robot closest to the picking point according to the picking point position of the article in each picking task and the current position of each storage robot.
Optionally, each picker is assigned at least one picking task;
according to the current position of each picker and the picking point position of the item in each picking task, respectively allocating each picking task to the picker nearest to the picking point, and further comprising:
and generating a picking point path according to the picking point positions of the items in each picking task distributed to the picker, and sending the picking point path to a terminal carried by the picker so as to display the picking point path on a display screen of the terminal.
Optionally, the method further comprises:
dynamically adjusting picking tasks allocated to the pickers in real time according to the current positions of the pickers and the picking point positions of the items in the picking tasks in the process of executing the picking tasks by the pickers;
and updating the picking point path according to the adjusted picking task, and issuing the updated picking point path to the picker.
Optionally, each warehousing robot is assigned at least one picking task;
and in the process of executing the picking tasks by the storage robot, dynamically adjusting the picking tasks distributed to the storage robot in real time according to the current position of the storage robot and the picking point positions of the articles in each picking task.
Optionally, the method further comprises:
and if the picking points of at least two storage robots to be put in place are the same, controlling the at least two storage robots to sequentially reach the picking points according to the sequence.
Optionally, the method further comprises:
for any one sorting task, distributing the sorting task to the picker and the storage robot according to the walking speed of the picker and the moving speed of the storage robot, so that the storage robot reaches the picking point of the item in the sorting task earlier than the picker.
Optionally, the method further comprises:
if the picking points of the items in the picking tasks are located in a preset dispersion area, putting the picking tasks into a dispersion task set;
and if a preset time node is reached or the number of picking tasks in the dispersed task set reaches a number threshold, respectively allocating each picking task in the dispersed task set to the picker and the warehousing robot.
Optionally, assigning each of the picking orders to the picker nearest to the picking point according to the current position of each of the pickers and the picking point position of the item in each of the picking orders, respectively, comprises:
screening out picking task sets matched with the pickers according to preset virtual partitions corresponding to the pickers and picking point positions of the articles in the picking tasks;
for each picking task set, assigning each picking task to the picker nearest to the picking point according to the current position of each picker matching the picking task set and the picking point position of the item of each picking task in the picking task set.
In addition, according to another aspect of an embodiment of the present invention, there is provided a task assigning apparatus including:
the positioning module is used for acquiring shelf identifiers uploaded by code scanning equipment carried by each picker, so as to position the current position of each picker;
the first distribution module is used for distributing each picking task to the picker nearest to the picking point according to the current position of each picker and the picking point position of the item in each picking task;
and the second distribution module is used for acquiring the current position of each storage robot, and distributing each picking task to the storage robot closest to the picking point according to the picking point position of the article in each picking task and the current position of each storage robot.
Optionally, each picker is assigned at least one picking task;
the first allocation module is further configured to:
and generating a picking point path according to the picking point positions of the items in each picking task distributed to the picker, and sending the picking point path to a terminal carried by the picker so as to display the picking point path on a display screen of the terminal.
Optionally, the first allocation module is further configured to:
dynamically adjusting picking tasks allocated to the pickers in real time according to the current positions of the pickers and the picking point positions of the items in the picking tasks in the process of executing the picking tasks by the pickers;
and updating the picking point path according to the adjusted picking task, and issuing the updated picking point path to the picker.
Optionally, each warehousing robot is assigned at least one picking task;
the second allocating module is further configured to: and in the process of executing the picking tasks by the storage robot, dynamically adjusting the picking tasks distributed to the storage robot in real time according to the current position of the storage robot and the picking point positions of the articles in each picking task.
Optionally, the second allocating module is further configured to:
and if the picking points of at least two storage robots to be put in place are the same, controlling the at least two storage robots to sequentially reach the picking points according to the sequence.
Optionally, the first allocation module is further configured to: for any one sorting task, distributing the sorting task to the picker and the storage robot according to the walking speed of the picker and the moving speed of the storage robot, so that the storage robot reaches the picking point of the item in the sorting task earlier than the picker.
Optionally, the first allocation module is further configured to:
if the picking points of the items in the picking tasks are located in a preset dispersion area, putting the picking tasks into a dispersion task set;
and if a preset time node is reached or the number of picking tasks in the dispersed task set reaches a number threshold, respectively allocating each picking task in the dispersed task set to the picker and the warehousing robot.
Optionally, the first allocation module is further configured to:
screening out picking task sets matched with the pickers according to preset virtual partitions corresponding to the pickers and picking point positions of the articles in the picking tasks;
for each picking task set, assigning each picking task to the picker nearest to the picking point according to the current position of each picker matching the picking task set and the picking point position of the item of each picking task in the picking task set.
In addition, according to another aspect of the embodiments of the present invention, there is provided a task allocation system, including a code scanning device, a warehousing robot, and a scheduling system;
the code scanning device is used for scanning shelf identification and uploading the shelf identification to the dispatching system; wherein the scanning device is carried by each picker;
the scheduling system is used for receiving the shelf identifiers uploaded by the scanning devices so as to locate the current position of each picker; according to the current position of each picker and the picking point position of the items in each picking task, distributing each picking task to the picker nearest to the picking point; and acquiring the current position of each storage robot, and distributing each picking task to the storage robot closest to the picking point according to the picking point position of the article in each picking task.
Optionally, each picker is assigned at least one picking task;
the scheduling system is further configured to:
and generating a picking point path according to the picking point positions of the items in each picking task distributed to the picker, and sending the picking point path to a terminal carried by the picker so as to display the picking point path on a display screen of the terminal.
The scheduling system is further configured to:
dynamically adjusting picking tasks allocated to the pickers in real time according to the current positions of the pickers and the picking point positions of the items in the picking tasks in the process of executing the picking tasks by the pickers;
and updating the picking point path according to the adjusted picking task, and issuing the updated picking point path to the picker.
Optionally, each warehousing robot is assigned at least one picking task;
the scheduling system is further configured to: and in the process of executing the picking tasks by the storage robot, dynamically adjusting the picking tasks distributed to the storage robot in real time according to the current position of the storage robot and the picking point positions of the articles in each picking task.
Optionally, the scheduling system is further configured to:
and if the picking points of at least two storage robots to be put in place are the same, controlling the at least two storage robots to sequentially reach the picking points according to the sequence.
Optionally, the scheduling system is further configured to:
for any one sorting task, distributing the sorting task to the picker and the storage robot according to the walking speed of the picker and the moving speed of the storage robot, so that the storage robot reaches the picking point of the item in the sorting task earlier than the picker.
Optionally, the scheduling system is further configured to:
if the picking points of the items in the picking tasks are located in a preset dispersion area, putting the picking tasks into a dispersion task set;
and if a preset time node is reached or the number of picking tasks in the dispersed task set reaches a number threshold, respectively allocating each picking task in the dispersed task set to the picker and the warehousing robot.
Optionally, the scheduling system is further configured to:
screening out picking task sets matched with the pickers according to preset virtual partitions corresponding to the pickers and picking point positions of the articles in the picking tasks;
for each picking task set, assigning each picking task to the picker nearest to the picking point according to the current position of each picker matching the picking task set and the picking point position of the item of each picking task in the picking task set.
According to another aspect of the embodiments of the present invention, there is also provided an electronic device, including:
one or more processors;
a storage device for storing one or more programs,
when the one or more programs are executed by the one or more processors, the one or more processors implement the method of any of the embodiments described above.
According to another aspect of the embodiments of the present invention, there is also provided a computer readable medium, on which a computer program is stored, which when executed by a processor implements the method of any of the above embodiments.
One embodiment of the above invention has the following advantages or benefits: the technical means that the picking tasks are distributed to the picker nearest to the picking point according to the current position of the picker and the picking point position of the article in the picking tasks, and the picking tasks are distributed to the storage robot nearest to the picking point respectively according to the picking point position of the article in the picking tasks and the current position of the storage robot are adopted, so that the technical problem of low picking efficiency in the prior art is solved. According to the embodiment of the invention, the picking tasks are dynamically distributed to the storage robots and the pickers, the walking paths of the pickers and the waiting time of the storage robots are maximally reduced under the condition of meeting the task timeliness, so that the picking efficiency is maximized, the application amount of the storage robots is relatively minimum, and the storage benefit is maximized.
Further effects of the above-mentioned non-conventional alternatives will be described below in connection with the embodiments.
Drawings
The drawings are included to provide a better understanding of the invention and are not to be construed as unduly limiting the invention. Wherein:
FIG. 1 is a schematic diagram of a main flow of a task assignment method according to an embodiment of the present invention;
FIG. 2 is a schematic view of a main flow of a task assigning method according to a referential embodiment of the present invention;
FIG. 3 is a schematic diagram of the main modules of a task assignment device according to an embodiment of the present invention;
FIG. 4 is a schematic diagram of a task allocation system according to an embodiment of the present invention;
FIG. 5 is an exemplary system architecture diagram in which embodiments of the present invention may be employed;
fig. 6 is a schematic block diagram of a computer system suitable for use in implementing a terminal device or server of an embodiment of the invention.
Detailed Description
Exemplary embodiments of the present invention are described below with reference to the accompanying drawings, in which various details of embodiments of the invention are included to assist understanding, and which are to be considered as merely exemplary. Accordingly, those of ordinary skill in the art will recognize that various changes and modifications of the embodiments described herein can be made without departing from the scope and spirit of the invention. Also, descriptions of well-known functions and constructions are omitted in the following description for clarity and conciseness.
The prior art lacks effective dispatch management to the storage robot, leads to selecting efficiency not high, and the inventor has the following reason through the analytical research mainly:
1) if the picking points of the items of the picking tasks in the warehouse are scattered, the picker cannot find the picking tasks (namely cannot find the parking position of the storage robot), so that the picker can find all the places, and the picking efficiency is low.
2) At the end of each time of picking order, picking orders at certain 'corner' positions are not discovered by pickers in time, and therefore the picking order is delayed.
3) When the picking point distribution of the article of picking the task is comparatively "sparse", it can appear that the picker sees that both sides are all had storage robot in the distance and waiting to pick, and the picker does not know which storage robot of selecting preferentially, also can appear that a plurality of pickers go to same storage robot simultaneously, leads to the task to overlap, and the opposite side storage robot then unmanned in time selects.
4) The picking tasks received by each picker are not balanced, and the labor distribution of the pickers is unreasonable.
5) In the picking mode of 'car leader', due to the fact that people, robots and picking tasks are bound with each other, a picker cannot pick along the way when passing through the item picking points of other picking tasks, and therefore picking efficiency is low; in addition, when the picker completes a picking task along with the robot, another robot needs to be searched again, so that picking time is wasted, and the picking efficiency is low.
Fig. 1 is a schematic diagram of a main flow of a task allocation method according to an embodiment of the present invention. As an embodiment of the present invention, as shown in fig. 1, the task allocation method may include:
step 101, acquiring shelf identifiers uploaded by code scanning equipment carried by each picker, so as to locate the current position of each picker.
Each picker carries a code scanning device which is used for scanning identification information such as one-dimensional codes or two-dimensional codes and the like on the goods shelf so as to obtain goods shelf identification; the shelf identification is then uploaded to the scheduling system. And after receiving the shelf identifiers uploaded by the scanning equipment carried by the pickers, the scheduling system positions the current positions of the pickers according to the corresponding relation between the shelf identifiers and the shelf positions. In the embodiment of the invention, after the pickers arrive near the goods shelf, the code scanning equipment scans the identification information such as the one-dimensional code or the two-dimensional code on the goods shelf, and then the goods shelf identification is uploaded to the dispatching system, and the dispatching system can position the current position of each picker in real time according to the goods shelf identification uploaded in real time.
Optionally, in order to conveniently carry the code scanning device, the code scanning device may be a wearable camera or a code scanner, so that the sorting task executed by the pickers is not affected, and the identifiers on the surrounding shelves can be scanned in real time through the code scanning device, so as to locate the current position of each picker in real time, and the scheduling scheme is optimized in real time by the scheduling system.
And 102, respectively allocating each picking task to the picker nearest to the picking point according to the current position of each picker and the picking point position of the item in each picking task.
After the current positions of all the pickers are located, the dispatching system respectively calculates the pickers closest to the picking point positions according to the current positions of all the pickers and the picking point positions of the articles in all the picking tasks, so that the corresponding picking tasks are bound with the pickers closest to the picking point positions, the corresponding picking tasks are issued to the terminals of the pickers closest to the picking point positions, and the pickers can conveniently check the distributed picking tasks through the terminals.
In the embodiment of the invention, the optimal picking tasks are distributed to each picker by the scheduling system, and the nearest picker is assigned to go to the picking point for operation, so that the walking distance of the picker can be reduced, and therefore, the picker does not need to pick the picking tasks any more, does not need to judge which picking task is optimal, only needs to execute the picking task distributed by the scheduling system, and the picking efficiency can be obviously improved.
Optionally, step 102 may comprise: screening out picking task sets matched with the pickers according to preset virtual partitions corresponding to the pickers and picking point positions of the articles in the picking tasks; for each picking task set, assigning each picking task to the picker nearest to the picking point according to the current position of each picker matching the picking task set and the picking point position of the item of each picking task in the picking task set. If the picking points of the items in the picking tasks are distributed densely in the warehouse, a corresponding virtual partition can be planned for each picker in advance, one or more virtual partitions can be planned for each picker according to actual conditions according to different density degrees of the picking points, and each picker is responsible for picking the picking tasks of the corresponding virtual partitions, so that the walking distance of the pickers in the warehouse can be reduced, the executing tasks of each picker can be balanced, and the picking efficiency can be improved.
In embodiments of the present invention, the scheduling system preferentially assigns picking tasks having a picking point in the virtual partition corresponding to the picker when assigning the picking tasks to the picker.
Optionally, step 102 is followed by: and generating a picking point path according to the picking point positions of the items in each picking task distributed to the picker, and sending the picking point path to a terminal carried by the picker so as to display the picking point path on a display screen of the terminal. In embodiments of the invention, each picker may be assigned at least one picking task, and the scheduling system generates a picking path for each picker according to the picking task assigned to each picker, and then issues the picking path to the terminal of the corresponding picker. After the terminal receives the picking path issued by the scheduling system, the picking path can be displayed on the display screen, so that a picker can conveniently check the walking path and the task distribution position, and indoor map positioning navigation is carried out for the picker. The picker may wear a terminal on the arm with a display screen for displaying the picking path. Optionally, the terminal is an intelligent terminal, information such as picking tasks and walking paths can be provided for a picker through a human-computer exchange interface, interaction with the picker can be performed through an intelligent voice interaction function, the walking paths are guided by voice, the picker can carry articles to a carrier and then confirm completion of the tasks through voice, and the robot enters a next picking point or returns the completion tasks to the packaging area. Therefore, the intelligent terminal can free the hands of the picker in the picking operation, and the picking efficiency is further improved.
103, acquiring the current position of each storage robot, and distributing each picking task to the storage robot closest to the picking point according to the picking point position of the article in each picking task and the current position of each storage robot.
In the embodiment of the invention, the warehousing robots can report the current positions in real time, the scheduling system respectively calculates the warehousing robots closest to the picking point positions according to the picking point positions of the articles in the picking tasks and the current positions of the warehousing robots, so as to bind the corresponding picking tasks with the warehousing robots closest to the picking point positions and issue the corresponding picking tasks to the warehousing robots closest to the picking point positions, and the warehousing robots go to the picking point in sequence after receiving the picking tasks.
Each warehousing robot is assigned at least one picking task, and similar to step 102, the scheduling system may also generate a picking path for each warehousing robot, and the warehousing robot goes to each picking point in the path in sequence according to the delivered picking path. The warehousing robot includes at least one of an automated guided transport vehicle, an intelligent guided transport vehicle, or an autonomous mobile robot.
Optionally, dynamically adjusting the picking tasks assigned to the pickers in real time according to the current positions of the pickers and the picking point positions of the items in the respective picking tasks during the course of the pickers performing the picking tasks; and updating the picking point path according to the adjusted picking task, and issuing the updated picking point path to the picker. Optionally, in the process of executing the picking tasks by the warehousing robot, the picking tasks allocated to the warehousing robot are dynamically adjusted in real time according to the current position of the warehousing robot and the picking point positions of the items in each picking task. The scheduling system may dynamically assign picking tasks to each picker and each warehousing robot at intervals so that picking tasks may be moved from one warehousing robot to another and from one picker to another. The picking tasks distributed to the storage robots and the pickers are dynamically adjusted, so that the picking point paths of the storage robots and the pickers are also dynamically adjusted, the in-route tasks can be picked, the distributed picking tasks can be distributed to other more suitable storage robots and pickers, the picking work of each picker is relatively balanced, the picking efficiency is maximized, and the condition that a plurality of pickers 'order grabbing' or the picking tasks are avoided.
Optionally, the method further comprises: and if the picking points of at least two storage robots to be put in place are the same, controlling the at least two storage robots to sequentially reach the picking points according to the sequence. The dispatching system controls the storage robots to go to the picking points in sequence, so that the situation that the storage robots wait for the picking points is avoided as much as possible, and the picking efficiency is improved.
Optionally, the method further comprises: for any one sorting task, distributing the sorting task to the picker and the storage robot according to the walking speed of the picker and the moving speed of the storage robot, so that the storage robot reaches the picking point of the item in the sorting task earlier than the picker. The dispatching system preferably controls the warehousing robot and the pickers to arrive at the picking points at the same time, but the warehousing robot can arrive at the picking points relatively early by considering the walking speed difference of each picker, and the dispatching system timely dispatches/adjusts the picking tasks to the proper pickers so as to avoid the long-time waiting of the warehousing robot.
Optionally, the method further comprises: if the picking points of the items in the picking tasks are located in a preset dispersion area, putting the picking tasks into a dispersion task set; and if a preset time node is reached or the number of picking tasks in the dispersed task set reaches a number threshold, respectively allocating each picking task in the dispersed task set to the picker and the warehousing robot. The scheduling system can carry out 'single-blocking' on picking tasks in certain corners under the condition that the time node of each order is not exceeded, namely, the warehousing robot and the picker are scheduled to go to the picking point to execute the tasks after a certain number of picking tasks are achieved, the phenomenon of delay of the picking tasks is avoided, and the highest picking efficiency is achieved. Particularly, when the picking point positions of the picking tasks are distributed sparsely, the dispatching system adopts a zone-by-zone step-by-step picking strategy to enable the walking paths of the storage robot and the picker to be shortest, so that the picker executes a plurality of picking tasks in the area, the walking paths are reduced, and the highest picking efficiency is achieved.
According to the various embodiments described above, it can be seen that the technical means of allocating the picking tasks to the pickers closest to the picking points according to the current positions of the pickers and the picking point positions of the items in the picking tasks and allocating the picking tasks to the storage robots closest to the picking points respectively according to the picking point positions of the items in the picking tasks and the current positions of the storage robots in the picking tasks in the embodiments of the present invention solves the technical problem of low picking efficiency in the prior art. According to the embodiment of the invention, the picking tasks are dynamically distributed to the storage robots and the pickers, the walking paths of the pickers and the waiting time of the storage robots are maximally reduced under the condition of meeting the task timeliness, so that the picking efficiency is maximized, the application amount of the storage robots is relatively minimum, and the storage benefit is maximized.
Fig. 2 is a schematic diagram of a main flow of a task allocation method according to a referential embodiment of the present invention. As still another embodiment of the present invention, as shown in fig. 2, the task allocation method may include:
step 201, obtaining shelf identifiers uploaded by code scanning devices carried by the pickers, so as to locate the current positions of the pickers.
Step 202, according to the current position of each picker and the picking point position of the items in each picking task, each picking task is respectively allocated to the picker closest to the picking point.
Step 203, a picking point path is generated according to the picking point positions of the items in each picking task assigned to the picker.
And 204, sending the picking point path to a terminal carried by the picker, so that the picking point path is displayed on a display screen of the terminal.
And step 205, acquiring the current position of each warehousing robot.
And step 206, distributing each picking task to the storage robot closest to the picking point according to the picking point position of the article in each picking task and the current position of each storage robot.
Step 207, generating a picking point path according to the picking point positions of the items in each picking task distributed to the warehousing robot.
And 208, issuing the picking point path to the storage robot so that the picking point path is displayed on a display screen of the storage robot.
In addition, in one embodiment of the present invention, the detailed implementation of the task allocation method is described in detail above, so that the repeated content is not described again.
Fig. 3 is a schematic diagram of main modules of a task assigning apparatus according to an embodiment of the present invention, and as shown in fig. 3, the task assigning apparatus 300 includes a positioning module 301, a first assigning module 302, and a second assigning module 303; the positioning module 301 is configured to obtain shelf identifiers uploaded by code scanning devices carried by pickers, so as to position current positions of the pickers; the first allocating module 302 is configured to allocate each picking task to a picker nearest to the picking point according to the current position of each picker and the picking point position of the item in each picking task; the second allocating module 303 is configured to acquire a current position of each warehousing robot, and allocate each picking task to the warehousing robot closest to the picking point according to the picking point position of the article in each picking task and the current position of each warehousing robot.
Optionally, each picker is assigned at least one picking task;
the first assignment module 302 is further configured to: and generating a picking point path according to the picking point positions of the items in each picking task distributed to the picker, and sending the picking point path to a terminal carried by the picker so as to display the picking point path on a display screen of the terminal.
Optionally, the first allocating module 302 is further configured to: dynamically adjusting picking tasks allocated to the pickers in real time according to the current positions of the pickers and the picking point positions of the items in the picking tasks in the process of executing the picking tasks by the pickers; and updating the picking point path according to the adjusted picking task, and issuing the updated picking point path to the picker.
Optionally, each warehousing robot is assigned at least one picking task;
the second allocating module 303 is further configured to: and in the process of executing the picking tasks by the storage robot, dynamically adjusting the picking tasks distributed to the storage robot in real time according to the current position of the storage robot and the picking point positions of the articles in each picking task.
Optionally, the second allocating module 303 is further configured to: and if the picking points of at least two storage robots to be put in place are the same, controlling the at least two storage robots to sequentially reach the picking points according to the sequence.
Optionally, the first allocating module 302 is further configured to: for any one sorting task, distributing the sorting task to the picker and the storage robot according to the walking speed of the picker and the moving speed of the storage robot, so that the storage robot reaches the picking point of the item in the sorting task earlier than the picker.
Optionally, the first allocating module 302 is further configured to: if the picking points of the items in the picking tasks are located in a preset dispersion area, putting the picking tasks into a dispersion task set; and if a preset time node is reached or the number of picking tasks in the dispersed task set reaches a number threshold, respectively allocating each picking task in the dispersed task set to the picker and the warehousing robot.
Optionally, the first allocating module 302 is further configured to: screening out picking task sets matched with the pickers according to preset virtual partitions corresponding to the pickers and picking point positions of the articles in the picking tasks; for each picking task set, assigning each picking task to the picker nearest to the picking point according to the current position of each picker matching the picking task set and the picking point position of the item of each picking task in the picking task set.
It should be noted that, in the embodiment of the task assigning apparatus according to the present invention, the details of the task assigning method are already described in detail, and therefore, the repeated description is not repeated here.
Fig. 4 is a schematic structural diagram of a task allocation system according to an embodiment of the present invention. As shown in fig. 5, the task allocation system includes a code scanning device 403, a warehousing robot 402 and a scheduling system 401; the code scanning device 403 is configured to scan a shelf identifier and upload the shelf identifier to the scheduling system 401; wherein the scanning device is carried by each picker 405; the scheduling system 401 is configured to receive the shelf identifiers uploaded by each of the scanning devices, and thereby locate the current location of each of the pickers 405; assigning each of the picking orders to the picker 405 closest to the picking point according to the current location of each picker 405 and the picking point location of the items in each picking order; acquiring the current position of each warehousing robot 402, and distributing each picking task to the warehousing robot 402 closest to the picking point according to the picking point position of the article in each picking task.
Optionally, each picker 405 is assigned at least one picking task;
the scheduling system 401 is further configured to:
a picking point path is generated according to the picking point positions of the items in each picking task assigned to the picker 405, and the picking point path is issued to the terminal 404 carried by the picker 405, so that the picking point path is displayed on the display screen of the terminal 404.
The scheduling system 401 is further configured to:
dynamically adjusting the picking orders assigned to the picker 405 in real time based on the current location of the picker 405 and the picking point locations of the items in each picking order during the picking order performed by the picker 405;
and updating the picking point route according to the adjusted picking task, and sending the updated picking point route to the picker 405.
Optionally, each warehousing robot 402 is assigned at least one picking task;
the scheduling system 401 is further configured to: in the process that the warehousing robot 402 executes the picking tasks, the picking tasks distributed to the warehousing robot 402 are dynamically adjusted in real time according to the current position of the warehousing robot 402 and the picking point positions of the articles in each picking task.
Optionally, the scheduling system 401 is further configured to:
if the picking points of at least two warehousing robots 402 which are about to reach the picking points are the same, the at least two warehousing robots 402 are controlled to sequentially reach the picking points according to the sequence.
Optionally, the scheduling system 401 is further configured to:
for any one sorting task, the picking tasks are assigned to the picker 405 and the warehousing robot 402 according to the walking speed of the picker 405 and the moving speed of the warehousing robot 402, so that the warehousing robot 402 arrives at the picking point of the items in the picking tasks earlier than the picker 405.
Optionally, the scheduling system 401 is further configured to:
if the picking points of the items in the picking tasks are located in a preset dispersion area, putting the picking tasks into a dispersion task set;
if a preset time node is reached or the number of picking tasks in the dispersed task set reaches a number threshold, assigning each picking task in the dispersed task set to the picker 405 and the warehousing robot 402, respectively.
Optionally, the scheduling system 401 is further configured to:
screening out picking task sets matched with the pickers 405 according to preset virtual partitions corresponding to the pickers 405 and picking point positions of the items in the picking tasks;
for each picking task set, each picking task is assigned to the picker 405 closest to the picking point according to the current position of the picker 405 matching the picking task set and the picking point position of the item of the picking task in the picking task set.
It should be noted that, in the implementation of the task assigning system of the present invention, the details of the task assigning method are already described in detail, and therefore, the repeated descriptions herein will not be repeated.
Fig. 5 illustrates an exemplary system architecture 500 to which the task assigning method or the task assigning apparatus according to the embodiments of the present invention may be applied.
As shown in fig. 5, the system architecture 500 may include terminal devices 501, 502, 503, a network 504, and a server 505. The network 504 serves to provide a medium for communication links between the terminal devices 501, 502, 503 and the server 505. Network 504 may include various connection types, such as wired, wireless communication links, or fiber optic cables, to name a few.
The user may use the terminal devices 501, 502, 503 to interact with a server 505 over a network 504 to receive or send messages or the like. The terminal devices 501, 502, 503 may have installed thereon various communication client applications, such as shopping-like applications, web browser applications, search-like applications, instant messaging tools, mailbox clients, social platform software, etc. (by way of example only).
The terminal devices 501, 502, 503 may be various electronic devices having a display screen and supporting web browsing, including but not limited to smart phones, tablet computers, laptop portable computers, desktop computers, and the like.
The server 505 may be a server providing various services, such as a background management server (for example only) providing support for shopping websites browsed by users using the terminal devices 501, 502, 503. The background management server may analyze and otherwise process the received data such as the item information query request, and feed back a processing result (for example, target push information, item information — just an example) to the terminal device.
It should be noted that the task allocation method provided by the embodiment of the present invention is generally executed by the server 505, and accordingly, the task allocation apparatus is generally disposed in the server 505. The task allocation method provided by the embodiment of the present invention may also be executed by the terminal devices 501, 502, and 503, and accordingly, the task allocation apparatus may be disposed in the terminal devices 501, 502, and 503.
It should be understood that the number of terminal devices, networks, and servers in fig. 5 is merely illustrative. There may be any number of terminal devices, networks, and servers, as desired for implementation.
Referring now to FIG. 6, a block diagram of a computer system 600 suitable for use with a terminal device implementing an embodiment of the invention is shown. The terminal device shown in fig. 6 is only an example, and should not bring any limitation to the functions and the scope of use of the embodiments of the present invention.
As shown in fig. 6, the computer system 600 includes a Central Processing Unit (CPU)601 that can perform various appropriate actions and processes according to a program stored in a Read Only Memory (ROM)602 or a program loaded from a storage section 608 into a Random Access Memory (RAM) 603. In the RAM603, various programs and data necessary for the operation of the system 600 are also stored. The CPU 601, ROM 602, and RAM603 are connected to each other via a bus 604. An input/output (I/O) interface 605 is also connected to bus 604.
The following components are connected to the I/O interface 605: an input portion 606 including a keyboard, a mouse, and the like; an output portion 607 including a display such as a Cathode Ray Tube (CRT), a Liquid Crystal Display (LCD), and the like, and a speaker; a storage section 608 including a hard disk and the like; and a communication section 609 including a network interface card such as a LAN card, a modem, or the like. The communication section 609 performs communication processing via a network such as the internet. The driver 610 is also connected to the I/O interface 605 as needed. A removable medium 611 such as a magnetic disk, an optical disk, a magneto-optical disk, a semiconductor memory, or the like is mounted on the drive 610 as necessary, so that a computer program read out therefrom is mounted in the storage section 608 as necessary.
In particular, according to the embodiments of the present disclosure, the processes described above with reference to the flowcharts may be implemented as computer software programs. For example, embodiments of the present disclosure include a computer program comprising a computer program embodied on a computer readable medium, the computer program comprising program code for performing the method illustrated in the flow chart. In such an embodiment, the computer program may be downloaded and installed from a network through the communication section 609, and/or installed from the removable medium 611. The computer program performs the above-described functions defined in the system of the present invention when executed by the Central Processing Unit (CPU) 601.
It should be noted that the computer readable medium shown in the present invention can be a computer readable signal medium or a computer readable storage medium or any combination of the two. A computer readable storage medium may be, for example, but not limited to, an electronic, magnetic, optical, electromagnetic, infrared, or semiconductor system, apparatus, or device, or any combination of the foregoing. More specific examples of the computer readable storage medium may include, but are not limited to: an electrical connection having one or more wires, a portable computer diskette, a hard disk, a Random Access Memory (RAM), a read-only memory (ROM), an erasable programmable read-only memory (EPROM or flash memory), an optical fiber, a portable compact disc read-only memory (CD-ROM), an optical storage device, a magnetic storage device, or any suitable combination of the foregoing. In the present invention, a computer readable storage medium may be any tangible medium that can contain, or store a program for use by or in connection with an instruction execution system, apparatus, or device. In the present invention, however, a computer readable signal medium may include a propagated data signal with computer readable program code embodied therein, for example, in baseband or as part of a carrier wave. Such a propagated data signal may take many forms, including, but not limited to, electro-magnetic, optical, or any suitable combination thereof. A computer readable signal medium may also be any computer readable medium that is not a computer readable storage medium and that can communicate, propagate, or transport a program for use by or in connection with an instruction execution system, apparatus, or device. Program code embodied on a computer readable medium may be transmitted using any appropriate medium, including but not limited to: wireless, wire, fiber optic cable, RF, etc., or any suitable combination of the foregoing.
The flowchart and block diagrams in the figures illustrate the architecture, functionality, and operation of possible implementations of systems, methods and computer programs according to various embodiments of the present invention. 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 or flowchart illustration, and combinations of blocks in the block diagrams 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.
The modules described in the embodiments of the present invention may be implemented by software or hardware. The described modules may also be provided in a processor, which may be described as: a processor includes a location module, a first assignment module, and a second assignment module, where the names of the modules do not in some cases constitute a definition of the modules themselves.
As another aspect, the present invention also provides a computer-readable medium that may be contained in the apparatus described in the above embodiments; or may be separate and not incorporated into the device. The computer readable medium carries one or more programs which, when executed by a device, implement the method of: acquiring shelf identifiers uploaded by code scanning equipment carried by each picker, and positioning the current position of each picker; according to the current position of each picker and the picking point position of the items in each picking task, distributing each picking task to the picker nearest to the picking point; and acquiring the current position of each storage robot, and distributing each picking task to the storage robot closest to the picking point according to the picking point position of the article in each picking task and the current position of each storage robot.
According to the technical scheme of the embodiment of the invention, the technical means that the picking tasks are distributed to the picker nearest to the picking point according to the current position of the picker and the picking point position of the article in the picking tasks, and the picking tasks are distributed to the storage robot nearest to the picking point respectively according to the picking point position of the article in the picking tasks and the current position of the storage robot are adopted, so that the technical problem of low picking efficiency in the prior art is solved. According to the embodiment of the invention, the picking tasks are dynamically distributed to the storage robots and the pickers, the walking paths of the pickers and the waiting time of the storage robots are maximally reduced under the condition of meeting the task timeliness, so that the picking efficiency is maximized, the application amount of the storage robots is relatively minimum, and the storage benefit is maximized.
The above-described embodiments should not be construed as limiting the scope of the invention. Those skilled in the art will appreciate that various modifications, combinations, sub-combinations, and substitutions can occur, depending on design requirements and other factors. Any modification, equivalent replacement, and improvement made within the spirit and principle of the present invention should be included in the protection scope of the present invention.
Claims (13)
1. A task allocation method, comprising:
acquiring shelf identifiers uploaded by code scanning equipment carried by each picker, and positioning the current position of each picker;
according to the current position of each picker and the picking point position of the items in each picking task, distributing each picking task to the picker nearest to the picking point;
and acquiring the current position of each storage robot, and distributing each picking task to the storage robot closest to the picking point according to the picking point position of the article in each picking task and the current position of each storage robot.
2. The method of claim 1, wherein each picker is assigned at least one picking task;
according to the current position of each picker and the picking point position of the item in each picking task, respectively allocating each picking task to the picker nearest to the picking point, and further comprising:
and generating a picking point path according to the picking point positions of the items in each picking task distributed to the picker, and sending the picking point path to a terminal carried by the picker so as to display the picking point path on a display screen of the terminal.
3. The method of claim 2, further comprising:
dynamically adjusting picking tasks allocated to the pickers in real time according to the current positions of the pickers and the picking point positions of the items in the picking tasks in the process of executing the picking tasks by the pickers;
and updating the picking point path according to the adjusted picking task, and issuing the updated picking point path to the picker.
4. The method according to claim 1, wherein each warehousing robot is assigned at least one picking task;
the method further comprises the following steps: and in the process of executing the picking tasks by the storage robot, dynamically adjusting the picking tasks distributed to the storage robot in real time according to the current position of the storage robot and the picking point positions of the articles in each picking task.
5. The method of claim 4, further comprising:
and if the picking points of at least two storage robots to be put in place are the same, controlling the at least two storage robots to sequentially reach the picking points according to the sequence.
6. The method of claim 1, further comprising:
for any one sorting task, distributing the sorting task to the picker and the storage robot according to the walking speed of the picker and the moving speed of the storage robot, so that the storage robot reaches the picking point of the item in the sorting task earlier than the picker.
7. The method of claim 1, further comprising:
if the picking points of the items in the picking tasks are located in a preset dispersion area, putting the picking tasks into a dispersion task set;
and if a preset time node is reached or the number of picking tasks in the dispersed task set reaches a number threshold, respectively allocating each picking task in the dispersed task set to the picker and the warehousing robot.
8. The method of claim 1, wherein assigning each of the picking orders to a picker nearest the picking point based on a current location of the picker and a picking point location of an item in each picking order, respectively, comprises:
screening out picking task sets matched with the pickers according to preset virtual partitions corresponding to the pickers and picking point positions of the articles in the picking tasks;
for each picking task set, assigning each picking task to the picker nearest to the picking point according to the current position of each picker matching the picking task set and the picking point position of the item of each picking task in the picking task set.
9. A task assigning apparatus, comprising:
the positioning module is used for acquiring shelf identifiers uploaded by code scanning equipment carried by each picker, so as to position the current position of each picker;
the first distribution module is used for distributing each picking task to the picker nearest to the picking point according to the current position of each picker and the picking point position of the item in each picking task;
and the second distribution module is used for acquiring the current position of each storage robot, and distributing each picking task to the storage robot closest to the picking point according to the picking point position of the article in each picking task and the current position of each storage robot.
10. A task allocation system is characterized by comprising code scanning equipment, a warehousing robot and a scheduling system; wherein the content of the first and second substances,
the code scanning device is used for scanning shelf identification and uploading the shelf identification to the dispatching system; wherein the scanning device is carried by each picker;
the scheduling system is used for receiving the shelf identifiers uploaded by the scanning devices so as to locate the current position of each picker; according to the current position of each picker and the picking point position of the items in each picking task, distributing each picking task to the picker nearest to the picking point; and acquiring the current position of each storage robot, and distributing each picking task to the storage robot closest to the picking point according to the picking point position of the article in each picking task.
11. The system of claim 10, further comprising: a terminal carried by each of said pickers;
the scheduling system is further configured to generate a picking point path according to the picking point positions of the items in each picking task assigned to the picker, and issue the picking point path to a terminal carried by the picker, so that the picking point path is displayed on a display screen of the terminal.
12. An electronic device, comprising:
one or more processors;
a storage device for storing one or more programs,
the one or more programs, when executed by the one or more processors, implement the method of any of claims 1-8.
13. A computer-readable medium, on which a computer program is stored, which, when being executed by a processor, carries out the method according to any one of claims 1-8.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202010286408.5A CN113537654A (en) | 2020-04-13 | 2020-04-13 | Task allocation method, device and system |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202010286408.5A CN113537654A (en) | 2020-04-13 | 2020-04-13 | Task allocation method, device and system |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN113537654A true CN113537654A (en) | 2021-10-22 |
Family
ID=78119899
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202010286408.5A Pending CN113537654A (en) | 2020-04-13 | 2020-04-13 | Task allocation method, device and system |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN113537654A (en) |
Citations (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN109670708A (en) * | 2018-12-19 | 2019-04-23 | 中山乐心电子有限公司 | The distribution system and method for picking business of storing in a warehouse |
| US20190127146A1 (en) * | 2017-10-26 | 2019-05-02 | Hitachi Transport System, Ltd. | Rack management system and rack management method |
| CN109878959A (en) * | 2019-03-15 | 2019-06-14 | 北京旷视机器人技术有限公司 | Sort dispatching method, device, warehousing system and readable storage medium storing program for executing |
| CN110084471A (en) * | 2019-03-15 | 2019-08-02 | 北京旷视机器人技术有限公司 | Sort dispatching method, device, warehousing system and readable storage medium storing program for executing |
| CN110580593A (en) * | 2018-06-08 | 2019-12-17 | 北京京东尚科信息技术有限公司 | goods sorting method, control system and goods sorting system |
-
2020
- 2020-04-13 CN CN202010286408.5A patent/CN113537654A/en active Pending
Patent Citations (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20190127146A1 (en) * | 2017-10-26 | 2019-05-02 | Hitachi Transport System, Ltd. | Rack management system and rack management method |
| CN110580593A (en) * | 2018-06-08 | 2019-12-17 | 北京京东尚科信息技术有限公司 | goods sorting method, control system and goods sorting system |
| CN109670708A (en) * | 2018-12-19 | 2019-04-23 | 中山乐心电子有限公司 | The distribution system and method for picking business of storing in a warehouse |
| CN109878959A (en) * | 2019-03-15 | 2019-06-14 | 北京旷视机器人技术有限公司 | Sort dispatching method, device, warehousing system and readable storage medium storing program for executing |
| CN110084471A (en) * | 2019-03-15 | 2019-08-02 | 北京旷视机器人技术有限公司 | Sort dispatching method, device, warehousing system and readable storage medium storing program for executing |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN111553548B (en) | Goods picking method and device | |
| CN110348771B (en) | Method and device for order grouping of orders | |
| JP2021519735A (en) | Methods and equipment for transporting product shelves | |
| CN111507651A (en) | Order data processing method and device applied to man-machine mixed warehouse | |
| CN110889656B (en) | Warehouse rule configuration method and device | |
| CN112700180A (en) | Goods picking method and goods picking device | |
| CN110766349A (en) | Tallying method and device | |
| CN111415110A (en) | Method and device for checking goods shelf | |
| CN112101690A (en) | Article sorting method and device | |
| CN116562770A (en) | Information sequence storage method, apparatus, electronic device, and computer readable medium | |
| CN111832980A (en) | Method and device for allocating storage positions of multi-layer warehouse | |
| CN113393193A (en) | Warehouse-out method and device | |
| CN113762664A (en) | Method and device for distributing picking task and computer readable medium | |
| CN113537654A (en) | Task allocation method, device and system | |
| CN112474368B (en) | Goods picking method, device, equipment and computer readable medium | |
| CN110826752A (en) | Collection list distribution method and device | |
| CN113627837B (en) | Goods collection positioning method and device | |
| CN110826751B (en) | Method and device for picking goods | |
| CN113743847B (en) | Rechecking method, device and system | |
| CN115390958A (en) | Task processing method and device | |
| CN113689140A (en) | Method and device for task scheduling | |
| CN116629495A (en) | Method and device for outputting information | |
| CN112486033A (en) | Simulation test method and device for equipment | |
| CN112529346A (en) | Task allocation method and device | |
| CN113778024A (en) | Method and device for scheduling equipment, electronic equipment and storage medium |
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 |