I want to do path planning in dynamic environment in which obstacles keep changing. Could you suggest me good path planning algorithm for this? . Is D* algorithm suitable for me to achieve this in simulation?

  • $\begingroup$ D* is similar to A* very complicated to implement, I'd like to suggest an algorithm without any heuristics which is using the CPU with 100%. $\endgroup$ Jul 13 '19 at 18:01
  • $\begingroup$ So what are the algorithms you would suggest me for calculating shortest paths in dynamic environments other than D*? Is D* lite easy to implement?. Is Potential field Algorithm a right choice for calculating shortest path? $\endgroup$
    – Saad
    Jul 13 '19 at 23:00
  • $\begingroup$ If it's unclear which algorithm is the right one, a best practice method is to create a failed project. The idea is to show that D* isn't able to find the path for the robot because the map is too large. This creates a spot on the weakness. $\endgroup$ Jul 14 '19 at 8:00
  • $\begingroup$ VFH algorithm could do it! $\endgroup$
    – JJerome
    Jul 18 '19 at 3:18
  • $\begingroup$ Can shortest path be computed using potential field path planning algorithm? Or is it just for obstacle avoidance and navigative towards goal? As i studied potential field deals with attracrive/repulsive forces, its not for shortest path finding. $\endgroup$
    – Saad
    Jul 18 '19 at 19:14

Have you considered using the Vector Field Histogram (VFH) algorithm for path planning in an environment with dynamic obstacles?


Your Answer

By clicking “Post Your Answer”, you agree to our terms of service, privacy policy and cookie policy

Not the answer you're looking for? Browse other questions tagged or ask your own question.