Learn More
This paper presents a comparative study of three algorithms that use occupancy grid map of environments to find a path for a mobile robot from the given start to the goal &#x2014; the D<sup>&#x2217;</sup>, Two Way D<sup>&#x2217;</sup> (TWD<sup>&#x2217;</sup>) and E<sup>&#x2217;</sup>. All three algorithms have ability of dynamic replanning in case of(More)
  • 1