UAV path planning using potential field and modified receding horizon A* 3D algorithm
Khuswendi T.a, Hindersah H.a, Adiprawita W.a
a Department of Electrical Engineering, Insitut Teknologi Bandung, Indonesia
Abstract
Path planning is an important step to design autonomous flight system of UAV. This paper proposes method for designing path planning algorithm that can make UAV move autonomously. The algorithm used potential field method and A* Algorithm. A* algorithm will be created in a 3D environment, and developed to become hierarchical A* 3D algorithm, and receding horizon A*3D algorithm. These proposed algorithms will be tested in GUI simulation. The potential field and A* algorithm are combined, which the potential field is used for setting up environment, while A* algorithm is used to search the optimal path. Each proposed algorithm has advantages and weaknesses, in terms of time and distance travelled. In time viewpoint, the most optimal method is hierarchical A*3D algorithm, as it requires a short processing time but requires larger distance than the others, whereas the most optimal distance is the normal method of A* 3D, but it takes processing time longest, so that the most appropriate method to be implemented on the UAV is receding horizon A*3D algorithm, both in terms of processing time and distance, still visible to be implemented. © 2011 IEEE.
Author keywords
3-D environments,A,Autonomous flight,Optimal methods,Optimal paths,Path-planning,Path-planning algorithm,Potential field,Potential field methods,Processing Time,Receding horizon,Short processing time
Indexed keywords
A,Algorithm,Path planning UAV,Potential Field