Capacity-Constrained Urban Air Mobility Scheduling

  title={Capacity-Constrained Urban Air Mobility Scheduling},
  author={Qinshuang Wei and Gustav Nilsson and Samuel D. Coogan},
This paper studies the problem of scheduling urban air mobility trips when travel times are uncertain and capacity at destinations is limited. Urban air mobility, in which air transportation is used for relatively short trips within a city or region, is emerging as a possible component in future transportation networks. Destinations in urban air mobility networks, called vertiports or vertistops, typically have limited landing capacity, and, for safety, it must be guaranteed that an air vehicle… 

Figures from this paper



Scheduling of Urban Air Mobility Services with Limited Landing Capacity and Uncertain Travel Times

This paper presents a network model for an on-demand urban air mobility service with uncertain travel times and limited landing capacity at nodes, and presents a mixed integer program for obtaining an optimal schedule in this case.

A dynamic programming heuristic for vehicle routing with time-dependent travel times and required breaks

The objective of this paper is to develop a solution method for the VRP with time windows (VRPTW), time-dependent travel times, and driving hours regulations, and an efficient heuristic for optimizing the vehicle’s departure times for each (partial) vehicle route, such that the complete solution algorithm runs in polynomial time.

Simulation Evaluations of an Autonomous Urban Air Mobility Network Management and Separation Service

This paper presents an initial implementation of an autonomous Urban Air Mobility network management and aircraft separation service for urban airspace that does 1) departure and arrival scheduling

Optimizing Combined Truck Routing and Parking based on Parking Availability Prediction

According to the U.S. Department of Transportation, 36 states are experiencing shortages in rest areas, affecting the truck drivers’ ability to comply with working hour regulations. This issue points

Algorithms for minimum‐cost paths in time‐dependent networks with waiting policies

This article surveys several broad classes of waiting policies and shows how techniques for speeding up dynamic programming can be effectively applied to obtain practical algorithms for these different problem variants.

Urban Air Mobility Airspace Integration Concepts and Considerations

This paper will serve as a starting point to develop a framework for NASA’s Urban Air Mobility airspace integration research and development efforts with partners and stakeholders that could include fast-time simulations, human-in-the-loop simulations, and flight demonstrations.

Identifying the factors affecting the use and adoption of urban air mobility

Transportation systems in urban environments are facing an increasing number of challenges. Growing mobility demand imposes additional pressure on existing infrastructure and public transportation

A Throughput Based Capacity Metric for Low-Altitude Airspace

A throughput-based metric for estimating airspace capacity to accommodate future air traffic in low-altitude airspace is proposed and finds that, beyond an algorithm-specific aircraft inflow rate, throughput tends to decrease before the system safety reduces, and hence this metric is promising for evaluating airspace capacity.

Dynamic Traffic Scheduling and Congestion Control across Data Centers Based on SDN

Considering the prolonged occupation of the bandwidth by malicious flows, the multilevel feedback queue mechanism is employed and an effective congestion control algorithm is proposed and demonstrated a better traffic scheduling effect and great improvement in bandwidth utilization across data centers.