Search arXiv⌕ Search
Home/Archive/arXiv

arXiv · 2309.12680

Can Urban Air Mobility become reality? Opportunities, challenges and selected research results

Henry Pak·Lukas Asmer·Petra Kokus·Bianca I. Schuchardt·Albert End·Frank Meller·Karolin Schweiger·Christoph Torens·Carolina Barzantny·Dennis Becker·Johannes Maria Ernst·Florian Jäger·Tim Laudien·Nabih Naeem·Anne Papenfuß·Jan Pertz·Prajwal Shiva Prakasha·Patrick Ratei·Fabian Reimer·Patrick Sieb·Chen Zhu
View original source ↗Read source document ↗Export metadata ↓

Abstract

Urban Air Mobility (UAM) is a new air transportation system for passengers and cargo in urban environments, enabled by new technologies and integrated into multimodal transportation systems. The vision of UAM comprises the mass use in urban and suburban environments, complementing existing transportation systems and contributing to the decarbonization of the transport sector. Initial attempts to create a market for urban air transportation in the last century failed due to lack of profitability and community acceptance. Technological advances in numerous fields over the past few decades have led to a renewed interest in urban air transportation. UAM is expected to benefit users and to also have a positive impact on the economy by creating new markets and employment opportunities for manufacturing and operation of UAM vehicles and the construction of related ground infrastructure. However, there are also concerns about noise, safety and security, privacy and environmental impacts. Therefore, the UAM system needs to be designed carefully to become safe, affordable, accessible, environmentally friendly, economically viable and thus sustainable. This paper provides an overview of selected key research topics related to UAM and how the German Aerospace Center (DLR) contributed to this research in the project "HorizonUAM - Urban Air Mobility Research at the German Aerospace Center (DLR)". Selected research results that support the realization of the UAM vision are briefly presented.

Explore related subjects

eess.SYcs.SY

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Henry Pak, Lukas Asmer, Petra Kokus, Bianca I. Schuchardt, Albert End, Frank Meller, Karolin Schweiger, Christoph Torens, Carolina Barzantny, Dennis Becker, Johannes Maria Ernst, Florian Jäger, Tim Laudien, Nabih Naeem, Anne Papenfuß, Jan Pertz, Prajwal Shiva Prakasha, Patrick Ratei, Fabian Reimer, Patrick Sieb, Chen Zhu. 2023-09-22. Can Urban Air Mobility become reality? Opportunities, challenges and selected research results. https://doi.org/10.1007/s13272-024-00733-x

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

arXiv2026

Failure-Aware Iterative Learning of State-Control Invariant Sets

In this paper, we address the problem of computing maximal state-control invariant sets for deterministic linear systems using failing trajectories. We introduce the concept of state-control invariance, which extends control invariance from the state space to the joint state-control space. The maximal state-control invariant (MSCI) set simultaneously encodes the maximal control invariant set (MCI) and, for each state in the MCI, the set of control inputs that preserve invariance. We prove that the state projection of the MSCI is the MCI and the state-dependent sections of the MSCI are the admissible invariance-preserving inputs. Building on this framework, we develop a Failure-Aware Iterative Learning (FAIL) algorithm for deterministic linear time-invariant systems with polytopic constraints. The algorithm iteratively updates a constraint set in the state-control space by learning predecessor halfspaces from one-step failing state-input pairs, without knowing the dynamics. For each failure, FAIL learns the violated halfspaces of the predecessor of the constraint set by a regression on failing trajectories. We prove that the learned constraint set converges monotonically to the MSCI. Numerical experiments on a double integrator system validate the proposed approach.

eess.SY↗
arXiv2026

Consensus and Synchronization of Multi-agent Systems over Finite Fields - Graph Topologies

This paper presents cooperative protocols for multi-agent systems with agents having a finite state-space. Both scalar single-integrator consensus and general LTI system synchronization are considered. Systems having a finite state-space describe agents with minimal memory capacity processing only a finite alphabet. Such systems are remarkably resilient to communication noise. The crucial problem, however, is to construct the admissible communication topology, which is NP-hard. We address this by efficiently exploring the subsets of admissible graph matrices and propose two new algorithms to generate them. Simulations validate the proposed approach.

eess.SY↗
arXiv2026

Extracting Exact Lie Derivatives Without Backpropagation: A Dual Compiler for Neural Control Barrier Functions

A safety filter based on a neural control barrier function (CBF) deployed in an embedded control loop evaluates, at each control cycle, the trained network and its Lie derivatives along the system vector fields, under the memory and worst-case execution time (WCET) constraints that safety-oriented coding standards impose. Reverse-mode automatic differentiation, by which training frameworks obtain these derivatives, retains an activation cache whose size grows with the sum of the layer widths, and general-purpose differentiation runtimes allocate the computational graph from the heap at each call. This paper presents a compiler that evaluates a neural CBF and its exact Lie derivatives by forward-mode dual-number arithmetic. The compiler emits self-contained C++ code in which a single forward pass, without backpropagation, returns the barrier value and its exact Lie derivative along a given vector field; the drift and input Lie derivatives of the safety constraint are obtained from one such pass per vector field, and a second-order extension based on hyper-dual numbers returns the exact second-order Lie derivatives required by CBFs of relative degree two. The dual forward pass requires a workspace bounded by four times the widest layer, independent of network depth, and the emitted code contains no allocation call sites, so the absence of dynamic allocation is verifiable by inspection of the code. On an ESP32-S3 microcontroller, the compiled filter assembles the complete safety constraint in under one millisecond from statically allocated buffers of at most 768 bytes, and the maximum execution time over 1000 evaluations lies within 5% of the median in all three examples, whereas a heap-allocating reverse-mode baseline shows maxima 33% and 70% above its median in the two first-order examples. The compiler and the embedded experiments are released as open-source software.

eess.SY↗