Optimal path planning using bidirectional rapidly-exploring random tree star-dynamic window approach (BRRT*-DWA) with adaptive Monte Carlo localization (AMCL) for mobile robot

Abstract

Abstract Path planning is an important task for mobileF service robots. Most of the available path-planning algorithms are applicable only in static environments. Achieving path planning becomes a difficult task in an unknown, dynamic environment. To solve the path planning problem in an unknown dynamic environment, this paper proposes a Bidirectional Rapidly-exploring Random Tree Star-Dynamic Window Approach (BRRT*-DWA) algorithm with Adaptive Monte Carlo Localization (AMCL). Bidirectional Rapidly-exploring Random Tree Star(BRRT*) is used to generate an optimal global path plan, Dynamic Window Approach(DWA) is a local planner and Adaptive Monte Carlo Localization(AMCL) is used as a localization technique. The robot can navigate using the map file of the unknown environment created by Simultaneous Localization And Mapping (SLAM) and the data from the Light Detection and Ranging (LiDAR) sensor while avoiding dynamic and static obstacles. In addition, the object identification algorithm You Only Look Once (YOLO) was adopted, trained, and used for the robot to recognize objects and people. Results obtained from both simulation and experiment show the proposed method can achieve better performance in a dynamic environment compared with other state-of-the-art algorithms.