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...

We present an approximation method to compute geodesic distances on triangulated domains in the three dimensional space. Our particular approach is based on the Fast Marching Method for solving the Eikonal equation on triangular meshes. As such, the algorithm is a wavefront propagation method, a reminiscent of the Dijkstra algorithm which runs in O(n log n) steps.

We consider a continuous-space shortest path problem in a two-dimensional plane. This is the problem of finding a trajectory that starts at a given point, ends at the boundary of a compact set of <2, and minimizes a cost function of the form ∫ T 0 r(x(t))dt+ q(x(T )). For a discretized version of this problem, a Dijkstra-like method that requires one iteration per discretization point has been ...

We introduce the Targeted Multiobjective Dijkstra Algorithm (T-MDA), a label setting algorithm for One-to-One Shortest Path (MOSP) Problem. It is based on recently published (MDA) and equips it with A*-like techniques. For any explored subpath, MOSP decides whether subpath can be discarded or must stored as part of output. A major design choice how to store subpaths from moment they are first u...

ion Techniques: model-checking raised interest in techniques to abstract infinite to finite models. Provided that the abstraction has been proven sound, testing may be sufficient for establishing correctness [10, 18]. Systematic Testing: the discussion over test adequacy criteria [27], i. e. criteria solving the question “when did we test enough to meet a given test hypothesis,” led to more sys...

In order to make the network model was more fitting the actual condition of city traffic, this paper presents a dynamic transportation network model based on the traffic time division, and designs improved Dijkstra algorithm to solve the city traffic paths planning problem. Dijkstra algorithm is a typical singlesource shortest path algorithm is used to calculate a node to all other nodes in the...

The Dijkstra monad has been introduced recently for capturing weakest precondition computations within the context of program verification, supported by a theorem prover. Here we give a more general description of such Dijkstra monads in a categorical setting. We first elaborate the recently developed view on program semantics in terms of a triangle of computations, state transformers, and pred...