A-Star Path Planning (Making Obstacle and Random Obstacle)

A-Star (A*) Path Planning is a widely used algorithm for finding the shortest path between two points in a grid while avoiding obstacles.

A-Star (A*) Path Planning is a widely used algorithm for finding the shortest path between two points in a grid while avoiding obstacles. It combines the advantages of Dijkstra's algorithm and a heuristic approach, making it efficient for many robotics and navigation applications

1. Grid Initialization:

• Create a grid that represents the environment. Each cell in the grid can either be free (traversable) or occupied (an obstacle).
• Define the start and goal positions in the grid.

2. Obstacle Creation:

• Manual Obstacles: Specify cells in the grid as obstacles by marking them as "occupied."
• Random Obstacles: Generate obstacles randomly by selecting cells in the grid based on a probability or specific criteria.