This planner attempts to find a legal place to put a carrot for the robot to follow. It does this by moving back along the vector between the robot and the goal point.
This package provides an implementation of a simple global planner for a mobile base. This planner computes a feasible carrot point to pass on to a local planner from a user-specified goal and obstacle information gleaned from a costmap.