With the importance of time and cost in today’s world, it is essential to solve problems in the best way possible. Optimization is a process used to achieve this goal and is applied in several areas, ...
You are free to share (copy and redistribute) this article in any medium or format and to adapt (remix, transform, and build upon) the material for any purpose, even commercially within the parameters ...
Abstract: This article introduces the problem of parallelization of Dijkstra's algorithm, a well known algorithm for computing single-source shortest path in a graph. Dijkstra's algorithm can be ...
As more and more intelligent devices are put into the field of power system, the number of connected nodes in the power network is increasing exponentially. Under the background of smart grid ...
Every useful scientific application does some type of Input/Output (I/O). Such applications could be reading initial conditions or data sets for processing, or could be writing numerical data from ...
Path planning plays a crucial role in many applications in robotics for example for planning an arm movement or for navigation. Most of the existing approaches to solve this problem are iterative, ...
This paper proposes an improved ant colony algorithm to achieve efficient searching capabilities of path planning in complicated maps for mobile robot. The improved ant colony algorithm uses the ...
Geodesic distance from a single point on a surface. The heat method allows distance to be rapidly updated for new source points or curves. We introduce the heat method for solving the single- or ...
Some results have been hidden because they may be inaccessible to you
Show inaccessible results