Guard Dog Robot Project

While rewriting my A* implementation I seem to have broken something and it since returns successful paths , but not the shortest successful paths!
( Although the route compression that is performed from the motors , corrects them [ the straight red line ] )

i.e

Continuing with a fix!