The problem of updating shortest paths in networks whose topology dynamically changes over time is a core functionality of many nowadays networked systems. In fact, the problem finds application in many real-world scenarios such as Internet routing and route planning in road networks. In these scenarios, shortest-path data are stored in different ways and have to be updated whenever the underly...

This paper presents a WDM (Wavelength Division Multiplex) mesh network planning and designing that satisfies given demands and a restoration approach. This restoration approach is based on the network traffic rearrangement by all source and destination nodes with the shortest path algorithm ignoring the failed link and when a link has inadequate capacity, the problem is solved by both nodes of ...

Grids are often used to represent maps in video games. In this paper, we propose a method for preprocessing eightneighbor grids to generate subgoal graphs and show how subgoal graphs can be used to find shortest paths fast. We place subgoals at the corners of obstacles (similar to visibility graphs) and add those edges between subgoals that are necessary for finding shortest paths, while ensuri...

Mobile robot global path planning in a static environment is an important problem all along. The paper proposes a method of global path planning based on neural network and genetic algorithm. The neural network model of environmental information in the workspace for a robot is constructed. Using this model, the relationship between a collision avoidance path and the output of the model is estab...

This paper examines path planning strategies in partially unknown dynamic environemnts and introduces an approach to learning innovative routes. The approach is verified against shortest path planning with a distance transform algorithm, local and global replanning and suboptimal route following in unknown, partially unknown, static and dynamic environments. We show that the learned routes are ...

Finding single pair shortest paths on surface is a fundamental problem in various domains, like Geographic Information Systems (GIS) 3D applications, robotic path planning system, and surface nearest neighbor query in spatial database, etc. Currently, to solve the problem, existing algorithms must traverse the entire polyhedral surface. With the rapid advance in areas like Global Positioning Sy...

Motivated by what is required for real-time path planning, the paper starts out by presenting RMPD, a new recursive “local” planner founded on the key notion that, unless made necessary by an obstacle, there must be no deviation from the shortest path between any two points, which would normally be a straight line path in the configuration space. Subsequently, we increase the power of RMPD by i...

Grids with blocked and unblocked cells are often used to represent continuous 2D and 3D environments in robotics and video games. The shortest paths formed by the edges of 8neighbor 2D grids can be up to ≈ 8% longer than the shortest paths in the continuous environment. Theta* typically finds much shorter paths than that by propagating information along graph edges (to achieve short runtimes) w...

The contribution of the paper is a high performance pathplanning algorithm designed to be used within a multi-agent planning framework solving a UAV collision avoidance problem. Due to the lack of benchmark examples and available algorithms for 3D+time planning, the algorithm performance has been compared in the classical domain of path planning in grids with blocked and unblocked cells. The Ac...