A Study of the Global Topological Map Construction Algorithm Based on Grid Map Representation for Multirobot

In some large environments where humans and machines coexist, such as smart factories, restaurants, and hotels, multiple mobile robots system have certain advantages over single mobile robot in terms of task complexity, execution efficiency, and system robustness. However, path conflicts and blockages may occur among robots without effective global coordination method, especially in some special areas like narrow straight roads (N-S-R) and crossroads (C-R). To solve this problem, using the global topology map might be a good solution. Therefore, this paper proposes a method called Surplus Topology Generation Algorithm (STGA) for constructing a global topological map based on grid map representation. On the basis of grid maps, we designed Node-Filter to generate enough topological nodes, and simplified the node set by Node-Selection. In special areas such as N-S-R and C-R, which are prone to path conflicts and blocking scenarios, we extracted the Harris corner point and combined them to select the corner point combinations that characterize some special features like passage entrance, etc. Then, feature nodes that can characterize the special features were obtained by establishing mapping relationships between nodes and corner point combinations. Finally, the global topology map was obtained after establishing the reachability relationships between nodes. The simulation experiment results showed that the topological maps generated by STGA had obvious advantages in the richness of topological relationships. Besides, the topological maps also showed certain advantages compared to grid maps for the planning efficiency and security of global paths. Furthermore, the rich topological nodes on the global topological map were feasible in solving path conflicts of multiple robots. Note to Practitioners-Multi-robot system has better efficiency and system robustness, but how to solve the path conflicts among robots is a problem. We propose a method to solve multi-robot conflicts with global topological maps. This topological map is constructed by STGA. The grid map environment is discretized into a set of topological nodes, which have been used to maintain the spatial transitions of each robot in the environment. When robots encounter unavoidable path conflicts, they are scheduled with the help of topological nodes to achieve orderly and efficient collaboration.