Results 131 to 140 of about 959 (166)
Collaborative scheduling of dual-trolley quay cranes and AGVs via speed-control strategy. [PDF]
PLoS OneTan Y +5 more
europepmc +1 more source
Algorithm for UAV path planning in high obstacle density environments: RFA-star. [PDF]
Front Plant SciZhang W +5 more
europepmc +1 more source
Time-Efficient RSA over Large-Scale Multi-Domain EON. [PDF]
Sensors (Basel)Xi T, Li X, Wang X.
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
openaire +2 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
On Dijkstra’s Algorithm for Deadlock Detection
2009We study a classical problem in operating systems concerning deadlock detection for systems with reusable resources. The elegant Dijkstra’s algorithm utilizes simple data structures, but it has the cost of quadratic dependence on the number of the processes.
Youming Li +2 more
openaire +1 more source
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 +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