Much has been written on shortest path problems with weight, or resource, constraints. However, relatively little of it has provided systematic computational comparisons for a representative selection of algorithms. Furthermore, there has been almost no work showing numerical performance of scaling algorithms, although worst-case complexity guarantees for these are well known, nor has the effec...

In this lecture, we will further examine shortest path algorithms. We will first revisit Dijkstra’s algorithm and prove its correctness. Next, we will look at another shortest path algorithm known as the Bellman-Ford algorithm, that has a slower running time than Dijkstra’s but allows us to compute shortest paths on graphs with negative edge weights. Lastly, we look at an O(n3)-time algorithm f...

The Inverse Shortest Path (ISP) problem has recently been considered for applications involving the precise determination of unknown path costs, given only limited experts' knowledge of some shortest paths. Unlike previous approaches which are usually restrictive (such as the minimum change requirement) and algorithmically complicated, a more general but simple optimization scheme based on embe...

There exit several high speed computation applications that requires minimum distance computation between nodes in weighted graph. Dedicated techniques exist for this purpose are called as shortest path computation. Depending upon need of application, there are three type of shortest path problems; Single Source Shortest Path (SSSP), Single Destination Shortest Path (SDSP) and All Pair Shortest...

In this paper, we present an approach for user assisted segmentation of lumen border in OCT images. This interactive segmentation is performed by a combination of point based soft constraint on object boundary and stroke based regional constraint. The edge based boundary constraint is imposed through searching the shortest path in a three-dimensional graph, derived from a multi-layer image repr...

A new global path planning approach based on particle swarm optimization (PSO) for a mobile robot in a static environment is presented. Consider path planning as an optimization problem with constraints. The constraints are the path can not pass by the obstacles. The optimization target is the path is shortest. The obstacles in the robot’s environment are described as polygons and the vertexes ...

We have designed a two-stage scheme to consider the trajectory planning problem of two mobile manipulators for cooperative transportation of a rigid body in the presence of static obstacles. In the first stage, with regard to the static obstacles, we develop a method that searches the workspace for the shortest possible path between the start and goal configurations, by constructing a graph on ...

in this paper we introduce an improvement in the path planning algorithm for the humanoid soccer playing robot which uses ferguson splines and pso (particle swarm optimization). the objective of the algorithm is to find a path through other playing robots to the ball, which should be as short as possible and also safe enough. ferguson splines create preliminary paths using random generated para...

Rational choice when preferences are not required to be transitive and complete has been discussed in the literature for years. In this article transitivity and completeness of the preference relation is also not assumed. It will be shown that nevertheless the existence of a competitive equilibrium can be proven when those properties are replaced by a domination property which allows that there...