Nor Badariyah Abdul Latip

TL;DR: This study analyses all the available path planning algorithms in terms of energy efficiency for a UAV and considers the computation time, path length and completeness because UAV must compute a stealthy and minimal path length to save energy.

TL;DR: Current researches on the graph search algorithms under combinatorial method are mainly reviewed in this paper by keeping focus on the comprehensive surveys of its properties for path planning, resulting in a pen picture of their assumptions and drawbacks.

TL;DR: The number of obstacles considered for path planning is reduced by introducing a space in which the obstacles lie, which makes the algorithm suitable to be applied in real-time and will greatly accelerate the development of autonomous cars in the near future.

TL;DR: In this article, the authors analyzed different C-space representation techniques under combinatorial method based on the past researches and their findings with different criteria such as optimality, completeness, safety, memory uses, real time and computational time etc.

TL;DR: This paper analyses an experimental path planning performance between the Iterative Equilateral Space Oriented Visibility Graph (IESOVG) and conventional Visibilitygraph algorithms in terms of computation time and path length for an autonomous vehicle.