Results 71 to 80 of about 391,490 (227)
Path planning algorithm for a car like robot based on Coronoi Diagram Method [PDF]
, 2013 The purpose of this study is to develop an efficient offline path planning algorithm that is capable of finding optimal collision-free paths from a starting point to a goal point. The algorithm is based on Voronoi diagram method for the environment
Inun, Haidie
core
Computing shortest paths in 2D and 3D memristive networks
, 2013 Global optimisation problems in networks often require shortest path length computations to determine the most efficient route. The simplest and most common problem with a shortest path solution is perhaps that of a traditional labyrinth or maze with a ...
Prodromakis, Themistoklis +2 more
core
MathematicsThe shortest path problem is fundamental in graph theory and has been studied extensively due to its practical importance. Despite this aspect, finding the shortest path between two nodes remains a significant challenge in many applications, as it often ...
Adrien Durand +3 more
doaj +1 more source
Shortest Path Network Interdiction With Goal Threshold
IEEE Access, 2018 Network defense and attack problems can be modeled as network interdictions. In this paper, we consider a new version of the network interdiction problem that optimizes the interdictor's resource consumption while limiting network capacities (e.g., the ...
Xiangyu Wei +4 more
doaj +1 more source
Rapid Generation of the Shortest Generalized Dubins Path in Forced Landing
International Journal of Applied Mathematics and Computer ScienceThis paper investigates the problem of rapid shortest path generation during an aircraft’s forced landing, where the heading angle of the target point is variable.
Tian Min +3 more
doaj +1 more source
Promet (Zagreb), 2014 In the field of geoinformation and transportation science, the shortest path is calculated on graph data mostly found in road and transportation networks. This data is often stored in various database systems.
Mario Miler +2 more
doaj +1 more source
Distributed algorithms from arboreal ants for the shortest path problem. [PDF]
Proc Natl Acad Sci U S A, 2023 Garg S +3 more
europepmc +1 more source
Metric Embedding via Shortest Path Decompositions
, 2019 We study the problem of embedding shortest-path metrics of weighted graphs into $\ell_p$ spaces. We introduce a new embedding technique based on low-depth decompositions of a graph via shortest paths.
Abraham, Ittai +3 more
core
SPAGAN: Shortest Path Graph Attention Network [PDF]
, 2019 Yiding Yang +4 more
openalex +1 more source
Acceleration of Shortest Path and Constrained Shortest Path Computation [PDF]
, 2005 We study acceleration methods for point-to-point shortest path and constrained shortest path computations in directed graphs, in particular in road and railroad networks. Our acceleration methods are allowed to use a preprocessing of the network data to create auxiliary information which is then used to speed-up shortest path queries.
Ekkehard Köhler +2 more
openaire +1 more source