Multi-robot cooperative exploration method, storage medium and system
Through the multi-robot collaborative communication method, tasks are intelligently allocated, and the problem of insufficient task allocation in multi-robot collaborative exploration is solved, efficiency and system performance are improved, and global utility optimization is achieved.
Patent Information
- Application Number
- CN202410955326.3
- Authority / Receiving Office
- CN · China
- Patent Type
- Applications(China)
- Current Assignee / Owner
- Filing Date
- 2024-07-17
- Publication Date
- 2024-11-05
- Estimated Expiration
- 2044-07-17
AI Technical Summary
The existing technology is not intelligent enough in multi-robot collaborative exploration, resulting in intensive teams that cause overlap in tasks to reduce system resource utilization and efficiency. The sparse and scattered teams converge for too long in an uncontrollable environment, making it difficult to obtain system performance.
Through the multi-robot collaborative communication method, the interactive data information updates the local raster information and the front-line list, clusters the task sub-list, calculates the utility of each task allocation method based on the connection situation and location data distribution tasks, and selects the allocation method with the highest total utility. Deliver the task queue and adjust the height and position through the vision module and flight control module for automatic detection.
The task allocation efficiency and system performance of multi-robot collaborative exploration are improved, the problem of task overlap and convergence time is avoided, and global utility optimization is achieved.
Smart Images

Figure CN118897552A_ABST
Abstract
Description
Technical Field
[0001] The present application relates to the field of automation, and in particular to a method capable of enhancing multi-robot collaborative communication. Background Art
[0002] When using multiple robots for exploration, existing technologies can be divided into implicit collaboration and explicit collaboration. Implicit collaboration generally does not rely on communication connections, and mainly uses the robot's local perception capabilities such as light, pheromone concentration, and visual-based colors and QR codes to interact with the task environment or team members, and ultimately achieve collaboration. At the same time, the increase in team or cluster density will not cause communication interference and blockage. However, the implicit communication collaboration strategy emphasizes intensive and close-range interactions. In exploration and search tasks, the task overlap caused by intensive teams will reduce the utilization of system resources and task efficiency. In sparsely dispersed robot teams and uncontrollable task environments, this type of coordination mechanism will have the problem of long convergence time, making it difficult to obtain good system performance.
[0003] The problem with the current existing technical solutions is that they do not better solve the problem of task allocation in the process of multi-robot collaborative exploration. Summary of the invention
[0004] In view of the above problems, it is necessary to provide a method for allocating tasks in multi-robot collaborative communication to solve the problem that task allocation in the prior art is not intelligent enough. To achieve the above purpose, the inventor provides a multi-robot collaborative exploration method, which is suitable for task allocation of multiple connected robots that exist in a first network at the same time, including the following steps: multiple connected robots interact with first data information, and update the local grid information and local frontier list of each robot according to the interacted first data information; cluster the local frontier list to extract the local task sublist to be allocated; according to the connectivity between the first robot and several other robots and the position data of several other robots, the tasks in the local task sublist are distributed in the network, and the distribution specifically includes the steps of calculating the utility of all robots in the network that are distributed to the task in each task allocation method, selecting the allocation method with the highest total utility, and issuing each robot a respective task queue.
[0005] In some further embodiments, the utility includes energy utility and communication utility, the energy utility is related to the length of the planned path between the current robot and the task point position, and the communication utility depends on the optimal communication distance and the distance between the end points of each robot task.
[0006] In one embodiment of the present application, the method for calculating the communication utility includes the steps of: obtaining the optimal communication distance by testing whether the current communication packet loss rate is less than a threshold value, judging the number of connected robots after the first task assignment method is completed according to the position of each robot end point in the first task assignment method and the optimal communication distance, and determining the communication utility according to the number of connected robots after the first task assignment method is completed, and the communication utility is positively correlated with the number of connected robots after completion.
[0007] In one embodiment of the present application, the number of task queues of each robot in the network is set to 1.
[0008] Alternatively, the number of task queues is set to a first preset value greater than 1.
[0009] In one embodiment of the present application, the steps are also included:
[0010] Perform a reachability check on the task points in the assigned task list, and delete the unreachable task points in the task queue according to the local map of each robot.
[0011] If the task queue is empty after the deletion, a request is sent to all robots in the network to distribute the second priority task. If the task queue is still empty, the next update of the local frontier list is waited for.
[0012] In one embodiment of the present application, the steps are also included:
[0013] The second robot selects the task endpoint based on the second task queue it receives and the principle of optimal communication utility, and repeats the steps of inserting unassigned elements in the second task queue between the initial position and the task endpoint so that the communication utility of the inserted path is optimal, until all elements in the second task queue are assigned.
[0014] In one embodiment of the present application, the steps of: inserting unallocated elements in the second task queue at the initial position and the task end point so that the communication utility of the path after insertion is optimal; and repeating the verification step: if the difference in length between the path after insertion and the path before insertion exceeds a preset value, the element is not inserted and the planning is terminated.
[0015] In one embodiment of the present application, clustering the local frontier list and extracting the local task sublist to be assigned specifically includes the following steps:
[0016] Select several frontier points from the frontier point set as the initial cluster centers, and calculate the distance from each frontier point in the frontier point set to the initial cluster center; then assign the frontier points to the sets where the cluster centers are located to form multiple clusters, and update the cluster center of each cluster according to the frontier point subset in the cluster. Repeat the above assignment and update process until the cluster no longer changes; select the frontier point closest to the current cluster center from each cluster, and extract the local task sublist to be assigned.
[0017] A multi-robot collaborative exploration storage medium stores a computer program. When the computer program is executed, it executes the multi-robot collaborative exploration method as described above.
[0018] A multi-robot collaborative exploration system, comprising a plurality of connected robots in a first network, wherein the plurality of connected robots are used to exchange first data information, and update local grid information and a local frontier list of each robot according to the exchanged first data information;
[0019] A clustering module, the clustering module is used to cluster the local frontier list and extract a local task sublist to be assigned;
[0020] A distribution module is used to distribute the tasks in the local task sublist in the network according to the connectivity between the first robot and other robots and the location data of other robots. The distribution specifically includes the steps of calculating the utility of all robots in the network that are distributed to the tasks in each task distribution method, selecting the distribution method with the highest total utility, and issuing each robot its own task queue.
[0021] Different from the existing technology, the above technical solution can obtain the first image information through the visual module, and the processing module can analyze and determine the relative position of the detection device and the object to be inspected, so as to control the flight control module and adjust the height and horizontal position of the flight device in space, and finally achieve the technical effect of automatically adjusting the detection device to align with the object to be inspected.
[0022] The above-mentioned records related to the invention content are only an overview of the technical solution of the present application. In order to enable ordinary technicians in the field to more clearly understand the technical solution of the present application, and then implement it according to the text of the specification and the contents recorded in the drawings, and to make the above-mentioned purpose and other purposes, features and advantages of the present application easier to understand, the following is an explanation in combination with the specific implementation mode and drawings of the present application. BRIEF DESCRIPTION OF THE DRAWINGS
[0023] The drawings are only used to illustrate the principles, implementation methods, applications, characteristics and effects of the specific embodiments of the present application and other related contents, and shall not be considered as limitations of the present application.
[0024] In the drawings of the specification:
[0025] Figure 1 It is a flow chart of the multi-robot collaborative exploration method described in a specific implementation method;
[0026] Figure 2 It is a schematic diagram of the reachability inspection process described in the specific implementation method;
[0027] Figure 3 A multi-task greedy selection flow chart for joint utility optimization described in a specific implementation method;
[0028] Figure 4 It is a task insertion flow chart in the multi-task planning mode described in the specific implementation mode;
[0029] Figure 5 A diagram of a storage medium for multi-robot collaborative exploration as described in a specific implementation method;
[0030] Figure 6 This is a module diagram of a multi-robot collaborative exploration system according to a specific implementation method. DETAILED DESCRIPTION
[0031] In order to explain in detail the possible application scenarios, technical principles, specific schemes that can be implemented, and the purposes and effects that can be achieved, the following is a detailed description of the specific embodiments listed in conjunction with the accompanying drawings. The embodiments described herein are only used to more clearly illustrate the technical solutions of the present application, and are therefore only used as examples, and cannot be used to limit the scope of protection of the present application.
[0032] Reference to "embodiment" herein means that the specific features, structures or characteristics described in conjunction with the embodiment may be included in at least one embodiment of the present application. The term "embodiment" appearing in various places in the specification does not necessarily refer to the same embodiment, nor does it particularly limit its independence or association with other embodiments. In principle, in the present application, as long as there is no technical contradiction or conflict, the various technical features mentioned in the embodiments can be combined in any way to form a corresponding implementable technical solution.
[0033] Unless otherwise defined, the technical terms used in this document have the same meanings as those generally understood by those skilled in the art to which this application belongs; the use of relevant terms in this document is only for describing specific embodiments and is not intended to limit this application.
[0034] In the description of this application, the term "and / or" is an expression used to describe the logical relationship between objects, indicating that three relationships may exist, for example, A and / or B, which means: A exists, B exists, and A and B exist at the same time. In addition, the character " / " in this article generally indicates that the objects before and after are in an "or" logical relationship.
[0035] In the present application, terms such as “first” and “second” are merely used to distinguish one entity or operation from another entity or operation, and do not necessarily require or imply any actual relationship of quantity, priority or sequence between these entities or operations.
[0036] Without further limitations, in this application, the words "include", "comprises", "has" or other similar expressions used in the sentences are intended to cover non-exclusive inclusion. These expressions do not exclude the presence of additional elements in the process, method or product including the elements, so that the process, method or product including a series of elements may include not only those limited elements, but also other elements not explicitly listed, or also include elements inherent to such process, method or product.
[0037] Similar to the understanding in the Examination Guidelines, in this application, expressions such as "greater than", "less than", "exceed" and the like are understood to exclude the number itself; expressions such as "above", "below", "within" and the like are understood to include the number itself. In addition, in the description of the embodiments of this application, "multiple" means more than two (including two), and similar expressions related to "multiple" are also understood in this way, such as "multiple groups", "multiple times", etc., unless otherwise clearly and specifically limited.
[0038] In the description of the embodiments of the present application, space-related expressions used, such as "center", "longitudinal", "lateral", "length", "width", "thickness", "up", "down", "front", "back", "left", "right", "vertical", "horizontal", "vertical", "top", "bottom", "inside", "outside", "clockwise", "counterclockwise", "axial", "radial", "circumferential", etc., indicate the orientation or position relationship based on the orientation or position relationship shown in the specific embodiments or drawings, and are only for the convenience of describing the specific embodiments of the present application or facilitating the reader's understanding, and do not indicate or imply that the referred device or component must have a specific position, a specific orientation, or be constructed or operated in a specific orientation, and therefore cannot be understood as a limitation on the embodiments of the present application.
[0039] Unless otherwise expressly specified or limited, in the description of the embodiments of the present application, the terms such as "install", "connect", "connect", "fix", "set", etc. used should be understood in a broad sense. For example, the "connection" can be a fixed connection, a detachable connection, or an integrated setting; it can be a mechanical connection, an electrical connection, or a communication connection; it can be a direct connection, or it can be indirectly connected through an intermediate medium; it can be the internal connection of two elements or the interaction relationship between two elements. For technicians in the technical field to which the present application belongs, the specific meanings of the above terms in the embodiments of the present application can be understood according to the specific circumstances.
[0040] In this application, the electronic device can be a device with a processing unit such as a tablet, a mobile phone, a computer, or an electronic computing device with a PCB. It can also be an optional unit with a communication function, a camera function, etc.
[0041] In this application, a robot is an explorer for performing grid area exploration in a three-dimensional or two-dimensional space. It has the necessary information collection function, networking function, and information interaction function required for the information described below. The robot can be a mobile vehicle or flying component with autonomous action decision-making or semi-autonomous control, such as a drone in the prior art, which can be a remote-controlled flying device.
[0042] The network in this application may include a non-tangible signal transmission connection relationship, or may include one or more of several robots, servers, and forwarding nodes in the same signal connection transmission relationship (such as a local area network or a wide area network). The local in this application represents a preset storage location, storage method, etc. related to the current object and different from other objects.
[0043] In one embodiment of the present application, please refer to Figure 1 , is a collaborative exploration method for multiple connected robots in a first network, the method comprising the steps of, S1 exchanging first data information, and updating local grid information and local frontier list of each robot according to the interacted first data information;
[0044] S2 clusters the local frontier list and extracts the local task sublist to be assigned;
[0045] S3 distributes the tasks in the local task sublist in the network according to the connectivity between the first robot and several other robots and the location data of several other robots. The distribution specifically includes the steps of calculating the utility of all robots in the network that are distributed to the tasks in each task allocation method, selecting the allocation method with the highest total utility, and issuing each robot its own task queue.
[0046] Among them, the first network can be a local area network or a wide area network. Among the m robots exploring at the same time, even if only n robots (m>n) can be networked with each other, the method can be executed. The method can be a multi-center mode, or a preset robot in the first network can initiate step S1. Specifically, the first data information includes the robot's local grid information and local frontier list. The local grid information is the information for the grid pre-division of the explored environment and the exploration mark of the grid area in each environment. For example, the grid unit can be divided into an idle grid, an occupied grid, and an unknown grid. The idle grid represents the grid area without obstacles that has been explored during the task process, and is marked in white in the display of the task process; the occupied grid represents the grid area occupied by obstacles detected during the task process, and is marked in black in the display of the task process; the unknown grid represents the grid area that has not been explored at the current task time. The frontier is the boundary between the unexplored area and the explored area. The frontier point of this application is the nearest grid area adjacent to the explored area. The local frontier list can be a collection of localized frontier points. In some embodiments, the first data may also be a local communication subgraph, and the local communication subgraph is map information around the current position of the robot. The first data and the local communication subgraph can be sent to each robot in the first network through the cloud. The clustering method can use the commonly used point set clustering method, and through step S2, the positions where the unexplored areas are relatively dense can be screened out to achieve better exploration effects. Among them, distribution according to the position of the robot can be to sort the closest distance between the position of the robot and the frontier point, and then issue them in sequence. In a simple example, the utility can be defined as a negative correlation with the path of the current position and the frontier point position in the task, and the closer the utility, the higher the utility. When the optimal utility can be obtained by coordinating from the direction of the total network, the tasks of all robots are issued, and finally the technical effect of global utility optimization is achieved.
[0047] In one embodiment of the present application, the utility includes energy utility and communication utility, wherein the energy utility is related to the length of the planned path between the current robot and the task point position, and the communication utility depends on the optimal communication distance and the distance between the task endpoints of each robot. The planned path between the current robot and the task point position can be calculated according to the prior art, and the longer the length of the path, the lower the energy utility. The two can be negatively correlated, such as an inverse relationship, a negative exponential function, and the like. The communication utility can be set to be related to the maximum distance between the task endpoints of each robot, and the larger the distance between the task endpoints, the smaller the communication utility. It can also be set that after the distance between the task endpoints exceeds the optimal communication distance, the utility of the two is negatively correlated, and the communication utility decreases as the maximum distance between the task endpoints increases. In the optimal communication range, that is, when the maximum distance between the task endpoints of each robot is less than the optimal communication range, the communication utility is a preset constant.
[0048] The optimal communication distance can be obtained through preliminary experiments, or it can be set independently by personnel based on empiricism. In one embodiment of the present application, the method for calculating the communication utility includes the steps of: obtaining the optimal communication distance by testing whether the current communication packet loss rate is less than a threshold value, judging the number of connected robots after the first task assignment method is completed according to the position of each robot end point in the first task assignment method and the optimal communication distance, determining the communication utility according to the number of connected robots after the first task assignment method is completed, and the communication utility is positively correlated with the number of connected robots after completion. The more robots are connected after completion, the greater the communication utility. This method can be further expressed as: Communication utility function U C,i (T a , R) definition:
[0049]
[0050] Among them, near i Indicates execution of the current task queue T a Post Robot R i The number of connected robots at the location, γ c is the communication utility parameter, which is given by experience.
[0051] In one embodiment of the present application, a single-task mode design can also be performed, and the number of task queues of each robot in the network is set to 1. In the single-task mode, the efficiency of issuing tasks and the update frequency in the network can be improved. In some other embodiments, it can also be set to a multi-task mode, and the number of task queues is set to a first preset value greater than 1. In the multi-task mode, the number of task queues of the same robot is greater than 1, which can reduce the number of communications in the network and save channel resources. At the same time, in a task allocation cycle, the order of the task queues of each robot itself can also be locally optimized, so the efficiency of exploration can be further improved.
[0052] In one embodiment of the present application, the steps are also included: performing a reachability check on the task points in the assigned task list, deleting the unreachable task points in the task queue of each robot according to the local map of the robot, if the task queue is empty after deletion, sending a request to all robots in the network to distribute the next priority task, if the task queue is still empty, waiting for the next update of the local frontier list.
[0053] Specifically, Figure 2As shown in the figure, considering that the collaboration under the communication constraint environment is based on differential information, the traversable path planned based on the local map of the task distributor may fall into the unexplored area on the local map of the task receiver. Therefore, the current robot needs to perform a reachability check on the assigned task list before making a selection decision. The inspection step specifically includes deleting the unreachable task points in its assigned list. If it is empty after the inspection, it requests other connected members to distribute the secondary priority tasks and inspects again until it is not empty. If it is still empty after traversing all priorities, it is considered that the local frontier is basically explored and there are no suitable tasks at other robot members. At this time, the frontier points are extracted again by traversing the local map, and then the task distribution process is re-executed based on the new frontier information. Through the above process, the robot can be prevented from falling into the dilemma of being unreachable, and the task allocation mechanism of multi-task exploration can be further optimized.
[0054] In one embodiment of the present application, in the multi-task cooperation mode, a multi-task greedy selection process of joint utility optimization can also be performed. This process is specifically as follows Figure 3 As shown, the method further includes the step of selecting the task end point based on the communication utility optimization principle according to the second task queue received by the second robot, and repeating the step of inserting the unassigned elements in the second task queue between the initial position and the task end point so that the communication utility of the inserted path is optimal until all elements in the second task queue are assigned. Figure 4 ,definition For the allocation list T assign The number of task points in GetUc(T assign ) First, T assign The communication utility at each task point in the calculation is calculated, and the initialization plan is The set of plan queues Plan[k], which are initialized to T assign Each task point in is used as the planning list of the end point. assign ) has assigned an endpoint to each planning queue Plan[k]. In subsequent planning, we only need to continue planning 0 to N for Plan[k] based on the principle of sequential greedy selection. ass -1 mission point is enough.
[0055] Furthermore, in order to prevent some robots from falling into information islands, the steps can be repeated: inserting unassigned elements in the second task queue at the initial position and the task end point so that the communication utility of the inserted path is optimal; and repeating the verification step: if the difference in length between the intersecting path after insertion and the path before insertion exceeds a preset value, the element is not inserted and the planning is terminated. Figure 5 As shown in , the solution process for the task queue Plan[k] is a sequential greedy planning process with an unfixed number of selected tasks. Definition For the allocation list T assign The set of mission points that have not yet been selected, is the number of task points in this set. GetBestSelect(T assign , Plan[k]) in finding the optimal task selection T' assign [l], it is necessary to determine whether to insert and whether the planning is completed. The insertion selection process will be executed if and only if the length of the traversable path after insertion, pathLen(Plan[k]'), satisfies the following conditions:
[0056] pathLen(Plan[k]')<pathLen(Plan[k])+D TH
[0057] Among them, Plan[k]' represents the optimal task selection T' assign [l] The planning queue obtained after inserting Plan[k] according to its optimal insertion position, pathLen returns the length of the traversable path in the current planning queue, D TH The distance threshold for tolerating task insertion in the current planning queue is associated with the sensing capability of the robot members. Finally, after solving the optimal planning solution based on all task endpoints in Plan, the planning queue Plan[k] with the greatest task benefit is selected as T plan The above scheme can achieve that no matter how many robots there are in the system, they should try to spread in different directions during detection to improve the coverage rate per unit energy consumption, but at the same time, they should also try to avoid the generation of communication islands.
[0058] In a further embodiment, clustering the local frontier list and extracting the local task sublist to be assigned specifically includes the following steps: selecting a number of frontier points from the frontier point set as the initial cluster center, and calculating the distance from each frontier point in the frontier point set to the initial cluster center; then assigning the frontier points to the sets where the cluster centers are located to form multiple clusters, updating the cluster center of each cluster according to the frontier point subset in the cluster, and repeating the above assignment and update process until the cluster no longer changes; selecting the frontier point closest to the current cluster center from each cluster to extract the local task sublist to be assigned. The k-means algorithm is widely used as a simple and efficient classic clustering algorithm because it can be easily applied to the task abstraction scenario of micro-robots due to its relatively small computational complexity. At the same time, in this scenario, the determination of the value and the selection of the initial cluster center can be traced because of the semi-empirical nature of the definition of the frontier point and the setting of the candidate task point, which can avoid falling into the situation of local optimal solution.
[0059] In some further embodiments, a multi-robot collaborative exploration storage medium 50 is introduced, which stores a computer program. When the computer program is executed, the multi-robot collaborative exploration method described above is executed. Through the above storage medium, tasks of all robots can be issued, and the technical effect of global utility optimization is finally achieved.
[0060] Figure 6 In the embodiment shown, there is a multi-robot collaborative exploration system, including multiple connected robots in a first network, the multiple connected robots are used to exchange first data information, and update the local grid information and local frontier list of each robot according to the first data information; a clustering module, the clustering module is used to cluster the local frontier list and extract the local task sublist to be assigned; a distribution module, the distribution module is used to distribute the tasks in the local task sublist in the network according to the connectivity between the first robot and other robots and the position data of other robots, and the distribution specifically includes the steps of calculating the utility of all robots in the network that are assigned to the task in each task assignment method, selecting the assignment method with the highest total utility, and issuing each robot its own task queue. Through the above system design, the tasks of all robots are issued, and finally the technical effect of global utility optimization is achieved.
[0061] Finally, it should be noted that although the above embodiments have been described in the specification and drawings of this application, this does not limit the scope of patent protection of this application. All technical solutions generated by replacing or modifying equivalent structures or equivalent processes based on the essential concept of this application using the contents recorded in the specification and drawings of this application, as well as directly or indirectly implementing the technical solutions of the above embodiments in other related technical fields, are included in the scope of patent protection of this application.
Claims
1. A multi-robot collaborative exploration method, characterized in that: The method is applicable to task allocation for multiple connected robots existing in a first network at the same time, and comprises the following steps: A plurality of connected robots exchange first data information, and update local grid information and a local frontier list of each robot according to the exchanged first data information; Cluster the local frontier list and extract the sublist of local tasks to be assigned; According to the connectivity between the first robot and several other robots and the location data of several other robots, the tasks in the local task sublist are distributed in the network. The distribution specifically includes the steps of calculating the utility of all robots distributed to the tasks in the network in each task allocation method, selecting the allocation method with the highest total utility, and issuing each robot its own task queue.
2. The multi-robot collaborative exploration method according to claim 1, characterized in that: The utility includes energy utility and communication utility. The energy utility is related to the length of the planned path between the current robot and the task point position, and the communication utility depends on the optimal communication distance and the distance between the task endpoints of each robot.
3. The multi-robot collaborative exploration method according to claim 2, characterized in that: The method for calculating the communication utility includes the steps of: obtaining an optimal communication distance by testing whether a current communication packet loss rate is less than a threshold value; judging the number of connected robots after the first task assignment method is executed according to the position of each robot end point in the first task assignment method and the optimal communication distance; determining the communication utility according to the number of connected robots after the first task assignment method is executed, and the communication utility is positively correlated with the number of connected robots after completion.
4. The multi-robot collaborative exploration method according to claim 2, characterized in that: The number of task queues for each robot in the network is set to 1. Alternatively, the number of task queues is set to a first preset value greater than 1.
5. The multi-robot collaborative exploration method according to claim 2, characterized in that: Also includes the steps: Perform a reachability check on the task points in the assigned task list, and delete the unreachable task points in the task queue according to the local map of each robot. If the task queue is empty after the deletion, a request is sent to all robots in the network to distribute the second priority task. If the task queue is still empty, the next update of the local frontier list is waited for.
6. The multi-robot collaborative exploration method according to claim 1, characterized in that: Also includes the steps, The second robot selects the task endpoint based on the second task queue it receives and the communication utility optimization principle. Repeat the steps of inserting unallocated elements in the second task queue at the initial position and the task end point so that the communication utility of the inserted path is optimal, until all elements in the second task queue are allocated.
7. The multi-robot collaborative exploration method according to claim 6, characterized in that: Repeat the steps of: inserting unallocated elements in the second task queue at the initial position and the task end point so that the communication utility of the inserted path is optimal; and repeat the verification step: if the difference in length between the path after insertion and the path before insertion exceeds a preset value, the element is not inserted and the planning is terminated.
8. The multi-robot collaborative exploration method according to claim 1, characterized in that: Clustering the local frontier list and extracting the local task sublist to be assigned specifically includes the following steps: Select several frontier points from the frontier point set as the initial cluster centers, and calculate the distance from each frontier point in the frontier point set to the initial cluster center; then assign the frontier points to the sets where the cluster centers are located to form multiple clusters, and update the cluster center of each cluster according to the frontier point subset in the cluster. Repeat the above assignment and update process until the cluster no longer changes; select the frontier point closest to the current cluster center from each cluster, and extract the local task sublist to be assigned.
9. A multi-robot collaborative exploration storage medium, characterized in that: A computer program is stored, and when the computer program is executed, the multi-robot collaborative exploration method according to any one of claims 1 to 8 is executed.
10. A multi-robot collaborative exploration system, characterized in that: The method comprises a plurality of connected robots in a first network, wherein the plurality of connected robots are used to exchange first data information, and update local grid information and a local frontier list of each robot according to the exchanged first data information; A clustering module, the clustering module is used to cluster the local frontier list and extract a local task sublist to be assigned; A distribution module is used to distribute the tasks in the local task sublist in the network according to the connectivity between the first robot and other robots and the location data of other robots. The distribution specifically includes the steps of calculating the utility of all robots in the network that are distributed to the tasks in each task distribution method, selecting the distribution method with the highest total utility, and issuing each robot its own task queue.
Citation Information
Patent Citations
Mobile robot collaborative environment exploration method
CN114967694A
Robot control method and device and storage medium
CN116922371A
Multi-robot collaborative exploration method based on non-iterative interaction mechanism
CN118131777A
Dynamic multi-objective task allocation
US20180326583A1
Picking system including server for assigning task and robot for performing delivery according to assigned task
WO2024096183A1
Cited By
Multi-entity relative position determination method and device, equipment and medium
CN119594985A
