Results 31 to 40 of about 46,824 (191)
Applications of graph algorithms in GIS [PDF]
, 2010 A
Fack, Veerle, Vanhove, Stéphanie
core +2 more sources
Surface Optimal Path Planning Using an Extended Dijkstra Algorithm
IEEE Access, 2020 Extensive studies have been conducted on the Dijkstra algorithm owing to its bright prospect. However, few of them have studied the surface path planning of mobile robots.
Min Luo, Xiaorong Hou, Jing Yang
doaj +1 more source
An Efficient Approach for Solving Time-Dependent Shortest Path Problem under Fermatean Neutrosophic Environment [PDF]
Neutrosophic Sets and SystemsEfficiently determining optimal paths and calculating the least travel time within complex networks is of utmost importance in addressing transportation challenges.
K. Vidhya, A. Saraswathi, Said Broumi
doaj +1 more source
Robot Path Planning of Improved Adaptive Ant Colony System Algorithm Based on Dijkstra
Journal of Robotics, 2022 Path planning is one of the key technologies of robot. Aiming at the problems of slow convergence speed and inefficient search of traditional Ant Colony System Algorithm, an adaptive Ant Colony System Algorithm based on Dijkstra is proposed in the paper.
Chonglin Gu +3 more
doaj +1 more source
A Divide-and-Conquer Algorithm for Betweenness Centrality [PDF]
, 2015 The problem of efficiently computing the betweenness centrality of nodes has been researched extensively. To date, the best known exact and centralized algorithm for this task is an algorithm proposed in 2001 by Brandes.
Bestavros, Azer +3 more
core +1 more source
Public transport route planning: Modified dijkstra's algorithm
2017 International Conference on Computer Science and Engineering (UBMK), 2017 Public transport applications, which aim to propose the ideal route to end users, have commonly been used by passengers. However, the ideal route for public transport varies depending on the preferences of users. The shortest path is preferred by most users as a primary criterion for the ideal route.
Bozyigit, Alican +2 more
openaire +3 more sources
Path Planning of a Mobile Robot Based on the Improved RRT Algorithm
Applied Sciences, 2023 RRT (rapidly exploring random tree) is a sampling-based planning algorithm that has been widely used due to its simple structure and fast speed. However, the RRT algorithm has several issues such as low planning efficiency, high randomness, and poor path
Xiangjie Li, Yala Tong
doaj +1 more source
Property-Driven Fence Insertion using Reorder Bounded Model Checking [PDF]
, 2015 Modern architectures provide weaker memory consistency guarantees than sequential consistency. These weaker guarantees allow programs to exhibit behaviours where the program statements appear to have executed out of program order.
Joshi, Saurabh, Kroening, Daniel
core +2 more sources
Shortest Path Finding Using Dijkstra’s Algorithm
PIKSEL : Penelitian Ilmu Komputer Sistem Embedded and Logic, 2021 In the professional work, discipline is a very important to see work ethic of an employee. Discipline has also the most important element of good behavior, both as individual and social. A problem is when people on the road in finding the shortest path in order to get to the destination on time. Finding shortest path improves workers discipline and add
Surya Fajar Saputra +4 more
openaire +1 more source
Delivery Route Management based on Dijkstra Algorithm
مجلة بغداد للعلوم, 2021 For businesses that provide delivery services, the efficiency of the delivery process in terms of punctuality is very important. In addition to increasing customer trust, efficient route management, and selection are required to reduce vehicle fuel costs
Ng Lih Sheng +3 more
doaj +1 more source