Vertiport Design Methodology and Capacity Analysis
eess.SY, cs.SY
Submitted: 2026-09-29
Updated: 2026-09-29
License: http://creativecommons.org/licenses/by-nc-nd/4.0/
The gist: This paper presents a comprehensive methodology for vertiport design and capacity analysis using stochastic queueing models.
Terminology
Abstract
This paper presents a comprehensive methodology for vertiport design and capacity analysis using stochastic queueing models. Vertiport capacity is defined as the maximum steady-state throughput of aircraft per hour while maintaining a specified maximum queuing delay with high probability. We introduce a two-node queueing network model with a finite buffer to analytically derive mean queue lengths and delays at singleTLOF vertiports, supported by a simulation model that validates these findings under various operational conditions. Our analyses reveal that vertiport capacity is significantly constrained by the interactions between takeoff/landing operations and turnaround activities. Capacity is further reduced by the variance in these operational parameters, with deterministic times substantially enhancing capacity. The study shows that vertiport throughput is typically around 50% of the theoretical maximum departure capacity in a Markovian model, decreasing sharply as confidence in maximum queuing delay increases. Non-Markovian models with adequate parking pads achieve full TLOF capacity. Additionally, our methodology identifies the optimal number of parking pads required to maximize throughput per unit area. The findings provide insights for designing vertiport infrastructure to support scalable and efficient UAM deployment.
Related papers
- One Request, Multiple Experts: LLM Orchestrates Domain Specific Models via Adaptive Task Routing
- A Geometric Decision Procedure for STL Feasibility and Repair
- From Asymptotic to Designer-Assigned-Time Control: A Review of Stability Notions, Design Mechanisms, and Controller Architectures
- Battery Second Life: A Review of Experimental Studies
- Submodular Multi-Agent Policy Learning for Online Distributed Task Allocation in Open Multi-Agent Systems
- Policy-Level Recursive Self-Improvement for Embodied AI with a Criticality World Model