Robot queuing method, robot and computer-readable storage medium

By setting up a queue area in the warehouse, the robot queues before reaching the target point and adjusts the motion mode according to the occupation status, the problem of inefficient picking caused by competition from multiple robots is solved and the picking efficiency is improved.

CN112099491BActive Publication Date: 2024-11-01DJANGO ROBOTICS SHANGHAI CO LTD
View PDF 0 Cites 0 Cited by

Patent Information

Application Number
CN202010842790.3
Authority / Receiving Office
CN · China
Patent Type
Patents(China)
Current Assignee / Owner
Filing Date
2020-08-20
Publication Date
2024-11-01
Estimated Expiration
2040-08-20

AI Technical Summary

Technical Problem

In large warehouses, multiple robots are prone to congestion when competing for the same target point, resulting in reduced picking efficiency.

Method used

Set up a queue area near the target point, so that the robot queues in the queue area before reaching the target point, and switches the driving mode according to the occupied state of the target point or maintains a preset distance to move to the robot ahead.

Benefits of technology

It effectively reduces the waiting time of the robot when competing for the same target point and improves picking efficiency.

✦ Generated by Eureka AI based on patent content.

Smart Images

  • Figure CN112099491B_ABST
    Figure CN112099491B_ABST
Patent Text Reader

Abstract

The embodiment of the present application provides a robot queuing method, a robot and a computer-readable storage medium, wherein the queuing method is applied to the robot, including: when detecting that the robot reaches the queuing area corresponding to the target point, switching the driving mode to the queuing mode; detecting whether the target point is occupied; if the target point is not occupied, advancing along the queuing area in the queuing mode to reach the target point and occupying the target point; if the target point is occupied, advancing along the queuing area in the queuing mode while maintaining a preset distance range with the robot adjacent to the front. By setting a queuing area near the target point, the embodiment of the present application can reduce the waiting time of the robot when competing for the same target point, and effectively improve the efficiency of picking.
Need to check novelty before this filing date? Find Prior Art

Description

Technical Field

[0001] The present application relates to the field of robot technology, and in particular to a robot queuing method in a warehousing system, a robot, and a computer-readable storage medium. Background Art

[0002] In a large warehouse, various types of goods in a commodity order are stored in various partitions of the warehouse and are scattered among a large number of other commodities. If the goods in the commodity order are picked only by pickers, the pickers are required to walk a lot. As the pickers work for a long time, there is a problem of low picking efficiency.

[0003] In order to improve picking efficiency, robots are used to replace the walking of pickers and travel between various partitions of the warehouse. Pickers only need to take the goods from the shelves and place them in the turnover boxes on the robots. Humans and machines work together to complete the picking of goods in the order.

[0004] When multiple robots are performing the picking of commodity orders in the warehouse, there will be competition for resources, that is, multiple robots go to the same destination at the same time, and there may even be robot congestion in some areas while there are no robots in other areas. If multiple robots go to the same destination one by one, the time for picking commodity orders will be extended, which will eventually lead to reduced picking efficiency. Summary of the invention

[0005] The embodiments of the present application provide a robot queuing method, a robot and a computer-readable storage medium. By setting a queuing area near a target point, the waiting time of the robots when competing for the same target point can be reduced, thereby effectively improving the efficiency of picking.

[0006] In a first aspect, a robot queuing method is provided, wherein the queuing method is applied to a robot and comprises:

[0007] When it is detected that the robot reaches the queuing area corresponding to the target point, the driving mode is switched to the queuing mode;

[0008] Detecting whether the target point is occupied;

[0009] If the target point is not occupied, proceed along the queuing area in the queuing mode to reach the target point and occupy the target point;

[0010] If the target point is occupied, the robot moves along the queuing area in the queuing mode while maintaining a preset distance range with the robot adjacent to the front.

[0011] A second aspect provides a robot, comprising:

[0012] A processing module, configured to switch the driving mode to the queuing mode when detecting that the robot has reached a queuing area corresponding to a target point; and to detect whether the target point is occupied;

[0013] The execution module is used for, according to the detection result of the processing module, when the target point is not occupied, advancing along the queuing area in the queuing mode to reach the target point and occupy the target point; when the target point is occupied, advancing along the queuing area in the queuing mode while maintaining a preset distance range with the robot adjacent to the front.

[0014] According to a third aspect, a robot is provided, comprising a processor, a communication interface, a memory and a communication bus; wherein the processor, the communication interface and the memory communicate with each other via a bus; the memory is used to store computer programs; and the processor is used to execute the programs stored in the memory to implement the robot queuing method as described in the first aspect.

[0015] According to a fourth aspect, a computer-readable storage medium is provided, on which a computer program is stored. When the computer program is executed by a processor, the robot queuing method according to the first aspect is implemented.

[0016] Based on the robot queuing method, robot and computer-readable storage medium provided in the embodiments of the present application, when it is detected that the robot has arrived at the queuing area corresponding to the target point, the driving mode is switched to the queuing mode, and it is detected whether the target point is occupied. If the target point is not occupied, the robot advances along the queuing area in a queuing mode to reach the target point and occupies the target point. If the target point is occupied, the robot advances along the queuing area in a queuing mode while maintaining a preset distance range with the robot adjacent to the front. The queuing area set according to the area where congestion occurs is used to make the robot queue in the queuing area before reaching the target point, and the robot reaches the target point in turn through the queuing area, which can reduce the waiting time of the robot when competing for the same target point, and effectively improve the efficiency of picking. BRIEF DESCRIPTION OF THE DRAWINGS

[0017] In order to more clearly illustrate one or more embodiments of the present application or the technical solutions in the prior art, the drawings required for use in the embodiments or the description of the prior art will be briefly introduced below. Obviously, the drawings described below are only some embodiments recorded in the present application. For ordinary technicians in this field, other drawings can be obtained based on these drawings without paying creative labor.

[0018] Figure 1 A flowchart of an implementation method of the robot queuing method of an embodiment of the present application;

[0019] Figure 2 A flowchart of an implementation method of the queuing mode of an embodiment of the present application;

[0020] Figure 3 A flowchart of another implementation of the robot queuing method according to an embodiment of the present application;

[0021] Figure 4 A flowchart of another implementation of the robot queuing method according to an embodiment of the present application;

[0022] Figure 5A A schematic diagram of setting a queuing area in a warehouse according to an embodiment of the present application;

[0023] Figure 5B A schematic diagram for illustrating the robot queuing in a queuing area according to an embodiment of the present application;

[0024] Figure 6 A schematic diagram of the structure of a robot according to an embodiment of the present application;

[0025] Figure 7 This is another schematic diagram of the composition structure of the robot according to an embodiment of the present application. DETAILED DESCRIPTION

[0026] In order to enable those skilled in the art to better understand the technical solutions in one or more embodiments of the present application, the technical solutions in one or more embodiments of the present application will be clearly and completely described below in conjunction with the drawings in one or more embodiments of the present application. Obviously, the described embodiments are only part of the embodiments of the present application, not all of the embodiments. Based on one or more embodiments of the present application, all other embodiments obtained by ordinary technicians in this field without creative work should fall within the scope of protection of this document.

[0027] Figure 1 A flowchart of an implementation method of the robot queuing method of an embodiment of the present application is shown in FIG. Figure 1 The queuing method shown is applied to a robot and can be executed by a robot. The robot can be a robot in a warehousing system, for example, a robot that travels between various partitions of a warehouse to load goods in a commodity order. However, the embodiment of the present application does not limit the type of robot. Figure 1 As shown, the queuing method at least includes:

[0028] S102, when it is detected that the robot reaches the queuing area corresponding to the target point, the driving mode is switched to the queuing mode.

[0029] In an embodiment of the present application, the target point may be an area where there is resource competition when the robot performs the picking of commodity orders in the warehouse, for example: a scanning point for scanning the frame in the storage system, a packaging point for packaging operations, and other areas prone to congestion. The embodiment of the present application does not limit the type of the target point. A queuing area may be set near the target point so that the robot going to the target point first arrives at the queuing area to queue, and then reaches the target point from the queuing area. Optionally, a queuing area may be set for each target point, or a queuing area may be set for several target points. The embodiment of the present application does not limit the setting form of the queuing area.

[0030] In the embodiment of the present application, the robot may include two movement modes, namely, driving mode and queuing mode. The robot moves in the driving mode in the non-queuing area and in the queuing mode in the queuing area. The robot moves from the initial position to the queuing area corresponding to the target point in the driving mode. When the robot reaches the queuing area corresponding to the target point, the driving mode is switched to the queuing mode. The robot moves in the queuing area in the queuing mode and reaches the target point. When the robot leaves the target point, the queuing mode is switched to the driving mode. The embodiment of the present application does not limit the implementation method of the driving mode and the queuing mode.

[0031] S104, detecting whether the target point is occupied.

[0032] If the target point is not occupied, execute S106; otherwise, if the target point is occupied, execute S108.

[0033] S106, moving along the queuing area in a queuing mode to reach the target point and occupy the target point.

[0034] S108, advancing along the queuing area in a queuing mode while maintaining a preset distance range with the robot adjacent to the front.

[0035] In an embodiment of the present application, in the queuing mode, the robot can adopt different motion forms in the queuing area by detecting the state of the target point. The state of the target point may include: the target point is occupied by other robots and the target point is not occupied by other robots. The motion forms adopted by the robot in the queuing area may include: the form of autonomous motion of the robot and the form of following motion of the robot. When there are no other robots in front of the robot, the robot adopts the form of autonomous motion and moves along the queuing area; when there are other robots in front of the robot, the robot adopts the form of following motion, maintains a preset distance range with the robot adjacent to the front, and moves along the queuing area.

[0036] Optionally, the robot may move at a predetermined speed in the queuing area, which predetermined speed may be less than the speed of the robot in the driving mode.

[0037] In some optional examples, when the first robot reaches the queuing area corresponding to the target point, the first robot switches the driving mode to the queuing mode, and determines that the target point is not occupied by detecting whether the target point is occupied, and then moves along the queuing area in the queuing mode to reach the target point and occupy the target point; when the second robot reaches the queuing area corresponding to the target point, the second robot switches the driving mode to the queuing mode, and determines that the target point is occupied by detecting whether the target point is occupied, and then moves along the queuing area in the queuing mode while maintaining a preset distance range with the first robot; when the third robot reaches the queuing area corresponding to the target point, the third robot switches the driving mode to the queuing mode, and determines that the target point is occupied by detecting whether the target point is occupied, and then moves along the queuing area in the queuing mode while maintaining a preset distance range with the second robot; Among them, when the first robot stops at the target point due to occupying the target point, the second robot can stop at the first queue in the queuing area within a preset distance range from the target point, the third robot can stop at the second queue in the queuing area within a preset distance range from the first queue, and so on; when the first robot leaves the target point, the queuing mode is switched to the driving mode; the second robot in the first queue in the queuing area determines that the target point is not occupied by detecting whether the target point is occupied, and advances from the first queue along the queuing area in a queuing mode to the target point and occupies the target point; the third robot in the second queue in the queuing area determines that the target point is occupied by detecting whether the target point is occupied, and advances from the second queue along the queuing area in a queuing mode to the first queue, and so on; completing the sequential advance of the robots in the queuing area.

[0038] The robot queuing method provided in the embodiment of the present application switches the driving mode to the queuing mode when it is detected that the robot has arrived at the queuing area corresponding to the target point, detects whether the target point is occupied, and if so, advances along the queuing area in the queuing mode to reach the target point and occupies the target point; if the target point is occupied, advances along the queuing area in the queuing mode while maintaining a preset distance range with the robot adjacent to the front; by utilizing the queuing area set according to the area where congestion occurs, the robot queues in the queuing area before reaching the target point, and reaches the target point in turn through the queuing area, which can reduce the waiting time of the robot when competing for the same target point, and effectively improve the efficiency of picking.

[0039] The following will be combined Figures 2 to 4 The robot queuing method of the present application is described in detail in the embodiments.

[0040] Figure 2 A flowchart of an implementation method of the queuing mode of an embodiment of the present application is shown in FIG. Figure 2 As shown, moving along the queue area in a queue mode includes at least:

[0041] S202, detecting features of the object in front.

[0042] In an embodiment of the present application, the robot can detect the features of the object in front of it through radar or other sensors, such as laser radar, etc. The embodiment of the present application does not limit the implementation method of detecting the features of the object in front of the robot.

[0043] S204: Determine whether the front object is a robot based on the features of the front object.

[0044] If the object in front is a robot, execute S206; otherwise, if the object in front is not a robot, execute S208.

[0045] S206, follow the robot in front along the queuing area.

[0046] S208, stop moving along the queuing area.

[0047] In the embodiment of the present application, the robot can detect the features of the object in front of it in the queuing mode to determine whether the object in front of it is a robot or a non-robot obstacle, and adopt different processing methods when determining that the object in front of it is a robot or an obstacle. When the object in front of it is determined to be a robot according to its features, the robot will follow the robot in front of it along the queuing area; when the object in front of it is determined to be an obstacle according to its features, the robot will stop moving along the queuing area until it detects that there is no obstacle in front of it and then continue to move along the queuing area.

[0048] In this embodiment, the robot detects the features of the object in front in the queuing mode and identifies the object in front. It can autonomously distinguish whether the object in front is an obstacle or other robots. Therefore, when the robot moves along the queuing area, different processing methods can be adopted for the obstacles in front or other robots, thereby ensuring the safety and effectiveness of the robot's movement in the queuing area.

[0049] Figure 3 FIG. 1 is a flow chart of another implementation method of the robot queuing method according to an embodiment of the present application. Figure 3 As shown, the queuing method at least includes:

[0050] S302, obtaining the location information of the target point, the location information of the corresponding queue entry point, and the location information of other robots in the warehouse.

[0051] In the embodiment of the present application, the queue area may include a queue entry point, and the queue area may be a rectangular area determined by the queue entry point and the target point as boundary points. The embodiment of the present application does not limit the implementation method of the queue area. Optionally, the robot may receive the location information of the target point, the location information of the corresponding queue entry point, and the location information of other robots in the warehouse sent by the server; or, the robot may also send a request to the server to obtain the location information of the target point, the location information of the corresponding queue entry point, and the location information of other robots; the embodiment of the present application does not limit the method of obtaining the location information of the target point, the location information of the corresponding queue entry point, and the location information of other robots.

[0052] S304, based on the position information of the queue entry point, detecting whether the robot has reached the queue area corresponding to the target point.

[0053] S306: When it is detected that the robot reaches the queuing area corresponding to the target point, the driving mode is switched to the queuing mode.

[0054] In the embodiment of the present application, the robot can match the detected current position information with the position information of the queue entrance point corresponding to the target point obtained from the server to determine whether it has reached the queue area corresponding to the target point. For example, the robot can match the coordinates of the two in the same coordinate system to determine whether it has reached the queue area corresponding to the target point. The embodiment of the present application does not limit the implementation method of detecting whether the robot has reached the queue area corresponding to the target point.

[0055] S308, detecting whether the target point is occupied according to the position information of the target point and the position information of other robots in the warehouse.

[0056] In the embodiment of the present application, the robot can match the location information of the target point obtained from the server with the location information of other robots in the warehouse to determine whether the target point is occupied. For example, the robot can match the coordinates of the two robots in the same coordinate system to determine whether the target point is occupied. The embodiment of the present application does not limit the implementation method of detecting whether the target point is occupied.

[0057] If the target point is not occupied, execute S310; otherwise, if the target point is occupied, execute S312.

[0058] S310, advancing along the queuing area in a queuing mode to reach the target point, and occupying the target point.

[0059] S312, advancing along the queuing area in a queuing mode while maintaining a preset distance range with the robot adjacent to the front.

[0060] In this embodiment, the description of S310 and S312 can be found in Figure 1The description of S106 and S108 is already given in the specification, so it will not be repeated here.

[0061] This embodiment sets a queue entry point in the queue area and determines the queue area according to the queue entry point and the target point, which can facilitate the determination of the queue area and the detection of the robot reaching the queue area; this embodiment obtains the position information of other robots in the warehouse and the position information of the target point, which can facilitate the detection of whether the target point is occupied, and thus the movement form of the robot in the queue area can be determined according to the state of the target point.

[0062] Figure 4 FIG. 1 is a flow chart of another implementation method of the robot queuing method of the embodiment of the present application. In this embodiment, the target points are the scanning points and the packaging points. Figure 4 As shown, the queuing method at least includes:

[0063] S402, receiving the position information of the frame scanning point and the position information of the corresponding queue entry point.

[0064] In the embodiments of the present application, Figure 5A As shown, Figure 5A This is a schematic diagram of setting a queuing area in a warehouse according to an embodiment of the present application. After experiments, it is determined that the area where the robot is congested is the scanning point 123 for scanning the frame and the packing point 125 for packing in the warehouse. Therefore, a queuing area 122 for the robot is set near the scanning point 123 and the packing point 125 in the warehouse. The queuing area 122 is a rectangular area, including the queuing entry points 121 and 124. The queuing area 122 can be located on the straight line between the queuing entry point 121 and the scanning point 123, and on the straight line between the queuing entry point 124 and the packing point 125, respectively, so that the queuing entry point 121 and the scanning point 123 are the boundary points of the queuing area 122, and the queuing entry point 124 and the packing point 125 are the boundary points of the queuing area 122. Since there is a one-to-one correspondence between the queue entry point 121 and the frame scanning point 123, and there is a one-to-one correspondence between the queue entry point 124 and the packaging point 125, the queue entry point 121 can be bound to the frame scanning point 123, and the queue entry point 124 can be bound to the packaging point 125.

[0065] S404, plan a path based on the location information of the queue entry point, and reach the queue area corresponding to the scanning point according to the planned path.

[0066] In the embodiment of the present application, after receiving the position information of the scanning point 123 and the position information of the corresponding queue entry point 121 sent by the server, the robot will plan a path according to the position information of the queue entry point 121, and follow the planned path from the current position to the queue area corresponding to the scanning point 123. Optionally, the current position of the robot can be the parking area 126, the charging area 127, or other positions in the warehouse, which is not limited in the embodiment of the present application.

[0067] S406, switching the driving mode to the queuing mode, entering the queuing area, and moving along the queuing area in the queuing mode.

[0068] In the embodiment of the present application, when multiple robots sequentially receive the location information of the same scanning point 123 and the location information of the corresponding queue entry point 121 sent by the server, the multiple robots will sequentially arrive at the queue entry point 121 in driving mode, and switch the driving mode to the queue mode, enter the queue area 122 from the queue entry point 121, and move along the queue area 122 in the queue mode until they reach the scanning point 123. Figure 5B As shown, Figure 5B A schematic diagram of robots queuing in a queuing area is provided to illustrate an embodiment of the present application. When the first robot enters the queuing area 122 from the queuing entrance point 121, it will move along the queuing area 122 in a queuing mode, reach the scanning point 123 and stop at the scanning point 123; when the second robot enters the queuing area 122 from the queuing entrance point 121, it will follow the first robot in a queuing mode and move along the queuing area 122. When the first robot stops at the scanning point 123, the second robot will stop at the first queue at a preset distance from the scanning point 123; when the third robot enters the queuing area 122 from the queuing entrance point 121, it will follow the first robot in a queuing mode and move along the queuing area 122. When the first robot stops at the scanning point 123, the second robot will stop at the first queue at a preset distance from the scanning point 123. After a person enters the queuing area 122 from the queuing entrance point 121, he will follow the second robot in a queuing mode and move along the queuing area 122. When the second robot stops at the first queue, the third robot will stop at the second queue at a preset distance from the first queue, and so on. When the first robot leaves the scanning point 123, the second robot will reach the scanning point 123 in a queuing mode and stop at the scanning point 123. The third robot will reach the first queue in a queuing mode and stop at the first queue, and so on, completing the queuing process of the robots in the queuing area 122.

[0069] S408, occupying the scanning point and displaying the scanning information.

[0070] In an embodiment of the present application, the robot that arrives at the scanning point 123 and occupies the scanning point 123 will receive a product order sent by the server at the scanning point 123. The robot will display the scanning information on the installed mobile terminal according to the product order to prompt the staff to perform the scanning operation.

[0071] S410, when leaving the scanning point, switching the queuing mode to the driving mode.

[0072] In an embodiment of the present application, when the robot occupying the scanning point 123 leaves the scanning point 123 after the scanning is completed, the queuing mode will be switched to the driving mode. After the scanning point 123 is released, the robots queued in the corresponding queuing area 122 will occupy the scanning point 123 in turn.

[0073] S412, receiving the location information of the packaging point and the location information of the corresponding queue entry point.

[0074] In an embodiment of the present application, after completing the picking of the goods in the commodity order, the robot will go to the packing point 125 for packing. At this time, the robot will receive the location information of the packing point 125 and the location information of the corresponding queue entry point 124 sent by the server.

[0075] S414, plan a path based on the location information of the queue entry point, and reach the queue area corresponding to the packaging point according to the planned path.

[0076] In an embodiment of the present application, after receiving the location information of the packing point 125 and the location information of the corresponding queue entry point 124 sent by the server, the robot will plan a path according to the location information of the queue entry point 124, and reach the queue area corresponding to the packing point 125 from the current position according to the planned path.

[0077] S416, switching the driving mode to the queuing mode, entering the queuing area, and moving along the queuing area in the queuing mode.

[0078] In an embodiment of the present application, when multiple robots sequentially receive the location information of the same packing point 125 and the corresponding location information of the queuing entry point 124 sent by the server, the multiple robots will sequentially arrive at the queuing entry point 124 in driving mode, and switch the driving mode to queuing mode, enter the queuing area 122 from the queuing entry point 124, and advance along the queuing area 122 in queuing mode until they reach the packing point 125. Among them, when the first robot enters the queuing area 122 from the queuing entrance point 124, it will advance along the queuing area 122 in a queuing mode, arrive at the packing point 125 and stop at the packing point 125; when the second robot enters the queuing area 122 from the queuing entrance point 124, it will follow the first robot in a queuing mode and advance along the queuing area 122. When the first robot stops at the packing point 125, the second robot will stop at a first queue at a preset distance from the packing point 125; when the third robot enters the queuing area 122 from the queuing entrance point 124, it will follow the second robot in a queuing mode and advance along the queuing area 122. When the second robot stops at the first queue, the third robot will stop at a second queue at a preset distance from the first queue, and so on; when the first robot leaves the packing point 125, the second robot will arrive at the packing point 125 in a queuing mode and stop at the packing point 125, the third robot will arrive at the first queue in a queuing mode and stop at the first queue, and so on, completing the queuing process of the robots in the queuing area 122.

[0079] S418, occupy the packing point and display the packing screen.

[0080] In an embodiment of the present application, the robot that arrives at the packing point 125 and occupies the packing point 125 will display a packing screen through the installed mobile terminal at the packing point 125 to prompt the staff to perform the packing operation.

[0081] S420, when leaving the packing point, the queuing mode is switched to the driving mode.

[0082] In an embodiment of the present application, when the staff determines that the packing is completed and the robot occupies the packing point 125, the queuing mode will be switched to the driving mode. After the packing point 125 is released, the robots queued in the corresponding queuing area 122 will occupy the packing point 125 in turn.

[0083] This embodiment determines the scanning points and packing points that are prone to congestion during the order processing process, sets up a queuing area, and makes the robots queue in the queuing area before arriving at the scanning points and packing points. This can reduce the waiting time of the robots when competing for the same resources. While ensuring that there is sufficient space in the queuing area, the robots can maintain a continuous state of motion during the order processing process, thereby effectively improving the efficiency of picking.

[0084] Corresponding to the robot queuing method described above, based on the same technical concept, the embodiment of the present application further provides a robot, which can be a robot in a warehousing system, for example, a robot that travels between various partitions of a warehouse to load goods in a commodity order, but the embodiment of the present application does not limit the type of robot. Figure 6 A schematic diagram of the structure of a robot according to an embodiment of the present application, the robot is used to perform Figure 1 The robot queuing method described, such as Figure 6 As shown, the robot at least includes: a processing module 610 and an execution module 620, wherein the processing module 610 is connected to the execution module 620.

[0085] The processing module 610 is used to switch the driving mode to the queuing mode when it is detected that the robot reaches the queuing area corresponding to the target point; and detect whether the target point is occupied.

[0086] The execution module 620 is used to, based on the detection result of the processing module 610, advance along the queuing area in a queuing mode to reach the target point and occupy the target point when the target point is not occupied; when the target point is occupied, advance along the queuing area in a queuing mode while maintaining a preset distance range with the robot adjacent to the front.

[0087] In this embodiment, the description of the processing module 610 can be found in Figure 1 The description of S102 and S104 is given in the specification, so it will not be repeated here.

[0088] In this embodiment, the description of the execution module 620 can be found in Figure 1 The description of S106 and S108 is already given in the specification, so it will not be repeated here.

[0089] The robot provided in the embodiment of the present application switches the driving mode to the queuing mode when it is detected that the robot has arrived at the queuing area corresponding to the target point, and detects whether the target point is occupied. If the target point is not occupied, the robot advances along the queuing area in the queuing mode to reach the target point and occupies the target point. If the target point is occupied, the robot advances along the queuing area in the queuing mode while maintaining a preset distance range with the robot adjacent to the front. The queuing area set according to the area where congestion occurs is used to make the robot queue in the queuing area before reaching the target point, and arrive at the target point in turn through the queuing area, which can reduce the waiting time of the robot when competing for the same target point, and effectively improve the efficiency of picking.

[0090] Optionally, the processing module 610 is further configured to detect features of the front object; and determine whether the front object is a robot according to the features of the front object;

[0091] The execution module 620 is also used to follow the robot in front along the queuing area when the object in front is a robot according to the judgment result of the processing module 610; when the object in front is not a robot, stop moving along the queuing area.

[0092] Optionally, the queuing area includes a queuing entry point, and the queuing area is a rectangular area determined by the queuing entry point and the target point as boundary points.

[0093] Alternatively, if Figure 7 As shown, the robot also includes: a communication module 630, connected to the processing module 610, for obtaining the position information of the target point and the position information of the corresponding queue entry point.

[0094] The processing module 610 is also used to detect whether the robot reaches the queue area corresponding to the target point according to the position information of the queue entry point.

[0095] Optionally, the communication module 630 is also used to obtain location information of other robots in the warehouse.

[0096] The processing module 610 is further used to detect whether the target point is occupied based on the position information of the target point and the position information of other robots in the warehouse.

[0097] Optionally, the processing module 610 is further configured to switch the queuing mode to the driving mode when the robot leaves the target point.

[0098] Optionally, the target point includes: a scanning point for performing a scanning operation when picking a commodity order in a warehouse and / or a packing point for performing a packing operation.

[0099] Corresponding to the robot queuing method described above, based on the same technical concept, an embodiment of the present application further provides a robot, which includes a processor, a communication interface, a memory and a communication bus; wherein the processor, the communication interface and the memory communicate with each other through the bus; the memory is used to store computer programs; the processor is used to execute the programs stored in the memory to implement the following process:

[0100] When it is detected that the robot reaches the queuing area corresponding to the target point, the driving mode is switched to the queuing mode;

[0101] Detecting whether the target point is occupied;

[0102] If the target point is not occupied, proceed along the queuing area in the queuing mode to reach the target point and occupy the target point;

[0103] If the target point is occupied, the robot moves along the queuing area in the queuing mode while maintaining a preset distance range with the robot adjacent to the front.

[0104] The robot provided in the embodiment of the present application switches the driving mode to the queuing mode when it is detected that the robot has arrived at the queuing area corresponding to the target point, and detects whether the target point is occupied. If the target point is not occupied, the robot advances along the queuing area in the queuing mode to reach the target point and occupies the target point. If the target point is occupied, the robot advances along the queuing area in the queuing mode while maintaining a preset distance range with the robot adjacent to the front. The queuing area set according to the area where congestion occurs is used to make the robot queue in the queuing area before reaching the target point, and arrive at the target point in turn through the queuing area, which can reduce the waiting time of the robot when competing for the same target point, and effectively improve the efficiency of picking.

[0105] Corresponding to the detection method described above, based on the same technical concept, an embodiment of the present application further provides a computer-readable storage medium, which is used to store computer-executable instructions. When the computer-executable instructions are executed, the following process is implemented:

[0106] When it is detected that the robot reaches the queuing area corresponding to the target point, the driving mode is switched to the queuing mode;

[0107] Detecting whether the target point is occupied;

[0108] If the target point is not occupied, proceed along the queuing area in the queuing mode to reach the target point and occupy the target point;

[0109] If the target point is occupied, the robot moves along the queuing area in the queuing mode while maintaining a preset distance range with the robot adjacent to the front.

[0110] The computer-readable storage medium provided in the embodiment of the present application switches the driving mode to the queuing mode when it is detected that the robot has arrived at the queuing area corresponding to the target point, detects whether the target point is occupied, and if so, advances along the queuing area in the queuing mode to reach the target point and occupies the target point; if the target point is occupied, advances along the queuing area in the queuing mode while maintaining a preset distance range with the robot adjacent to the front; utilizes the queuing area set according to the area where congestion occurs, so that the robot queues in the queuing area before reaching the target point, and arrives at the target point in turn through the queuing area, which can reduce the waiting time of the robot when competing for the same target point, and effectively improve the efficiency of picking.

[0111] It should also be noted that the terms "include", "comprises" or any other variations thereof are intended to cover non-exclusive inclusion, so that a process, method, commodity or device including a series of elements includes not only those elements, but also other elements not explicitly listed, or also includes elements inherent to such process, method, commodity or device. In the absence of more restrictions, the elements defined by the sentence "comprises a ..." do not exclude the existence of other identical elements in the process, method, commodity or device including the elements.

[0112] One or more embodiments of the present application may be described in the general context of computer-executable instructions executed by a computer, such as program modules. Generally, program modules include routines, programs, objects, components, data structures, etc. that perform specific tasks or implement specific abstract data types. One or more embodiments of the present application may also be practiced in distributed computing environments, in which tasks are performed by remote processing devices connected through a communication network. In a distributed computing environment, program modules may be located in local and remote computer storage media, including storage devices.

[0113] Each embodiment in this application is described in a progressive manner, and the same or similar parts between the embodiments can be referred to each other, and each embodiment focuses on the differences from other embodiments. In particular, for the system embodiment, since it is basically similar to the method embodiment, the description is relatively simple, and the relevant parts can be referred to the partial description of the method embodiment.

[0114] The above description is only an embodiment of this document and is not intended to limit this document. For those skilled in the art, this document may have various changes and variations. Any modification, equivalent replacement, improvement, etc. made within the spirit and principle of this document should be included in the scope of the claims of this document.

Claims

1. A robot queuing method, characterized in that: The queuing method is applied to a robot, comprising: Obtain the location information of the target point, the location information of the corresponding queue entry point, and the location information of other robots in the warehouse; According to the position information of the queue entry point, detecting whether the robot has reached the queue area corresponding to the target point; When it is detected that the robot reaches the queuing area corresponding to the target point, the driving mode is switched to the queuing mode; Detecting whether the target point is occupied according to the position information of the target point and the position information of other robots in the warehouse; If the target point is not occupied, proceed along the queuing area in the queuing mode to reach the target point and occupy the target point; If the target point is occupied, the robot moves forward along the queuing area in the queuing mode while maintaining a preset distance range with the robot in front; When the robot leaves the target point, switching the queuing mode to the driving mode; The queuing area includes a queuing entrance point, and the queuing area is a rectangular area determined by the queuing entrance point and the target point as boundary points; the movement forms adopted by the robot in the queuing area include: the robot's autonomous movement and the robot's following movement; when there are no other robots in front of the robot, the robot adopts the autonomous movement form and moves along the queuing area; when there are other robots in front of the robot, the robot adopts the following movement form, maintains a preset distance range with the adjacent robot in front, and moves along the queuing area; the robot moves at a predetermined speed in the queuing area, and the predetermined speed is less than the speed of the robot in the driving mode.

2. The queuing method according to claim 1, characterized in that: The advancing along the queuing area in the queuing mode comprises: Detect features of objects in front of you; Determining whether the front object is a robot according to the features of the front object; If the front object is a robot, follow the front robot along the queuing area; If the object in front is not a robot, stop moving along the queuing area.

3. The queuing method according to claim 1, characterized in that: The target points include: scanning points for performing scanning operations when picking commodity orders in a warehouse and / or packing points for performing packing operations.

4. A robot, characterized in that: include A processing module, configured to switch the driving mode to the queuing mode when detecting that the robot has reached a queuing area corresponding to a target point; Detecting whether the target point is occupied; an execution module, configured to, according to the detection result of the processing module, advance along the queuing area in the queuing mode to reach the target point and occupy the target point when the target point is not occupied; When the target point is occupied, the robot moves along the queuing area in the queuing mode while maintaining a preset distance range with the robot adjacent to the front; The communication module is connected to the processing module and is used to obtain the location information of the target point and the location information of the corresponding queue entry point; it is also used to obtain the location information of other robots in the warehouse; The processing module is further used to detect whether the robot has reached the queue area corresponding to the target point according to the position information of the queue entry point; it is also used to detect whether the target point is occupied according to the position information of the target point and the position information of other robots in the warehouse; it is also used to switch the queue mode to the driving mode when the robot leaves the target point; The queuing area includes a queuing entry point, and the queuing area is a rectangular area determined by the queuing entry point and the target point as boundary points; The movement forms adopted by the robot in the queuing area include: the robot's autonomous movement and the robot's following movement; When there are no other robots in front of the robot, the robot adopts autonomous motion and moves along the queuing area; when there are other robots in front of the robot, the robot adopts following motion, maintains a preset distance range with the adjacent robot in front, and moves along the queuing area; the robot moves at a predetermined speed in the queuing area, and the predetermined speed is less than the speed of the robot in driving mode.

5. A robot, characterized in that: It includes a processor, a communication interface, a memory and a communication bus; wherein the processor, the communication interface and the memory communicate with each other through the bus; the memory is used to store computer programs; the processor is used to execute the programs stored in the memory to implement the robot queuing method as described in any one of claims 1 to 3.

6. A computer-readable storage medium, characterized in that: The computer-readable storage medium stores a computer program, and when the computer program is executed by a processor, the robot queuing method according to any one of claims 1 to 3 is implemented.