Results 1 to 10 of about 16,130 (172)

A Modified Dijkstra Algorithm for ROS Based Autonomous Mobile Robots

open access: yesJournal 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

open access: yesICT 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

Solusi Optimal Pencarian Jalur Tercepat Menggunakan Algoritma Dijkstra Untuk Mencari Lokasi Cafe Di Bumiayu

open access: yesJurnal 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

open access: yesE-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

GENERALIZATION OF DIJKSTRA’S ALGORITHM FOR EXTRACTION OF SHORTEST PATHS IN DIRECTED MULTIGRAPHS [PDF]

open access: yesJournal of Computer Science, 2013
The classical Dijkstra’s algorithm to find the shortest path in graphs is not applicable to multigraphs. In this study the authors generalize the classical Dijkstra’s algorithm to make it applicable to directed multigraphs. The modified algorithm is called by Generalized Dijkstra’s algorithm or GD Algorithm (GDA in short).
Siddhartha Sankar Biswas   +2 more
openaire   +1 more source

The Utilisation of Dijkstra’s Algorithm to Assist Evacuation Route in Higher and Close Building [PDF]

open access: yesJournal of Computer Science, 2015
Corresponding Author: Nor Amalina Mohd Sabri Center for Advanced Computing Technology (C-ACT), Faculty of Information and Communication Technology, Universiti Teknikal Malaysia Melaka, Malaysia Email: noramalinamohdsabri@gmail.com Abstract: Finding a shortest path in a high rise building during critical incident or evacuation is facing two main issues ...
Nor Amalina Mohd Sabri   +3 more
openaire   +1 more source

A REFINEMENT OF DIJKSTRA’S ALGORITHM FOR EXTRACTION OF SHORTEST PATHS IN GENERALIZED REAL TIME-MULTIGRAPHS [PDF]

open access: yesJournal of Computer Science, 2014
The networks of the present day communication systems, be it a public road transportation system or a MANET or an Adhoc Network, frequently face a lot of uncertainties in particular regarding traffic jam, flood or water logging or PWD maintenance work (in case of public road network), attack or damage from inter nal or external agents, sudden failure ...
Siddhartha Sankar Biswas   +2 more
openaire   +1 more source

Open pit limit optimization using dijkstra’s algorithm [PDF]

open access: yesInternational 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

Programmatic implementation of the Dijkstra algorithm in the Transact-SQL language using relational algebra [PDF]

open access: yesE3S Web of Conferences, 2020
The article is devoted to the topical issue of data processing in the database management systems. It presents a solution to the problem of finding paths in a graph using Dijkstra’s algorithm, set as a sequence of relational operations and functions of ...
Urubkin Mikhail   +4 more
doaj   +1 more source

Proposed Approach to Increase the Reliability of Wireless Sensor Networks through Dijkstra’s Algorithm [PDF]

open access: yesSHS Web of Conferences
This 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

Home - About - Disclaimer - Privacy