Results 71 to 80 of about 46,824 (191)
Implementasi Algoritma Dijkstra pada Game Pacman [PDF]
, 2019 Pacman is one of the labyrinth-shaped games where this game has used artificial intelligence, artificial intelligence is composed of several algorithms that are inserted in the program and Implementation of the dijkstra algorithm as a method of solving ...
Aminudin, S. (Sidiq) +4 more
core
Efficient motion planning for problems lacking optimal substructure
, 2017 We consider the motion-planning problem of planning a collision-free path of a robot in the presence of risk zones. The robot is allowed to travel in these zones but is penalized in a super-linear fashion for consecutive accumulative time spent there. We
Hou, Brian +2 more
core +1 more source
Route Planning in Transportation Networks [PDF]
, 2015 We survey recent advances in algorithms for route planning in transportation networks. For road networks, we show that one can compute driving directions in milliseconds or less even at continental scale.
Bast, Hannah +7 more
core
Application Teaching Case of Dijkstra Algorithm
DEStech Transactions on Social Science, Education and Human Science, 2017 Dijkstra algorithm has been widely applied in many fields, such as optimization, image processing and grid processing. In the tradition teaching process, we find that students could not understand the use of Dijkstra algorithm, think this algorithm is complex and have no interest.
Xiao-Chao SUN +3 more
openaire +2 more sources
An Improved Dijkstra Shortest Path Algorithm [PDF]
Proceedings of the 2nd International Conference on Computer Science and Electronics Engineering (ICCSEE 2013), 2013 An improved Dijkstra shortest path algorithm is presented in this paper. The improved algorithm introduces a constraint function with weighted value to solve the defects of the data structure storage, such as lots of redundancy of space and time. The number of search nodes is reduced by ignoring reversed nodes and the weighted value is flexibly changed
Min Shi, Qingming Yi, Yizhen Huang
openaire +1 more source
Bidirectional Dijkstra’s Algorithm is Instance-Optimal
Fixed a bug in the bidirectional search pseudocode where e_mid was updated even if $\mu$ wasn't. Fixed a typo in the proof of Theorem 3: changed all $v_1u_2$ to $u_2v_1$.
Haeupler, Bernhard +4 more
openaire +2 more sources
Research on cross-platform mine emergency rescue path optimization scheme
Gong-kuang zidonghua, 2020 At present, research on coal mine emergency rescue path optimization is mostly in the stage of computer simulation calculation. In order to further promote its application in the actual environment of complex roadway, a cross-platform mine emergency ...
HAO Tianxuan, ZHAO Lizhen
doaj +1 more source
DIJKSTRA ALGORITHM USING UAV PATH PLANNING
Konya Journal of Engineering Sciences, 2020 The use of unmanned aerial vehicles (UAV) is increasing today. UAVs can be divided into two parts, which are remote controlled and can travel automatically due to a certain battery problem. Recent research has also focused on the development and application of new algorithms to autonomously control these vehicles and determine the shortest flight paths.
Elaf DHULKEFL +2 more
openaire +3 more sources
Performance Evaluation of using a Dynamic Shortest Path Algorithm in OLSRv2 [PDF]
, 2010 MANET routing protocols are designed to scale up to thousands of routers with frequent changes of the topology. In preference, MANET routing protocols should also support constrained low-power devices.
Herberg, Ulrich
core +1 more source
Exploring a New Adaptive Routing Based on the Dijkstra Algorithm in Optical Networks-on-Chip. [PDF]
Micromachines (Basel), 2021 Zheng YL +7 more
europepmc +1 more source