Results 1 to 10 of about 47,124 (214)
Dijkstra's algorithm to find the nearest vaccine location
Procedia Computer Science, 2023 Since the start of Covid-19 pandemic has made many people look for vaccine locations. In general, Dijkstra algorithm is used to find the shortest path. The shortest path problem concentrates on finding the path with the minimum distance. The Dijkstra algorithm was chosen because it has several advantages other than advantageous in terms of running time
Jason +4 more
exaly +3 more sources
A New Algorithm Based on Dijkstra for Vehicle Path Planning Considering Intersection Attribute
IEEE Access, 2021 Vehicle path planning is a key issue for car navigation systems. When path planning, considering the time spent at intersections is more in line with the actual situation, so it is of practical significance to study the path planning problem take account
Dan-Dan Zhu, Jun-Qing Sun
doaj +3 more sources
Long-Endurance Dynamic Path Planning Method of NSV Considering Wind Energy Capture
Journal of Marine Science and Engineering, 2021 To meet the mission requirements of long-endurance and unmanned marine environment observation, the natural energy-driven unmanned surface vehicle (NSV) usually takes special sailing paths to increase energy capture to achieve the purpose of improving ...
Qi Jia +5 more
doaj +1 more source
Optimized Graph Search Algorithms for Exploration with Mobile Robot
Emitter: International Journal of Engineering Technology, 2021 Graph search algorithms and shortest path algorithms, designed to allow real mobile robots to search unknown environments, are typically run in a hybrid manner, which results in the fast exploration of an entire environment using the shortest path.
Aydın GULLU, Hilmi KUŞÇU
doaj +1 more source
Targeted multiobjective Dijkstra algorithm
Networks, 2023 We introduce the Targeted Multiobjective Dijkstra Algorithm (T‐MDA), a label setting algorithm for the One‐to‐One Multiobjective Shortest Path (MOSP) Problem. It is based on the recently published Multiobjective Dijkstra Algorithm (MDA) and equips it with A*‐like techniques.
Pedro Maristany de las Casas +3 more
openaire +3 more sources
Route Prioritization by Using Fuzzy Analytic Hierarchy Process Extended Dijkstra Algorithm [PDF]
Journal of Eta Maritime Science, 2019 Voyage planning is of significance considering the oil consumption, time and safety factors. Determining the proper route after considering multiple convergent factors synchronously is one of the most important subjects in ship management that requires
Bekir ŞAHİN
doaj +1 more source
Jurnal Riset Informatika, 2022 In most games, an artificial pathfinding intelligence is required for traversing the fastest discovery. It is essential for many video games, particularly Role Playing Games (RPGs).
Riska Nurtantyo Sarbini +3 more
doaj +1 more source
On the Optimization of Dijkstra’s Algorithm [PDF]
, 2011 In this paper, we propose some amendment on Dijkstras algorithm in order to optimize it by reducing the number of iterations. The main idea is to solve the problem where more than one node satisfies the condition of the second step in the traditional Dijkstras algorithm.
Seifedine Nimer Kadry +2 more
openaire +2 more sources
A Dijkstra-Type Algorithm for Dynamic Games [PDF]
Dynamic Games and Applications, 2015 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Martino Bardi +1 more
openaire +3 more sources
EURASIP Journal on Wireless Communications and Networking, 2020 The development of multicore hardware has provided many new development opportunities for many application software algorithms. Especially, the algorithm with large calculation volume has gained a lot of room for improvement.
Bo Zhang, De Ji Hu
doaj +1 more source