Results 161 to 170 of about 47,124 (214)
Machine learning assisted classification of staphylococcal biofilm maturity. [PDF]
Biofilmvan Dun SCJ +9 more
europepmc +1 more source
Correction: Ou et al. Autonomous Navigation by Mobile Robot with Sensor Fusion Based on Deep Reinforcement Learning. <i>Sensors</i> 2024, <i>24</i>, 3895. [PDF]
Sensors (Basel)Ou Y, Cai Y, Sun Y, Qin T.
europepmc +1 more source
Some of the next articles are maybe not open access.
Related searches:
Related searches:
A biobjective Dijkstra algorithm
European Journal of Operational Research, 2019zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Antonio Sedeño-Noda, Marcos Colebrook
exaly +3 more sources
Dijkstra’s algorithm and L-concave function maximization
Mathematical Programming, 2013zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Kazuo Murota, Akiyoshi Shioura
exaly +3 more sources
Dijkstra's algorithm and Google maps
Proceedings of the 2014 ACM Southeast Regional Conference, 2014Dijkstra's Algorithm is known as the shortest path source. In this paper, we discuss this Algorithm and the applications that the algorithm has on the modern day. In this study, we provide a pseudo-code of the algorithm. It is the backbone of every navigation system. Google Maps is a typical application of this Algorithm.
Daniel R. Lanning +2 more
openaire +1 more source
2014 9th IEEE Conference on Industrial Electronics and Applications, 2014
The path planning is a very important part of AGV control. Firstly, The OpenCV is called to fitting the contour of obstacles with polygon and to optimize the result. Then a model of AGV work space is built by the method of network topology. So the problem of AGV path planning can be transformed into the problem of searching for the shortest path of the
Duanling Li, Kun Niu
openaire +1 more source
The path planning is a very important part of AGV control. Firstly, The OpenCV is called to fitting the contour of obstacles with polygon and to optimize the result. Then a model of AGV work space is built by the method of network topology. So the problem of AGV path planning can be transformed into the problem of searching for the shortest path of the
Duanling Li, Kun Niu
openaire +1 more source
The improved Dijkstra's shortest path algorithm
2011 Seventh International Conference on Natural Computation, 2011The shortest path problem exists in variety of areas. A well known shortest path algorithm is Dijkstra's, also called “label algorithm”. Experiment results have shown that the “label algorithm” has the following issues: ①. Its exiting mechanism is effective to undigraph but ineffective to digraph, or even gets into an infinite loop; ②.
Shu-Xi Wang, Xing-qiu Zhao
openaire +1 more source
Tsunami Simulation Based on Dijkstra Algorithm
2014 17th International Conference on Network-Based Information Systems, 2014This paper is concerned with the proposal of a numerical method to predict the movement of tsunami wave front by use of Dijkstra algorithm. Data for sea depth and land height are assigned to the nodes of rectangular meshes and the data values at the points except for these node points are approximated by linear interpolation.
Kazunori Uchida +3 more
openaire +1 more source