This repository contains code to find a path between the start node and the goal node for a point robot using A* algorithm.
The action set for this project is:
where, L represents the step size.
The threshold distance to reach the goal node is 1.5 units without any constraint on the orientation.
- NumPy
- OpenCV
- queue
- math
- matplotlib
python A_star.py
Program accepts step size as input. Below output is for step size of 5.