8 July 2024 in Transportation Research Part C: Emerging Technologies
16 May 2024 in Transportation Research Part B: Methodological
13 August 2020 in IEEE Transactions on Control of Network Systems
We consider ride-sharing networks served by human-driven vehicles (HVs) and autonomous vehicles (AVs). We propose a model for ride-sharing in this mixed autonomy setting for a multi-location equidistant network in which a platform sets prices for riders, compensations for drivers of HVs, and operates AVs for a fixed price in order to maximize profits. We consider three vehicle-to-rider assignment possibilities. For each of these priority assignments, we establish a nonconvex optimization problem characterizing the optimal profits for a network operating at a steady-state equilibrium and provide a convex problem which we show to have the same optimal profits, allowing for efficient computation of equilibria. We show that all three priority schemes result in the same maximum profits for the platform. We then consider, for the star-to-complete networks, the ratio of AVs to HVs that will be deployed by the platform in order to maximize profits for various operating costs of AVs. We show that in certain cases, the platform may choose to mix HVs and AVs rather than using only HVs or only AVs. We fully characterize these cases analytically and demonstrate our results on an example.
12 September 2023 in IEEE Transactions on Control of Network Systems
In Urban Air Mobility (UAM) networks, takeoff and landing sites, called vertiports, are likely to experience intermittent closures due to, e.g., adverse weather. To ensure safety, all in-flight Urban Air Vehicles (UAVs) in a UAM network must therefore have alternative landing sites with sufficient landing capacity in the event of a vertiport closure. In this paper, we study the problem of safety verification of UAM schedules in the face of vertiport closures. We first provide necessary and sufficient conditions for a given UAM schedule to be safe in the sense that, if a vertiport closure occurs, then all UAVs will be able to safely land at a backup landing site. We then extend these results to the scenario of multiple vertiport closures. Next, we convert these conditions to an efficient algorithm for verifying the safety of a UAM schedule via a linear program by using properties of totally unimodular matrices. Our algorithm allows for uncertain travel time between UAM vertiports and scales quadratically with the number of scheduled UAVs. We demonstrate our algorithm on a UAM network with up to 1,000 UAVs.