Tingchen Ma
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Research Subjects
Tingchen Ma has a total of 7 co-authors. Here are the top co-authors by number of shared publications:
- Yongsheng Ou
Dalian University of Technology
2 shared publications - Chao Liu
Chinese Academy of Sciences
1 shared publication Guolai Jiang
Key Laboratory of Human-Machine Intelligence-Synergy Systems, Shenzhen Institutes of Advanced Technology, Chinese Academy of Sciences
1 shared publication- Lingxin Kong
Guangdong Provincial Key Laboratory of Robotics and Intelligent System, Shenzhen Institute of Advanced Technology, Chinese Academy of Sciences, Shenzhen 518055, China
1 shared publication - Sheng Xu
Guangdong Provincial Key Laboratory of Robotics and Intelligent System, Shenzhen Institutes of Advanced Technology, Chinese Academy of Sciences, Shenzhen, China
1 shared publication - Xinbo Ma
Key Laboratory of Human-Machine Intelligence-Synergy Systems, Shenzhen Institutes of Advanced Technology, Chinese Academy of Sciences
1 shared publication
Latest Publications
- Open Access
Accurate 3D LiDAR SLAM System Based on Hash Multi-Scale Map and Bidirectional Matching Algorithm
Simultaneous localization and mapping (SLAM) is a hot research area that is widely required in many robotics applications. In SLAM technology, it is essential to explore an accurate and efficient map model to represent the environment and develop the corresponding data association methods needed to achieve reliable matching from measurements to maps. These two key elements impact the working stability of the SLAM system, especially in complex scenarios. However, previous literature has not fully addressed the problems of efficient mapping and accurate data association. In this article, we propose a novel hash multi-scale (H-MS) map to ensure query efficiency with accurate modeling. In the proposed map, the inserted map point will simultaneously participate in modeling voxels of different scales in a voxel group, enabling the map to represent objects of different scales in the environment effectively. Meanwhile, the root node of the voxel group is saved to a hash table for efficient access. Secondly, considering the one-to-many (1 order of magnitude) high computational data association problem caused by maintaining multi-scale voxel landmarks simultaneously in the H-MS map, we further propose a bidirectional matching algorithm (MSBM). This algorithm utilizes forward–reverse–forward projection to balance the efficiency and accuracy problem. The proposed H-MS map and MSBM algorithm are integrated into a completed LiDAR SLAM (HMS-SLAM) system. Finally, we validated the proposed map model, matching algorithm, and integrated system on the public KITTI dataset. The experimental results show that, compared with the ikd tree map, the H-MS map model has higher insertion and deletion efficiency, both having time complexity. The computational efficiency and accuracy of the MSBM algorithm are better than that of the small-scale priority matching algorithm, and the computing speed of the MSBM achieves 49 ms/time under a single CPU thread. In addition, the HMS-SLAM system built in this article has also reached excellent performance in terms of mapping accuracy and memory usage.Open AccessAccurate 3D LiDAR SLAM System Based on Hash Multi-Scale Map and Bidirectional Matching Algorithm
Simultaneous localization and mapping (SLAM) is a hot research area that is widely required in many robotics applications. In SLAM technology, it is essential to explore an accurate and efficient map model to represent the environment and develop the corresponding data association methods needed to achieve reliable matching from measurements to maps. These two key elements impact the working stability of the SLAM system, especially in complex scenarios. However, previous literature has not fully addressed the problems of efficient mapping and accurate data association. In this article, we propose a novel hash multi-scale (H-MS) map to ensure query efficiency with accurate modeling. In the proposed map, the inserted map point will simultaneously participate in modeling voxels of different scales in a voxel group, enabling the map to represent objects of different scales in the environment effectively. Meanwhile, the root node of the voxel group is saved to a hash table for efficient access. Secondly, considering the one-to-many (1 order of magnitude) high computational data association problem caused by maintaining multi-scale voxel landmarks simultaneously in the H-MS map, we further propose a bidirectional matching algorithm (MSBM). This algorithm utilizes forward–reverse–forward projection to balance the efficiency and accuracy problem. The proposed H-MS map and MSBM algorithm are integrated into a completed LiDAR SLAM (HMS-SLAM) system. Finally, we validated the proposed map model, matching algorithm, and integrated system on the public KITTI dataset. The experimental results show that, compared with the ikd tree map, the H-MS map model has higher insertion and deletion efficiency, both having time complexity. The computational efficiency and accuracy of the MSBM algorithm are better than that of the small-scale priority matching algorithm, and the computing speed of the MSBM achieves 49 ms/time under a single CPU thread. In addition, the HMS-SLAM system built in this article has also reached excellent performance in terms of mapping accuracy and memory usage. - 15 July 2021
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 1213-1218
An Intelligent Speed-Suggestion Planner for Coverage Path with Multiple Constraints
In this paper, we consider various constraints to generate a recommended speed profile for the covered path of the mobile robot, and use the recommended speed profile as the control input to complete trajectory tracking. These speeds are affected by the constraints of the robot's kinematics and dynamics model and the constraints of the robot's environment. The speed planner is used in many scenarios of mobile robots, such as cleaning robots, disinfecting robots, etc., which can improve the safety and efficiency of tasks performed by robots. We introduce the commonly used traffic regulations in daily life into the generation of speed profile. In certain sections of highways or urban roads, there will be a road sign indicating the recommended speed of the section. And our paper is to generate the speed of each point for the given path as the recommended speed for the robot to drive for reference. We use a dynamic window method to update the current environment in real-time. And calculate the influence of the environment in the window on the current speed. Then we use a pure pursuit method to track the given path, and we define a safety cost function to express the safety of the trajectory. We demonstrated the efficiency and security of this method by using a simulation platform.
- 15 July 2021
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 1213-1218
An Intelligent Speed-Suggestion Planner for Coverage Path with Multiple Constraints
In this paper, we consider various constraints to generate a recommended speed profile for the covered path of the mobile robot, and use the recommended speed profile as the control input to complete trajectory tracking. These speeds are affected by the constraints of the robot's kinematics and dynamics model and the constraints of the robot's environment. The speed planner is used in many scenarios of mobile robots, such as cleaning robots, disinfecting robots, etc., which can improve the safety and efficiency of tasks performed by robots. We introduce the commonly used traffic regulations in daily life into the generation of speed profile. In certain sections of highways or urban roads, there will be a road sign indicating the recommended speed of the section. And our paper is to generate the speed of each point for the given path as the recommended speed for the robot to drive for reference. We use a dynamic window method to update the current environment in real-time. And calculate the influence of the environment in the window on the current speed. Then we use a pure pursuit method to track the given path, and we define a safety cost function to express the safety of the trajectory. We demonstrated the efficiency and security of this method by using a simulation platform.