Geometric Trajectory Optimization for TRACON Arrivals: An NLP Approach with ATC Vectoring Maneuver Modeling

Fuente: arXiv
Saved in:
Bibliographic Details
Main Authors: Pang, Yutian, Delahaye, Daniel, Clarke, John-Paul
Format: Preprint
Published: 2026
Subjects:
Online Access:
Tags: Add Tag
No Tags, Be the first to tag this record!
_version_ 1866908980644675584
author Pang, Yutian
Delahaye, Daniel
Clarke, John-Paul
author_facet Pang, Yutian
Delahaye, Daniel
Clarke, John-Paul
contents Terminal airspace congestion remains a major bottleneck in the global air traffic network. Although the Aircraft Sequencing and Scheduling Problem (ASSP) has been widely studied, many methods rely on simplified node-link abstractions that ignore the practical flight path, producing schedules that can be hard to execute under real airspace geometric constraints. This paper introduces a high-fidelity trajectory optimization framework for Terminal Arrival Sequencing and Scheduling (TASS) that explicitly models controller vectoring maneuvers. We formulate a single-stage nonlinear programming (NLP) model with a weighted objective function that optimizes Baseleg path extension and segment-wise speed profiles for arriving aircraft. The model enforces nonlinear geometric coupling between Baseleg extensions and the required Radius-to-Fix (RF) turn for Final Approach Fix (FAF) intercept through closed-form expressions. Under the First-Come-First-Served (FCFS) rule, it generates separated, operationally feasible trajectories aligned with controller practice. Monte Carlo simulations with ample runs on the A80 TRACON in Atlanta demonstrate minimal separation violations below the runway capacity threshold through tactical path stretching, with violations occurring only when arrival rates exceed the maximum tolerable rate.
format Preprint
id arxiv_https___arxiv_org_abs_2604_18454
institution arXiv
publishDate 2026
record_format arxiv
spellingShingle Geometric Trajectory Optimization for TRACON Arrivals: An NLP Approach with ATC Vectoring Maneuver Modeling
Pang, Yutian
Delahaye, Daniel
Clarke, John-Paul
Optimization and Control
Probability
Terminal airspace congestion remains a major bottleneck in the global air traffic network. Although the Aircraft Sequencing and Scheduling Problem (ASSP) has been widely studied, many methods rely on simplified node-link abstractions that ignore the practical flight path, producing schedules that can be hard to execute under real airspace geometric constraints. This paper introduces a high-fidelity trajectory optimization framework for Terminal Arrival Sequencing and Scheduling (TASS) that explicitly models controller vectoring maneuvers. We formulate a single-stage nonlinear programming (NLP) model with a weighted objective function that optimizes Baseleg path extension and segment-wise speed profiles for arriving aircraft. The model enforces nonlinear geometric coupling between Baseleg extensions and the required Radius-to-Fix (RF) turn for Final Approach Fix (FAF) intercept through closed-form expressions. Under the First-Come-First-Served (FCFS) rule, it generates separated, operationally feasible trajectories aligned with controller practice. Monte Carlo simulations with ample runs on the A80 TRACON in Atlanta demonstrate minimal separation violations below the runway capacity threshold through tactical path stretching, with violations occurring only when arrival rates exceed the maximum tolerable rate.
title Geometric Trajectory Optimization for TRACON Arrivals: An NLP Approach with ATC Vectoring Maneuver Modeling
topic Optimization and Control
Probability
url https://arxiv.org/abs/2604.18454