Implementation of a novel reactive navigation algorithm

In this project a reactive navigation algorithm is applied to a non-holonomic differential drive robot. The algorithm uses a stochastic process to navigate a robot through terrain while lacking a priori information. A graph is made from a random array of points that is used to connect the current location of the robot to its destination. Dijkstra's algorithm is used to select the shortest route that leads to the destination. The robot attempts to traverse this route until it detects that it is being blocked by an obstacle. The graph is then recreated with different random points, an a new route is calculated. This procedure is repeated until the robot arrives at its destination. This is tested by making a simulated robot with perfect localization travel through two kinds of environments. Processing speed is maintained by hashing location information according to its coordinates.