CN112520282B

CN112520282B - Dispatching method and device for goods to be transported

Info

Publication number: CN112520282B
Application number: CN201910881268.3A
Authority: CN
Inventors: 付小龙
Original assignee: Beijing Jingdong Qianshi Technology Co Ltd
Current assignee: Beijing Jingdong Qianshi Technology Co Ltd
Priority date: 2019-09-18
Filing date: 2019-09-18
Publication date: 2022-11-08
Anticipated expiration: 2039-09-18
Also published as: CN112520282A

Abstract

The invention discloses a dispatching method and a dispatching device for goods to be transported, and relates to the technical field of warehouse logistics. One embodiment of the method comprises: setting a transfer point for each goods placing area; determining an available goods placing area and a corresponding transit point according to the received carrying task; when a plurality of available goods placing areas exist, selecting the goods placing area with the largest idleness from the available goods placing areas as a target goods placing area, and taking a transfer point corresponding to the target goods placing area as a target transfer point; pre-occupying available stocking points in a target stocking area; when the carrying trolley runs to the target transfer point, the target stocking point is selected from the available stocking points in the target stocking area, and the information of the target stocking point is sent to the carrying trolley to complete the carrying task. This embodiment can avoid the point of putting goods that blocks automatically, chooses the most reasonable point of putting goods to the goods quantity in every area of putting goods of control keeps the equilibrium, improves the utilization ratio and the handling efficiency of the point of putting goods, has reduced handling cost.

Description

Dispatching method and device for goods to be transported

Technical Field

The invention relates to the technical field of computers, in particular to a dispatching method and a dispatching device for goods transportation.

Background

Automatic goods transferring can be carried out by adopting an unmanned forklift AGV in a modern logistics warehouse, and a transferring task is triggered by detecting whether goods exist or not through an infrared light sensor (namely, the infrared light sensor is positioned on each goods placing point, and the sensor can transmit detected signals to vehicles in real time). Since the control of an upstream business system is eliminated, unified monitoring and management of the goods placing position and the goods taking position are lacked. Therefore, the dispatching system of the AGV forklift is required to accurately monitor and manage the goods position, so that the goods can be accurately and reasonably placed on the goods position, and the efficient recycling of the goods position is guaranteed.

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

(1) Because a plurality of goods placing points are arranged in the goods placing area and are arranged in sequence, fences are arranged on two sides of the goods placing points on the same straight line, and the goods can reach the back goods placing points only by passing through the front goods placing points. For example, the a, b and c stock release points are on the same straight line, if the a stock release point is in an occupied state, the b and c stock release points are changed into an idle state due to manual cleaning; because rely on infrared light sensor response goods alone, unmanned fork truck AGV can think b, c put the goods and can put the goods, consequently can go to put the goods, will be blockked by the goods of a put the goods and put the goods point this moment, can't reach b, c and put the goods and put the point.

(2) Because the actual distance of the warehouse between the picking area and the stocking area is longer, when the unmanned forklift AGV just picks the goods, the stocking area may have idle stocking points, but in the process of the forklift AGV walking, the stocking points are occupied by human or uncontrollable factors, and the goods can not be delivered to the stocking points.

Disclosure of Invention

In view of this, embodiments of the present invention provide a method and an apparatus for scheduling delivered goods, which can automatically avoid blocked stocking points, select the most reasonable stocking point, control the number of goods in each stocking area to be balanced, improve the utilization rate and the handling efficiency of the stocking points, and reduce the handling cost.

To achieve the above object, according to an aspect of an embodiment of the present invention, there is provided a scheduling method for delivering goods, including:

setting a transfer point for each goods placing area;

determining an available goods placing area and a corresponding transit point according to the received carrying task;

when the number of the available goods placing areas is multiple, selecting the goods placing area with the maximum idleness from the multiple available goods placing areas as a target goods placing area, and taking a transfer point corresponding to the target goods placing area as a target transfer point;

pre-occupying available stocking points in the target stocking area;

and when the carrying trolley runs to the target transfer point, selecting a target stocking point from the available stocking points in the target stocking area, and sending the information of the target stocking point to the carrying trolley to complete a carrying task.

Optionally, the method further comprises: and when the number of the available goods placing areas is only one, taking the available goods placing areas as target goods placing areas.

Optionally, selecting a stocking area with the largest vacancy as the target stocking area from the plurality of available stocking areas comprises:

determining the number of effective available put points in each available put area according to the number of the available put points in each available put area and the number of pre-occupied put points;

determining the proportion of the available stocking points according to the number of the effective available stocking points and the number of the total stocking points, and taking the proportion of the available stocking points as the vacancy degree of the stocking area;

and taking the goods placing area with the maximum vacancy as a target goods placing area.

Optionally, the method further comprises: numbering the goods placing points in the goods placing area from small to large according to the direction perpendicular to the goods placing direction from the deepest place of the goods placing;

selecting a target put point from the available put points for the target put area includes: and selecting the available put point with the smallest number from the target put area as the target put point.

To achieve the above object, according to another aspect of an embodiment of the present invention, there is provided a scheduling apparatus for delivering goods, including:

the transfer point setting module is used for setting a transfer point for each goods placing area;

the target determining module is used for determining an available goods placing area and a corresponding transfer point according to the received carrying task; when the number of the available stocking areas is multiple, selecting a stocking area with the largest vacancy degree from the multiple available stocking areas as a target stocking area, and taking a transfer point corresponding to the target stocking area as a target transfer point;

the pre-occupying module is used for pre-occupying available stocking points in the target stocking area;

and the selection module is used for selecting a target stocking point from the available stocking points in the target stocking area when the carrying trolley runs to the target transfer point, and sending the information of the target stocking point to the carrying trolley so as to finish a carrying task.

Optionally, the goal determining module is further configured to: when the number of the available putting areas is only one, the available putting areas are used as target putting areas.

Optionally, the goal determination module is further configured to:

determining the proportion of the available stocking points according to the number of the effective available stocking points and the number of the total stocking points, and taking the proportion of the available stocking points as the vacancy degree of a stocking area;

Optionally, the device further comprises a numbering module, configured to number the stocking points in the stocking area from small to large in a direction perpendicular to the stocking direction from the deepest stocking location;

the selection module is further configured to: and selecting the available put point with the smallest number from the target put area as the target put point.

To achieve the above object, according to still another aspect of an embodiment of the present invention, there is provided an electronic apparatus including: 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 the method for scheduling delivery of goods of an embodiment of the present invention.

To achieve the above object, according to still another 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 the scheduling method for delivering goods of the embodiments of the present invention.

One embodiment of the above invention has the following advantages or benefits: because the transfer point is set for each goods placing area; determining an available goods placing area and a corresponding transit point according to the received carrying task; when the number of the available goods placing areas is multiple, selecting the goods placing area with the maximum idleness from the multiple available goods placing areas as a target goods placing area, and taking a transfer point corresponding to the target goods placing area as a target transfer point; pre-occupying available put points in the target put area; when the carrying trolley runs to the target transfer point, a target stocking point is selected from available stocking points in the target stocking area, and information of the target stocking point is sent to the carrying trolley to complete a carrying task.

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 method of scheduling delivery of a cargo according to an embodiment of the present invention;

FIG. 2 is a schematic illustration of a sub-flow of a method of scheduling delivery of a shipment in accordance with an embodiment of the present invention;

FIG. 3 is a schematic structural diagram of a cargo area in the dispatching method for delivering cargo according to the embodiment of the invention;

FIG. 4 is a schematic diagram of a main flow of a dispatch method for delivering cargo according to another embodiment of the present invention;

FIG. 5 is a schematic diagram of the main modules of a dispatching device for delivering goods according to an embodiment of the present invention;

FIG. 6 is an exemplary system architecture diagram in which embodiments of the present invention may be employed;

fig. 7 is a schematic block diagram of a computer system suitable for use in implementing a terminal device or server according to an embodiment of the present 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.

Fig. 1 is a schematic diagram of a main flow of a scheduling method for delivering goods according to an embodiment of the present invention, as shown in fig. 1, the method includes:

step S101: and a transfer point is arranged for each goods placing area.

In this embodiment, the transit point serves as a relay point in the delivery process of a carrying trolley (unmanned forklift AGV), and one delivery process is divided into two sections: the first section is from the picking point to the transfer point, and the second section is from the transfer point to the putting point. In an alternative embodiment, the location of the transfer point may be located at the entrance to the cargo area.

Step S102: determining an available goods placing area and a corresponding transit point according to the received carrying task; when the number of the available goods placing areas is multiple, selecting the goods placing area with the maximum vacancy degree from the multiple available goods placing areas as a target goods placing area, taking a transfer point corresponding to the target goods placing area as a target transfer point,

in this embodiment, the warehouse may be divided into a plurality of stocking areas according to an actual application scenario, and the division of the correspondence between the pickup points and the stocking areas may also be determined according to the size of the warehouse, the number of goods, and the like.

In this embodiment, after receiving the transportation task, the pick-up point is determined according to the transportation task, and then the corresponding available put area and the transit point corresponding to each available put area are queried according to the pick-up point. When there are a plurality of available putting areas, the most vacant putting area may be selected as the target putting area from among the plurality of available putting areas. The most vacant stocking area can be the stocking area with the most available stocking points or the stocking area with the highest ratio of the number of the available stocking points to the total stocking points.

As a specific example, the most free put area may be determined according to the following steps:

step S201: the number of available put points available in each available put area is determined based on the number of available put points and the number of pre-occupied put points in each available put area.

The available put points are idle put points blocked by objects, and the pre-occupied put points are put points pre-occupied by the carrying tasks assigned to the current put area but not reaching the transit points. And subtracting the number of the pre-occupied putting points from the number of the available putting points in the putting area to obtain the number of the effective available putting points in the putting area. For example, if the number of available put points is 50 and the number of pre-emptive put points is 13, then the number of available put points available in the put area is 37.

In an alternative embodiment, when the number of the available stocking areas is only one, the available stocking area is taken as the target stocking area.

Step S202: and determining the proportion of the available stocking points according to the number of the effective available stocking points and the number of the total stocking points, and taking the proportion of the available stocking points as the vacancy degree of the stocking area.

And dividing the number of the effective available stocking points in each stocking area by the number of the total stocking points in each stocking area to obtain the proportion of the available stocking points in each stocking area. For example, if the number of available put points in the put area is 37, and the number of all put points in the put area (i.e., the number of total put points) is 100, the proportion of the available put points in the put area is 37%, i.e., the vacancy of the put area is 37%.

Step S203: and taking the goods placing area with the maximum vacancy as a target goods placing area.

Step S103: pre-occupying available put points within the target put area.

And when determining a target stocking area and a target transfer point corresponding to the current carrying task, pre-occupying one of the available stocking points in the target stocking area.

Step S104: and when the carrying trolley runs to the target transfer point, selecting a target stocking point from the available stocking points in the target stocking area, and sending the information of the target stocking point to the carrying trolley to complete a carrying task.

In this embodiment, the put points in the put area may be numbered in order from small to large in a direction perpendicular to the put direction from the deepest place of the put. That is, for put points located on the same straight line, the closer to the put-zone entrance, the larger the number. And after the goods are stored at the goods placing points with larger serial numbers on the same straight line, the carrying trolley can not pass through the goods placing points with larger serial numbers to place the goods on the goods placing points with smaller serial numbers. Therefore, after the conveyance cart has traveled to the target transit point, the available put point with the smallest number in the target put area may be selected as the target put point. And then the position of the target goods release point is sent to the carrying trolley, so that the carrying trolley continues to carry out carrying tasks, and the goods are placed at the specified target goods release point.

According to the dispatching method for goods delivery, the transfer point and the available goods release points in the pre-occupied goods release area are set, the blocked goods release points can be automatically avoided, the most reasonable goods release points are selected, the number of the goods in each goods release area is controlled to be balanced, the utilization rate and the carrying efficiency of the goods release points are improved, and the carrying cost is reduced.

In order to make the dispatching method for delivering goods more clear, fig. 3 and fig. 4 are taken as an example for explanation. Fig. 3 is a schematic structural diagram of a cargo area according to another embodiment of the present invention, and fig. 4 is a schematic main flow chart of a scheduling method for delivering cargo according to an embodiment of the present invention.

As shown in fig. 3, in the present embodiment, the picking areas are divided into pick-up points No. 1, no. 2, no. 3, and No. 4. The goods putting area is divided into a goods putting area a, a goods putting area b and a goods putting area c. Wherein, the goods of No. 1, no. 2, no. 3 pick points should be transported to put goods district a and put goods district b, and the goods of No. 4 pick points should be transported to put goods district c.

As shown in fig. 4, the dispatching method for delivering goods according to the embodiment of the present invention includes the following steps:

1. and the transfer points set in the goods placing area a, the goods placing area b and the goods placing area c are respectively a transfer point 1, a transfer point 2 and a transfer point 3, the transfer points are used as relay points in the traveling process of the AGV, and one goods placing process is divided into two sections to become two-section goods placing.

2. An attribute that increases the pick-up number of pick-off points for a put area records the number of tasks that the current pick-off area has been assigned to but has not yet reached a transit point.

3. And numbering the putting points in the putting area from small to large from the deepest putting depth in a direction perpendicular to the putting direction.

4. After receiving the transport tasks generated by the picking area, the dispatching device for transporting goods firstly inquires out corresponding goods release areas (for example, the goods release area b and the goods release area c) and transfer points (the goods release area b: the transfer point 2 and the goods release area c: the transfer point 3) corresponding to the respective areas according to the goods taking points (for example, the goods taking point No. 2).

5. And respectively processing the selected stocking areas, selecting the number of all stocking points without barriers from each stocking area, and subtracting the stocking point pre-occupied number of each stocking area to obtain the number of effective available stocking points in each stocking area (stocking area b: useFulCounts _1, stocking area c: useFulCounts _ 2).

6. Dividing the number of the effective available put points in each put area by the total number of all put points in the respective put area to obtain the proportion of the available put points in each put area (put area b: present _1, put area c: present _ 2).

7. The available put proportion of each put area is compared, and the area with the largest proportion and larger than 0 is selected as the target put area (for example, if present _1 >.

8. And increasing the pre-occupied number of the goods placing points of one area for the selected target goods placing area.

9. After receiving the transfer task and reaching the transfer point (for example, transfer point 2), the AGV of the unmanned forklift requests the dispatching device for transferring the goods to assign a reasonable goods placement point.

10. The dispatching device for transporting the goods selects an available set of goods-placing points without blockage from the goods-placing area corresponding to the transfer point, selects a goods-placing point with the minimum sequence number from the set as a target goods-placing point, and deducts the pre-occupied quantity of the goods-placing points in the area of one current goods-placing area.

11. And issuing the selected stocking points to an unmanned forklift AGV, and continuing to execute a carrying task.

12. And the unmanned forklift AGV puts the goods to a target goods putting point to complete the task.

According to the dispatching method for goods delivery, provided by the embodiment of the invention, the blocked stocking points can be automatically avoided by setting the transfer points and the available stocking points in the pre-occupied stocking areas, the most reasonable stocking points are selected, the number of the goods in each stocking area is controlled to be kept balanced, the utilization rate and the carrying efficiency of the stocking points are improved, and the carrying cost is reduced.

Fig. 5 is a schematic diagram of main blocks of a scheduling device 500 for delivering goods according to an embodiment of the present invention. As shown in fig. 5, the dispatching device 500 for delivering goods includes:

a transit point setting module 501, configured to set a transit point for each stocking area;

a target determination module 502, configured to determine an available stock release area and a corresponding transit point according to the received carrying task; when the number of the available goods placing areas is multiple, selecting the goods placing area with the maximum idleness from the multiple available goods placing areas as a target goods placing area, and taking a transfer point corresponding to the target goods placing area as a target transfer point;

a pre-occupying module 503, configured to pre-occupy available stocking points in the target stocking area;

and the selection module 504 is used for selecting a target stocking point from available stocking points in the target stocking area when the carrying trolley runs to the target transit point, and sending the information of the target stocking point to the carrying trolley so as to complete a carrying task.

In an alternative embodiment, the goal determination module 502 is further configured to: when the number of the available putting areas is only one, the available putting areas are used as target putting areas.

In an alternative embodiment, the goal determining module 502 is further configured to:

In an alternative embodiment, the apparatus 500 further comprises a numbering module for numbering the put points in the put area from small to large in a direction perpendicular to the put direction from the deepest place;

the selection module 504 is further configured to: and selecting the available put point with the smallest number from the target put area as the target put point.

The device can execute the method provided by the embodiment of the invention, and has the corresponding functional modules and beneficial effects of the execution method. For technical details that are not described in detail in this embodiment, reference may be made to the method provided in the embodiment of the present invention.

Fig. 6 illustrates an exemplary system architecture 600 of a method of or apparatus for dispatching shipments to which embodiments of the present invention may be applied.

As shown in fig. 6, the system architecture 600 may include

terminal devices

601, 602, 603, a network 604, and a server 605. The network 604 serves to provide a medium for communication links between the

terminal devices

601, 602, 603 and the server 605. Network 604 may include various types of connections, such as wire, wireless communication links, or fiber optic cables, to name a few.

A user may use the

terminal devices

601, 602, 603 to interact with the server 605 via the network 604 to receive or send messages or the like. Various communication client applications, such as a shopping application, a web browser application, a search application, an instant messaging tool, a mailbox client, social platform software, and the like, may be installed on the

terminal devices

601, 602, and 603.

The

terminal devices

601, 602, 603 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 605 may be a server that provides various services, such as a background management server that supports shopping websites browsed by the user using the

terminal devices

601, 602, and 603. The background management server may analyze and perform other processing on the received data such as the product information query request, and feed back a processing result (e.g., target push information and product information) to the terminal device.

It should be noted that the dispatching method for delivering goods provided by the embodiment of the present invention is generally executed by the server 605, and accordingly, the dispatching device for delivering goods is generally disposed in the server 605.

It should be understood that the number of terminal devices, networks, and servers in fig. 6 is merely illustrative. There may be any number of terminal devices, networks, and servers, as desired for an implementation.

Referring now to FIG. 7, shown is a block diagram of a computer system 700 suitable for use with a terminal device implementing an embodiment of the present invention. The terminal device shown in fig. 7 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. 7, the computer system 700 includes a Central Processing Unit (CPU) 701, which can perform various appropriate actions and processes in accordance with a program stored in a Read Only Memory (ROM) 702 or a program loaded from a storage section 708 into a Random Access Memory (RAM) 703. In the RAM 703, various programs and data necessary for the operation of the system 700 are also stored. The CPU 701, the ROM 702, and the RAM 703 are connected to each other via a bus 704. An input/output (I/O) interface 705 is also connected to bus 704.

The following components are connected to the I/O interface 705: an input portion 706 including a keyboard, a mouse, and the like; an output section 707 including a display such as a Cathode Ray Tube (CRT), a Liquid Crystal Display (LCD), and the like, and a speaker; a storage section 708 including a hard disk and the like; and a communication section 709 including a network interface card such as a LAN card, a modem, or the like. The communication section 709 performs communication processing via a network such as the internet. A drive 710 is also connected to the I/O interface 705 as needed. A removable medium 711 such as a magnetic disk, an optical disk, a magneto-optical disk, a semiconductor memory, or the like is mounted on the drive 710 as necessary, so that a computer program read out therefrom is mounted into the storage section 708 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 by the flow chart. In such an embodiment, the computer program can be downloaded and installed from a network through the communication section 709, and/or installed from the removable medium 711. The computer program performs the above-described functions defined in the system of the present invention when executed by the Central Processing Unit (CPU) 701.

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 context of 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 includes a sending module, an obtaining module, a determining module, and a first processing module. The names of these modules do not in some cases constitute a limitation on the unit itself, and for example, the sending module may also be described as a "module that sends a picture acquisition request to a connected server".

As another aspect, the present invention also provides a computer-readable medium, which 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:

setting a transfer point for each goods placing area;

pre-occupying available put points in the target put area;

when the carrying trolley runs to the target transfer point, selecting a target stocking point from available stocking points in a target stocking area, and sending the information of the target stocking point to the carrying trolley to finish a carrying task

According to the technical scheme of the embodiment of the invention, the blocking stocking points can be automatically avoided by setting the transfer points and the available stocking points in the pre-occupied stocking areas, the most reasonable stocking points are selected, the quantity of goods in each stocking area is controlled to be balanced, the utilization rate and the carrying efficiency of the stocking points are improved, and the carrying cost is reduced.

The above-described embodiments should not be construed as limiting the scope of the invention. It should be understood by those skilled in the art that various modifications, combinations, sub-combinations and substitutions may 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 method of scheduling delivery of goods, comprising:

setting a transfer point for each goods placing area;

pre-occupying available put points in the target put area;

2. The method of claim 1, further comprising:

when the number of the available putting areas is only one, the available putting areas are used as target putting areas.

3. The method of claim 1, wherein selecting a put area with the greatest idleness from a plurality of available put areas as a target put area comprises:

4. The method of claim 1, further comprising:

numbering the goods placing points in the goods placing area from small to large according to the direction perpendicular to the goods placing direction from the deepest place of the goods placing;

selecting a target put point from the available put points for the target put area includes:

and selecting the available put point with the smallest number from the target put area as the target put point.

5. A dispatching device for transporting cargo, comprising:

the target determining module is used for determining an available goods placing area and a corresponding transit point according to the received carrying task; when the number of the available stocking areas is multiple, selecting a stocking area with the largest vacancy degree from the multiple available stocking areas as a target stocking area, and taking a transfer point corresponding to the target stocking area as a target transfer point;

and the selection module is used for selecting a target stocking point from the available stocking points in the target stocking area when the carrying trolley runs to the target transit point, and sending the information of the target stocking point to the carrying trolley so as to finish the carrying task.

6. The apparatus of claim 5, wherein the targeting module is further configured to:

and when the number of the available goods placing areas is only one, taking the available goods placing areas as target goods placing areas.

7. The apparatus of claim 5, wherein the targeting module is further configured to:

8. The apparatus of claim 5, further comprising a numbering module for numbering the put points in the put area in order of size from the deepest place of the put perpendicular to the direction of the put;

9. 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-4.

10. 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-4.