An implementation of the A* algorithm to find the shortest path between two points. Given a start and goal position, the robot computes a global path and moves node-to-node until reaching its final position.
Robotics · October 2020
A* Planning
Robotics · October 2020
An implementation of the A* algorithm to find the shortest path between two points. Given a start and goal position, the robot computes a global path and moves node-to-node until reaching its final position.