This paper presents the application of the PPQ Dijkstra approach for solving 2D path planning problems. The approach is a Dijkstra process whose priority queue (PQ) is implemented through a Pseudo Priority Queue (PPQ) also known as Untidy PQ. The performance of the optimization process is dramatically improved by the application of the PPQ. This modification can be used for a family of problems. The path planning problem belongs to the family of feasible problems that can be solved by considering PPQ-Dijkstra approach. The solution provided by the PPQDijkstra algorithm is optimal, i.e. it is identical to the solution obtained through the standard Dijkstra algorithm. The PPQ-Dijkstra algorithm can be also applied for higher dimensionality problems such as non-holonomic planning processes, e.g. involving configuration spaces of higher dimension.
[1]
Josef Stoer,et al.
Numerische Mathematik 1
,
1989
.
[2]
J A Sethian,et al.
A fast marching level set method for monotonically advancing fronts.
,
1996,
Proceedings of the National Academy of Sciences of the United States of America.
[3]
Edsger W. Dijkstra,et al.
A note on two problems in connexion with graphs
,
1959,
Numerische Mathematik.
[4]
Jose Guivant,et al.
Pseudo Priority Queues for Real-Time Performance on Dynamic Programming Processes Applied to Path Planning
,
2008
.
[5]
Guillermo Sapiro,et al.
O(N) implementation of the fast marching algorithm
,
2006,
Journal of Computational Physics.