Hybrid A*-Based Valley Path Planning Algorithm for Aircraft

5Citations
Citations of this article
5Readers
Mendeley users who have this article in their library.

Abstract

This paper presents a valley path planning algorithm based on the Hybrid A* algorithm. This algorithm is aimed at finding the valley path for aircraft considering dynamics constraints and terrain limitations. The preliminaries involve the establishment of a 3D workspace based on digital elevation map (DEM) data and addressing methods of valley detection. Following this comprehensive groundwork, the Hybrid A*-based algorithm, employed to determine the valley path within the 3D workspace while accommodating dynamic constraints and terrain limitations, is then introduced. In the experimental test, to validate the effectiveness of the algorithm proposed in this paper, we tested the performance of the proposed algorithm and other three baseline algorithms based on four optimization objectives in three workspaces. The simulated results indicate that the algorithm proposed in this paper can effectively find the valley path while considering dynamic constraints and terrain limitations.

Cite

CITATION STYLE

APA

Xue, T., Cao, Y., Zhao, Y., Ai, J., & Dong, Y. (2024). Hybrid A*-Based Valley Path Planning Algorithm for Aircraft. Aerospace, 11(7). https://doi.org/10.3390/aerospace11070516

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free