Bidirectional A*

Motion planning algorithms for mobile robots in 2D environment

Bidirectional A*

Motion planning algorithms for mobile robots in 2D environment

Undergraduate Project Sep 2022 - Dec 2022

Table of Contents

Background

  • In this work, we will create different motion planning algorithms like Heuristic and Incremental Search based and Sampling based algorithms in a 2D environment for a point robot.

  • All the algorithms are implemented in python. The environment is implemented using a priority queue and is made effecient using the concept of OOPs.

  • Search Based Planning

    Anytime_Repairing Anytime Repairing A*

    Sampling Based Planning

    RRT_connect RRT Connect