What are the simple local planner algorithms which satisfies following conditions?
I have a requirement to write a local planner which only follows global planner path. It does not find any alternate path/route when it encounters the dynamic obstacle instead it waits until the obstacle moves away and again start continuing on the global path. Thank you.
have you found a solution to this?