Results 61 to 70 of about 4,817 (226)

Recent Application of Dijkstra’s Algorithm in the Process of Production Planning

Applied Sciences, 2022
This paper aims to develop a method that could serve as a tool for evaluating extracted raw materials in terms of use by considering the place of extraction and consumption.
Marcel Behún, Dušan Knežo, Michal Cehlár, Lucia Knapčíková, Annamária Behúnová   +4 more
doaj   +1 more source

Proteome Analysis of Corynebacterium diphtheriae–Macrophage Interaction

PROTEOMICS, EarlyView.
ABSTRACT Contact of Corynebacterium diphtheriae with macrophages induces adaptations on both bacterial and cellular sides. The study presented here was aiming to shed light on the simultaneous intracellular adaptation of the bacteria and changes in the proteome of the phagocytes in response to the internalization of C. diphtheriae.
Luca Musella, Jens Möller, Christopher Lischer, Julio Vera‐Gonzalez, Jörg Hofmann, Lisa Ott, Andreas Burkovski   +6 more
wiley   +1 more source

A QUANTUM IMPROVEMENT ON DIJKSTRA’S ALGORITHM FOR COMPUTER NETWORK ROUTING [PDF]

مجلة جامعة الانبار للعلوم الصرفة, 2008
The aim of this paper is to improve the Dijkstra algorithm which is widely used in the internet routing. Quantum computing approach is used to improve the work of Dijkstra algorithm for network routing by exploiting the massive parallelism existing in ...
Rana F. Ghani, Ahmed T. Sadik
doaj   +1 more source

Experiences With a Last Meter Delivery Robot

Journal of Field Robotics, EarlyView.
ABSTRACT The steady growth of e‐commerce is a consolidated trend continuously increasing the number of parcels delivered worldwide. Conventionally, in logistics, last mile delivery has been the area of study covering the last step of a parcel delivery process: from the nearest distribution center to the customer.
Ricard Bitriá, Jordi Palacín, Elena Rubies, Eduard Clotet   +3 more
wiley   +1 more source

Autonomous Navigation in Large‐Scale Underground Environments Based on a Purely Topological Understanding of Tunnel Networks

Journal of Field Robotics, EarlyView.
ABSTRACT This work presents a non‐geometrical navigation approach based on a purely topological understanding of underground environments. By conceptualizing subterranean scenarios as a set of tunnels that intersect with each other, and taking a navigation approach based on topological instructions, we simplify the navigation problem to the sequential ...
Lorenzo Cano, Danilo Tardioli, Alejandro R. Mosteo   +2 more
wiley   +1 more source

A Performance Comparison of Shortest Path Algorithms in Directed Graphs

Engineering Proceedings
This study examines the performance characteristics of four commonly used short-path algorithms, including Dijkstra, Bellman–Ford, Floyd–Warshall, and Dantzig, on randomly generated directed graphs.
Fatima Sapundzhi, Kristiyan Danev, Antonina Ivanova, Metodi Popstoilov, Slavi Georgiev   +4 more
doaj   +1 more source

Vector Field‐Based Collision‐Free Navigation in Tunnel‐Like Environments

Journal of Field Robotics, EarlyView.
ABSTRACT Tunnel‐like environments, renowned for their vast scale, confined spaces, and limited visibility, present significant challenges for autonomous robot navigation. This study addresses the critical issue of guiding robots through such environments while ensuring collision‐free navigation and maintaining a specified safety margin from both tunnel
Bao Jianjun, Licheng Feng, Yueqi Wang, Kai Zhao, Binghao Li, Liao Wu   +5 more
wiley   +1 more source

Study on Near-Optimal Path Finding Strategies in a Road Network

Journal of Algorithms & Computational Technology, 2008
In this paper we analyze the existing defects of hierarchical and nonhierarchical path finding algorithm respectively in detail and present a hierarchical path finding algorithm based on the heuristic directing search approach which is used for promoting
Shi Jun, Li Jian-Yuan, Cao Han, Wang Xi-Li   +3 more
doaj   +1 more source

Quantifying Structural Complexity, Effort, and Performance: An Early Experiment Using Network Design Tasks

Systems Engineering, EarlyView.
ABSTRACT Structural Complexity is perceived as driving cost in system development, yet managing it effectively requires empirical understanding. This study investigates human decision‐making using a toy transportation‐style network design task, focusing on how Structural Complexity, Effort, and Performance interact. Seventy‐four participants (primarily
Alfonso Lanza, Joshua Sutherland, Marc‐Andre Chavy‐Macdonald, Olivier L. de Weck   +3 more
wiley   +1 more source

Landmark Guided Probabilistic Roadmap Queries

, 2017
A landmark based heuristic is investigated for reducing query phase run-time of the probabilistic roadmap (\PRM) motion planning method. The heuristic is generated by storing minimum spanning trees from a small number of vertices within the \PRM graph ...
Frazzoli, Emilio, Nager, Yannik, Paden, Brian   +2 more
core   +1 more source