Results 31 to 40 of about 5,425,704 (264)
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 +5 more
doaj +1 more source
Robust semi-automated path extraction for visualising stenosis of the coronary arteries [PDF]
, 2008 Computed tomography angiography (CTA) is useful for diagnosing and planning treatment of heart disease. However, contrast agent in surrounding structures (such as the aorta and left ventricle) makes 3-D visualisation of the coronary arteries difficult ...
Achenbach +43 more
core +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
On the utility of network coding in dynamic environments [PDF]
, 2004 Many wireless applications, such as ad-hoc networks and sensor networks, require decentralized operation in dynamically varying environments. We consider a distributed randomized network coding approach that enables efficient decentralized operation of ...
Chang, Yu-Han +5 more
core +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
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 +2 more
doaj +1 more source
Historical Relative Performance Index over Interconnectedness of Badminton Athletes [PDF]
, 2007 The paper proposes the Historical Relative Performance Index in order to quantitatively extract information in the scores hit in the sets of head-to-head game in badminton tournaments.
Khanafiah, Deni +2 more
core +1 more source
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
Algorithms for Finding Shortest Paths in Networks with Vertex Transfer Penalties
Algorithms, 2020 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
Intensif: Jurnal Ilmiah Penelitian Teknologi dan Penerapan Sistem Informasi, 2022 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