We investigate the uncertain versions of two classical combinatorial optimization problems, namely the Single-Pair Shortest Path Problem (SP-SPP) and the Single-Source Shortest Path Problem (SS-SPP). The former consists of finding a path of minimum length connecting two specific nodes in a finite directed graph G; the latter consists of finding the shortest paths from a fixed node to the remain...

There is vast amount of literature focusing on motion planning for general robots. However, the same studies for tethered robots have not been investigated much. While a robot navigates in an environment with obstacles, it may meet some problems, such as a lack of power supply, or losing its wireless communication connection. If a robot is attached to a flexible tether, it can obtain sufficient...

Given a set of n points on the plane colored with k ≤ n colors, the Trip Planning Problem asks for the shortest path visiting the k colors. It is a well-known NP-hard problem. We show that under some natural constraints on the path, the problem can be solved in polynomial time.

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

The bidirectional shortest path problem has important applications in VLSI floor planning and other areas. We introduce a new algorithm to solve bidirectional shortest path problems using parallel architectures provided by general purpose computing on graphics processing units. The algorithm performs parallel searches from the source and sink using Dijkstra’s classic approach modified with prun...

In this paper, Hop eld neural networks have been considered in solving tower of Hanoi test which is used in determining of de cit of planning capability of human prefrontal cortex. The main di erence of this work from the ones in the literature which use neural networks, is: The tower of Hanoi problem has been formulated here as a special shortest path problem. In the literature, some Hop eld n...

While the shortest path problem has myriad applications, the computational efficiency of suitable algorithms depends intimately on the underlying problem domain. In this paper, we focus on domains where evaluating the edge weight function dominates algorithm running time. Inspired by approaches in robotic motion planning, we define and investigate the Lazy Shortest Path class of algorithms whic...

In this paper path planning and obstacle avoidance for a statically stable biped robot using PRM and reinforcement learning is discussed. The main objective of the paper is to compare these two methods of path planning for applications involving a biped robot. The statically stable biped robot under consideration is a 4-degree of freedom walking robot that can follow any given trajectory on fla...

Motion planning of mobile robots is a complex problem. The complexity further increases when it comes to path planning in dynamic environments. This paper presents an algorithm for on-line path planning of mobile robots in unknown environments with moving obstacles. A mathematical model is established which considers all the current on-line information of robot as well as nearing obstacles. Par...