Home /Research /Solving Optimal Path Planning Problem of an Intelligent Mobile Robot in Dynamic Environment Using Bidirectional Rapidly-exploring Random Tree Star-Dynamic Window Approach (BRRT*-DWA) with Adaptive Monte Carlo Localization (AMCL)
OTHER

Solving Optimal Path Planning Problem of an Intelligent Mobile Robot in Dynamic Environment Using Bidirectional Rapidly-exploring Random Tree Star-Dynamic Window Approach (BRRT*-DWA) with Adaptive Monte Carlo Localization (AMCL)

Muluken Menebo, Lebsework Negash, Chala Merga Abdissa

Year
2023
Citations
3
Access
Open access

Abstract

To solve the problem of path planning in unknown dynamic environment, this paper proposes BRRT*-DWA algorithm with Adaptive Monte Carlo Localization. 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.

Keywords

Monte Carlo methodPath (computing)Motion planningWindow (computing)Tree (set theory)Computer scienceMathematical optimizationPlannerMonte Carlo tree searchStar (game theory)

Related papers

Browse all OTHER papers