Results 31 to 40 of about 15,993 (171)
International Journal of Computational Intelligence Systems, 2020 In this paper, we will present a N-Non-Intersecting-Routing (NNIR) algorithm which is used to reduce the cost of resilient routing in telecommunications problems.
Lewis Veryard +4 more
doaj +1 more source
Optimal distribution of vehicular traffic flow with Dijkstra’s algorithm and Markov chains
African Scientific ReportsThe 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
Optimal Path Planning Method for IMU System-Level Calibration Based on Improved Dijkstra’s Algorithm
IEEE Access, 2023 The calibration path of system-level calibration directly affects the incentive effect of the error term and thus the calibration accuracy. Currently, the planning of system-level calibration paths is predominantly designed based on personal experience ...
Xuesong Bai +4 more
doaj +1 more source
THE USE OF THE ROADLOAD APPLICATION IN GEOGRAPHICAL STUDIES OF FLOWS GENERATED BY INDIVIDUAL MODES OF TRANSPORT [PDF]
Transport Problems, 2020 The purpose of this article is to present the authors' own software for predicting changes in the density and directions of traffic flows and to compare overall results of research on transport accessibility with the ...
Marta BOROWSKA-STEFAŃSKA +3 more
doaj +1 more source
Making more flexible ATISMART+ model for traffic simulations using a CAS [PDF]
, 2015 Traffic simulations usually require the search of a path to join two different points. Dijkstra’s algorithm [1] is one of the most commonly used for this task due to its easiness and quickness.
Aguilera-Venegas, Gabriel +5 more
core
Predicting Atomic Charges in MOFs by Topological Charge Equilibration
Advanced Functional Materials, EarlyView.An atomic charge prediction method is presented that is able to accurately reproduce ab‐initio‐derived reference charges for a large number of metal–organic frameworks. Based on a topological charge equilibration scheme, static charges that fulfill overall neutrality are quickly generated.
Babak Farhadi Jahromi +2 more
wiley +1 more source
Path planning algorithm for a car like robot based on Coronoi Diagram Method [PDF]
, 2013 The purpose of this study is to develop an efficient offline path planning algorithm that is capable of finding optimal collision-free paths from a starting point to a goal point. The algorithm is based on Voronoi diagram method for the environment
Inun, Haidie
core
Shortest Distances as Enumeration Problem
, 2021 We investigate the single source shortest distance (SSSD) and all pairs shortest distance (APSD) problems as enumeration problems (on unweighted and integer weighted graphs), meaning that the elements $(u, v, d(u, v))$ -- where $u$ and $v$ are vertices ...
Casel, Katrin +3 more
core
Advanced Intelligent Discovery, EarlyView.Combining machine learning and probabilistic statistical learning is a powerful way to discover and design new materials. A variety of machine learning approaches can be used to identify promising candidates for target applications, and causal inference can help identify potential ways to make them a reality.
Jonathan Y. C. Ting, Amanda S. Barnard
wiley +1 more source