What are the simple local planner algorithms which satisfies following conditions?

asked 2018-05-22 21:06:04 -0600

malgudi gravatar image

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.

edit retag flag offensive close merge delete


have you found a solution to this?

aarontan gravatar imageaarontan ( 2018-06-07 14:39:49 -0600 )edit