CN113120498A

CN113120498A - Roadway goods picking management method and device

Info

Publication number: CN113120498A
Application number: CN202010042448.5A
Authority: CN
Inventors: 何宽
Original assignee: Beijing Jingbangda Trade Co Ltd; Beijing Jingdong Zhenshi Information Technology Co Ltd
Current assignee: Beijing Jingbangda Trade Co Ltd; Beijing Jingdong Zhenshi Information Technology Co Ltd
Priority date: 2020-01-15
Filing date: 2020-01-15
Publication date: 2021-07-16
Anticipated expiration: 2040-01-15
Also published as: CN113120498B

Abstract

The invention discloses a roadway goods picking management method and device, and relates to the technical field of computers. One embodiment of the method comprises: acquiring a time interval between a current time point and a current picking order cutoff time point, and acquiring a task to be picked corresponding to a tunnel in the time interval by taking the tunnel as a dimension; determining the identification of the articles in each task to be picked, acquiring the picking quantity of each article, and combining the picking duration of a single article to obtain the total picking duration of all articles; and taking the ratio of the total picking time length to the time interval as the crowdedness of the tunnel, and triggering the alarm reminding of the crowdedness of the tunnel if the crowdedness exceeds a preset crowdedness range. According to the implementation mode, the distribution of the picking tasks in the roadway is timely regulated and controlled by calculating the congestion degree of the roadway in the current time period, so that the smoothness of the roadway is ensured, the situation that picking personnel start picking after waiting for the completion of picking of other picking personnel is avoided, the picking efficiency is improved, and the order processing speed is increased.

Description

Roadway goods picking management method and device

Technical Field

The invention relates to the field of warehouse logistics, in particular to a roadway goods picking management method and device.

Background

With the rapid development of electronic commerce and the gradual popularization of online shopping, the daily processing order quantity of an e-commerce website warehouse is increased, and the production pressure is higher. When picking up goods in the warehouse, the picking up personnel need to pull the picking up vehicle to shuttle among different roadways, so that the blocking phenomenon is easy to generate.

At present, a camera is mainly used for collecting tunnel images, and the number of operators in a fixed area is identified according to a face or feature identification result, so that the tunnel congestion degree is calculated; and if the crowdedness is too high, the placement of the goods shelves in the warehouse is re-planned, and the width of the roadway is expanded.

In the process of implementing the invention, the inventor finds that the prior art has at least the following problems:

the widening of the tunnel wastes warehouse resources, reduces the volume ratio of the warehouse, further needs to expand more warehouse stored articles, and increases the storage cost; for the goods picking personnel, the goods picking travel distance is increased, and the goods picking difficulty is improved. And the degree of congestion of the roadway can only be calculated in real time, but prediction cannot be carried out, and the goods picking personnel are guided to produce.

Disclosure of Invention

In view of this, embodiments of the present invention provide a method and an apparatus for picking and managing a roadway, which can at least solve the problem of low computation efficiency due to roadway congestion in the prior art.

To achieve the above object, according to an aspect of an embodiment of the present invention, there is provided a lane picking management method, including:

acquiring a time interval between a current time point and a current picking order cutoff time point, and acquiring a task to be picked corresponding to a roadway in the time interval by taking the roadway as a dimension;

determining the identification of the articles in each task to be picked, acquiring the picking quantity of each article, and combining the picking duration of a single article to obtain the total picking duration of all articles;

and taking the ratio of the total picking time length to the time interval as the crowdedness of the roadway, and triggering the crowdedness alarm reminding of the roadway if the crowdedness exceeds a preset crowdedness range.

Optionally, before the obtaining of the task to be picked corresponding to the lane in the time interval, the method includes: and determining a storage position adjacent to the roadway according to the serial number of the roadway, and taking the task to be picked corresponding to the storage position in the current picking order as the task to be picked corresponding to the roadway.

Optionally, before the task to be picked corresponding to the storage location in the current picking order is used as the task to be picked corresponding to the lane, the method further includes:

receiving an order, acquiring the identification and the demand of an article in the order, determining a storage position corresponding to the identification, and extracting the storage position of which the stock is greater than or equal to the demand from the storage position;

and generating a task to be picked based on the identification and the demand quantity of the articles, the serial numbers of the extracted storage positions and the serial numbers of the roadways where the storage positions are located.

Optionally, if the congestion degree exceeds the predetermined congestion degree range, before triggering a warning to the congestion degree of the roadway, the method further includes:

determining a thermal interval where the crowding degree is located, obtaining a color corresponding to the thermal interval, and performing color marking on the roadway in a warehouse map based on the color;

and if the color is the preset color, triggering the alarm reminding of the crowdedness of the roadway.

Optionally, if the congestion degree exceeds the predetermined congestion degree range, after triggering the warning and reminding of the congestion degree of the roadway, the method further includes:

calculating the sorting quantity which can be processed in the time interval based on the time interval and the sorting duration of the single item, and combining the sorting quantity of each item to obtain the sorting quantity to be adjusted;

sorting the articles according to the processing stop time point, and accumulating the picking amount from the article with the largest processing stop time point until the accumulation result is the picking amount to be adjusted;

and adding the accumulated articles into a to-be-adjusted picking task, and further adding the to-be-adjusted picking task into the next picking order for processing.

To achieve the above object, according to another aspect of the embodiments of the present invention, there is provided a lane picking management device including:

the task acquisition module is used for acquiring a time interval between a current time point and a current picking order cutoff time point and acquiring a task to be picked corresponding to a roadway in the time interval by taking the roadway as a dimension;

the time length determining module is used for determining the identification of the articles in each task to be picked, acquiring the picking quantity of each article, and combining the picking time length of a single article to obtain the total picking time length of all articles;

and the congestion degree reminding module is used for taking the ratio of the total picking time length to the time interval as the congestion degree of the tunnel, and triggering the warning reminding of the congestion degree of the tunnel if the congestion degree exceeds a preset congestion degree range.

Optionally, the task obtaining module is configured to: and determining a storage position adjacent to the roadway according to the serial number of the roadway, and taking the task to be picked corresponding to the storage position in the current picking order as the task to be picked corresponding to the roadway.

Optionally, the task obtaining module is configured to:

Optionally, the congestion degree reminding module is further configured to:

Optionally, the system further includes a task backward moving module, configured to:

To achieve the above objects, according to still another aspect of embodiments of the present invention, there is provided an electronic device for picking up goods in a roadway.

The electronic device of the embodiment of the invention comprises: one or more processors; a storage device for storing one or more programs which, when executed by the one or more processors, cause the one or more processors to implement any of the above-described lane picking management methods.

To achieve the above object, according to a further aspect of the embodiments of the present invention, there is provided a computer readable medium, on which a computer program is stored, the program, when executed by a processor, implementing any one of the above-mentioned lane picking management methods.

According to the scheme provided by the invention, one embodiment of the invention has the following advantages or beneficial effects: by calculating the congestion degree of the tunnel in the current time period, the distribution of the picking tasks in the tunnel is regulated and controlled in time, the smoothness of the tunnel is ensured, and the situation that picking personnel start picking after waiting for the completion of picking of other picking personnel is avoided, so that the picking efficiency is improved, and the order processing speed is increased.

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 main flow chart of a roadway picking management method according to an embodiment of the invention;

FIG. 2 is a thermodynamic schematic of roadway congestion;

fig. 3 is a schematic flow diagram of an alternative roadway pick-up management method according to an embodiment of the present invention;

fig. 4 is a schematic diagram of the main modules of a roadway pick-up management device according to an embodiment of the 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 with a mobile device or server implementing 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.

Referring to fig. 1, a main flowchart of a roadway picking management method provided by an embodiment of the present invention is shown, including the following steps:

s101: acquiring a time interval between a current time point and a current picking order cutoff time point, and acquiring a task to be picked corresponding to a roadway in the time interval by taking the roadway as a dimension;

s102: determining the identification of the articles in each task to be picked, acquiring the picking quantity of each article, and combining the picking duration of a single article to obtain the total picking duration of all articles;

s103: and taking the ratio of the total picking time length to the time interval as the crowdedness of the roadway, and triggering the crowdedness alarm reminding of the roadway if the crowdedness exceeds a preset crowdedness range.

In the above embodiment, in step S101, the lanes are numbered in advance, for example, 001 and 002. The tunnel congestion degree processing mainly uses the tunnel as a dimension to carry out independent processing.

The lanes are usually arranged between shelves, and if there are three rows of shelves, there are two lanes, but only one lane has one side shelf. In addition, U-shaped shelves can be arranged, and the shelf adjacent to the roadway needs to comprise a U-shaped bottom. Therefore, the correspondence between the lanes and the shelves may be one-to-one, one-to-two, or one-to-three.

The goods shelf is provided with a storage position, and the goods are stored in the storage position. The picking is carried out from the storage position, and the picking task corresponding to the storage position is the picking task of the roadway associated with the storage position. For example, a storage position 1 and a storage position 2 are adjacent to the lane 001, and the storage positions correspond to the picking tasks a and B, respectively, and the to-be-picked tasks corresponding to the lane 001 are the task a and the task B. When one task is processed, the selected task is marked as a picked task, and the rest tasks are to-be-picked tasks.

The order picking task is mainly processed by the order, for example, the order 1 comprises the order picking tasks 1-10, and the order 2 comprises the order picking tasks 11-20. For the same area (e.g. bin, warehouse), only one wave is processed at a time, and processing is stopped only when the wave processing reaches the cutoff time point.

Assume that the time interval from the current time point to the current wave cut-off time is t minutes, for example, the processing time period of the current wave is 7:00-8:00, the current time point is 7:10, and the time interval from the cut-off time point 8:00 is 50 minutes.

For lane 001, A, B, C are allocated, only task C is processed between 7:00-7:10, since the pending tasks for lane 001 can be determined to be a and B within the time interval.

For step S102, it is assumed that the demand amount for item 1 in task a is n1 and the demand amount for item 2 in task B is n2 (in actual operation, one task may include a plurality of items).

The average picking time of the operator for picking one article is x minutes, and the total picking time of the roadway 001 after the task A and the task B are processed is as follows: (n1+ n2) x.

For step S103, a ratio of the total picking time length to the time interval is calculated, so as to calculate the congestion degree of the lane 001:

thermal intervals are defined in advance for different crowdedness, for example (here only an example):

[0, 0.5] Green represents the heating power

(0.5, 0.8] yellow for thermal power

(0.8, +) Red indicates heat

And matching the thermal intervals according to the obtained tunnel congestion degree, and rendering the tunnel in a warehouse map (or a tunnel map) by using a corresponding color so as to monitor the current task processing condition of each tunnel, for example, as shown in fig. 2, the tunnel is clear, slightly congested and heavily congested respectively.

When the roadway congestion degree is in the heavy congestion degree interval, the corresponding color is also presented as an early warning color. The background management can check the roadway congestion degree heating power through a warehouse map page and adaptively adjust tasks.

In addition, the method can also be directly adjusted according to the congestion degree of the roadway, when the congestion degree of the roadway exceeds a preset congestion degree range, the method directly triggers the alarm of the congestion degree of the roadway, and simultaneously can record a data format: roadway number, number of tasks to be picked and degree of crowding.

It should be noted that the processing of the picking task in the warehouse is not immediate, and generally the picking task is produced according to a wave order, for example, 7:00-8:00 waves, and a cycle task, the calculation is triggered before the production, the next calculation is started after each calculation is completed, and a time interval may be set between the two calculations or not, specifically according to the setting of the staff.

For example, the first calculation is 7:05 start, the calculation takes 5 minutes and ends at 7: 10. If there is no time interval, the next calculation is started from 7: 10. However, if a time interval is set, such as 10 minutes, the next calculation begins at 7: 20. But the calculated time periods are all within the current time period of the wave.

According to the method provided by the embodiment, the channel crowding degree in the time from the current time to the wave cut-off time is calculated by taking the picking wave number and the channel as dimensions, and background management personnel can visually feel the channel crowding degree through thermal color marking in a warehouse map so as to visually check the task processing condition of each channel and facilitate subsequent task allocation processing.

Referring to fig. 3, a schematic flow chart of an alternative roadway picking management method according to an embodiment of the present invention is shown, including the following steps:

s301: acquiring a time interval between a current time point and a current picking order cutoff time point, and acquiring a task to be picked corresponding to a roadway in the time interval by taking the roadway as a dimension;

s302: determining the identification of the articles in each task to be picked, acquiring the picking quantity of each article, and combining the picking duration of a single article to obtain the total picking duration of all articles;

s303: taking the ratio of the total picking time length to the time interval as the crowdedness of the roadway, and triggering the crowdedness alarm reminding of the roadway if the crowdedness exceeds a preset crowdedness range;

s304: calculating the sorting quantity which can be processed in the time interval based on the time interval and the sorting duration of the single item, and combining the sorting quantity of each item to obtain the sorting quantity to be adjusted;

s305: sorting the articles according to the processing stop time point, and accumulating the picking amount from the article with the largest processing stop time point until the accumulation result is the picking amount to be adjusted;

s306: and adding the accumulated articles into a to-be-adjusted picking task, and further adding the to-be-adjusted picking task into the next picking order for processing.

In the above embodiment, in steps S301 to S303, the production flow of the order in the warehouse needs to be managed: initialization, positioning (positioning the storage position of an item according to the item required by an order), task allocation, picking, rechecking, packaging and shipping.

The initialization may be regarded as preprocessing of order data to extract information required for picking up the order as data support for the production of the order in the warehouse. For example, order identification, item identification and demand are mainly considered in the picking process, and sensitive information such as customer address/telephone is not considered. Therefore, although the order data sent to the warehouse upstream is a complete data, after the initialization process, only the data required by the next node is transmitted to the next node.

The positioning node is used for positioning the area where the article is located and the storage position, the storage position can be one or more, for example, the required quantity of the article 1 is 100, while the existing storage position with the stock quantity greater than or equal to 100 does not exist, and the stock quantities of at least two storage positions need to be accumulated for supply. Assuming that the warehouse is a map, the positioning function is to find the coordinates of the object.

Additionally, after locating the node, a pick order form may be generated based on the order information (e.g., identification) and the location information (including item identification and bin number). The order picking task list comprises the processes passed by the order picking, and the required items in the task list are picked according to the process sequence.

After the picking task list is generated, the picking task list can be stored in a picking task pool, and the picking task list comprises storage position codes and picking task numbers, wherein one storage position possibly corresponds to a plurality of picking tasks, and the storage position codes and the picking tasks form a group of 1: and N is obtained.

For step S304, for the lane with the penalty degree alarm prompt, the worker may adjust part of the tasks in the current pass, for example, to the next pass, so as to relieve the picking pressure of the current pass.

Also for example, 7:00-8:00 wave times, with the current time point of 7:10, the amount of picking that can be handled within the time interval (50 minutes) is calculated, and 100 picking items can be picked assuming a picking time period of 30s for a single item.

For lane 001, the demand of item 1 in task a is n 1-60, and the demand of item 2 in task B is n 2-60, and the total is 120 pieces, that is, 20 remaining current cycles may not be processed, and need to be adjusted to the next cycle.

For step S305, as an example, assuming that the processing deadline time point of the item 1 is 8:30 and the processing deadline time point of the item 2 is 9:00, the picking amount is accumulated from the item 2, and the "picking 20 items 2" is taken as the picking task to be adjusted.

It should be noted that, in an actual operation, a task may include a plurality of items, and if the maximum item picking amount at the processing deadline is smaller than the picking amount to be adjusted, the second item accumulation is arranged from the processing deadline until the accumulated value is the picking amount position to be adjusted. For example, the cumulative amount of articles 2 and 3 is 20.

Through the above operation, for an article whose processing deadline is later, the processing can be delayed to avoid a delayed processing situation of an article whose processing deadline is adjacent.

For step S306, the determined picking task to be adjusted may be added to the next wave for processing, so as to alleviate the current blocking condition of the tunnel.

In addition to the situation that the current task of the next wave moves backward, the task of the next wave can also be moved, for example, for the unblocked lane in fig. 2, the corresponding task can be allocated to the corresponding lane in advance for processing, so that the processing situation of the picking task in the lane is improved, and the problem that the lane is idle but still needs to wait for the completion of the wave is avoided.

According to the method provided by the embodiment, the distribution of the picking tasks in the tunnel is timely regulated and controlled (for example, the current wave task is distributed to the next wave or the next wave task is preposed) by calculating the congestion degree of the tunnel in the current wave time period, so that the smoothness of the tunnel is ensured, and the situation that the picking personnel start picking after waiting for the completion of picking by other picking personnel is avoided, so that the picking efficiency is improved, and the order processing speed is increased; and data calculation is only carried out on a software level, and compared with image recognition, the method has the advantages of less consumed server resources and human resource cost and low cost.

Referring to fig. 4, a schematic diagram of main modules of a roadway picking management device 400 provided by an embodiment of the present invention is shown, including:

the task obtaining module 401 is configured to obtain a time interval between a current time point and a current picking order cutoff time point, and obtain a task to be picked corresponding to a roadway in the time interval by using the roadway as a dimension;

a duration determining module 402, configured to determine identifiers of the items in each task to be picked, obtain a picking amount of each item, and obtain a total picking duration of all the items by combining the picking durations of the individual items;

a congestion degree reminding module 403, configured to use a ratio of the total picking time to the time interval as a congestion degree of the lane, and trigger a warning to the congestion degree of the lane if the congestion degree exceeds a predetermined congestion degree range.

In the implementation apparatus of the present invention, the task obtaining module 401 is configured to: and determining a storage position adjacent to the roadway according to the serial number of the roadway, and taking the task to be picked corresponding to the storage position in the current picking order as the task to be picked corresponding to the roadway.

In the implementation apparatus of the present invention, the task obtaining module 401 is configured to:

In the implementation apparatus of the present invention, the congestion degree reminding module 403 is further configured to:

The device for implementing the present invention further includes a task backward module 406 (not shown in the figure) for:

In addition, the detailed implementation of the device in the embodiment of the present invention has been described in detail in the above method, so that the repeated description is not repeated here.

Fig. 5 illustrates an exemplary system architecture 500 to which embodiments of the 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 (by way of example only). 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. Various communication client applications may be installed on the

terminal devices

501, 502, 503.

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.

It should be noted that the method provided by the embodiment of the present invention is generally executed by the server 505, and accordingly, the apparatus is generally disposed in the server 505.

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 RAM 603, various programs and data necessary for the operation of the system 600 are also stored. The CPU 601, ROM 602, and RAM 603 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 product 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 program products 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 comprises a task obtaining module, a duration determining module and a congestion degree reminding module. The names of the modules do not constitute a limitation to the modules themselves in some cases, for example, the congestion degree reminding module may also be described as a "lane congestion degree determination module".

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, cause the device to comprise:

According to the technical scheme of the embodiment of the invention, the distribution of the picking tasks in the tunnel is timely regulated and controlled by calculating the congestion degree of the tunnel in the current time period, so that the smoothness of the tunnel is ensured, and the situation that picking personnel start picking after waiting for the completion of picking of other picking personnel is avoided, thereby improving the picking efficiency and accelerating the order processing speed.

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

1. A roadway pick-up management method is characterized by comprising the following steps:

2. The method according to claim 1, characterized in that before said acquiring the task to be picked corresponding to said lane within said time interval, it comprises: and determining a storage position adjacent to the roadway according to the serial number of the roadway, and taking the task to be picked corresponding to the storage position in the current picking order as the task to be picked corresponding to the roadway.

3. The method of claim 2, further comprising, prior to designating the task to be picked corresponding to the bin in the current pick order as the task to be picked corresponding to the lane:

4. The method of claim 1, wherein before triggering a warning prompt for the degree of congestion of the roadway if the degree of congestion exceeds a predetermined degree of congestion range, the method further comprises:

5. The method according to claim 1 or 4, wherein after triggering a warning prompt for the degree of congestion of the roadway if the degree of congestion exceeds a predetermined degree of congestion range, the method further comprises:

6. A roadway pick-up management device, comprising:

7. An electronic device, comprising:

one or more processors;

a storage device for storing one or more programs,

when executed by the one or more processors, cause the one or more processors to implement the method of any one of claims 1-5.

8. 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-5.