Results 21 to 30 of about 959 (166)

Multi-criteria path rationalization in the conditions of multi-type passenger transport systems

Вестник университета, 2021
The article proposes methods of searching passenger travel routes in conditions where one or more optimization criteria must be taken into account in the presence of a pedestrian system and multi-type transport systems with their topologies, sets of ...
V. V. Egorov
doaj   +1 more source

The Simulation of Traffic Signal Preemption using GPS and Dijkstra Algorithm for Emergency Fire Handling at Makassar City Fire Service

International Journal of Applied Sciences and Smart Technologies, 2021
The Makassar City Fire Department often faces obstacles in handling fires. Problems that often hinder such as congestion at crossroads, panic residents, and others.
Melki Friaswanto, Erick Alfons Lisangan, Sean Coonery Sumarta   +2 more
doaj   +1 more source

HCTNav: A Path Planning Algorithm for Low-Cost Autonomous Robot Navigation in Indoor Environments

ISPRS International Journal of Geo-Information, 2013
Low-cost robots are characterized by low computational resources and limited energy supply. Path planning algorithms aim to find the optimal path between two points so the robot consumes as little energy as possible.
Javier Garrido, Angel de Castro, Nafiseh Osati Eraghi, Alberto Sanchez, Fernando López-Colino, Marco Pala   +5 more
doaj   +1 more source

Simplicial dijkstra and A* algorithms for optimal feedback planning [PDF]

2011 IEEE/RSJ International Conference on Intelligent Robots and Systems, 2011
This paper considers the Euclidean shortest path problem among obstacles in ℝn. Adaptations of Dijkstra's and A* algorithms are introduced that compute the approximate cost-to-go function over a simplicial complex embedded in the free space. Interpolation methods are carefully designed and analyzed so that they are proven to converge numerically to the
Yershov, Dmitry S., LaValle, Steven M.
openaire   +2 more sources

Hybrid Bellman–Ford–Dijkstra algorithm

Journal of Discrete Algorithms, 2017
The paper considers the single-source shortest paths problem in a digraph with negative edge costs allowed. A new, hybrid algorithm for finding shortest paths from a source \(s\) in a graph \(G\) with general edge costs is constructed by combining Bellman-Ford and Dijkstra algorithms (hence BFD algorithm).
Yefim Dinitz, Rotem Itzhak
openaire   +2 more sources

Calculating the Shortest Path Using Dijkstra’s Algorithm

Araştırma Temelli Etkinlik Dergisi, 2018
The Dijkstra's algorithm is an algorithm that determines the shortest paths needed to go from a starting node to any node in a graph. In this article, the process and results of an activity that included route formation among the provinces in the Aegean ...
Bekir Cevizci
doaj   +4 more sources

Comparison Analysis of Dijkstra and A-Star Algorithms in NPC (Non-Playable Character) Movement on a Single-Player Game

IJAIT (International Journal of Applied Information Technology)
Artificial intelligence in a game plays a vital role in enhancing the player's gaming experience, especially in single-player games. NPCs are the primary means of interaction in single-player games, assisting and guiding players like interactions with ...
Dany Zaky Dhaifullah, Nelly Oktavia Adiwijaya, Priza Pandunata   +2 more
doaj   +1 more source

Automating AI Discovery for Biomedicine Through Knowledge Graphs and Large Language Models Agents

Advanced Intelligent Discovery, EarlyView.
This work proposes a novel framework that automates biomedical discovery by integrating knowledge graphs with multiagent large language models. A biologically aligned graph exploration strategy identifies hidden pathways between biomedical entities, and specialized agents use this pathway to iteratively design AI predictors and wet‐lab validation ...
Naafey Aamer, Muhammad Nabeel Asim, Shan Munir, Andreas Dengel   +3 more
wiley   +1 more source

Optimal distribution of vehicular traffic flow with Dijkstra’s algorithm and Markov chains

African Scientific Reports
The optimization of traffic distribution is a critical problem in transportation networks, where efficient routing can reduce congestion, minimize travel time, and improve overall traffic flow.
L. I. Igbinosun, N. R. Udoenoh
doaj   +1 more source

Rapid path planning algorithm for mobile robot in dynamic environment

Advances in Mechanical Engineering, 2017
Searching the lowest-cost path through a graph is central to many problems, including path planning for a mobile robot. By combining Dijkstra’s algorithm, A* algorithm, and rolling window principle, a new rapid path planning algorithm for a mobile robot ...
Hong-mei Zhang, Ming-long Li
doaj   +1 more source