Comparison between Normal Waveform and Modified Wavefront Path Planning Algorithm for Mobile Robot

Abstract

Mobile robot path planning is about finding a movement from one position to another without collision. The wavefront is typically used for path planning jobs and appreciated for its efficiency, but it needs full wave expansion which takes significant amount of time and process in large scale environment. This study compared wavefront algorithm and modified wavefront algorithm for mobile robots to move efficiently in a collision free grid based static environment. The algorithms are compared in regards to parameters such as execution time of the algorithm and planned path length which is carried out using Player/Stage simulation software. Results revealed that modified wavefront algorithm is a much better path planning algorithm compared to normal wavefront algorithm in static environment.

Distributed multi-robot potential-field-based exploration with submap-based mapping and noise-augmented strategy

“…A similar distance form was once introduced in [35], and there were some studies regarding the comparison between the performance by different types of distances [36], [37]. However, the previous ones were not utilized as a part of the potential.…”

Simulation and experimental approach for optimal path planning of UAV using A* and MEA* algorithms

“…Thompson et al [12] used the Slocum glider with the Wavefront planner to forecast 48-hour ocean currents. Tang et al [13] findings show that when comparing a modified wavefront to a normal wavefront, there is a 19% improvement. A* is the first best search methods [14] developed from Dijkstra varieties, are widely used in algorithms such as route planning in computer games and robotics.…”