Results 21 to 30 of about 15,993 (171)
Parametric shortest-path algorithms via tropical geometry
We study parameterized versions of classical algorithms for computing shortest-path trees. This is most easily expressed in terms of tropical geometry.
Joswig, Michael, Schröter, Benjamin
core +1 more source
HCTNav: A Path Planning Algorithm for Low-Cost Autonomous Robot Navigation in Indoor Environments
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 +5 more
doaj +1 more source
Finding the Best QoS Path in a Gilbert Channel Network [PDF]
Many different types of modern wired and wireless communication links can be mathematically described as discrete- time Gilbert channels. In this extended abstract, we present an exact method of calculating the best path in a network of discrete- time ...
Soedarmadji, Edwin
core +2 more sources
Calculating the Shortest Path Using Dijkstra’s Algorithm
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
Building graph-based programming strategies for reconfigurable photonic circuits [PDF]
We have developed a graph representation of programmable photonic mesh circuits that can be used by pathfinding algorithms. We modified the Dijkstra algorithm to observe only physically possible connections in the graph, demonstrating flexible rerouting ...
Bogaerts, Wim, Chen, Xiangfeng
core +1 more source
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 +2 more
doaj +1 more source
A Dijkstra-Based Approach to Fuelbreak Planning
One of the most effective methods of preventing large-scale wildfires is creating fuelbreaks, buffer zones whose purpose is to stop or delay the spread of the fire, providing firefighters an opportunity to control the fire. Fuelbreaks are already applied
Assaf Shmuel, Eyal Heifetz
doaj +1 more source
Algorithms for Finding Shortest Paths in Networks with Vertex Transfer Penalties
In this paper we review many of the well-known algorithms for solving the shortest path problem in edge-weighted graphs. We then focus on a variant of this problem in which additional penalties are incurred at the vertices. These penalties can be used to
Rhyd Lewis
doaj +1 more source
School is an essential thing for education quality. This time, the South Tangerang government is implementing a new student admission process using a zoning system; all prospective students must choose a school that has the shortest distance from their ...
Maulana Muhamad Sulaiman, Sahlan Sahlan
doaj +1 more source
Cloud Enabled Emergency Navigation Using Faster-than-real-time Simulation
State-of-the-art emergency navigation approaches are designed to evacuate civilians during a disaster based on real-time decisions using a pre-defined algorithm and live sensory data.
Bi, Huibo, Gelenbe, Erol
core +1 more source

