Give a robot a grid, some obstacles, a start point, and a goal — how does it find the shortest safe path? This project implements and compares two classic answers to that question: Dijkstra's ...
A Python-based 2D navigation simulator for a grid-world mobile robot. It plans collision-free paths with A* and Dijkstra, drives a simulated robot along them, and detects and replans around obstacles ...
Some results have been hidden because they may be inaccessible to you
Show inaccessible results