Shortest path planning on topographical maps

An effective robot trajectory planning method using a genetic algorithm

“…We search for several interior points between the starting point and the target, and then use the Hermite cubic interpolation method to construct the path. Our method has the following advantages: (1) it is easy to program and efficiently implement, (2) it ensures that the resulting optimized trajectory is smooth, and (3) it can be extended to solve spatial and redundant robot problems.…”

“…The collisions are detected in the Cartesian workspace by a hierarchical distance computation based on the given CAD model, which is done by adjusting the step size of the search to the distance between the robot and the obstacle. Saab and VanPutte [2] introduced an algorithm for shortest path planning using topographical maps. The algorithm partitions the search space into free regions and obstacle regions, and combines the benefits of node generation searches with a geometric technique to find a near optimal path.…”

Shortest routes on varying height surfaces using gray-level distance transforms

“…Variations of Dijkstra's path search algorithm can be used by modifying the path optimization problem to a graph search, as presented, for example, in Refs. [1,2]. A dynamic programming-based algorithm for computing distances of fuzzy digital objects is presented in Ref.…”

An Improved Chaos Electromagnetism Mechanism Algorithm for Path Optimization Problem

“…With the algorithm graph lines can be optimized to produce the quickest path toward its destination. Saab & Van Putte [12] apply dijkstra algorithm for finding the shortest path on the map. Ergun et al, [13] implemented dijkstra algorithm in transmission system multizonal.…”