Abstract: Finding a shortest path from an arbitrarily selected initial position to a single goal position is very useful in some domains, such as in partially-known environments or control many ...

Abstract: We present an optimal and efficient algorithm for finding a shortest path in an elastic optical network. The algorithm is an adaptation of the Dijkstra shortest path algorithm, where we take ...