Plurality of mobile robot systems and mobile robot control method thereof
The mobile robot system addresses the challenge of real-time collision avoidance by generating detour routes using a cloud server and relay servers, reducing computational costs and time, and optimizing path adjustments within the system, thereby preventing collisions among multiple autonomous robots.
Patent Information
- Application Number
- PCT/KR2023/006483
- Authority / Receiving Office
- WO · WO
- Patent Type
- Applications
- Current Assignee / Owner
- Filing Date
- 2023-05-12
- Publication Date
- 2024-11-21
AI Technical Summary
Existing systems face challenges in generating real-time detour routes for multiple autonomous mobile robots to avoid collisions within a specific space, particularly when using global path planning without local map generation, which is computationally intensive and costly.
A mobile robot system that periodically receives state values from multiple robots, generates and transmits detour routes based on the density of the space and global map, using a cloud server and relay servers to create emergency or general detour routes by identifying overlapping sections and adjusting paths to prevent collisions.
This approach reduces computational costs and time by creating detour routes without additional obstacle sensing, effectively preventing collisions in real-time and optimizing path adjustments based on regional characteristics.
Smart Images

Figure KR2023006483_21112024_PF_FP_ABST
Abstract
Description
Multiple mobile robot systems and their mobile robot control methods
[0001] The present disclosure provides a robot system for a specific space comprising a plurality of mobile robots. Specifically, the present disclosure relates to a control method for a mobile robot system that generates and provides a real-time detour path for mobile robots traveling through a specific space with individual travel paths.
[0002] Robots were developed for industrial use and have played a key role in factory automation. Recently, the scope of robotics applications has expanded, with developments in medical and aerospace robots, as well as domestic robots for everyday use. Among these robots, those capable of autonomous navigation are called autonomous robots.
[0003] As robot use increases, there is a growing demand for robots that can provide diverse information and services beyond the repetitive performance of simple functions.
[0004] Accordingly, it can be deployed in stores, public places, warehouses, ports, factories, etc. to perform tasks such as moving goods to specific locations or patrolling.
[0005] In general, the driving path of an autonomous robot can be divided into global path planning and local path planning.
[0006] Global path planning refers to the process of generating a driving path from the starting point to the destination based on a global map before the mobile robot starts driving.
[0007] Local route planning refers to the process of updating the driving route in real time to avoid obstacles on the driving route through real-time sensing while following the driving route generated by the global route planning.
[0008] However, when a mobile robot with a driving path according to a global path plan based on a global map within a specific space performs real-time sensing, the signal processing calculations for the detection signals sensed by each of multiple mobile robots driving within a space increase significantly, resulting in a lot of time and cost.
[0009] Additionally, in a system that includes multiple mobile robots, it is defined as a system for processing and communicating various events in the space based on technologies such as cloud computing and CPS (Cyber-Physical System).
[0010] Cloud computing provides virtualized information and communication technology resources as a service by utilizing Internet technology.
[0011] Cloud computing allows users to use information and communication technology resources (e.g., servers, storage, networks, and software) as needed.
[0012] When a cloud server performs control over a large number of mobile robots through cloud computing, a relay server may be additionally included for each space for the convenience of control or communication. In this case, only the minimum detection signals should be transmitted for the convenience of communication and simplicity of data.
[0013] Korean Patent No. 1679482 discloses a multi-robot system for obstacle avoidance and a method using a switching large-scale strategy for obstacle avoidance.
[0014] A method for obstacle avoidance of a multi-robot includes a step in which a sensor attached to the follower robot determines the distance between the follower robots, a step in which the control unit of the follower robot determines whether a collision problem has occurred, and a step in which the follower robots cooperate with the lead robot to switch into an obstacle avoidance formation. However, this only discloses the relationship between the follower robots, and thus cannot respond in real time to collisions between robots that move autonomously along various individual paths.
[0015]
[0016] [Prior Art Literature]
[0017] Korean Patent No. 10-1679482, published on November 18, 2016
[0018]
[0019] The first task of the present disclosure is to provide a detour path that can avoid collisions between mobile robots in an operating situation when operating multiple mobile robots moving in real time.
[0020] The second task of the present disclosure is to provide a mobile robot system that can predict the possibility of collision and provide a detour route by receiving only real-time locations through global map generation without performing local map generation.
[0021] The third task of the present disclosure is to provide a real-time detour route that can prevent collisions by correcting the detour route according to the width of the route on a global map.
[0022] The present disclosure provides a mobile robot system comprising: a plurality of mobile robots arranged in a specific space and driving in the specific space according to their respective driving paths; and a server that periodically receives status values from the plurality of mobile robots and generates and transmits a detour path for densely packed mobile robots among the plurality of mobile robots according to the density of the space based on the status values and a global map of the space.
[0023] The mobile robot receiving the above-described detour route can drive in the specific space by updating the driving route according to the above-described detour route.
[0024] Each of the above-mentioned specific spaces may further include a relay server that transmits and receives data with the server and controls a plurality of mobile robots in the above-mentioned specific space.
[0025] The above mobile robot can periodically transmit the current location information and the driving path information of the mobile robot to the server as the status value.
[0026] The server can combine current location information for multiple mobile robots and extract a pair of mobile robots whose distance between the mobile robots is less than a threshold as the pair of mobile robots requiring the detour route.
[0027] The server can generate an emergency detour route if the distance between the mobile robots is less than a threshold and less than the topology node spacing of the global map, and can generate a normal detour route if the distance is greater than the topology node spacing of the global map.
[0028] The server may set an overlapping section on the reverse vector among the driving paths of the extracted mobile robot pair as an initial overlapping section, and set an overlapping section in time among the initial overlapping sections in which the movement of the mobile robot pair overlaps as a temporal overlapping section, thereby generating the general detour route for the temporal overlapping section.
[0029] The server can generate two general detour paths for the mobile robot pair by shifting in the same direction at both ends of the temporal overlapping section.
[0030] When the server generates the emergency detour route, it may set an overlapping section on the reverse vector from the current location to the destination on the driving path of the densely packed pair of mobile robots as an overlapping section, set a virtual node within the overlapping section, and generate the emergency detour route based on the virtual node.
[0031] The above server can create a general detour route or an emergency detour route excluding the narrow route if a narrow route exists within the overlapping section on the global map of the specific space.
[0032] When the above-mentioned general detour route or emergency detour route in which the above-mentioned narrow path exists is transmitted to the above-mentioned mobile robot, the mobile robot that first entered the above-mentioned narrow path can first pass through the above-mentioned narrow path so that other mobile robots can maintain a standby mode outside the above-mentioned narrow path.
[0033] Meanwhile, a method for controlling a mobile robot, which controls a plurality of mobile robots arranged in a specific space and driving in the specific space according to each driving path, is provided, comprising: a step of periodically receiving status values from the plurality of mobile robots; a step of extracting a densely packed mobile robot pair among the plurality of mobile robots by calculating a density of the space based on the status values and a global map of the space; and a step of generating a detour path for the extracted mobile robot pair and transmitting the detour path to the mobile robot pair.
[0034] The above-mentioned mobile robot may further include a step of receiving the detour path, updating the driving path with the detour path, and continuing the driving in the specific space.
[0035] The step of receiving the above status value can periodically receive the current location information and the driving path information of the mobile robot as the status value from the mobile robot.
[0036] The step of extracting the densely packed mobile robot pairs may include: a step of extracting current location information for the plurality of mobile robots; and a step of calculating the current location information with each other to extract the mobile robot pairs whose distance between the mobile robots is less than or equal to a threshold value as the densely packed mobile robot pairs.
[0037] The step of generating the above-mentioned detour route may generate an emergency detour route if the distance between the mobile robots is less than or equal to a threshold and less than or equal to the topological node spacing of the global map, and may generate a normal detour route if the distance between the mobile robots is greater than or equal to the topological node spacing of the global map.
[0038] It may include a step of setting an overlapping section on the reverse vector among the driving paths of the densely packed pair of mobile robots as an initial overlapping section, a step of setting an overlapping section in time among the initial overlapping sections, in which the movement of the pair of mobile robots overlaps, as a temporal overlapping section, and a step of generating the general detour route for the temporal overlapping section.
[0039] For the densely packed pair of mobile robots, two general detour paths can be generated by shifting in the same direction at both ends of the temporal overlapping section.
[0040] When generating the above emergency detour route, an overlapping section on the inverse vector from the current location to the destination on the driving path of the densely packed pair of mobile robots may be set as an overlapping section, a virtual node may be set within the overlapping section, and the emergency detour route may be generated based on the virtual node.
[0041] If a narrow path exists within the overlapping section on the global map of the above-mentioned specific space, a general detour route or an emergency detour route excluding the narrow path can be created.
[0042]
[0043] Through the above-described solution, the present disclosure can prevent collisions between mobile robots in real time when multiple mobile robots are operated to run in the same specific space.
[0044] Furthermore, avoidance paths can be generated in real time without additional obstacle sensing by multiple mobile robots. By generating detour paths with a small computational load, computational load, time, and cost can also be reduced.
[0045] Additionally, the possibility of collision can be further reduced by moving sequentially rather than selecting a detour route on a narrow path depending on the regional characteristics of the current global route.
[0046]
[0047] FIG. 1 is a schematic diagram illustrating a plurality of mobile robot systems according to one embodiment of the present disclosure.
[0048] Figure 2 is a detailed diagram of the individual mobile robot system of Figure 1.
[0049] Figure 3 is a configuration diagram according to an application example of the cloud server of Figure 2.
[0050] FIG. 4 is an operation diagram of an identity detection unit of a cloud server according to one embodiment of the present disclosure.
[0051] Figure 5 is a schematic diagram showing the distance between multiple mobile robots within a mobile robot system.
[0052] FIG. 6 is an operation diagram of a detour path generation unit of a cloud server according to one embodiment of the present disclosure.
[0053] Figures 7a and 7b are schematic diagrams for explaining the operation diagram of Figure 6.
[0054] FIG. 8 is an operation diagram of an emergency detour path generation unit of a cloud server according to one embodiment of the present disclosure.
[0055] Figures 9a and 9b are schematic diagrams for explaining the operation diagram of Figure 8.
[0056] Figure 10 is a flowchart showing the creation of a detour route when a narrow path exists on a global map.
[0057] Figure 11 is a schematic diagram for explaining the operation diagram of Figure 10.
[0058] Figures 12a and 12b show simulations of the operation of the robot according to Figure 11.
[0059]
[0060] The use of terms such as "first," "second," etc., preceding the components mentioned below is intended solely to avoid confusion regarding the components they refer to, and has no bearing on the order, importance, or dominant-subordinate relationship between the components. For example, an invention can be implemented that includes only the second component without the first component.
[0061] The thickness and size of each component in the drawings are exaggerated, omitted, or schematically illustrated for convenience and clarity. Furthermore, the size and area of each component do not entirely reflect its actual size or area.
[0062] Additionally, the angles and directions mentioned in the process of describing the structure of the present disclosure are based on those described in the drawings. If the reference point and positional relationship for angles are not clearly mentioned in the description of the structure in the specification, reference should be made to the relevant drawings.
[0063] FIG. 1 is a schematic diagram illustrating a plurality of mobile robot systems according to one embodiment of the present disclosure, and FIG. 2 is a detailed diagram of an individual mobile robot system of FIG. 1.
[0064] Referring to FIG. 1, a plurality of mobile robot systems according to one embodiment of the present disclosure may include a cloud server (10), a plurality of relay servers (20), and a plurality of mobile robots (30).
[0065] A cloud-based robotics system comprehensively manages and controls multiple robots (30) distributed in various spaces separated from each other.
[0066] At this time, each space is functionally or geographically separated, and each relay server (20) is set up to control multiple robots (30) placed within each space.
[0067] Within each space, robots of the same type (30) may be placed, but, alternatively, robots of different types (30) may be placed.
[0068] For example, a relay server (20) is set up in space 1 (A1), and multiple delivery robots and multiple surveillance robots (30) (R1, R2, R3, R4) can be deployed.
[0069] The heterogeneous or homogeneous robots (30) placed in each space can transmit and receive data with the relay server (20) or cloud server (10) set in the space and provide the assigned service.
[0070] Preferably, a cloud robot system according to one embodiment of the present disclosure includes a cloud server (10) that sets up a plurality of mobile robots (30) and each relay server (20) in each space, transmits and receives information with each relay server (20) and the mobile robot (30), and generates a driving path (P1, P2, P3, P4) of each mobile robot (30) according to global map information of the space in which each mobile robot (30) moves, and provides the driving path to each mobile robot (30), and provides the driving path by correcting and updating it in real time.
[0071] The relay server (20) monitors the status of multiple robots (30) within the allocated space at a short distance, periodically receives status values from each of the multiple mobile robots (30), and transmits them to the cloud server (10).
[0072] In addition, the corrected driving path information for each robot (30) received from the cloud server (10) can be transmitted to the corresponding mobile robot (30) so that the mobile robot (30) can be controlled to change and drive in real time along the corrected driving path.
[0073] A plurality of mobile robots (30), a relay server (20), and a cloud server (10) are equipped with a communication means (not shown) that supports one or more communication standards, and can communicate with each other.
[0074] For example, a plurality of mobile robots (30), a relay server (20), and a cloud server (10) may be implemented to communicate wirelessly using wireless communication technologies such as IEEE 802.11 WLAN, IEEE 802.15 WPAN, UWB, Wi-Fi, Zigbee, Z-wave, Blue-Tooth, etc. The mobile robot (30) may vary depending on the communication method of the other device to be communicated with or the cloud server (10) and relay server (20).
[0075] In particular, a plurality of mobile robots (30) can wirelessly communicate with other robots (30) and / or a relay server (20) and a cloud server (10) via a 5G network. When the mobile robots (30) wirelessly communicate via a 5G network, an ultra-low latency / ultra-large capacity data transmission network can be implemented.
[0076] More specifically, 5G networks are communications technologies capable of delivering transmission speeds of tens of Gbps over the wireless spectrum. They enable ultra-low latency, ultra-high capacity, and ultra-realistic data transmission across multiple modules, enabling data transmission at speeds exceeding Gbps and ultra-low latency measured in milliseconds, meeting service-specific quality requirements. These 5G networks can offer network quality comparable to high-speed wired networks while simultaneously offering the advantages of wireless connectivity.
[0077] This 5G network can be controlled to provide optimized services for each mobile robot (30) and each space between the robot (30) and the relay server (20), between the relay server (20) and the cloud server (10), and between the robot (30) and the cloud server (10) in a cloud-based robot system.
[0078] In addition, multiple mobile robots (30) and relay servers (20) can communicate in MQTT (Message Queueing Telemetry Transport) mode and HTTP (HyperText Transfer Protocol) mode, but are not limited thereto.
[0079] In some cases, two or more communication standards are supported between multiple robots (30) and relay servers (20) and cloud servers (10), and the optimal communication standard can be used depending on the type of communication data and the type of device participating in the communication.
[0080] In this specification, a "user" refers to a person who provides or uses a service through multiple robots (30), and may include individual customers who purchase or rent robots (30) and use them in a workplace, etc., managers and employees of a company that provides services to employees or customers using robots (30), and customers who use the services provided by such companies. Accordingly, a "user" may include individual customers (Business to Consumer: B2C) and corporate customers (Business to Business: B2B).
[0081] The cloud server (10) stores global map information of each space in order to control a plurality of physically distributed robots (30), and generates a driving path based on the global map information of each space and the tasks assigned to each mobile robot (30) and provides the path to each mobile robot (30) through the relay server (20). In addition, the cloud server corrects the stored driving path in real time based on the status value of the mobile robot (30) to generate a detour path and provides the path to the mobile robot (30) through the relay server (20).
[0082] The above cloud server (10) generates a path generation model or engine for the mobile robot (30) of each space. The base model or engine may include a general model or general engine applicable to similar mobile robots (30) depending on the environment of the mobile robot system.
[0083] The cloud server (10) receives environmental information for each local environment, i.e., global map information for each space where multiple mobile robots (30) are deployed, receives the number and job table of each mobile robot, and comprehensively judges this to perform deep learning to upgrade the base model so as to be optimized for the environment.
[0084] The relay server (20) is set up in each space as shown in FIG. 2, and transmits and receives data with multiple different or similar robots (30) placed in the space, and can control each robot (30) by transmitting and receiving data with the cloud server (10).
[0085] The relay server (20) is a technology that processes data in the edge area where data is created, rather than processing data in the cloud server (10). Data requiring real-time processing is implemented in a way that the relay server (20) processes the data and, when necessary, communicates with the central cloud as a secondary task.
[0086] Each relay server (20) is placed in a separate virtual space or physically separated space, as shown in FIG. 2, and controls a plurality of robots (30) placed in the space to provide services.
[0087] For example, as shown in FIG. 2, a relay server (21) can control a plurality of robots (30: R1-R4) that provide goods movement services within a logistics warehouse, and the plurality of robots (30) can be transport robots, surveillance robots, etc.
[0088] In this way, multiple mobile robots (30) placed in the space are dependent on the relay server (21) and, when operation begins while transmitting and receiving data with the relay server (21) and the cloud server (10), individually drive according to the transmitted driving path (p1-p4) and perform assigned tasks.
[0089] Fig. 3 is a configuration diagram according to an application example of the cloud server (10) of Fig. 2.
[0090] Referring to FIG. 3, the cloud server (10) may include a communication unit (11), a storage unit (13), a congestion detection unit (15), a detour route generation unit (17), and an emergency detour route generation unit (19).
[0091] Specifically, the storage unit (13) can store, in the case of a cloud server (10), an algorithm that can perform processing for generating a driving path and a detour path for each robot based on global map information for each space, and can store and manage data acquired based on IoT technology from a plurality of similar or mobile robots (30) within each space.
[0092] This storage unit (13) may be a variety of storage devices such as ROM, RAM, EPROM, flash drive, hard drive, etc., and may also be web storage that performs the storage function of the storage unit (13) on the Internet.
[0093] Additionally, in some embodiments, the software components stored in the storage (13) may include an operating system, a communication module (or set of instructions), a contact / motion module (or set of instructions), a graphics module (or set of instructions), a text input module (or set of instructions), a global positioning system (GPS) module (or set of instructions), and applications (or sets of instructions).
[0094] As previously described, the communication unit (11) of the cloud server (10) enables various communications depending on the communication method required by the environment. In particular, communication between the robot (30) and the relay server (20), the relay server (20) and the cloud server (10), and the robot (30) and the cloud server (10) is possible using a 5G network.
[0095] The cloud server (10) individually generates a driving path (P1-P4) for each mobile robot (30) based on a global map. Here, the global map is a map of the work environment used by the mobile robot (30), and information on static obstacles, which are areas in which the mobile robot (30) cannot move, is predefined. The driving path generated by the cloud server (10) is named the initial driving path (P1-P4).
[0096] For example, referring to FIG. 2, the cloud server (10) considers static obstacles defined in the global map and assigns a driving path (P1-P4) for each mobile robot (30: R1-R4) to drive for a predetermined period of time in each space.
[0097] According to one embodiment of the present disclosure, the cloud server (10) can generate an initial driving path (P1-P4) using an A* algorithm (A star algorithm) or an RRT (Rapidly exploring Random Tree) algorithm.
[0098] The identity detection unit (15) of the cloud server (10) periodically receives status value information of each robot (30:R1-R4) from the communication unit (11), and determines the current movement point and driving path of the mobile robot (30:R1-R4) in operation to determine the distance between multiple mobile robots (30:R1-R4) within the same space.
[0099] The above-mentioned congestion detection unit (15) periodically receives information on the current movement points of the corresponding mobile robots (30) from each relay server (20), calculates each distance between multiple mobile robots (30: R1-R4) for each period, and determines that there is a possibility of congestion if the distance is below a threshold value.
[0100] If there is a possibility of the above-mentioned congestion, the congestion detection unit (15) transmits information about the corresponding mobile robot pair to the detour path generation unit (17).
[0101] The detour path generation unit (17) receives a list of robot pairs below a threshold value from the congestion detection unit (15) and generates a detour path for each mobile robot pair.
[0102] The above detour route is generated from global map information, and can be generated by comparing and processing only the global map information and the initial driving route (P1-P4) without generating a local map by not receiving real-time sensing information from the mobile robot (30:R1-R4).
[0103] Meanwhile, if the distance between multiple mobile robots (30: R1-R4) calculated by the above-mentioned identity detection unit (15) is smaller than the distance between topology nodes, the emergency detour path generation unit (19) generates an emergency detour path.
[0104] The above emergency detour path generation unit (19) receives information about the corresponding robot (R) pair, generates an emergency detour path, and provides it to the corresponding mobile robot (30: R1-R4) through the communication unit (11).
[0105] In this way, the cloud server (10) periodically receives real-time status values of each mobile robot (30: R1-R4), such as current location and driving path information, through the relay server (20), compares them with each other, predicts the possibility of congestion, and generates and provides a detour route accordingly.
[0106] At this time, the cloud server (10) can create different types of detour routes depending on whether the area on the global map is a wide area or a narrow area.
[0107] Below, the operation of the functional module of each cloud server (10) is individually described.
[0108] FIG. 4 is an operation diagram of an identity detection unit (15) of a cloud server (10) according to one embodiment of the present disclosure, and FIG. 5 is a schematic diagram showing the distance between a plurality of mobile robots (30: R1-R4) in a mobile robot (R) system.
[0109] Referring to Fig. 4, a plurality of mobile robots (R1, R2) moving in a space include information about a driving path (P1, P2) set according to a global map for the space, and drive in the space according to the driving path (P1, P2).
[0110] Such mobile robots (R1, R2) periodically transmit status values, i.e., current location information and stored driving path (P1, P2) information of the corresponding mobile robots (R1, R2) to the cloud server via the relay server (20) (S10).
[0111] The identity detection unit (15) of the cloud server (10) periodically receives the status values of the mobile robots (R1, R2) and determines whether there is a pair of robots in a space with a very high density where the distance between the plurality of mobile robots (R1, R2) is below a threshold value based on the current positions of the plurality of mobile robots (R1, R2) in a space (S11).
[0112] Specifically, when the current position information of the mobile robots (R1, R2) in the current cycle is received as shown in Fig. 5, the distance (d1) between the first robot (R) and the second robot (R) is calculated as in mathematical expression 1.
[0113] [Mathematical Formula 1]
[0114]
[0115] The above-mentioned identity detection unit (15) extracts a pair of mobile robots (R1, R2) whose current positions are less than a threshold among all d1s between the current positions of multiple mobile robots (R1, R2) received in the current cycle.
[0116] At this time, if the value of d1 is less than the threshold value and the value of d1 is less than TP, which is the topology node spacing of the global map, information about the corresponding robot (R) pair is transmitted to the emergency detour path generation unit (19).
[0117] If the value of the above D1 is greater than the topology node spacing and less than the threshold value, it is determined that there is a general possibility of congestion, and information about the corresponding robot pair is transmitted to the detour path generation unit (17) (S12).
[0118] Meanwhile, FIG. 6 is an operation diagram of a detour path generation unit (17) of a cloud server (10) according to one embodiment of the present disclosure, and FIGS. 7a and 7b are schematic diagrams for explaining the operation diagram of FIG. 6.
[0119] Referring to FIG. 6 and FIG. 7a and FIG. 7b, the detour path generation unit (17) receives a list of robot pairs with a distance below a real-time threshold from the congestion detection unit (15) and also receives information on the corresponding mobile robots.
[0120] The current location information and driving path information of each mobile robot (R1, R2) are extracted and confirmed from the extracted robot pair (S100).
[0121] The driving paths of the above robot pair are compared with each other to determine whether there is an overlapping section on the reverse vector (S110).
[0122] That is, the first robot (R1) and the second robot (R2) are extracted as a pair at risk of stagnation, and it is determined whether there is an overlapping section in the opposite vector direction among the driving paths of the two robots (R1, R2), and this is named as an initial overlapping section.
[0123] Next, as shown in Fig. 7a, the movement speed is converted based on the current positions of the two robots (R1, R2) for the overlapping section to determine whether an overlapping section (OP: overlapped period) exists in time (S120).
[0124] The above temporal overlapping section (OP) may be smaller than or equal to the initial overlapping section, and when the temporal overlapping section (OP) exists, the temporal overlapping section (OP) is represented by topological nodes (n1-n7) as shown in Fig. 7a.
[0125] For example, in FIG. 7a, the temporal overlap section (OP) may be a section between the first node (n1) and the seventh node (n7) between the first robot (R1) and the second robot (R2).
[0126] Next, the detour path generation unit (17) generates a detour path for the overlapping time section (OP) from the current position for the first robot (R1) and the second robot (R2) (S130).
[0127] At this time, for each robot (R1, R2), a detour path can be created to shift the temporal overlapping section (OP) in the first direction from the front of the temporal overlapping section (OP).
[0128] For example, the first robot (R1) and the second robot (R2) can create a detour path to shift to the right with respect to the front in the same manner.
[0129] That is, the first robot (R1) can create a detour path that goes from the first node (n1) to the right, passes from the first detour point (c2) to the fifth detour point (c6), and then returns to the seventh node (n7).
[0130] Meanwhile, the second robot (R2) can create a detour path that goes from the seventh node (n7) to the right, passes from the sixth detour point (c2') to the tenth detour point (c6'), and then returns to the first node (n1).
[0131] When such a detour path is created for each robot (R1, R2), a path is provided that allows the first robot (R1) and the second robot (R2) to pass by detouring without colliding with each other in the temporal overlapping section (OP).
[0132] The detour path generation unit (17) transmits the detour path information generated for each robot (R1, R2) to the relay server (20) through the communication unit (11), and transmits it to the corresponding robot (R1, R2) through the relay server (20) (S140).
[0133] The above mobile robots (R1, R2) can change their paths in real time according to the transmitted detour route to prepare for collisions.
[0134] Meanwhile, FIG. 8 is an operation diagram of an emergency detour path generation unit (19) of a cloud server according to one embodiment of the present disclosure, and FIGS. 9a and 9b are schematic diagrams for explaining the operation diagram of FIG. 8.
[0135] Referring to FIG. 8 and FIG. 9a and FIG. 9b, the emergency detour path generation unit (19) receives, from the traffic jam detection unit (15), a list of robot pairs in which the distance between real-time robots (30) is less than or equal to a threshold and the distance between real-time robots (30) is less than or equal to a topology node (TP) interval, and also receives information on the corresponding mobile robot (R) (S200).
[0136] The current location information and driving path information of each mobile robot (R1, R2) are extracted from the extracted robot pair.
[0137] At this time, the driving paths of each mobile robot (R1, R2) of the robot pair are compared with each other to check whether there is a possibility of collision.
[0138] Specifically, as shown in Fig. 9a, the vector from the current point of each robot (R1, R2) to the destination is checked (S210), and if the vectors of the two robots (R1, R2) are opposite to each other and have an overlapping section (op), it is determined that there is a possibility of collision (S220).
[0139] That is, when the distance between the first robot (R1) and the second robot (R2) is very close, and the vectors of the two robots (R1, R2) are in the opposite vector direction, an overlapping section (op) is searched, and a virtual node is set within the overlapping section (op) (S230).
[0140] Since the corresponding overlapping section (op) is smaller than the topology node (TP) interval, it cannot express the topology node, so a virtual node (i1-i5) having an interval smaller than the topology node is set as in Fig. 9b.
[0141] For example, in FIG. 9b, the overlap section (op) where the virtual node is set may be a section between the first node (n1) and the second node (n2) between the first robot (R1) and the second robot (R2).
[0142] Next, the emergency detour path generation unit (19) generates an emergency detour path for the overlapping section (op) for the first robot (R1) and the second robot (R2) (S240).
[0143] At this time, an emergency detour route is provided for each robot (R1, R2) to shift the overlapping section (OP) in the first direction.
[0144] For example, the first robot (R1) and the second robot (R2) can create an emergency detour path to shift to the right with respect to the front in the same manner.
[0145] That is, the first robot (R1) can create an emergency detour path that goes from the first node (n1) to the right, passes from the first detour point (i1') to the fifth detour point (i5'), and then returns to the second node (n2).
[0146] Meanwhile, the second robot (R2) can create an emergency detour route that goes from the second node (n2) to the right, passes from the sixth detour point (i1'') to the tenth detour point (i5''), and then returns to the first node (n1).
[0147] When such an emergency detour path is created for each robot (R1, R2), a path is provided through which the first robot (R1) and the second robot (R2) can pass by detouring without colliding with each other in the overlapping section (OP).
[0148] The emergency detour route generation unit (19) transmits the emergency detour route information generated for each robot (R1, R2) to the relay server (20) through the communication unit (11), and transmits it to the corresponding robot (R1, R2) through the relay server (20) (S250).
[0149] The above mobile robots (R1, R2) can change their routes in real time according to the transmitted emergency detour route to prepare for collisions.
[0150] In this way, by receiving the current location information of multiple mobile robots (30) within a space in real time and continuously calculating the relative distance accordingly to update the avoidance path between adjacent robots (30), multiple mobile robots (30) traveling within the same space can move without colliding with each other.
[0151] In addition, multiple mobile robots (30) can significantly reduce computation by avoiding collisions by correcting the initially set driving path for the global map without performing obstacle detection in real time.
[0152] Meanwhile, the detour route generation unit (17) and the emergency detour route generation unit (19) can correct the detour route according to the stored global map.
[0153] Below, we describe the operation of generating a corrected detour route based on a global map.
[0154] Fig. 10 is an operation diagram showing the creation of a detour route when a narrow path exists on a global map, Fig. 11 is a schematic diagram for explaining the operation diagram of Fig. 10, and Figs. 12a and 12b are simulations showing the operation of the robot (R) according to Fig. 11.
[0155] The detour route generation unit (17) and the emergency detour route generation unit (19) of the cloud server (10) distinguish information on wide-area roads and narrow roads within the global map information (S300).
[0156] At this time, a wide road and a narrow road are defined as a path having a width that allows two mobile robots (30) to drive simultaneously, and a narrow road is defined as a path having a width that allows one mobile robot (30) to drive but does not allow two mobile robots (30) to drive simultaneously.
[0157] In this way, in the global map information of each space, a wide route and a narrow route are distinguished for the path, and the detour route generation unit (17) and the emergency detour route generation unit (19) generate a detour route and an emergency detour route for the extracted robot pair, respectively.
[0158] At this time, it is determined whether the above-mentioned overlapping section matches a narrow path within the global map information (S310).
[0159] That is, if at least a part of the above-mentioned overlapping section (OP) coincides with a narrow path (S320), the possibility of a detour route bypassing the narrow path being effective is judged to be low, and the detour route is corrected (S330).
[0160] Specifically, if an overlapping section (OP) and a narrow path partially coincide, a detour route is formed excluding the coincident section.
[0161] For example, as shown in Fig. 11, when the overlapping section (OP) of the first robot (R1) and the second robot (R2) is between the first node (n1) and the seventh node (n7), it can be determined that the section between the third node (n3) and the fourth node (n4) in the overlapping section (OP) coincides with a narrow road (NR). If it is determined that a part of the overlapping section (OP) is a narrow road (NR), the detour route is corrected to bypass the section between the first node (n1) and the third node (n3), and the section between the fourth node (n4) and the seventh node (n7), excluding the third node (n3) and the fourth node (n4).
[0162] The corrected detour path generated in this way, for the first robot (R1), goes from the first node (n1) through the second detour point (c2) to the third node (n3), then passes through the narrow path (NR) to the fourth node (n4) and follows the detour path again, passes through the fifth detour point (c5) and the sixth detour point (c6), and reaches the seventh node (n7).
[0163] A corrected detour route like this can also create a detour point that shifts in a certain direction, for example, to the right, with the overlapping section (OP) in front.
[0164] Meanwhile, the corrected detour path of the second robot (R2) entering the overlapping section (OP) in the opposite vector direction goes from the seventh node (n7) to the fourth node (n4) through the seventh detour point (c2') and the eighth detour point (c3'), then follows the detour path again from the third node (n3) through the narrow path (NR), and then reaches the first node (n1) through the ninth detour point (c6').
[0165] At this time, the corrected detour route is transmitted to the first robot (R1) and the second robot (R2) with a high possibility of collision, and the first robot (R1) and the second robot (R2) update the driving route set according to the corrected detour route and drive according to the corrected detour route (S340).
[0166] At this time, when the first robot (R1) and the second robot (R2) reach the narrow path (NR), the robot (R1) that first enters the third node (n3) and the fourth node (n4) can be set to pass through the narrow path (NR) first.
[0167] The order of passage of the narrow path (NR) can be transmitted together when transmitting the above-mentioned corrected detour path, but is not limited thereto.
[0168] The order of passage through the above narrow path (NR) can be calculated based on the current position of each robot (R1, R2), the distance to the narrow path (NR), and the current speed, and it can be assumed that the robots (R1, R2) continuously travel at the same speed as the current speed.
[0169] As shown in Fig. 12a, the first robot (R1) and the second robot (R2) driving on the overlapping section drive according to the corrected detour path, and when encountering a narrow path (NR), the second robot (R2) does not move and waits in a stopped state until the first robot (R1) that entered the narrow path (NR) first passes through the narrow path (NR).
[0170] As shown in the above figure 12b, after the first robot (R1) has completely escaped the narrow path (NR), the second robot (R2) enters the narrow path (NR) and drives along the corrected detour path. Therefore, the corrected detour paths of the two robots (R1, R2) are temporally disconnected from each other in the narrow path (NR), and when driving along the corrected driving paths thereafter, they drive along their respective corrected driving paths but do not drive over the corresponding nodes in time.
[0171] However, even if there is no temporal response in this way, the search for the driving path is newly performed by retransmitting the status value for the current location in the next cycle, so there is no effect on subsequent driving.
[0172] Meanwhile, if there is no narrow path (NR) among the overlapping sections (OP) (S350), the detour path generation unit (17) and the emergency detour path generation unit (19) of the cloud server (10) generate each detour path and emergency detour path according to the flowcharts of FIGS. 6 and 8, and transmit the corresponding detour path to the corresponding robot (30) via the relay server (S360).
[0173] In this way, the cloud server (30) can receive global map information of each space and information on the status values of multiple mobile robots (30) in each space in real time, and provide a corrected driving path for the global map information.
[0174] Since correction of the driving path like this is implemented only with global map information without creating a local map, it does not require obstacle detection by the robot (30), so the cost of processing expensive obstacle sensors such as lidar and sensor values can be significantly reduced.
[0175] In addition, the calculation can be greatly simplified by calculating the risk of collision based on the relative distances of multiple robots (30) from the initially set driving route on the global map and then calculating a detour route.
[0176] The robot system according to the present disclosure is not limited to the configuration and method of the embodiments described above, but the embodiments may be configured by selectively combining all or part of the embodiments so that various modifications can be made.
[0177] Meanwhile, the control method of the robot system according to the embodiment of the present disclosure can be implemented as a processor-readable code on a processor-readable recording medium. The processor-readable recording medium includes all types of recording devices that store data that can be read by the processor. Examples of the processor-readable recording medium include ROM, RAM, CD-ROM, magnetic tape, floppy disk, optical data storage device, etc., and also includes those implemented in the form of a carrier wave, such as transmission via the Internet. Furthermore, the processor-readable recording medium can be distributed across network-connected computer systems, so that the processor-readable code can be stored and executed in a distributed manner.
[0178] In addition, although the preferred embodiments of the present disclosure have been illustrated and described above, the present disclosure is not limited to the specific embodiments described above, and various modifications may be made by a person having ordinary skill in the art to which the present invention pertains without departing from the gist of the present disclosure as claimed in the claims, and such modifications should not be understood individually from the technical idea or prospect of the present disclosure.
[0179] [Explanation of symbols]
[0180] 10: Cloud Server 20: Relay Server
[0181] 30: Mobile robot
Claims
1. A plurality of mobile robots arranged in a specific space and driving through the specific space according to each driving path; and A server that periodically receives status values from the plurality of mobile robots and generates and transmits a detour route for densely packed mobile robots among the plurality of mobile robots based on the status values and the global map of the space, according to the density of the space; A mobile robot system comprising:
2. In paragraph 1, A mobile robot system in which the mobile robot, which receives the detour route, updates the driving route according to the detour route and drives in the specific space.
3. In paragraph 2, A mobile robot system further comprising a relay server that is allocated to each of the above specific spaces, transmits and receives data with the server, and controls a plurality of mobile robots in the above specific space.
4. In paragraph 1, A mobile robot system in which the mobile robot periodically transmits the current location information and the driving path information of the mobile robot to the server as the status value.
5. In paragraph 4, A mobile robot system in which the server combines current location information for a plurality of mobile robots and extracts a pair of mobile robots whose distance between the mobile robots is less than a threshold as the pair of mobile robots requiring the detour route.
6. In paragraph 5, A mobile robot system in which the server generates an emergency detour route when the distance between the mobile robots is less than a threshold and less than the topology node spacing of the global map, and generates a normal detour route when the distance between the mobile robots is greater than the topology node spacing of the global map.
7. In paragraph 6, A mobile robot system in which the server sets an overlapping section on the reverse vector among the driving paths of the extracted mobile robot pair as an initial overlapping section, and sets an overlapping section in time among the initial overlapping sections in which the movement of the mobile robot pair overlaps as a temporal overlapping section, thereby generating the general detour route for the temporal overlapping section.
8. In paragraph 7, A mobile robot system in which the server generates two general detour paths for the mobile robot pair by shifting in the same direction at both ends of the temporal overlapping section.
9. In paragraph 8, A mobile robot system in which, when the server generates the emergency detour route, an overlapping section on the station vector from the current location to the destination on the driving path of the densely packed mobile robot pair is set as an overlapping section, a virtual node is set within the overlapping section, and the emergency detour route is generated based on the virtual node.
10. In paragraph 8 or 9, The above server is a mobile robot system that creates a general detour route or an emergency detour route excluding the narrow route when a narrow route exists within the overlapping section on the global map of the specific space.
11. In paragraph 10, A mobile robot system in which, when the above-mentioned general detour route or emergency detour route in which the above-mentioned narrow path exists is transmitted to the mobile robot, the mobile robot that first entered the narrow path passes through the narrow path first, and another mobile robot maintains a standby mode outside the narrow path.
12. A method for controlling a mobile robot, which controls a plurality of mobile robots that are placed in a specific space and drive in the specific space according to each driving path, A step of periodically receiving status values from the plurality of mobile robots; A step of extracting a densely packed mobile robot pair among the plurality of mobile robots by calculating the density of the space based on the state value and the global map of the space; and A step of generating a detour path for the extracted mobile robot pair and transmitting it to the mobile robot pair; A method for controlling a mobile robot including:
13. In paragraph 12, A control method for a mobile robot, further comprising a step of the mobile robot receiving the detour path and updating the driving path with the detour path to continue driving in the specific space.
14. In paragraph 13, The step of receiving the above status value is: A control method for a mobile robot that periodically receives current location information and driving path information of the mobile robot as the status value from the mobile robot.
15. In paragraph 14, The step of extracting the densely packed mobile robot pairs comprises: a step of extracting current location information for the plurality of mobile robots; and A step of extracting a pair of mobile robots whose distance between the mobile robots is less than a threshold value by calculating the current location information with each other as the densely packed pair of mobile robots; A method for controlling a mobile robot including:
16. In paragraph 15, The step of creating the above detour route is: A control method for a mobile robot, wherein an emergency detour route is generated when the distance between the mobile robots is less than or equal to a threshold and less than or equal to the topological node spacing of the global map, and a normal detour route is generated when the distance between the mobile robots is greater than or equal to the topological node spacing of the global map.
17. In paragraph 16, A step of setting an overlapping section on the reverse vector among the driving paths of the densely packed pair of mobile robots as an initial overlapping section; A step of setting a section in which the movements of the mobile robot pair overlap in time among the above initial overlapping sections as a time-overlapping section, and A step of creating the general detour route for the above-mentioned time-related overlapping section. A method for controlling a mobile robot including:
18. In paragraph 17, A control method for a mobile robot that generates two general detour paths by shifting in the same direction at both ends of the temporal overlapping section for a densely packed pair of mobile robots.
19. In paragraph 18, A control method for a mobile robot, wherein when generating the above emergency detour route, an overlapping section on the station vector from the current location to the destination on the driving route of the densely packed mobile robot pair is set as an overlapping section, a virtual node is set within the overlapping section, and the emergency detour route is generated based on the virtual node.
20. In paragraph 18 or 19, A control method for a mobile robot that creates a general detour route or an emergency detour route excluding the narrow route when a narrow route exists within the overlapping section on the global map of the specific space.
Citation Information
Patent Citations
A multi robot system for avoding obstacle and a method using switching formation strategy for obstable avoidandce
KR101679482B1
Pet care room
KR1020230045282A
Modular radar forming a cooling structure and Phased-array antenna comprising the same
KR1020240057793A
Method and system for controlling multiple robots drving specific area
KR102462491B1
Robot-friendly building
KR102473630B1
