Autonomous motion planning addresses the problem of nding collision-free paths for moving objects robots among obstacles. In this report we consider robots operating in workspaces occupied by stationary, completely known obstacles. We describe a new approach to probabilistic roadmap planners (PRMs). The overall theme of the algorithm, called Lazy PRM, is to minimise the number of collision chec...

We propose a planning model for multiple products manufactured across multiple manufacturing facilities sharing similar production capabilities. The need for crossfacility capacity management is most evident in high-tech industries that have capitalintensive equipment and short technology life cycle. Our model is based on an emerging practice in these industries where product managers from busi...

As for the limitations of algorithms in global path planning of mobile robot at present, this study applies the improved simulated annealing algorithm artificial neural networks to path planning of mobile robot in order to better the weaknesses of great scale of iteration computation and slow convergence, since the best-reserved simulated annealing algorithm was introduced and it was effectivel...

The standard shortest path planning problem determines a collision-free path of shortest distance between two distinct locations in an environment scattered with obstacles. This problem, in fact, corresponds to a special case of the weighted region problem, in which the environment is partitioned into a set of regions, with some regions (obstacles) having an associated weight of 1 while other r...

In this paper, we formulate a novel problem called Which-Edge question on shortest path queries. Specifically, this problem aims to find k edges that minimize the total distance for a given set of shortest path queries on a graph. This problem has important applications in logistics, urban planning, and network planning. We show the NP-hardness of the problem, as well as present efficient algor...

A new path planning method for Mobile Robots (MR) has been developed and implemented. On the one hand, based on the shortest path from the start point to the goal point, this path planner can choose the best moving directions of the MR, which helps to reach the target point as soon as possible. On the other hand, with an intelligent obstacle avoidance, our method can find th...

We consider a generalization of the shortest-path problem: given an alphabet Σ, a graph G whose edges are weighted and Σ-labeled, and a regular language L ⊆ Σ∗, the L-constrained shortest-path problem consists of finding a shortest path p in G such that the concatenated labels along p form a word of L. This definition allows to model, e. g., many traffic-planning problems. We present extensions...

In this paper, we present an obstacle avoiding path planning method based on Voronoi diagram and composite Bezier curve algorithm which obtains the shortest path length. In our algorithm, a Voronoi diagram is constructed according to the global environment. The piecewise linear rough path in the Voronoi diagram which keeps away from the obstacles is obtained by performing Dijkstra’s shortest pa...

Given a communication network or a road network one of the most natural algorithmic question is how to determine the shortest path from one point to another. In this paper we deal with one of the most fundamental problems of Graph Theory, the All Pairs Shortest Path (APSP) problem. We study three algorithms namely The FloydWarshall algorithm, APSP via Matrix Multiplication and the Johnson’s alg...

we give an algorithm, called t*, for finding the k shortest simplepaths connecting a certain pair of nodes, s and t, in a acyclic digraph.first the nodes of the graph are labeled according to the topologicalordering. then for node i an ordered list of simple s − i paths iscreated. the length of the list is at most k and it is created by usingtournament trees. we prove the correctness of t* and ...