A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
Filters
Surface Optimal Path Planning Using An Extended Dijkstra Algorithm
2020
IEEE Access
Preserved Fulltext
., wild ground, planet ground, and game scene) need to solve the optimal surface path. This paper proposes an extended Dijkstra algorithm. ...
The simulation results show that, compared with the traditional Dijkstra algorithm, this method improves the accuracy of the surface optimization path in single-robot single-target and multi-robot multi-target ...
The A* algorithm is based on a reasonable selection of heuristic functions, and the search time for the shortest path is shorter than the traditional Dijkstra algorithm. ...
doi:10.1109/access.2020.3015976
fatcat:lrpav4br7jfthdbeotwwgx25p4
Comparative Analysis of Pathfinding Algorithms A *, Dijkstra, and BFS on Maze Runner Game
2018
IJISTECH (International Journal Of Information System & Technology)
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2018; you can also visit the original URL.
The file type is application/pdf.
This study compared pathfinding algorithms A *, Dijkstra, and Breadth First Search (BFS) in the Maze Runner game. ...
Maze Runner game is a game that requires pathfinding algorithm to get to the destination with the shortest path. This algorithm is used in an NPC that will move from start node to destination node. ...
The computational process needed for A* algorithm is less than Dijkstra and BFS algorithms with 415 blocks. Both Dijkstra and BFS algorithms extend 618 blocks to search for the shortest path. ...
doi:10.30645/ijistech.v1i2.7
fatcat:2isqit67cvfxxkqkqjsy3diyle
Greedy, A-Star, and Dijkstra's Algorithms in Finding Shortest Path
2021
International Journal of Advances in Data and Information Systems
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2021; you can also visit the original URL.
The file type is application/pdf.
The purpose of this study is to analyze the Greedy, A-Star, and Dijkstra algorithms in the process of finding the shortest path. ...
From the results of the research conducted, the author can conclude that the Greedy, A-Star, and Dijkstra algorithms can be a solution in determining the shortest path in a path or graph with different ...
In his research extending the famous shortest path algorithm to consider edge weights and node weights for graphs derived from SDN topology, the Dijkstra algorithm is applied in extended pyretics [9] ...
doi:10.25008/ijadis.v2i1.1206
fatcat:gd4hskexwfha5h6mxfzegluzoi
Improvement and Application of Dijkstra Algorithms
2022
Academic Journal of Computing & Information Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2022; you can also visit the original URL.
The file type is application/pdf.
By comparing the calculation results with the complexity of the traditional algorithm, the effectiveness of the improved method is proved, the complexity of the algorithm is reduced, and the actual work ...
It improves the application ability and realizability of Dijkstra algorithm in practical problems. ...
V1 is the shortest for labeling, and then V1 is the origin, and then a circle is drawn to find the next closest point for labeling. Until the end node, find the shortest path. ...
doi:10.25236/ajcis.2022.050513
fatcat:mclbh46nsjbezg7w5fhkk3hmzq
Acceleration of Shortest Path and Constrained Shortest Path Computation
[chapter]
2005
Lecture Notes in Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
We focus on two methods based on Dijkstra's algorithm for shortest path computations and two methods based on a generalized version of Dijkstra for constrained shortest paths. ...
This combination narrows down the search space of Dijkstra's algorithm to almost the size of the corresponding shortest path for long distance shortest path queries. ...
We would like to thank Benjamin Wardemann and Ronald Wotzlaw for their help with the implementation and the group of Dorothea Wagner at the University of Karlsruhe and the group of Kai Nagel at ETH Zurich ...
doi:10.1007/11427186_13
fatcat:oru4wzq7sjepbjhrvhngdzv7f4
Research of Improved Shortest Path Algorithm in Campus GIS
2015
Open Cybernetics and Systemics Journal
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2018; you can also visit the original URL.
The file type is application/pdf.
The experimental results show that, compared with Dijkstra and A* algorithm, bi-directional A* algorithm is the fastest in the search, even when the vertex number large, it also can compute well. © Zhang ...
In searching of campus geographic information system, the shortest path is always the key and its efficiency which determines the quality of the service of the digital campus directly. ...
RELATED THEORY FOR THE SHORTEST PATH ALGORITHM
Dijkstra Algorithm Dijkstra algorithm [6, 7] mainly solves the problem of finding the shortest path from a point in a graph (the source) to a destination ...
doi:10.2174/1874110x01509011060
fatcat:rkiwbwgfnvcchm3n4a24in4lvi
Implementation of Dijkstra's Algorithm in the Shortest Route
2019
Scholars Bulletin
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
The dijkstra algorithm is one of the algorithms for determining the shortest route from one tourist attraction to another. ...
One of them is the creation of the website-based shortest route search destination search application with a mobile friendly display. ...
Dijkstra algorithm used the method of increasing node by node to get a shortest path tree which makes the starting point as its root [8] ". ...
doi:10.36348/sb.2019.v05i12.001
fatcat:w7yeecm5bzbwdofkyd5yvd6stq
Path Planning on Quadric Surfaces and Its Application
[chapter]
2018
Advanced Path Planning for Mobile Entities
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
In this chapter, recent near-shortest path-planning algorithms with O(nlog n) in the quadric plane based on the Delaunay triangulation, Ahuja-Dijkstra algorithm, and ridge points are reviewed. ...
Notably, these methods based on Delaunay triangulation concept are ideal for being extended to solve the path-planning problem on the Quadric surface or even the cruise missile mission planning and Mars ...
[11] proposed an O(n 2 log n) algorithm for propagating the shortest path map over a surface by a continuous Dijkstra method for general polyhedron. ...
doi:10.5772/intechopen.72573
fatcat:eb2tjxomvnhs5ayl62z73ntz4i
Enhanced A∗ algorithms for multiple alignments: optimal alignments for several sequences and k-opt approximate alignments for large cases
1999
Theoretical Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
This is established by generalizing the above A* search approach. ...
On the other hand, this problem corresponds to the shortest path problem and the A* algorithm, which can efficiently find the shortest path with an estimator, is usable. ...
Acknowledgements The work of the second author was supported in part by the Grant-in-Aid for Priority Areas 'Genome Science' of the Ministry of Education, Science, Sports and Culture of Japan. ...
doi:10.1016/s0304-3975(98)00093-0
fatcat:3vgholv7gvhxfpnterjwiegnyu
Concepts of Exact QoS Routing Algorithms
2004
IEEE/ACM Transactions on Networking
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
We show that these four concepts, namely 1) nonlinear definition of the path length; 2) a -shortest path approach; 3) nondominance; and 4) look-ahead, are fundamental building blocks of a multiconstrained ...
Third, by simply restricting the number of paths explored during the path computation, the computational complexity can be decreased at the expense of possibly loosing exactness. ...
The Dijkstra algorithm applied to the reduced graph will return a "shortest" path that minimizes defined by (3). ...
doi:10.1109/tnet.2004.836112
fatcat:ufvjoideejbk5gp5mrunysgddu
RimJump: Edge-based Shortest Path Planning for a 2D Map
2018
Robotica (Cambridge. Print)
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
So we proposed RimJump to solve the above problem, and it is a new path planning method that generates the strict shortest path for a 2D map. ...
SummaryPath planning under 2D map is a key issue in robot applications. However, most related algorithms rely on point-by-point traversal. ...
We thank Maxine Garcia, PhD, from Liwen Bianji, Edanz Group China (www. liwenbianji.cn/ac) for editing the English text of a draft of this manuscript. ...
doi:10.1017/s0263574718001236
fatcat:iif55kdvyjdtbpt6vlx5sxwrvy
Fast point-to-point shortest path computations with arc-flags
[chapter]
2009
DIMACS Series in Discrete Mathematics and Theoretical Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2012; you can also visit the original URL.
The file type is application/pdf.
Arc-flags are a modification to the standard Dijkstra algorithm and are used to avoid exploring unnecessary paths during shortest path computation. ...
We present a number of improvements of the basic variant of the arc-flag acceleration (Lauther, 1997 (Lauther, , 2004 for point-to-point (P2P) shortest path computations on large graphs. ...
We denote by T a the shortest path tree constructed by a backward Dijkstra search from the separator arc a. ...
doi:10.1090/dimacs/074/03
dblp:conf/dimacs/HilgerKMS06
fatcat:ae35nslg4fecdgwnc4xv7wbq24
Quality-aware trajectory planning of cellular connected UAVs
2020
Proceedings of the 2nd ACM MobiCom Workshop on Drone Assisted Wireless Communications for 5G and Beyond
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2022; you can also visit the original URL.
The file type is application/pdf.
The main target of this paper is to propose a modified form of well-known graph search methods i.e., Dijkstra and A-star also known as A* algorithm, for quality-aware trajectory planning of the UAV. ...
Simulation results illustrate that the proposed algorithm significantly improves the QOR by slightly increasing the path length compared with the naive shortest path. ...
ACKNOWLEDGEMENT This research has been partially supported by the PriMO-5G project funded by the European Unions Horizon 2020 research and innovation programme under grant agreement No 815191. ...
doi:10.1145/3414045.3415943
dblp:conf/mobicom/SheikhRJJS0A20
fatcat:bc2rzk4myfhd3ihu7a63sjcypy
Field Evaluation of Path-Planning Algorithms for Autonomous Mobile Robot in Smart Farms
2022
IEEE Access
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2022; you can also visit the original URL.
The file type is application/pdf.
The characteristics of the grid-based Dijkstra algorithm, the grid-based A* algorithm, the sampling-based rapidly exploring random tree (RRT) algorithm, and the sampling-based RRT* algorithm are discussed ...
Based on the results, we determined that the A* algorithm is suitable for smart farms. ...
VOLUME 10, 2022
) DIJKSTRA ALGORITHMThe Dijkstra algorithm [20] is a typical method for determining the shortest path and solves the optimization problem.VOLUME 10, 2022
VOLUME 10, ...
doi:10.1109/access.2022.3181131
fatcat:itimf7hspzgdjofboyz2hbdyvu
High Performance Computing Simulation of Intelligent Logistics Management Based on Shortest Path Algorithm
2022
Computational Intelligence and Neuroscience
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2022; you can also visit the original URL.
The file type is application/pdf.
To solve this problem, this paper proposes to introduce the shortest path algorithm. ...
This paper compares the Dijkstra algorithm with the A ∗ algorithm under the background of logistics management and finds that the latter is more suitable for this field with huge amount of information. ...
Dijkstra algorithm is a classical algorithm for solving the shortest path, and the core of its algorithm is the order of the length of the path. e main purpose of this algorithm is to choose the best route ...
doi:10.1155/2022/7930553
pmid:35720907
pmcid:PMC9200519
fatcat:6q2qyt6jrngf7czehlufxcolyu
« Previous
Showing results 1 — 15 out of 5,690 results