Fast Path Planning with Local Minima Avoidance using Dynamic Position Penalty Artificial Potential Fields (DPPAPF)

This Project was completed as part of my Research in the Kumar Robotics Lab at UPenn

We propose a novel Artifical Potential Field based Path Planning Algorithm

The proposed algorithm can be used in higher dimensional systems, and uses pseudo-stochastic smapling techniques

The algorithm introduces poitional penalties that penalize the agent for being stuck in local basins and consequently result in a dynamic change of optimization landscape