Route Planning Algorithm in FRA Based on Lazy Theta* Algorithm

Nan Xu; Xiang Wu

Proceedings of the 2nd International Conference on Internet Technology and Educational Informatization, ITEI 2022, December 23-25, 2022, Harbin, China

Research Article

Route Planning Algorithm in FRA Based on Lazy Theta* Algorithm

Download143 downloads

Cite: BibTeX Plain Text

@INPROCEEDINGS{10.4108/eai.23-12-2022.2329179,
    author={Nan  Xu and Xiang  Wu},
    title={Route Planning Algorithm in FRA Based on Lazy Theta* Algorithm},
    proceedings={Proceedings of the 2nd International Conference on Internet Technology and Educational Informatization, ITEI 2022, December 23-25, 2022, Harbin, China},
    publisher={EAI},
    proceedings_a={ITEI},
    year={2023},
    month={6},
    keywords={lazy theta* route planning shortest path problem},
    doi={10.4108/eai.23-12-2022.2329179}
}

Nan Xu
Xiang Wu
Year: 2023
Route Planning Algorithm in FRA Based on Lazy Theta* Algorithm
ITEI
EAI
DOI: 10.4108/eai.23-12-2022.2329179

Nan Xu¹^,*, Xiang Wu¹

1: Key Laboratory of Artificial Intelligence for Airlines of Civil Aviation Administration of China

*Contact email: xunan@csair.com

Abstract

Aiming at the problem of route planning in FRA, this paper proposes a route planning algorithm based on Theta * algorithm. After discretizing the free route airspace into unity cells, algorithm based on lazy Theta * algorithm is used to find the shortest path from the entry node to the exit node. Compared with the traditional A* algorithm, the algorithm proposed in this paper plans the route more smoothly.

Keywords: lazy theta* route planning shortest path problem

Published: 2023-06-14
Publisher: EAI

: http://dx.doi.org/10.4108/eai.23-12-2022.2329179