This paper proposed a new approach for optimum path planning in 2D environments cluttered with static obstacles. The presented model consists of four steps.In the first step, the skeleton of free obstacles space is extracted. The thin lines are converted into a graph in the second step. the determination of shortest length trajectory is done in the third step. The last step is consacred to cons...

In this paper, the problem of finding the minimum cost flow line able to produce different products is considered. This problem can be formulated as a shortest path problem on an acyclic di-graph when the machines graph associated with each product family is a chain or a comb. These graphs are relevant in production planning when dealing with pipelined assembly systems. We solve the problem usi...

As road networks become increasingly congested, accurate information regarding their vulnerability to an amalgamation of situations becomes more vital. Understanding how accidents, routine closures (due to construction, public events, etc) and even premeditated attacks on individual arcs influence the road network may assist policy makers in decisions on network expansion or planning, helping t...

For real-world robotic systems, the ability to efficiently obtain motion plans of good quality over a diverse range of problems, is crucial. Large, dense motion-planning roadmaps can typically ensure the existence of such good quality solutions for most problems. This thesis proposes an algorithmic framework for anytime planning on large, dense motion-planning roadmaps. The size of the roadmap ...

Motion planning is a key element of robotics since it empowers a robot to navigate autonomously. Particle Swarm Optimization is a simple, yet a very powerful optimization technique which has been effectively used in many complex multi-dimensional optimization problems. This paper proposes a path planning algorithm based on particle swarm optimization for computing a shortest collision-free path...

When planning the structure of a backhaul mesh network for public access, it is common to introduce redundant nodes in the mesh network. These are called redundant, because they do not increase the network capacity under normal operation, due to the shortest-path metric of the routing protocol. Instead, their sole purpose is to increase the network reliability by providing failover links when a...

We present methods for extracting optimal paths from motion planning roadmaps. Our system enables any combination of optimization criteria, such as collision detection, kinematic/dynamic constraints, or minimum clearance, and relaxed definitions of the goal state, to be used when selecting paths from roadmaps. Our algorithm is an augmented version of Dijkstra’s shortest path algorithm which all...

we consider biobjective shortest path problems in networks with fuzzy arc lengths. considering the available studies for single objective shortest path problems in fuzzy networks, using a distance function for comparison of fuzzy numbers, we propose three approaches for solving the biobjective prob- lems. the rst and second approaches are extensions of the labeling method to solve the sing...

We describe an algorithm for stochastic path planning and applications to route planning in the presence of traffic delays. We improve on the prior state of the art by designing, analyzing, implementing, and evaluating data structures that answer approximate stochastic shortest-path queries. For example, our data structures can be used to efficiently compute paths that maximize the probability ...

In this paper we discuss the problem of planning safe paths amidst unpredictably moving obstacles in the plane. Given the initial positions and the maximal velocities of the moving obstacles, the regions that are possibly not collision-free are modeled by discs that grow over time. We present an approach to compute the shortest path between two points in the plane that avoids these growing disc...