Zeng, Bi
2DLIW-SLAM:2D LiDAR-Inertial-Wheel Odometry with Real-Time Loop Closure
Zhang, Bin, Peng, Zexin, Zeng, Bi, Lu, Junjie
Due to budgetary constraints, indoor navigation typically employs 2D LiDAR rather than 3D LiDAR. However, the utilization of 2D LiDAR in Simultaneous Localization And Mapping (SLAM) frequently encounters challenges related to motion degeneracy, particularly in geometrically similar environments. To address this problem, this paper proposes a robust, accurate, and multi-sensor-fused 2D LiDAR SLAM system specifically designed for indoor mobile robots. To commence, the original LiDAR data undergoes meticulous processing through point and line extraction. Leveraging the distinctive characteristics of indoor environments, line-line constraints are established to complement other sensor data effectively, thereby augmenting the overall robustness and precision of the system. Concurrently, a tightly-coupled front-end is created, integrating data from the 2D LiDAR, IMU, and wheel odometry, thus enabling real-time state estimation. Building upon this solid foundation, a novel global feature point matching-based loop closure detection algorithm is proposed. This algorithm proves highly effective in mitigating front-end accumulated errors and ultimately constructs a globally consistent map. The experimental results indicate that our system fully meets real-time requirements. When compared to Cartographer, our system not only exhibits lower trajectory errors but also demonstrates stronger robustness, particularly in degeneracy problem.
TMSTC*: A Turn-minimizing Algorithm For Multi-robot Coverage Path Planning
Lu, Junjie, Zeng, Bi, Tang, Jingtao, Lam, Tin Lun
Coverage path planning is a major application for mobile robots, which requires robots to move along a planned path to cover the entire map. For large-scale tasks, coverage path planning benefits greatly from multiple robots. In this paper, we describe Turn-minimizing Multirobot Spanning Tree Coverage Star(TMSTC*), an improved multirobot coverage path planning (mCPP) algorithm based on the MSTC*. Our algorithm partitions the map into minimum bricks as tree's branches and thereby transforms the problem into finding the maximum independent set of bipartite graph. We then connect bricks with greedy strategy to form a tree, aiming to reduce the number of turns of corresponding circumnavigating coverage path. Our experimental results show that our approach enables multiple robots to make fewer turns and thus complete terrain coverage tasks faster than other popular algorithms.
Joint Intent Detection and Slot Filling with Wheel-Graph Attention Networks
Wei, Pengfei, Zeng, Bi, Liao, Wenxiong
Multiple deep learning-based joint models have demonstrated excellent results on Table 1: An example with intent and slot annotation the two tasks. In this paper, we propose a new joint (BIO format), which indicates the slot of movie name model with a wheel-graph attention network (Wheel-from an utterance with an intent PlayMusic. GAT) which is able to model interrelated connections directly for intent detection and slot filling. To construct a graph structure for utterances, we create intent The SLU module takesuser utterance as input and performs nodes, slot nodes, and directed edges. Intent nodes three tasks: domain determination, intent detection, can provide utterance-level semantic information for and slot filling [11]. Among them, the first two slot filling, while slot nodes can also provide local keyword tasks are often framed as a classification problem, which information for intent. Experiments show that infers the domain or intent (from a predefined set of our model outperforms multiple baselines on two public candidates) based on the current user utterance [27].