CN108983735B - Mobile robot scheduling device and method - Google Patents
Mobile robot scheduling device and method Download PDFInfo
- Publication number
- CN108983735B CN108983735B CN201810998491.1A CN201810998491A CN108983735B CN 108983735 B CN108983735 B CN 108983735B CN 201810998491 A CN201810998491 A CN 201810998491A CN 108983735 B CN108983735 B CN 108983735B
- Authority
- CN
- China
- Prior art keywords
- mobile
- mobile robot
- robots
- mobile robots
- moving
- 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
Images
Classifications
-
- 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], 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], computer integrated manufacturing [CIM] characterised by job scheduling, process planning, material flow
-
- 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], computer integrated manufacturing [CIM]
- G05B19/4185—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], computer integrated manufacturing [CIM] characterised by the network communication
- G05B19/41855—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], computer integrated manufacturing [CIM] characterised by the network communication by local area network [LAN], network structure
-
- 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], computer integrated manufacturing [CIM]
- G05B19/4189—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], computer integrated manufacturing [CIM] characterised by the transport system
-
- 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]
Abstract
The invention provides a mobile robot scheduling device and method, and relates to an intelligent robot. When two mobile robots move towards the direction of the intersection point, the grid coordinates of the two mobile robots are in different paths, and the distances between the two mobile robots and the intersection point are within a preset range, generating a pause movement instruction, sending the pause movement instruction to a mobile robot far away from an intersection point in two mobile robots, so that the phenomenon of mutual blocking (the mutual blocking of the robots can cause the problem that the robots constantly and autonomously plan a path and turn around) can not occur, because the path width can only allow one mobile robot to pass through, the mobile robot can not bypass the mobile robot in front according to the self obstacle avoidance program and can only queue and advance in sequence, therefore, the mobile robot can move orderly, the normal operation of the mobile robot is ensured, and the operation efficiency of the mobile robot is improved.
Description
Technical Field
The invention relates to the field of intelligent robots, in particular to a mobile robot scheduling device and method.
Background
A mobile Robot (Robot) is a machine device that automatically performs work. It can accept human command, run the program programmed in advance, and also can operate according to the principle outline action made by artificial intelligence technology. The task of which is to assist or replace human work, such as production, construction, or dangerous work. When a plurality of mobile robots need to be placed in the same area for operation, the current autonomous obstacle avoidance mode of the mobile robots can easily cause mutual blockage at the road junctions, and can also cause the movement of the mobile robots to be disordered and influence the normal operation of the robots.
Disclosure of Invention
It is therefore an object of the present invention to provide a mobile robot scheduling apparatus and method to improve the above-mentioned problems.
In a first aspect, an embodiment of the present invention provides a mobile robot scheduling apparatus, where the mobile robot scheduling apparatus includes:
the information receiving unit is used for receiving grid coordinates fed back by at least two mobile robots in the moving process according to a pre-stored moving route; the mobile robot is provided with a plurality of pre-stored mobile routes and a plurality of pre-stored mobile routes, wherein the mobile routes comprise one or more mobile paths, each mobile robot is pre-stored with a mobile route and a mobile path width, the pre-stored mobile routes of different mobile robots are provided with junction points, and the path width can only allow one mobile robot to pass through;
the judging unit is used for judging whether two mobile robots move towards the direction of the intersection point according to different moving routes and the fed grid coordinates;
the command generation unit is used for generating a pause movement command if two mobile robots move towards the direction of the intersection point, the grid coordinates of the two mobile robots are in different paths, and the distances between the two mobile robots and the intersection point are within a preset range;
and the information sending unit is used for sending the pause movement instruction to the mobile robot far away from the intersection point in the two mobile robots.
In a second aspect, an embodiment of the present invention further provides a mobile robot scheduling method, where the mobile robot scheduling method includes:
receiving grid coordinates fed back by at least two mobile robots in the moving process according to a pre-stored moving route; the mobile robot is provided with a plurality of pre-stored mobile routes and a plurality of pre-stored mobile routes, wherein the mobile routes comprise one or more mobile paths, each mobile robot is pre-stored with a mobile route and a mobile path width, the pre-stored mobile routes of different mobile robots are provided with junction points, and the path width can only allow one mobile robot to pass through;
judging whether two mobile robots move towards the direction of the intersection or not according to different moving routes and the fed grid coordinates;
if the two mobile robots move towards the direction of the intersection point, the grid coordinates of the two mobile robots are in different paths, and the distances between the two mobile robots and the intersection point are within a preset range, a pause movement instruction is generated;
and sending a pause movement instruction to the mobile robot far away from the junction in the two mobile robots.
Compared with the prior art, the mobile robot scheduling device and method provided by the invention generate the pause moving instruction when two mobile robots move towards the direction of the intersection point, the grid coordinates of the two mobile robots are in different paths, and the distances between the two mobile robots and the intersection point are within the preset range respectively, and send the pause moving instruction to the mobile robot far away from the intersection point in the two mobile robots, so that the phenomenon of mutual blocking (the problem that the robots constantly and autonomously plan the path and do not turn around due to mutual blocking of the robots) does not occur, and because the path width can only allow one mobile robot to pass, the mobile robot can not bypass the front mobile robot according to the self obstacle avoidance program, and only can queue and advance in sequence, the orderly movement of the mobile robots is realized, the normal operation of the mobile robot is ensured, and the operation efficiency of the mobile robot is improved.
In order to make the aforementioned and other objects, features and advantages of the present invention comprehensible, preferred embodiments accompanied with figures are described in detail below.
Drawings
In order to make the objects, technical solutions and advantages of the embodiments of the present invention clearer, the technical solutions in the embodiments of the present invention will be clearly and completely described below with reference to the drawings in the embodiments of the present invention, and it is obvious that the described embodiments are some, but not all, embodiments of the present invention. The components of embodiments of the present invention generally described and illustrated in the figures herein may be arranged and designed in a wide variety of different configurations. Thus, the following detailed description of the embodiments of the present invention, presented in the figures, is not intended to limit the scope of the invention, as claimed, but is merely representative of selected embodiments of the invention. 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 invention.
Fig. 1 is a schematic diagram of interaction between a server and a plurality of mobile robots according to an embodiment of the present invention;
fig. 2 is a block diagram of a server according to an embodiment of the present invention;
fig. 3 is a functional block diagram of a mobile robot scheduling apparatus according to an embodiment of the present invention;
fig. 4 is a schematic view of a scene of a mobile robot in a moving process according to an embodiment of the present invention;
fig. 5 is a flowchart of a mobile robot scheduling method according to an embodiment of the present invention.
Icon: 100-a server; 200-mobile robot scheduling device; 300-a mobile robot; 101-a memory; 102-a memory controller; 103-a processor; 104-peripheral interfaces; 105-a junction; 301-an information receiving unit; 302-a determination unit; 303-instruction generation unit; 304-an information transmitting unit; 305-virtual wall generation unit.
Detailed Description
The technical solutions in the embodiments of the present invention will be clearly and completely described below with reference to the drawings in the embodiments of the present invention, and it is obvious that the described embodiments are only a part of the embodiments of the present invention, and not all of the embodiments. The components of embodiments of the present invention generally described and illustrated in the figures herein may be arranged and designed in a wide variety of different configurations. Thus, the following detailed description of the embodiments of the present invention, presented in the figures, is not intended to limit the scope of the invention, as claimed, but is merely representative of selected embodiments of the invention. All other embodiments, which can be derived by a person skilled in the art from the embodiments of the present invention without making any creative effort, shall fall within the protection scope of the present invention.
The mobile robot scheduling apparatus and method according to the preferred embodiment of the present invention can be applied to the server 100. As shown in fig. 2, the server 100 interacts with a plurality of mobile robots 300 through a network. Fig. 2 shows a block diagram of the server 100 in the embodiment of the present invention. As shown in fig. 2, the server 100 includes a mobile robot scheduling apparatus 200, a memory 101, a storage controller 102, one or more (only one shown) processors 103, a peripheral interface 104, and the like. These components communicate with each other via one or more communication buses/signal lines. The mobile robot scheduling device 200 includes at least one software function module which may be stored in the memory 101 in the form of software or firmware (firmware) or solidified in an Operating System (OS) of the server 100.
The memory 101 may be used to store software programs and modules, such as program instructions/modules corresponding to the image processing apparatus and method in the embodiment of the present invention, and the processor 103 executes various functional applications and data processing by running the software programs and modules stored in the memory 101, such as the mobile robot scheduling method provided in the embodiment of the present invention.
The peripheral interface 104 couples various input/output devices to the processor 103 as well as to the memory 101. In some embodiments, the peripheral interface 104, the processor 103, and the memory controller 102 may be implemented in a single chip. In other examples, they may be implemented separately from the individual chips.
It will be appreciated that the configuration shown in fig. 2 is merely illustrative and that server 100 may include more or fewer components than shown in fig. 2 or have a different configuration than shown in fig. 2. The components shown in fig. 2 may be implemented in hardware, software, or a combination thereof.
Referring to fig. 3, an embodiment of the present invention provides a mobile robot scheduling apparatus 200, where the mobile robot scheduling apparatus 200 includes an information receiving unit 301, a determining unit 302, a command generating unit 303, an information transmitting unit 304, and a virtual wall generating unit 305.
The information sending unit 304 is further configured to send the moving route, the moving path width, and the moving instruction to at least two mobile robots 300.
The moving route includes one or more moving paths, each of the mobile robots 300 pre-stores the moving route and a moving path width, and the pre-stored moving routes of different mobile robots 300 have an intersection 105, and the path width can only allow one mobile robot 300 to pass through. Each mobile robot 300 stores the movement route and the movement path width after receiving the movement route and the movement path width, and starts and moves along the movement route after receiving the movement instruction, and each mobile robot 300 cannot cross the boundary of the movement path width and enter the area outside the movement path width.
The information receiving unit 301 is configured to receive grid coordinates fed back by starting point positions of at least two mobile robots 300 after receiving the first start instruction. The mobile robot 300 is equipped with a position sensor, and can transmit its own grid coordinates to the information receiving unit 301 in real time.
The virtual wall generation unit 305 generates a virtual wall at a start point position corresponding to the grid coordinates.
The mobile robot 300's own program restricts the mobile robot 300 from being able to cross the virtual wall, thus enabling each mobile robot 300 to advance only in order.
The information receiving unit 301 is further configured to receive grid coordinates fed back by at least two mobile robots 300 during a moving process according to a pre-stored moving route.
The determining unit 302 is configured to determine whether two of the mobile robots 300 both move toward the direction of the intersection 105, whether the grid coordinates of the two mobile robots 300 are on different paths, and whether respective distances from the intersection 105 are within a preset range.
Specifically, as shown in fig. 4, it can be determined whether two of the mobile robots 300 move towards the intersection 105 according to the moving routes pre-stored in the two mobile robots 300 respectively. When the distance between each of the two mobile robots 300 and the intersection 105 is within the preset range, if both mobile robots 300 continue to move forward, there is a possibility that a jam occurs at the intersection 105, and therefore it is necessary to control one of the mobile robots to stop moving forward.
The instruction generating unit 303 is configured to generate a pause movement instruction if both of the two mobile robots 300 move towards the direction of the intersection 105, the grid coordinates of the two mobile robots 300 are on different paths, and the distances between the two mobile robots 300 and the intersection 105 are within a preset range.
The information sending unit 304 is configured to send a pause movement instruction to the mobile robot 300 that is farther from the intersection 105 in the two mobile robots 300.
The determining unit 302 is further configured to determine whether the mobile robot 300 closer to the intersection 105 of the two mobile robots 300 has passed through the intersection 105 according to the grid coordinates.
When the mobile robot 300 closer to the intersection 105 of the two mobile robots 300 has passed the intersection 105, a second start instruction is sent to the mobile robot 300 farther from the intersection 105 of the two mobile robots 300.
In this embodiment, the mobile robot 300 closer to the intersection 105 has a higher priority, the mobile robot 300 closer to the intersection 105 stops moving for avoiding after receiving the movement stopping instruction, and when the mobile robot 300 closer to the intersection 105 passes through the intersection 105, the mobile robot 300 further from the intersection 105 receives the second start instruction and moves through the intersection 105, thereby preventing the mobile robot 300 from being blocked and enabling the mobile robots 300 to move orderly.
The instruction generating unit 303 is further configured to generate a pause movement instruction when the distance between the two mobile robots 300 on the same movement path is smaller than a preset safety threshold, and the information sending unit 304 is further configured to send the pause movement instruction to the mobile robot 300 that is located behind in the movement direction in the two mobile robots 300 on the same movement path, so that the mobile robots 300 can advance in order.
The information sending unit 304 is further configured to send a pause moving instruction to the mobile robot 300 moving to the destination. When the mobile robot 300 reaches the end point, the grid coordinates are transmitted to the information receiving unit 301, and at this time, the information receiving unit 301 transmits a movement suspension instruction to the mobile robot 300 moving to the end point, and at this time, the mobile robot 300 reaches the end point and suspends the movement.
Referring to fig. 5, an embodiment of the present invention further provides a mobile robot scheduling method, where the mobile robot scheduling method includes:
step S401: the movement route, the movement path width, and the movement instruction are transmitted to at least two mobile robots 300.
Step S402: receiving grid coordinates fed back by the starting point positions of the at least two mobile robots 300 after receiving the first starting instruction.
Step S403: and generating a virtual wall at the starting position corresponding to the grid coordinate.
Step S404: receiving grid coordinates fed back by at least two mobile robots 300 in the moving process according to the pre-stored moving route.
The moving route includes one or more moving paths, each of the mobile robots 300 pre-stores a moving route and a moving path width, and the pre-stored moving routes of different mobile robots 300 have an intersection 105, and the path width can only allow one mobile robot 300 to pass through.
Step S405: whether two of the mobile robots 300 move towards the direction of the intersection 105 and whether the grid coordinates of the two mobile robots 300 are in different paths and whether the distances between the two mobile robots 300 and the intersection 105 are within a preset range are determined, and if yes, step S405 is executed.
Step S406: a pause move instruction is generated.
Step S407: a pause movement instruction is sent to the mobile robot 300 that is farther from the intersection 105 of the two mobile robots 300.
Step S408: and judging whether the mobile robot 300 closer to the intersection 105 of the two mobile robots 300 passes through the intersection 105 according to the grid coordinates, and if so, executing the step S409.
Step S409: and sending a second starting instruction to the mobile robot 300 which is far away from the junction 105 in the two mobile robots 300.
Step S410: when the distance between the two mobile robots 300 on the same movement path is less than a preset safety threshold, a pause movement instruction is generated.
Step S411: the pause movement instruction is sent to the mobile robot 300 located at the rear in the movement direction among the two mobile robots 300 located on the same movement path.
Step S412: and sending a pause movement instruction to the mobile robot 300 moving to the terminal.
In summary, when two of the mobile robots move towards the direction of the intersection point and the grid coordinates of the two mobile robots are in different paths and the distances between the two mobile robots and the intersection point are within a preset range, the mobile robot scheduling apparatus and method generate a pause movement instruction, send the pause movement instruction to the mobile robot farther from the intersection point in the two mobile robots, and after the mobile robot closer to the intersection point passes through the intersection point, the mobile robot farther from the intersection point passes through the intersection point again, so that the phenomenon of mutual blocking (the problem that the robot constantly and autonomously plans the path to turn around due to mutual blocking of the robots) does not occur, and because the path width can only allow one mobile robot to pass through, the mobile robot cannot bypass the front mobile robot according to the self obstacle avoidance procedure, only can line up in sequence to advance, so that the mobile robot can move orderly, the normal operation of the mobile robot is ensured, and the operation efficiency of the mobile robot is improved.
In the embodiments provided in the present application, it should be understood that the disclosed apparatus and method can be implemented in other ways. The apparatus embodiments described above are merely illustrative, and for example, the flowchart and block diagrams in the figures illustrate the architecture, functionality, and operation of possible implementations of apparatus, methods and computer program products according to various embodiments of the present invention. In this regard, each block in the flowchart or block diagrams may represent a module, segment, or portion of code, which comprises one or more executable instructions for implementing the specified logical function(s). It should also be noted that, in some alternative implementations, the functions noted in the block may occur out of the order noted in the figures. For example, two blocks shown in succession may, in fact, be executed substantially concurrently, or the blocks may sometimes be executed in the reverse order, depending upon the functionality involved. It will also be noted that each block of the block diagrams and/or flowchart illustration, and combinations of blocks in the block diagrams and/or flowchart illustration, can be implemented by special purpose hardware-based systems which perform the specified functions or acts, or combinations of special purpose hardware and computer instructions.
In addition, the functional modules in the embodiments of the present invention may be integrated together to form an independent part, or each module may exist separately, or two or more modules may be integrated to form an independent part.
The functions, if implemented in the form of software functional modules 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 embodied in the form of a software product, which is stored in a storage medium and includes instructions for causing a computer device (which may be a personal computer, a server, or a network device) to execute all or part of the steps of the method according to the embodiments of the present invention. And the aforementioned storage medium includes: a U-disk, a removable hard disk, a Read-Only Memory (ROM), a Random Access Memory (RAM), a magnetic disk or an optical disk, and other various media capable of storing program codes. It is noted that, herein, relational terms such as first and second, and the like may be used solely to distinguish one entity or action from another entity or action without necessarily requiring or implying any actual such relationship or order between such entities or actions. Also, the terms "comprises," "comprising," or any other variation thereof, are intended to cover a non-exclusive inclusion, such that a process, method, article, or apparatus that comprises a list of elements does not include only those elements but may include other elements not expressly listed or inherent to such process, method, article, or apparatus. Without further limitation, an element defined by the phrase "comprising an … …" does not exclude the presence of other identical elements in a process, method, article, or apparatus that comprises the element.
The above description is only a preferred embodiment of the present invention and is not intended to limit the present invention, and various modifications and changes may be made by those skilled in the art. Any modification, equivalent replacement, or improvement made within the spirit and principle of the present invention should be included in the protection scope of the present invention. It should be noted that: like reference numbers and letters refer to like items in the following figures, and thus, once an item is defined in one figure, it need not be further defined and explained in subsequent figures.
The above description is only for the specific embodiments of the present invention, but the scope of the present invention is not limited thereto, and any person skilled in the art can easily conceive of the changes or substitutions within the technical scope of the present invention, and all the changes or substitutions should be covered within the scope of the present invention. Therefore, the protection scope of the present invention shall be subject to the protection scope of the claims.
It is noted that, herein, relational terms such as first and second, and the like may be used solely to distinguish one entity or action from another entity or action without necessarily requiring or implying any actual such relationship or order between such entities or actions. Also, the terms "comprises," "comprising," or any other variation thereof, are intended to cover a non-exclusive inclusion, such that a process, method, article, or apparatus that comprises a list of elements does not include only those elements but may include other elements not expressly listed or inherent to such process, method, article, or apparatus. Without further limitation, an element defined by the phrase "comprising an … …" does not exclude the presence of other identical elements in a process, method, article, or apparatus that comprises the element.
Claims (9)
1. A mobile robot scheduling apparatus, comprising:
the information receiving unit is used for receiving grid coordinates fed back by at least two mobile robots in the moving process according to a pre-stored moving route; the mobile robot is provided with a plurality of pre-stored mobile routes and a plurality of pre-stored mobile routes, wherein the mobile routes comprise one or more mobile paths, each mobile robot is pre-stored with a mobile route and a mobile path width, the pre-stored mobile routes of different mobile robots are provided with junction points, and the path width can only allow one mobile robot to pass through;
the judging unit is used for judging whether the two mobile robots move towards the direction of the intersection or not according to the fed back grid coordinates, whether the grid coordinates of the two mobile robots are in different paths or not and whether the distances between the two mobile robots and the intersection are within a preset range or not;
the command generation unit is used for generating a pause movement command if two mobile robots move towards the direction of the intersection point, the grid coordinates of the two mobile robots are in different paths, and the distances between the two mobile robots and the intersection point are within a preset range;
the information sending unit is used for sending the moving route, the moving path width and the moving instruction to the at least two mobile robots; the mobile robot is further used for sending a pause movement instruction to the mobile robot far away from the junction in the two mobile robots;
the information receiving unit is specifically used for receiving grid coordinates fed back by starting point positions of the at least two mobile robots after receiving the first starting instruction;
and the virtual wall generating unit is used for generating a virtual wall at the starting point position corresponding to the grid coordinate.
2. The mobile robot scheduling device according to claim 1, wherein the determining unit is further configured to determine whether a mobile robot closer to a junction of the two mobile robots has passed through the junction according to the grid coordinates;
and when the mobile robot closer to the junction point in the two mobile robots already passes through the junction point, sending a second starting instruction to the mobile robot farther from the junction point in the two mobile robots.
3. The mobile robot scheduling device according to claim 1, wherein the instruction generating unit is further configured to generate a pause movement instruction when a distance between two mobile robots on the same movement path is smaller than a preset safety threshold;
the information sending unit is further used for sending the pause moving instruction to a mobile robot behind in the moving direction in the two mobile robots on the same moving path.
4. The mobile robot scheduling device of claim 1, wherein the information sending unit is further configured to send a pause movement instruction to the mobile robot moving to the destination.
5. A mobile robot scheduling method, comprising:
receiving grid coordinates fed back by at least two mobile robots in the moving process according to a pre-stored moving route; the mobile robot is provided with a plurality of pre-stored mobile routes and a plurality of pre-stored mobile routes, wherein the mobile routes comprise one or more mobile paths, each mobile robot is pre-stored with a mobile route and a mobile path width, the pre-stored mobile routes of different mobile robots are provided with junction points, and the path width can only allow one mobile robot to pass through;
judging whether two mobile robots move towards the direction of the intersection or not according to the fed grid coordinates, whether the grid coordinates of the two mobile robots are in different paths or not and whether the distances between the two mobile robots and the intersection are within a preset range or not;
if the two mobile robots move towards the direction of the intersection point, the grid coordinates of the two mobile robots are in different paths, and the distances between the two mobile robots and the intersection point are within a preset range, a pause movement instruction is generated;
and sending a pause movement instruction to the mobile robot far away from the junction in the two mobile robots.
6. The mobile robot scheduling method of claim 5, wherein, prior to the step of receiving the grid coordinates fed back by the at least two mobile robots during movement according to the pre-stored movement routes, the mobile robot scheduling method further comprises:
sending a moving route, a moving path width and a moving instruction to at least two mobile robots;
receiving grid coordinates fed back by starting point positions of at least two mobile robots after receiving a first starting instruction;
and generating a virtual wall at the starting position corresponding to the grid coordinate.
7. The mobile robot scheduling method according to claim 5, wherein after the step of sending the pause movement instruction to the one of the two mobile robots farther from the intersection, the mobile robot scheduling method further comprises:
judging whether the mobile robot closer to the junction point in the two mobile robots passes through the junction point or not according to the grid coordinates;
and when the mobile robot closer to the junction point in the two mobile robots already passes through the junction point, sending a second starting instruction to the mobile robot farther from the junction point in the two mobile robots.
8. The mobile robot scheduling method according to claim 5, further comprising: when the distance between the two mobile robots on the same moving path is smaller than a preset safety threshold, generating a moving pause instruction;
and sending the pause movement instruction to a mobile robot behind in the movement direction in the two mobile robots on the same movement path.
9. The mobile robot scheduling method according to claim 5, further comprising:
and sending a pause moving instruction to the mobile robot moving to the terminal.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201810998491.1A CN108983735B (en) | 2018-08-29 | 2018-08-29 | Mobile robot scheduling device and method |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201810998491.1A CN108983735B (en) | 2018-08-29 | 2018-08-29 | Mobile robot scheduling device and method |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN108983735A CN108983735A (en) | 2018-12-11 |
| CN108983735B true CN108983735B (en) | 2021-05-11 |
Family
ID=64546880
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201810998491.1A Active CN108983735B (en) | 2018-08-29 | 2018-08-29 | Mobile robot scheduling device and method |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN108983735B (en) |
Families Citing this family (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN110032156B (en) * | 2019-04-19 | 2021-07-02 | 维沃移动通信有限公司 | Control and adjustment method of household equipment, terminal and household equipment |
| CN112081490B (en) * | 2019-06-14 | 2022-10-25 | 杭州海康机器人股份有限公司 | Logistics control system, robot control device and automatic door control method |
| CN110780651B (en) * | 2019-11-01 | 2022-07-08 | 四川长虹电器股份有限公司 | AGV dispatching system and method |
| CN115421474A (en) * | 2021-05-13 | 2022-12-02 | 北京京东乾石科技有限公司 | Robot control method and device and robot |
| CN114131606A (en) * | 2021-12-07 | 2022-03-04 | 亿嘉和科技股份有限公司 | Task scheduling method for double-arm inspection robot |
Citations (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| JP2010092321A (en) * | 2008-10-09 | 2010-04-22 | Nippon Steel Corp | Carrier system control device, method of controlling carrier system, and program |
| CN104111656A (en) * | 2014-08-06 | 2014-10-22 | 武汉汉迪机器人科技有限公司 | Navigation control system applying plurality of mobile robot platforms and control method of navigation control system |
Family Cites Families (14)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US6754634B1 (en) * | 1998-04-01 | 2004-06-22 | William P. C. Ho | Method for scheduling transportation resources |
| CN102582657B (en) * | 2012-02-16 | 2015-07-22 | 广东嘉腾机器人自动化有限公司 | AGV (automatic guided vehicle) traffic automatic control system and AGV traffic automatic control method |
| CN103064393B (en) * | 2012-12-31 | 2015-06-24 | 广州埃勃斯自动化控制科技有限公司 | Robot carrying control system based on wireless network |
| CN105137949A (en) * | 2015-09-23 | 2015-12-09 | 珠海创智科技有限公司 | AGV control system |
| FR3047219B1 (en) * | 2016-01-29 | 2022-03-11 | Daniel Moulene | AUTOMATIC TRANSPORT SYSTEM |
| CN106251016B (en) * | 2016-08-01 | 2019-05-07 | 江苏海事职业技术学院 | A kind of parking system paths planning method based on dynamic time windows |
| CN106155063A (en) * | 2016-09-28 | 2016-11-23 | 深圳市普渡科技有限公司 | A kind of multirobot dispatching method based on repulsion potential field |
| CN106548247B (en) * | 2016-10-08 | 2021-07-09 | 浙江国自机器人技术有限公司 | Traffic control method of mobile robot system |
| CN106705955B (en) * | 2016-12-23 | 2020-05-05 | 深圳市三维通机器人系统有限公司 | Sea level AGV scheduling method and system |
| CN106647763B (en) * | 2017-01-06 | 2019-10-11 | 深圳优地科技有限公司 | A kind of robot dispatching method, device and server |
| CN107610494B (en) * | 2017-08-28 | 2020-08-07 | 西北工业大学 | AGV vehicle system based on information physical fusion system and traffic control method |
| CN107748950A (en) * | 2017-09-25 | 2018-03-02 | 河南森源电气股份有限公司 | A kind of AGV dispatching methods of single major trunk roads |
| CN107450567A (en) * | 2017-09-25 | 2017-12-08 | 芜湖智久机器人有限公司 | A kind of AGV trolley control systems for being used for warehouse or workshop automatic transportation |
| CN108205323B (en) * | 2017-12-31 | 2021-01-08 | 芜湖哈特机器人产业技术研究院有限公司 | AGV traffic control system and method under hybrid navigation |
-
2018
- 2018-08-29 CN CN201810998491.1A patent/CN108983735B/en active Active
Patent Citations (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| JP2010092321A (en) * | 2008-10-09 | 2010-04-22 | Nippon Steel Corp | Carrier system control device, method of controlling carrier system, and program |
| CN104111656A (en) * | 2014-08-06 | 2014-10-22 | 武汉汉迪机器人科技有限公司 | Navigation control system applying plurality of mobile robot platforms and control method of navigation control system |
Non-Patent Citations (1)
| Title |
|---|
| 多潜伏式AGV物流系统相关技术研究;张西磊;《中国优秀硕士学位论文全文数据库 信息科技辑》;20180615;全文 * |
Also Published As
| Publication number | Publication date |
|---|---|
| CN108983735A (en) | 2018-12-11 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN108983735B (en) | Mobile robot scheduling device and method | |
| US11709502B2 (en) | Roadmap annotation for deadlock-free multi-agent navigation | |
| US10994418B2 (en) | Dynamically adjusting roadmaps for robots based on sensed environmental data | |
| WO2019178319A1 (en) | Method and apparatus for dynamic obstacle avoidance by mobile robots | |
| EP3391166B1 (en) | Autonomous visual navigation | |
| CN106483943B (en) | Dispatching method, device and the computer readable storage medium of robot | |
| KR102160968B1 (en) | Robot apparatus for autonomous driving and method for autonomous driving the robot apparatus | |
| US20140114526A1 (en) | Safety apparatus for a vehicle | |
| CN109116847B (en) | Path scheduling method and device, background server and storage medium | |
| JP7078665B2 (en) | Vehicle avoidance control methods, devices, electronic devices and storage media | |
| EP4134285A1 (en) | Vehicle obstacle avoidance method and apparatus, electronic device, and storage medium | |
| CN111158353A (en) | Movement control method for a plurality of robots and system thereof | |
| CN109739230B (en) | Driving track generation method and device and storage medium | |
| CN109048909B (en) | Branch node type path scheduling method and device, background server and first robot | |
| KR20170077332A (en) | Priority-based Collision Avoidance Control Method and System for Intelligent Autonomous Vehicle | |
| CN113867347A (en) | Robot path planning method, device, management system and computer storage medium | |
| CN113219966A (en) | Robot control method, device, communication device and storage medium | |
| CN110238841B (en) | Obstacle avoiding method and device | |
| WO2021037071A1 (en) | Flight control method and related apparatus | |
| CN109144003B (en) | Mobile robot scheduling device and method | |
| CN113495551A (en) | Robot control method and device, electronic equipment and storage medium | |
| JP6926604B2 (en) | Monitoring device, monitoring target tracking control device for moving objects, monitoring target tracking control program | |
| CN109164806A (en) | Mobile robot dispatching device and method | |
| CN116022168A (en) | Free space verification of ADS perception system perception | |
| CN112987761B (en) | Control system, method and device of unmanned equipment |
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 | ||
| TA01 | Transfer of patent application right | ||
| TA01 | Transfer of patent application right |
Effective date of registration: 20210316 Address after: 510000 room 1005, 228 Qiaotou street, Beishan village, Xinjiao South Road, Haizhu District, Guangzhou City, Guangdong Province Applicant after: Guangzhou Anshang Intelligent Technology Co.,Ltd. Address before: 510000 Guangzhou high tech Industrial Development Zone, Guangdong Province, 31 Kefeng Road, No. a220, building G1, Zhongchuang space, South China new materials innovation park, 49 Applicant before: GUANGZHOU DREAMONE ROBOT AUTOMATION Co.,Ltd. |
|
| GR01 | Patent grant | ||
| GR01 | Patent grant |