首页 /研究 /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

发表年份
2023
引用次数
3
访问权限
开放获取

摘要

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.

关键词

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

相关论文

查看 OTHER 分类全部论文