An Evolutionary Optimization Approach for Path Planning of Arrival Aircraft for Optimal Sequencing

  • Ahmed M
  • Alam S
  • Barlow M
N/ACitations
Citations of this article
1Readers
Mendeley users who have this article in their library.
Get full text

Abstract

In this paper, we present an evolutionary optimization based path planning algorithm at Terminal Airspace (TAS) that provides a near optimal aircraft arrival sequence at Final Approach Fix (FAF). The sequence obtained minimizes the inter-arrival time as well as provides conflict free path planning to an Air Traffic Controller (ATC). A classic Genetic Algorithm (GA) based optimization technique with conflict detection and resolution is developed. Conflict between any two aircraft is detected based on their future arrival time at the waypoint and resolved by stretching the gap between those two aircraft. The proposed algorithm is compared with the traditional GA. Results indicate that the proposed approach obtains a near optimal solution compared to the traditional GA based algorithm which does not consider TAS constraints.

Cite

CITATION STYLE

APA

Ahmed, M. S., Alam, S., & Barlow, M. (2017). An Evolutionary Optimization Approach for Path Planning of Arrival Aircraft for Optimal Sequencing (pp. 1–16). https://doi.org/10.1007/978-3-319-49049-6_1

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