Qinshuang Wei

Qinshuang Wei

Auto-generated profile, based on publicly available information

Qinshuang Wei

School of Electrical and Computer Engineering, Georgia Institute of Technology, Atlanta, GA, USA

Research Focus & Metrics

Academic Career Length

8Years (2019-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
8 July 2024 in Transportation Research Part C: Emerging Technologies
Verified
Journal Article
Closed access
ZGZhenyu Gao
Zhenyu Gao
YYYue Yu
Yue Yu
QWQinshuang Wei
Qinshuang Wei
UTUfuk Topcu
Ufuk Topcu
JCJohn-Paul Clarke
John-Paul Clarke

16 May 2024 in Transportation Research Part B: Methodological
Verified
Journal Article
Closed access
QWQinshuang Wei
Qinshuang Wei
ZGZhenyu Gao
Zhenyu Gao
JCJohn-Paul Clarke
John-Paul Clarke
UTUfuk Topcu
Ufuk Topcu

13 August 2020 in IEEE Transactions on Control of Network Systems
Verified
Journal Article
Closed access
QWQinshuang Wei
Qinshuang Wei
RPRamtin Pedarsani
Ramtin Pedarsani
SCSamuel Coogan
Samuel Coogan
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
Verified
Journal Article
Closed access
QWQinshuang Wei
Qinshuang Wei
GNGustav Nilsson
Gustav Nilsson
SCSamuel Coogan
Samuel Coogan
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.

18 March 2019 in arXiv
Verified
Preprint
Open access
PDF file
QWQinshuang Wei
Qinshuang Wei
JRJorge Alberto Rodriguez
Jorge Alberto Rodriguez
RPRamtin Pedarsani
Ramtin Pedarsani
SCSamuel Coogan
Samuel Coogan
We consider ride-sharing networks served byhuman-driven vehicles and autonomous vehicles. First, wepropose a novel model for ride-sharing in this mixed autonomysetting for a multi-location network in which the platformsets prices for riders, compensation for drivers, and operatesautonomous vehicles for a fixed price. Then we study thepossible benefits, in the form of increased profits, to the ride-sharing platform that are possible by introducing autonomousvehicles. We first establish a nonconvex optimization problemcharacterizing the optimal profits for a network operatingat a steady-state equilibrium and then propose a convexproblem with the same optimal profits that allows for efficientcomputation. Next, we study the relative mix of autonomous andhuman-driven vehicles that results at equilibrium for variouscosts of operation for autonomous vehicles. In particular, weshow that there is a regime for which the platform will chooseto mix autonomous and human-driven vehicles in order tooptimize profits. Our results provide insights into how suchride-sharing platforms might choose to integrate autonomousvehicles into their fleet.