The Scholten/Dijkstra “Pebble Game” is re-examined. We show that the algorithm lends itself to a distributed as well as an online version, and even to a reversed variant. Technically this is achieved by exploiting the local and the reversible nature of Petri Net transitions. Furthermore, these properties allow to retain the verification arguments of the algorithm.

Trajectory modeling is foundational for 4D-Route modeling, conflict detection and air traffic flow management. This paper proposes a novel algorithm based Vincenty’s fomulas for trajectory calculation, combined with the Dijkstra algorithm and Vincenty’s formulas. Using flight plan simulations our experimental results show that our method of En-route trajectory calculation exhibits much improved...

Core setting region could facilitate disaster relief and strength communication among setting regions when emergent disaster happens. Shortest path search algorithms could be applied. Dijkstra algorithm is discussed and is improved to solve the confirmation of core setting region. It ensures that the core setting region is the nearest to the farthest region. The improved algorithm turns out to ...

In this paper, we address a shortest path problem where an autonomous vehicle moves on a polyhedral surface according to a distance function that depends on the direction of the movement (directional) and on the friction of the space (frictional). This shortest path problem generalizes a hierarchy of problems and finds geometric structure to solve several proximity problems. We perform the char...

We present a technique for reducing the number of edge scans performed by Dijkstra’s algorithm for computing all pairs shortest paths. The main idea is to restrict path scanning only to locally shortest paths, i.e., paths whose proper subpaths are shortest paths. On a directed graph with n vertices and m edges, the technique we discuss allows it to reduce the number of edge scans from O(mn) to ...

Dijkstra’s Algorithm is used to find the shortest path from one node to another node in a graph.Dijkstra’s algorithm is also known as a single source shortest path algorithm. It is applied only on positive weights. In this paper, Global Positioning System is used for adding a new functionality in Dijkstra’s algorithm. In this paper, using Global Positioning System the position parameter is adde...

This paper first represent the basic conceptions of anonymous communication, then introduce the fundamentals in Anonymous Communication. Afterwards, we went deep to the classification of anonymous network topological, therefore we could get a better understanding on P2P anonymous communication system. We also systematically analyzes the existing node-select algorithms. Furthermore, we propose a...

This paper presents a new method for finding the node-disjoint paths with maximum combined bandwidth in communication networks. This problem is an NP-complete problem which can be optimally solved in exponential time using integer linear programming (ILP). The presented method uses a maximum-cost variant of Dijkstra algorithm and a virtual-node representation to obtain the maximum-bandwidth nod...