Results 1 to 10 of about 382 (118)
A Modified Dijkstra Algorithm for ROS Based Autonomous Mobile Robots
Journal of Advanced Research in Natural and Applied Sciences, 2023 Autonomous Mobile Robots (AMRs) are frequently used in many fields of technology. In this study, an AMR was designed to execute different path planning algorithms.
Orkan Murat Çelik, Murat Köseoğlu
doaj +1 more source
A reinforcement learning approach for widest path routing in software-defined networks
ICT Express, 2023 In this paper, a routing method based on reinforcement learning (RL) under software-defined networks (SDN), namely the Q-learning widest-path routing algorithm (Q-WPRA), is proposed.
Chih-Heng Ke, Yi-Hao Tu, Yi-Wei Ma
doaj +1 more source
Jurnal Derivat, 2021 The purpose of this study are (1) to represent the route of café location in Bumiayu in the form of graph, (2) To find a solution from the application of the Dijkstra’s algorithm to find location of café in Bumiayu, and (3) To find the recommended ...
Intan Alifiani +2 more
doaj +1 more source
APLIKASI ALGORITMA DIJKSTRA UNTUK MENENTUKAN RUTE TERPENDEK DARI KAMPUS A KE B UIN RADEN FATAH
E-Jurnal Matematika, 2021 Finding the shortest direction is one of the options that have been considered while traveling. One of the problems that occur for lecturers, staff, and students of UIN Raden Fatah is determining the shortest direction from Campus A to B. The application
RENDI SAPUTRAMA, HARTATIANA HARTATIANA
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
Open pit limit optimization using dijkstra’s algorithm [PDF]
International Journal of Mining and Geo-Engineering, 2020 In open-pit mine planning, the design of the most profitable ultimate pit limit is a prerequisite to developing a feasible mining sequence. Currently, the design of an ultimate pit is achieved through a computer program in most mining companies.
Mehdi Najafi +2 more
doaj +1 more source
EMERGENCY PROCESSES HANDLING IN URBAN AREA USING MODIFIED DIJKSTRA METHOD
JUTI: Jurnal Ilmiah Teknologi Informasi, 2021 Emergency Aid has a very vital role in saving the patient's life. The emergency process involves two stages, namely the pre-hospital and the hospital stage. Striving for the entire emergency process is to have the fastest response time.
Prima Wiratama, Ary Mazharuddin Shiddiqi
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
Proposed Approach to Increase the Reliability of Wireless Sensor Networks through Dijkstra’s Algorithm [PDF]
SHS Web of ConferencesThis study aims to improve the performance of wireless sensor networks (WSNs) using Dijkstra’s algorithm. WSNs are vital in applications like environmental monitoring and industrial processes, requiring efficient data flow and power management to extend ...
Jasim Abd Hashim Yaqin +1 more
doaj +1 more source