Results 41 to 50 of about 46,824 (191)
Path Planning Algorithms for Smart Parking: Review and Prospects
World Electric Vehicle JournalPath planning algorithms are crucial components in the process of smart parking. At present, there are many path planning algorithms designed for smart parking.
Zhonghai Han +5 more
doaj +1 more source
Optimal Path in Two and Three Dimensions
, 1998 We apply the Dijkstra algorithm to generate optimal paths between two given sites on a lattice representing a disordered energy landscape. We study the geometrical and energetic scaling properties of the optimal path where the energies are taken from a ...
Havlin, Shlomo +2 more
core +1 more source
Comparison of Dijkstra dan Floyd-Warshall Algorithm to Determine the Best Route of Train
IJID (International Journal on Informatics for Development), 2019 This study aims to find out the comparison of Dijkstra and Floyd-Warshall algorithms in finding the best path on a train trip. The best route is the path, which has the minimum price of a train journey.
Tri Setya Dermawan
doaj +1 more source
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
openaire +2 more sources
An algorithm for operational navigation in urban development using reinforcement learning [PDF]
The International Archives of the Photogrammetry, Remote Sensing and Spatial Information SciencesThis paper presents a navigation system for unmanned aerial vehicles (UAVs) operating in urban environments, where the main challenges include changes to the city layout that may not be reflected on existing maps.
I. Alyrchikov +3 more
doaj +1 more source
Tree Contraction, Connected Components, Minimum Spanning Trees: a GPU Path to Vertex Fitting [PDF]
, 2014 Standard parallel computing operations are considered in the context of algorithms for solving 3D graph problems which have applications, e.g., in vertex finding in HEP.
Hobson, PR, Lopes, RHC, Reid, ID
core +1 more source
RRT algorithm for path clipping of robotic arm guided by graph complexity
Xi'an Gongcheng Daxue xuebaoAimed at the issues of slow convergence speed, high path redundancy, and low sampling point utilization caused by the random sampling characteristics of the rapidly-exploring random tree (RRT) algorithm, a new solution was proposed.First, the graph ...
SHEN Danfeng +3 more
doaj +1 more source
Information-Aware Secure Routing in Wireless Sensor Networks
Sensors, 2019 Secure routing is crucial for wireless sensor networks (WSNs) because they are vulnerable to various attacks. In this paper, we propose a new secure routing protocol for WSNs in the presence of malicious nodes.
Qiong Shi +5 more
doaj +1 more source
An implementation of the Dilkstra algorithm for fuzzy costs (Technical report 2018) [PDF]
, 2019 This report presents an implementation the Dijkstra algorithm applied to a type V fuzz graph. This new algorithm can find the shortest path in a graph with edge costs are defined as positive triangular fuzzy ...
Alonso, Sira +3 more
core +1 more source
Path Selection for Quantum Repeater Networks
, 2012 Quantum networks will support long-distance quantum key distribution (QKD) and distributed quantum computation, and are an active area of both experimental and theoretical research.
A Basu +50 more
core +1 more source