CN111832678B - Sorting robot scheduling method and device, sorting robot and storage medium - Google Patents
Sorting robot scheduling method and device, sorting robot and storage medium Download PDFInfo
- Publication number
- CN111832678B CN111832678B CN202010696738.1A CN202010696738A CN111832678B CN 111832678 B CN111832678 B CN 111832678B CN 202010696738 A CN202010696738 A CN 202010696738A CN 111832678 B CN111832678 B CN 111832678B
- Authority
- CN
- China
- Prior art keywords
- position point
- point
- destination
- state
- sorting robot
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Active
Links
- 238000000034 method Methods 0.000 title claims abstract description 29
- 238000004590 computer program Methods 0.000 claims description 8
- 238000010586 diagram Methods 0.000 description 4
- 230000003287 optical effect Effects 0.000 description 3
- 230000004048 modification Effects 0.000 description 2
- 238000012986 modification Methods 0.000 description 2
- 238000012545 processing Methods 0.000 description 2
- 230000009471 action Effects 0.000 description 1
- 238000013459 approach Methods 0.000 description 1
- 230000009286 beneficial effect Effects 0.000 description 1
- 230000000903 blocking effect Effects 0.000 description 1
- 238000004364 calculation method Methods 0.000 description 1
- 238000004891 communication Methods 0.000 description 1
- 238000011161 development Methods 0.000 description 1
- 230000003203 everyday effect Effects 0.000 description 1
- 230000003993 interaction Effects 0.000 description 1
- 230000008569 process Effects 0.000 description 1
- 230000004044 response Effects 0.000 description 1
Images
Classifications
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06K—GRAPHICAL DATA READING; PRESENTATION OF DATA; RECORD CARRIERS; HANDLING RECORD CARRIERS
- G06K17/00—Methods or arrangements for effecting co-operative working between equipments covered by two or more of main groups G06K1/00 - G06K15/00, e.g. automatic card files incorporating conveying and reading operations
-
- B—PERFORMING OPERATIONS; TRANSPORTING
- B25—HAND TOOLS; PORTABLE POWER-DRIVEN TOOLS; MANIPULATORS
- B25J—MANIPULATORS; CHAMBERS PROVIDED WITH MANIPULATION DEVICES
- B25J9/00—Programme-controlled manipulators
- B25J9/16—Programme controls
-
- B—PERFORMING OPERATIONS; TRANSPORTING
- B25—HAND TOOLS; PORTABLE POWER-DRIVEN TOOLS; MANIPULATORS
- B25J—MANIPULATORS; CHAMBERS PROVIDED WITH MANIPULATION DEVICES
- B25J9/00—Programme-controlled manipulators
- B25J9/16—Programme controls
- B25J9/1602—Programme controls characterised by the control system, structure, architecture
-
- B—PERFORMING OPERATIONS; TRANSPORTING
- B25—HAND TOOLS; PORTABLE POWER-DRIVEN TOOLS; MANIPULATORS
- B25J—MANIPULATORS; CHAMBERS PROVIDED WITH MANIPULATION DEVICES
- B25J9/00—Programme-controlled manipulators
- B25J9/16—Programme controls
- B25J9/1656—Programme controls characterised by programming, planning systems for manipulators
- B25J9/1664—Programme controls characterised by programming, planning systems for manipulators characterised by motion, path, trajectory planning
-
- B—PERFORMING OPERATIONS; TRANSPORTING
- B25—HAND TOOLS; PORTABLE POWER-DRIVEN TOOLS; MANIPULATORS
- B25J—MANIPULATORS; CHAMBERS PROVIDED WITH MANIPULATION DEVICES
- B25J9/00—Programme-controlled manipulators
- B25J9/16—Programme controls
- B25J9/1656—Programme controls characterised by programming, planning systems for manipulators
- B25J9/1664—Programme controls characterised by programming, planning systems for manipulators characterised by motion, path, trajectory planning
- B25J9/1666—Avoiding collision or forbidden zones
-
- G—PHYSICS
- G05—CONTROLLING; REGULATING
- G05B—CONTROL OR REGULATING SYSTEMS IN GENERAL; FUNCTIONAL ELEMENTS OF SUCH SYSTEMS; MONITORING OR TESTING ARRANGEMENTS FOR SUCH SYSTEMS OR ELEMENTS
- G05B19/00—Programme-control systems
- G05B19/02—Programme-control systems electric
- G05B19/418—Total factory control, i.e. centrally controlling a plurality of machines, e.g. direct or distributed numerical control [DNC], flexible manufacturing systems [FMS], integrated manufacturing systems [IMS] or computer integrated manufacturing [CIM]
- G05B19/41865—Total factory control, i.e. centrally controlling a plurality of machines, e.g. direct or distributed numerical control [DNC], flexible manufacturing systems [FMS], integrated manufacturing systems [IMS] or computer integrated manufacturing [CIM] characterised by job scheduling, process planning, material flow
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06Q—INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
- G06Q10/00—Administration; Management
- G06Q10/02—Reservations, e.g. for tickets, services or events
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06Q—INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
- G06Q10/00—Administration; Management
- G06Q10/06—Resources, workflows, human or project management; Enterprise or organisation planning; Enterprise or organisation modelling
- G06Q10/063—Operations research, analysis or management
- G06Q10/0631—Resource planning, allocation, distributing or scheduling for enterprises or organisations
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06Q—INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
- G06Q10/00—Administration; Management
- G06Q10/08—Logistics, e.g. warehousing, loading or distribution; Inventory or stock management
- G06Q10/087—Inventory or stock management, e.g. order filling, procurement or balancing against orders
-
- Y—GENERAL TAGGING OF NEW TECHNOLOGICAL DEVELOPMENTS; GENERAL TAGGING OF CROSS-SECTIONAL TECHNOLOGIES SPANNING OVER SEVERAL SECTIONS OF THE IPC; TECHNICAL SUBJECTS COVERED BY FORMER USPC CROSS-REFERENCE ART COLLECTIONS [XRACs] AND DIGESTS
- Y02—TECHNOLOGIES OR APPLICATIONS FOR MITIGATION OR ADAPTATION AGAINST CLIMATE CHANGE
- Y02P—CLIMATE CHANGE MITIGATION TECHNOLOGIES IN THE PRODUCTION OR PROCESSING OF GOODS
- Y02P90/00—Enabling technologies with a potential contribution to greenhouse gas [GHG] emissions mitigation
- Y02P90/02—Total factory control, e.g. smart factories, flexible manufacturing systems [FMS] or integrated manufacturing systems [IMS]
Landscapes
- Engineering & Computer Science (AREA)
- Business, Economics & Management (AREA)
- Human Resources & Organizations (AREA)
- General Physics & Mathematics (AREA)
- Physics & Mathematics (AREA)
- Economics (AREA)
- Tourism & Hospitality (AREA)
- Robotics (AREA)
- Quality & Reliability (AREA)
- Strategic Management (AREA)
- Entrepreneurship & Innovation (AREA)
- Mechanical Engineering (AREA)
- Theoretical Computer Science (AREA)
- Marketing (AREA)
- Operations Research (AREA)
- Development Economics (AREA)
- General Business, Economics & Management (AREA)
- Automation & Control Theory (AREA)
- Accounting & Taxation (AREA)
- Finance (AREA)
- General Engineering & Computer Science (AREA)
- Manufacturing & Machinery (AREA)
- Educational Administration (AREA)
- Game Theory and Decision Science (AREA)
- Manipulator (AREA)
- Control Of Position, Course, Altitude, Or Attitude Of Moving Bodies (AREA)
Abstract
A sorting robot scheduling method, a sorting robot scheduling device, a sorting robot and a storage medium are applied to the technical field of logistics and comprise the following steps: acquiring a current position point and a destination position point of the mobile terminal; selecting a next location point according to the location point and the destination location point; acquiring the state information of the next position point; if the state information of the next position point is in an idle state, setting the state information of the current position point to be in the idle state, setting the state information of the next position point to be in a reserved state, going to the next position point, taking the next position point as the current position point after the next position point is reached, and executing the step of selecting the next position point again according to the current position point and the destination position point until the destination position point is reached. The sorting efficiency can be improved.
Description
Technical Field
The application relates to the technical field of logistics, in particular to a sorting robot scheduling method and device, a sorting robot and a storage medium.
Background
In recent years, with the rapid development of the express delivery industry in China, the application of a Sorting Robot (SR) in express delivery Sorting is rapidly increased. Often hundreds of sorting robots are operating simultaneously in a sorting yard, and the central dispatch system directs the sorting robots to sort tens of thousands of packages from a point of load (a human or loading robot places a package onto the sorting robot) to hundreds of lots.
For the dispatching of sorting robots, the current dispatching method is basically based on a Central Dispatching System (CDS). For each package to be sorted, the CDS plans a path of the SR according to the bar code or two-dimensional code information of the package list and the position of the SR loaded with the package, and sends an action instruction to the SR; the two-dimensional code position labels attached to the ground form position points, and the position points are connected to form a circuit. And the SR acquires the position information by optically scanning the two-dimensional code position label, feeds back the execution result and the position information to the CDS, and waits for the CDS to issue a next instruction. In this mode, all scheduling instructions are collectively issued by the CDS, and the SR is simply an execution instruction and feedback. Because the SR number is large, the information amount needing data interaction is large, the CDS calculation workload is huge, high-performance server processing is needed, the problems of local congestion, system stagnation and the like often occur in the SR running process, the SR working efficiency is low, the sorting system capacity cannot be effectively exerted, and the like. Meanwhile, the SR scans the two-dimensional code position label pasted on the ground in an optical mode, the response speed is low, and the two-dimensional code position label is easy to wear and generate errors.
Disclosure of Invention
The application mainly aims to provide a sorting robot scheduling method and device, a sorting robot and a storage medium, which can improve the working efficiency of the existing sorting robot.
In order to achieve the above object, a first aspect of embodiments of the present application provides a sorting robot scheduling method, including:
acquiring a current position point and a destination position point of the mobile terminal;
selecting a next location point according to the location point and the destination location point;
acquiring the state information of the next position point;
and if the state information of the next position point is in an idle state, setting the state information of the current position point to be in the idle state, setting the state information of the next position point to be in a reserved state, moving to the next position point, taking the next position point as the current position point after the next position point is reached, and executing the step of selecting the next position point again according to the current position point and the destination position point until the destination position point is reached.
Optionally, the method further includes:
and if the state information of the next position point is in a non-idle state, after waiting for a preset time length, executing the step of acquiring the state information of the next position point again, wherein the non-idle state comprises a reservation state or an occupation state.
Optionally, the method further includes:
and if the state information of the next position point is still in a non-idle state after the step of obtaining the state information of the next position point is executed for the preset times, selecting another position point around the current position point as the next position point.
Optionally, the selecting a next location point according to the location point and the destination location point includes:
selecting a position point in one direction closest to the destination position point from four directions, namely front, back, left and right, of the current position point;
and taking the position point as the next position point.
Optionally, the obtaining the current location point and the destination location point where the mobile terminal is located includes:
acquiring the loading state of the self, wherein the loading state comprises no load and load;
when the loading state is no-load, executing the step of acquiring the current position point and the destination position point of the self, wherein the destination position point is a loading point;
and when the loading state is a load, executing the step of acquiring the current position point and the destination position point of the load, wherein the destination position point is a sorting point.
Optionally, when the destination location point is a cargo loading point, after the cargo loading point is reached, loading the cargo, modifying the loading state of the destination location point into a load, and performing the step of obtaining the current location point and the destination location point of the destination location point again, where the destination location point is a sorting point;
and when the destination position point is a sorting point, unloading the load of the destination position point after the destination position point reaches the sorting point, and modifying the loading state of the destination position point to be idle.
In a second aspect of the present embodiment, a dispatching device for a sorting robot includes:
the first acquisition module is used for acquiring a current position point and a destination position point of the first acquisition module;
a selection module for selecting a next location point according to the location point and the destination location point;
the second acquisition module is used for acquiring the state information of the next position point;
and the motion module is used for setting the state information of the current position point into an idle state if the state information of the next position point is in the idle state, setting the state information of the next position point into a reservation state, moving to the next position point, taking the next position point as the current position point after the next position point is reached, and executing the step of selecting the next position point again according to the current position point and the destination position point until the destination position point is reached.
Optionally, the sorting robot is provided with an RFID reader for scanning the radio frequency tag on the location point.
A third aspect of the embodiments of the present application provides a sorting robot, including:
the system comprises a memory, a processor and a computer program stored on the memory and capable of running on the processor, and is characterized in that the processor executes the program to realize the sorting robot scheduling method provided by the first aspect of the embodiment of the application.
A fourth aspect of the embodiments of the present application provides a computer-readable storage medium, on which a computer program is stored, where the computer program, when executed by a processor, implements the sorting robot scheduling method provided in the first aspect of the embodiments of the present application.
As can be seen from the foregoing embodiments of the present application, the sorting robot scheduling method and apparatus, the sorting robot, and the storage medium provided by the present application can achieve the following beneficial effects:
1) the RFID reader is arranged, the speed of the sorting robot for obtaining the position information is greatly increased, and the risk that the two-dimensional code label of the ground position point is stained is eliminated.
2) The sorting robot is independently scheduled, dynamically decides and has higher speed. The bypassing treatment when meeting the front obstacle can avoid the occurrence of the blocking condition of a plurality of sorting robots.
3) The CDS does not need to carry out path planning and real-time scheduling on each sorting robot any more, and the workload is greatly reduced.
4) Most of the systems are general equipment and components, and the reliability is high. If the existing system is modified, only the ground label needs to be replaced, the optical scanning device of the sorting robot is replaced by the RFID reader, and the existing CDS, communication system and other facilities are utilized.
Drawings
In order to more clearly illustrate the embodiments of the present application or the technical solutions in the prior art, the drawings used in the description of the embodiments or the prior art will be briefly described below, it is obvious that the drawings in the following description are only some embodiments of the present application, and other drawings can be obtained by those skilled in the art without creative efforts.
Fig. 1 is a schematic flow chart of a sorting robot scheduling method according to an embodiment of the present application;
fig. 2 is a schematic structural diagram of a dispatching device of a sorting robot according to an embodiment of the present application;
fig. 3 shows a hardware structure diagram of a sorting robot.
Detailed Description
In order to make the purpose, features and advantages of the present application more obvious and understandable, the technical solutions in the embodiments of the present application will be clearly and completely described below with reference to the accompanying drawings in the embodiments of the present application, and it is obvious that the described embodiments are only a part of the embodiments of the present application, and not all the embodiments. All other embodiments, which can be derived by a person skilled in the art from the embodiments given herein without making any creative effort, shall fall within the protection scope of the present application.
Referring to fig. 1, fig. 1 is a schematic flow chart of a sorting robot scheduling method according to an embodiment of the present application, the method mainly includes the following steps:
s101, acquiring a current position point and a destination position point of the mobile terminal;
s102, selecting a next position point according to the current position point and the destination position point;
s103, acquiring the state information of the next position point;
s104, if the state information of the next position point is in an idle state, setting the state information of the current position point to be in the idle state, setting the state information of the next position point to be in a reserved state, moving to the next position point, taking the next position point as the current position point after the next position point is reached, and executing the step of selecting the next position point again according to the current position point and the destination position point until the destination position point is reached.
The destination location point obtained in step S101 may be from the CDS, or may be directly input by a worker.
The status information of the next location point obtained in step S103 may be obtained from the central dispatching system (the central dispatching system stores the status information of each location point), or may be obtained from the status processor of the location point by installing a status processor at each location point.
In one embodiment of the present application, the method further comprises: and if the state information of the next position point is in a non-idle state, after waiting for a preset time length, executing the step of acquiring the state information of the next position point again, wherein the non-idle state comprises a reservation state or an occupation state.
Wherein the preset time period may be several milliseconds or several seconds. Can be set according to actual conditions.
The non-idle state can be a reservation state or an occupied state, the reservation state indicates that the sorting robot at the position point makes a reservation, the sorting robot is about to enter the position point, and the occupied state indicates that the sorting robot at the position point is occupied currently.
In one embodiment of the present application, the method further comprises: if the state information of the next position point is still in a non-idle state after the step of obtaining the state information of the next position point is executed for the preset times, another position point around the current position point is selected as the next position point.
For example, if the original next position point is a point to the left of the current position point, the position point on the right, front, or back side around the current position point may be selected as the new next position point. The position point on the right side, the front side or the rear side can be randomly selected as a new next position point, or the position point on the side closest to the destination position point among the three can be selected as a new next position point. The present embodiment does not limit this.
In one embodiment of the present application, step S102 includes: selecting a position point in one direction closest to the destination position point from four directions, namely front, back, left and right, of the current position point; this position point is taken as the next position point.
The four directions of the front, the back, the left and the right are respectively set as the four directions of X +, X-, Y + and Y-, and the position point in one direction closest to the destination position point is selected as the next position point.
More, more directions can be designed for selection.
In one embodiment of the present application, step S101 includes: acquiring the loading state of the self, wherein the loading state comprises no load and load; when the loading state is no-load, step S101 is executed: acquiring a current position point and a destination position point of the self, wherein the destination position point is a cargo carrying point; when the loading state is a load, step S101 is executed: and acquiring a current position point and a destination position point of the self, wherein the destination position point is a sorting point.
In one embodiment of the present application, when the destination location point is a cargo point, after the cargo point is reached, the cargo is loaded, and the loading status of the cargo is modified to be a load, and the step S101 is executed again: acquiring a current position point and a destination position point of the self, wherein the destination position point is a sorting point; when the destination position point is a sorting point, after the sorting point is reached, the load of the destination position point is unloaded, and the loading state of the destination position point is modified to be unloaded.
The present application is exemplified below in approximate chronological order:
step 1: before the system works every day, the CDS transmits the crossing coding information and the position point information to the sorting robot. All the sorting robots detect the loading state of the sorting robots, set the loading state to be a loading state or an idle state according to whether a load exists or not, and set the state information of the position points of the sorting robots to be a non-idle state and send the state information to the CDS.
And 2, informing the sorting robot in an idle state to go to a destination position point (namely a loading point) by the CDS. And setting the loading point as a destination position point by the sorting robot, and planning the next position point. Since hundreds and thousands of sorting robots are operated simultaneously, the state of each position point on the ground is unpredictable, and therefore, it is meaningless to perform the whole path planning. The sorting robot only needs to select the next position point to move forward, namely, every time one position point is reached, the next position point is searched, and the next position point approaches to the destination position point step by step.
Step 3, the sorting robot sends reservation information to the CDS, a next location point is reserved, the CDS obtains the state information of the next location point, if the state information of the next location point is in an idle state, a message that reservation is successful is returned to the sorting robot, the state information of the current location point is set to be in the idle state, the state information of the next location point is set to be in the reservation state, and the sorting robot goes to the next location point after receiving the message that reservation is successful. The sorting robot may also acquire the status information of the next location point from the CDS or the status processor on the location point, and if the status information of the next location point is in an idle state, the sorting robot executes step S104.
And 4, the sorting robot reaches a loading point, after the package is manually or mechanically loaded, the loading state of the package is changed into a loading state, then when the package passes through the scanning frame, the scanning equipment acquires the label information of the package and transmits the label information to the CDS, and the CDS retrieves the destination position point (namely, the sorting point) of the package and sends the destination position point to the sorting robot.
And 5, repeating the step 3 by the sorting robot according to the current position point and the destination position point until the destination position point is reached. And after the sorting robot unloads the load of the robot, the loading state of the robot is changed into no-load, the robot goes to a waiting area, receives a CDS instruction and returns to the step 2.
Referring to fig. 2, fig. 2 is a schematic structural diagram of a dispatching device of a sorting robot according to an embodiment of the present application, the dispatching device mainly includes:
a first obtaining module 201, configured to obtain a current location point and a destination location point where the first obtaining module is located;
a selecting module 202, configured to select a next location point according to the location point and the destination location point;
a second obtaining module 203, configured to obtain state information of the next location point;
and a moving module 204, configured to set the state information of the current location point to be in an idle state if the state information of the next location point is in the idle state, set the state information of the next location point to be in a reserved state, go to the next location point, take the next location point as the current location point after the next location point is reached, and perform the step of selecting the next location point again according to the current location point and the destination location point until the destination location point is reached.
In one embodiment of the present application, the sorting robot is provided with an RFID reader for scanning the radio frequency tags on the location points. The two-dimensional code of the ground position point is changed into the radio frequency label, and the RFID reader on the sorting robot is matched, so that the speed of the sorting robot for obtaining the position information is greatly increased, and the risk of fouling the two-dimensional code label is eliminated.
In one embodiment of the present application, the sorting robot further includes: and a waiting module, configured to, if the state information of the next location point is in a non-idle state, wait for a preset time period, and then perform the step of obtaining the state information of the next location point again, where the non-idle state includes a reservation state or an occupied state.
In one embodiment of the present application, the sorting robot further includes: and a reselection module, configured to select another location point around the current location point as the next location point if the status information of the next location point is still in a non-idle state after the step of obtaining the status information of the next location point is performed for a preset number of times.
In one embodiment of the present application, the selection module 202 includes: the selection submodule is used for selecting a position point in one direction closest to the destination position point from the front direction, the rear direction, the left direction and the right direction of the current position point; a submodule is provided for taking the location point as a next location point.
In one embodiment of the present application, the sorting robot further includes: the third acquisition module is used for acquiring the loading state of the third acquisition module, wherein the loading state comprises no load and load; the first obtaining module is further configured to, when the loading state is no-load, perform the step of obtaining a current location point and a destination location point where the first obtaining module is located, where the destination location point is a loading point; the first obtaining module is further configured to, when the loading status is a load, perform the step of obtaining a current location point and a destination location point where the first obtaining module is located, where the destination location point is a sorting point.
In one embodiment of the present application, the sorting robot further includes: a first state modification module, configured to, when the destination location point is a cargo point, load the cargo after the destination location point is reached, modify the loading state of the destination location point into a load, and perform the step of acquiring the current location point and the destination location point of the destination location point again, where the destination location point is a sorting point; and the second state modification module is used for unloading the load of the destination location point after the destination location point is a sorting point and modifying the loading state of the destination location point into no load after the destination location point is reached.
Referring to fig. 3, fig. 3 shows a hardware structure diagram of a sorting robot.
The sorting robot described in this embodiment includes:
a memory 41, a processor 42 and a computer program stored on the memory 41 and executable on the processor, the processor when executing the program implementing the sorting robot scheduling method described in the foregoing embodiment shown in fig. 1.
Further, the sorting robot further includes:
at least one input device 43; at least one output device 44.
The memory 41, processor 42 input device 43 and output device 44 are connected by a bus 45.
The input device 43 may be a camera, a touch panel, a physical button, or a mouse. The output device 44 may specifically be a display screen.
The Memory 41 may be a high-speed Random Access Memory (RAM) Memory or a non-volatile Memory (non-volatile Memory), such as a magnetic disk Memory. The memory 41 is used for storing a set of executable program code, and the processor 42 is coupled to the memory 41.
Further, the embodiment of the present disclosure also provides a computer-readable storage medium, which may be provided in the sorting robot in the foregoing embodiments, and the computer-readable storage medium may be the sorting robot in the foregoing embodiment shown in fig. 3. The computer readable storage medium has stored thereon a computer program which, when executed by a processor, implements the sorting robot scheduling method described in the foregoing embodiment shown in fig. 1. Further, the computer-readable storage medium may be various media that can store program codes, such as a usb disk, a removable hard disk, a Read-Only Memory (ROM), a Random Access Memory (RAM), a magnetic disk, or an optical disk.
It should be noted that each functional module in each embodiment of the present disclosure may be integrated into one processing module, or each module may exist alone physically, or two or more modules are integrated into one module. The integrated module can be realized in a hardware mode, and can also be realized in a software functional module mode.
The integrated module, if implemented in the form of a software functional module and sold or used as a stand-alone product, may be stored in a computer readable storage medium. Based on such understanding, the technical solution of the present invention may be substantially or partially embodied in the form of a software product, or all or part of the technical solution that contributes to the prior art.
It should be noted that, for the sake of simplicity, the above-mentioned method embodiments are described as a series of acts or combinations, but those skilled in the art should understand that the present invention is not limited by the described order of acts, as some steps may be performed in other orders or simultaneously according to the present invention. Further, those skilled in the art will appreciate that the embodiments described in the specification are presently preferred and that no acts or modules are necessarily required of the invention.
In the above embodiments, the descriptions of the respective embodiments have respective emphasis, and for parts that are not described in detail in a certain embodiment, reference may be made to related descriptions of other embodiments.
In view of the above description of the dispatching method and device for a sorting robot, the sorting robot and the readable storage medium provided by the present invention, those skilled in the art will appreciate that the concepts according to the embodiments of the present invention may be modified in the specific implementation manners and the application ranges.
Claims (9)
1. A sorting robot scheduling method is characterized by comprising the following steps:
acquiring a current position point and a destination position point of the mobile terminal;
selecting a next position point according to the current position point and the destination position point, selecting a position point in one direction closest to the destination position point in four directions of front, back, left and right of the current position point, and taking the position point in one direction closest to the destination position point as the next position point;
acquiring the state information of the next position point;
and if the state information of the next position point is in an idle state, setting the state information of the current position point to be in the idle state, setting the state information of the next position point to be in a reserved state, moving to the next position point, taking the next position point as the current position point after the next position point is reached, and executing the step of selecting the next position point again according to the current position point and the destination position point until the destination position point is reached.
2. The sorting robot scheduling method of claim 1, further comprising:
and if the state information of the next position point is in a non-idle state, after waiting for a preset time length, executing the step of acquiring the state information of the next position point again, wherein the non-idle state comprises a reservation state or an occupation state.
3. The sorting robot scheduling method of claim 2, further comprising:
and if the state information of the next position point is still in a non-idle state after the step of obtaining the state information of the next position point is executed for the preset times, selecting another position point around the current position point as the next position point.
4. The sorting robot scheduling method according to claim 1, wherein the obtaining of the current location point and the destination location point of the robot comprises:
acquiring the loading state of the self, wherein the loading state comprises no load and load;
when the loading state is no-load, executing the step of acquiring the current position point and the destination position point of the self, wherein the destination position point is a loading point;
and when the loading state is a load, executing the step of acquiring the current position point and the destination position point of the load, wherein the destination position point is a sorting point.
5. The sorting robot scheduling method according to claim 4, wherein when the destination location point is a loading point, after the loading point is reached, the load is loaded, the loading state of the destination location point is modified into a load, and the step of acquiring the current location point and the destination location point where the destination location point is located is performed again, the destination location point being a sorting point;
and when the destination position point is a sorting point, unloading the load of the destination position point after the destination position point reaches the sorting point, and modifying the loading state of the destination position point to be idle.
6. A sorting robot scheduling device, comprising:
the first acquisition module is used for acquiring a current position point and a destination position point of the first acquisition module;
a selection module, configured to select a next location point according to the current location point and the destination location point, select a location point in one direction closest to the destination location point in four directions, i.e., front, back, left, and right, of the current location point, and use the selected location point in one direction closest to the destination location point as a next location point;
the second acquisition module is used for acquiring the state information of the next position point;
and the motion module is used for setting the state information of the current position point into an idle state if the state information of the next position point is in the idle state, setting the state information of the next position point into a reservation state, moving to the next position point, taking the next position point as the current position point after the next position point is reached, and executing the step of selecting the next position point again according to the current position point and the destination position point until the destination position point is reached.
7. The sorting robot scheduler of claim 6, wherein the sorting robot scheduler is provided with an RFID reader for scanning radio frequency tags on location points.
8. A sorting robot comprising: memory, processor and computer program stored on and executable on the memory, characterized in that the processor, when executing the computer program, carries out the steps of the sorting robot scheduling method according to any of claims 1 to 5.
9. A computer-readable storage medium, on which a computer program is stored which, when being executed by a processor, carries out the individual steps of the sorting robot scheduling method according to any one of claims 1 to 5.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202010696738.1A CN111832678B (en) | 2020-07-17 | 2020-07-17 | Sorting robot scheduling method and device, sorting robot and storage medium |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202010696738.1A CN111832678B (en) | 2020-07-17 | 2020-07-17 | Sorting robot scheduling method and device, sorting robot and storage medium |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN111832678A CN111832678A (en) | 2020-10-27 |
| CN111832678B true CN111832678B (en) | 2022-04-19 |
Family
ID=72923032
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202010696738.1A Active CN111832678B (en) | 2020-07-17 | 2020-07-17 | Sorting robot scheduling method and device, sorting robot and storage medium |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN111832678B (en) |
Families Citing this family (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN112327760B (en) * | 2020-10-30 | 2022-09-02 | 深圳创维－Rgb电子有限公司 | Flexible production line control method and device and computer readable storage medium |
| CN113751330B (en) * | 2021-01-18 | 2023-06-23 | 北京京东乾石科技有限公司 | Article sorting method, system, apparatus and storage medium |
| CN112862161B (en) * | 2021-01-18 | 2024-09-06 | 湖南睿邮信息技术有限公司 | Goods sorting management method, device, electronic equipment and storage medium |
| CN114757523B (en) * | 2022-04-11 | 2024-03-19 | 深圳优艾智合机器人科技有限公司 | Robot scheduling method, equipment and storage medium |
Citations (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US9513627B1 (en) * | 2016-04-25 | 2016-12-06 | inVia Robotics, LLC | Autonomous coordination of resources amongst robots |
| CN106647734A (en) * | 2016-10-12 | 2017-05-10 | 北京京东尚科信息技术有限公司 | Automatic guided vehicle, path planning method and device |
| CN107992060A (en) * | 2018-01-19 | 2018-05-04 | 广东美的智能机器人有限公司 | The paths planning method and system of multiple mobile robot |
| CN109189081A (en) * | 2018-11-16 | 2019-01-11 | 湖北文理学院 | AGV dispatch control method and device |
| CN109583559A (en) * | 2017-09-29 | 2019-04-05 | 凌子龙 | A kind of robot localization terrestrial reference |
Family Cites Families (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US10108193B2 (en) * | 2016-05-27 | 2018-10-23 | Glen C Wernersbach | Mover system |
| CN109990783B (en) * | 2017-12-29 | 2021-03-02 | 深圳市优必选科技有限公司 | Robot motion path planning method, robot and storage medium |
| CN110262471B (en) * | 2018-05-10 | 2022-09-06 | 北京京东乾石科技有限公司 | Robot scheduling method and device, robot and robot scheduling system |
-
2020
- 2020-07-17 CN CN202010696738.1A patent/CN111832678B/en active Active
Patent Citations (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US9513627B1 (en) * | 2016-04-25 | 2016-12-06 | inVia Robotics, LLC | Autonomous coordination of resources amongst robots |
| CN106647734A (en) * | 2016-10-12 | 2017-05-10 | 北京京东尚科信息技术有限公司 | Automatic guided vehicle, path planning method and device |
| CN109583559A (en) * | 2017-09-29 | 2019-04-05 | 凌子龙 | A kind of robot localization terrestrial reference |
| CN107992060A (en) * | 2018-01-19 | 2018-05-04 | 广东美的智能机器人有限公司 | The paths planning method and system of multiple mobile robot |
| CN109189081A (en) * | 2018-11-16 | 2019-01-11 | 湖北文理学院 | AGV dispatch control method and device |
Non-Patent Citations (1)
| Title |
|---|
| 《快件分拣机器人群的路径规划及智能调度》;杨友良;《华北理工大学学报（自然科学版）》;20180131;第91-96页 * |
Also Published As
| Publication number | Publication date |
|---|---|
| CN111832678A (en) | 2020-10-27 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN111832678B (en) | Sorting robot scheduling method and device, sorting robot and storage medium | |
| US20230222442A1 (en) | Order processing method, outbound method, device, system, and storage medium | |
| EP3699832A1 (en) | Systems and methods for optimizing scheduling of non-preemptive tasks in multi-robotic environment | |
| US20110295411A1 (en) | System And Method For Managing Reassignment Of Units Among Shipments In A Materials Handling Facility | |
| EP3588405A1 (en) | Systems and methods for scheduling a set of non-preemptive tasks in a multi-robot environment | |
| JPH04192512A (en) | Production control method, production control apparatus and manufacturing apparatus in production system of semiconductor device | |
| JP7179086B2 (en) | Method for scheduling a semiconductor back end fab | |
| US10387831B2 (en) | System and method for item consolidation | |
| KR20160044280A (en) | Method and apparatus for warehouse task scheduling | |
| WO2024216930A1 (en) | Distribution wall configuration method, apparatus, and system, and storage medium | |
| CN110390450B (en) | Storage scheduling method and device, storage medium and electronic equipment | |
| CN111652408A (en) | Order processing method, device, medium, electronic equipment and system in warehouse | |
| WO2021039143A1 (en) | Work planning system and work planning method | |
| EP4124949A1 (en) | Systems and methods for dynamic task schedulng and rescheduling using heterogenous multi agent fleet | |
| US20240336437A1 (en) | Three-dimensional sorting method and three-dimensional sorting robot and system | |
| CN113506068B (en) | Warehouse-in and warehouse-out method and device, storage medium and electronic equipment | |
| CN111123870A (en) | System control method and device and electronic equipment | |
| Garn et al. | Smoothly pass the parcel: implementing the theory of swift, even flow | |
| CN111451155B (en) | Sorting task processing method and device, warehouse control system and storage medium | |
| US20120158824A1 (en) | Apparatus and method for distributed processing of radio frequency identification (rfid) middleware | |
| CN111652407A (en) | Method, device, medium, electronic equipment and system for processing tasks in warehouse | |
| CN114833071A (en) | Logistics sorting station and cargo sorting method and system thereof | |
| CN109829005A (en) | A kind of big data processing method and processing device | |
| CN113077190B (en) | Resource allocation method, device, equipment and storage medium | |
| CN112184027B (en) | Task progress updating method, device and storage medium |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| PB01 | Publication | ||
| PB01 | Publication | ||
| SE01 | Entry into force of request for substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant |