Laplacian Path Planning: Implementation and Generalizations
Fei Yang, Kartik B. Ariyur · Infotech@Aerospace 2011 · 2011
This paper implements the Laplacian Path Planning with inner boundaries using Multigrid algorithm. This algorithm can mostly give a satisfactory numerical solution with 10 iterations on each level and also guarantees a path avoiding any obstacle to the destination. This paper also uses this path planning method to simulate the behaviour of the foraging of sh. Finally a simple way to avoid the moving obstacles is introduced here.