arXiv subjects

Max Z. Li

Publications and source records attributed to Max Z. Li.

21 records · Page 2Linked to original sources

arXiv2024

Spaceport Facility Location Planning within the US National Airspace System

The burgeoning commercial space transportation industry necessitates an expansion of launch infrastructure to meet rising demands. However, future operations from these large-scale infrastructures can result in new impacts, particularly to air traffic operations. To rigorously reason about where such future spaceports might be located and what their impacts might be, we introduce a facility location planning model for future US spaceports (SPFLP). Central considerations for the SPFLP include population density, space launch trajectories, and potential impacts to air traffic within the US National Airspace System (NAS). The SPFLP outputs a cost-optimal set of candidate locations for future spaceports while satisfying a range of operational constraints. By conducting sensitivity analyses on the SPFLP, we are able to examine differences in flight rerouting costs and optimal launch mission allocations. Our model and numerical experiments offer valuable insights for future spaceport site selection, contributing to the strategic development of commercial space transportation while keeping in mind the need to integrate these operations within the NAS.

math.OC↗

arXiv2023

Remote Identification Trajectory Coverage in Urban Air Mobility Applications

As Urban Air Mobility (UAM) and Advanced Air Mobility (AAM) continue to mature, a safety-critical system that will need to be implemented in tandem is Remote Identification (Remote ID) for uncrewed aircraft systems (UAS). To ensure successful and efficient deployment (e.g., maximal surveillance of UAS trajectories), as well as to better understand secondary impacts (e.g., consumer privacy risks in collecting real-time UAS trajectory information), the coverage of broadcast-receive Remote ID architectures needs to be characterized. Motivated by this need, we examine theoretical and empirical trajectory coverage of several common Remote ID technologies (e.g., Bluetooth, Wi-Fi) deployed for urban package delivery missions, a commonly-cited use case for UAM and AAM. We derive methods to explicitly compute expected coverage proportions under idealized geometries, as well as conduct case studies with realistic city geographies and UAS path planning algorithms. An example of results include approximate magnitudes of Remote ID receivers needed (approximately 500-5000 receivers needed to achieve 50-95\% coverage for Bluetooth Legacy, and approximately 10-40 receivers needed for the same coverage range for Wi-Fi NAN/Beacon, assuming a cruise altitude of 200 feet) to achieve specific trajectory coverage proportions for San Francisco, California. Our analyses, combined with complementary works related to Remote ID bandwidth and deployment topologies, can help guide municipal authorities and AAM stakeholders in future Remote ID system deployments and upkeep.

eess.SY↗

arXiv2022

Routing with Privacy for Drone Package Delivery Systems

Unmanned aerial vehicles (UAVs), or drones, are increasingly being used to deliver goods from vendors to customers. To safely conduct these operations at scale, drones are required to broadcast position information as codified in remote identification (remote ID) regulations. However, location broadcast of package delivery drones introduces a privacy risk for customers using these delivery services: Third-party observers may leverage broadcast drone trajectories to link customers with their purchases, potentially resulting in a wide range of privacy risks. We propose a probabilistic definition of privacy risk based on the likelihood of associating a customer to a vendor given a package delivery route. Next, we quantify these risks, enabling drone operators to assess privacy risks when planning delivery routes. We then evaluate the impacts of various factors (e.g., drone capacity) on privacy and consider the trade-offs between privacy and delivery wait times. Finally, we propose heuristics for generating routes with privacy guarantees to avoid exhaustive enumeration of all possible routes and evaluate their performance on several realistic delivery scenarios.

cs.CR↗