15 September 2022 in IEEE Transactions on Industrial Electronics
Autonomous robot exploration has received widespread attention as a crucial step in constructing maps for unknown environments. Among the research results in the field of robotic exploration, the boundary exploration algorithm based on rapidly exploring random tree (RRT) performs well in most scenarios, which guides the robot motion by taking the frontier with the maximum revenue value as the target point discretely. However, this discrete target selection scheme ignores the geometric continuity of the environment, and the robot often turns to another area before completing a geometrically continuous area (e.g., a complete room), which results in the disorderly motion of the robot and a relatively low exploration efficiency. This work proposes a heuristics biased sampling-based robot exploration strategy, which utilizes the semantic information of the environment as the heuristics to guide the robot exploration. First, a lightweight network model is proposed for heuristic object recognition. Second, a geometrically continuous region is estimated based on the heuristic object, and frontiers are then extracted in this region by using a biased sampling method. Finally, the heuristic information gain model is designed to determine the target frontier for the exploration, which instructs the robot to select the frontiers in the heuristic region with a higher priority. In this way, the robot can effectively use the heuristic knowledge of the environment to improve the efficiency of exploration. Compared with the RRT-based exploration methods in simulations and real-world environmental studies, and the experimental results prove the feasibility and effectiveness of our approach.
1 June 2022 in IEEE Transactions on Industrial Electronics
Rapidly exploring random tree and its applications for mobile robot navigation have attracted extensive interest in the human–robot interaction environment. However, most current sampling-based path planning algorithms are easy to fall into the trap space in complex and dynamic environments. In this article, a fast path planning algorithm based on Gaussian mixture model (GMM) is proposed to allow robotic systems to efficiently extract feature nodes and generate collision-free paths considering the pedestrian density and the environmental structure. First, the preliminary feature nodes are obtained by training GMM, in which the covariance matrix of each feature node contains the environmental structure information. Second, an online feature learning method is presented to extract features during the movement of the robot by the dual-channel scale filter and the secondary distance fusion. Once the obstacle-free grid points can be connected to the feature nodes without any collision, a heuristic path is generated directly to guide the robot to avoid the crowds according to the proposed pedestrian matrix. For the same environment, the learned information can be reused as prior knowledge in the next path planning to further improve the efficiency of path replanning. A series of experimental studies demonstrate that our proposed method can remarkably reduce the time taken to reach a goal and enhance the success rate of navigation in trapped and narrow environments.