Results 31 to 40 of about 5,083,450 (268)
Path planning of intelligent mobile robot based on Dijkstra algorithm
Journal of Physics: Conference Series, 2021 Under the premise of grid environment modeling method, a relaxed Dijkstra algorithm is proposed to solve the problem of real-time path planning for mobile robot in large-scale and obstacle intensive working environment.
Xueyan Li
semanticscholar +1 more source
Journal of Engineering, 2023 Finding the shortest route in wireless mesh networks is an important aspect. Many techniques are used to solve this problem like dynamic programming, evolutionary algorithms, weighted-sum techniques, and others. In this paper, we use dynamic programming
Sabreen Mahmood Shukr +2 more
doaj +1 more source
Building graph-based programming strategies for reconfigurable photonic circuits [PDF]
, 2019 We have developed a graph representation of programmable photonic mesh circuits that can be used by pathfinding algorithms. We modified the Dijkstra algorithm to observe only physically possible connections in the graph, demonstrating flexible rerouting ...
Bogaerts, Wim, Chen, Xiangfeng
core +1 more source
Teknologi Location Based Service (Global Positioning System) Pada Perangkat Mobile
ComTech, 2010 Article presents analysis and design of software using Location Based Service (LBS) that is part of communication technology based on geographic position.
Budi Yulianto
doaj +1 more source
An Application of the Multi-Level Heuristic for the Heterogeneous Fleet Vehicle Routing Problem [PDF]
, 2010 The Multi-Level heuristic is used to investigate the heterogeneous fleet vehicle routing problem (HFVRP). The initial solution for the Multi-Level heuristic is obtained by Dijkstra\u27s algorithm based on a cost network constructed by the sweep algorithm
Berrevoet, F. +5 more
core +6 more sources
Applying the Dijkstra Algorithm to Solve a Linear Diophantine Fuzzy Environment
Symmetry, 2021 Linear Diophantine fuzzy set (LDFS) theory expands Intuitionistic fuzzy set (IFS) and Pythagorean fuzzy set (PyFS) theories, widening the space of vague and uncertain information via reference parameters owing to its magnificent feature of a broad ...
P. Mani, S. Jafari, M. Riaz, M. Aslam
semanticscholar +1 more source
Search for the optimal way in the network of public communication [PDF]
Transport, 2002 The problem of searching the optimal way in the network of public communication is investigated in the article. The modified Minieka algorithm and designed combined search into depth and Dijkstra algorithm method, operating by the basis of graphs are ...
A. Keršys, A. Jurkauskas
doaj +3 more sources
Hybrid Bellman–Ford–Dijkstra algorithm
Journal of Discrete Algorithms, 2017 The paper considers the single-source shortest paths problem in a digraph with negative edge costs allowed. A new, hybrid algorithm for finding shortest paths from a source \(s\) in a graph \(G\) with general edge costs is constructed by combining Bellman-Ford and Dijkstra algorithms (hence BFD algorithm).
Dinitz, Yefim, Itzhak, Rotem
openaire +2 more sources
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.
Kadry, Seifedine +2 more
openaire +2 more sources
Path Planning Algorithm of Dijkstra-Based Intelligent Aircraft under Multiple Constraints
Xibei Gongye Daxue Xuebao, 2020 Aiming at the rapid planning of the optimal flight path of the intelligent aircraft, considering the error constraints and correction probability constraints, a model for intelligent aircraft path planning under multiple constraints is constructed, and a
doaj +1 more source