Results 181 to 190 of about 2,337,392 (235)
DSAC-ICM: A Distributional Reinforcement Learning Framework for Path Planning in 3D Uneven Terrains. [PDF]
Sensors (Basel)Zhou Y, Liu F, Liu Z, Ji X, Yin G.
europepmc +1 more source
Temporal speckle enables probabilistic weights for uncertainty-aware photonic AI
Pernice W +14 more
europepmc +1 more source
Path planning for manipulators based on the planar constraint RRT* algorithm. [PDF]
Sci RepLi M, Jiang W, Luo Z, Wang Y, Yang L.
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 +4 more sources
Dijkstra's algorithm to find the nearest vaccine location
Procedia Computer Science, 2023 Since the start of Covid-19 pandemic has made many people look for vaccine locations. In general, Dijkstra algorithm is used to find the shortest path. The shortest path problem concentrates on finding the path with the minimum distance. The Dijkstra algorithm was chosen because it has several advantages other than advantageous in terms of running time
Kristien Margi Suryaningrum +1 more
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 +2 more sources
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
Dijkstra’s algorithm and L-concave function maximization
Mathematical Programming, 2013zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Akiyoshi Shioura, Kazuo Murota
exaly +3 more sources
Neural Implementation of Dijkstra’s Algorithm.
2003This paper presents an extension of the Self Organizing Map model called Associative SOM that is able to process different types of input data in separated data-paths. The ASOM model can easily deal with situations of incomplete data-patterns and incorporate class labels for supervisory purposes.
Enrique Mérida Casermeiro +2 more
openaire +2 more sources