On the interaction between Autonomous Mobility-on-Demand systems and the power network: models and coordination algorithms

We study the interaction between a fleet of electric, self-driving vehicles servicing on-demand transportation requests (referred to as Autonomous Mobility-on-Demand, or AMoD, system) and the electric power network. We propose a model that captures the coupling between the two systems stemming from the vehicles' charging requirements and captures time-varying customer demand and power generation costs, road congestion, battery depreciation, and power transmission and distribution constraints. We then leverage the model to jointly optimize the operation of both systems. We devise an algorithmic procedure to losslessly reduce the problem size by bundling customer requests, allowing it to be efficiently solved by off-the-shelf linear programming solvers. Next, we show that the socially optimal solution to the joint problem can be enforced as a general equilibrium, and we provide a dual decomposition algorithm that allows self-interested agents to compute the market clearing prices without sharing private information. We assess the performance of the mode by studying a hypothetical AMoD system in Dallas-Fort Worth and its impact on the Texas power network. Lack of coordination between the AMoD system and the power network can cause a 4.4% increase in the price of electricity in Dallas-Fort Worth; conversely, coordination between the AMoD system and the power network could reduce electricity expenditure compared to the case where no cars are present (despite the increased demand for electricity) and yield savings of up $147M/year. Finally, we provide a receding-horizon implementation and assess its performance with agent-based simulations. Collectively, the results of this paper provide a first-of-a-kind characterization of the interaction between electric-powered AMoD systems and the power network, and shed additional light on the economic and societal value of AMoD.Comment: Extended version of the paper presented at Robotics: Science and Systems XIV, in prep. for journal submission. In V3, we add a proof that the socially-optimal solution can be enforced as a general equilibrium, a privacy-preserving distributed optimization algorithm, a description of the receding-horizon implementation and additional numerical results, and proofs of all theorem

On the interaction between Autonomous Mobility-on-Demand systems and the power network: models and coordination algorithms

We study the interaction between a fleet of electric, self-driving vehicles servicing on-demand transportation requests (referred to as Autonomous Mobility-on-Demand, or AMoD, system) and the electric power network. We propose a model that captures the coupling between the two systems stemming from the vehicles' charging requirements and captures time-varying customer demand and power generation costs, road congestion, battery depreciation, and power transmission and distribution constraints. We then leverage the model to jointly optimize the operation of both systems. We devise an algorithmic procedure to losslessly reduce the problem size by bundling customer requests, allowing it to be efficiently solved by off-the-shelf linear programming solvers. Next, we show that the socially optimal solution to the joint problem can be enforced as a general equilibrium, and we provide a dual decomposition algorithm that allows self-interested agents to compute the market clearing prices without sharing private information. We assess the performance of the mode by studying a hypothetical AMoD system in Dallas-Fort Worth and its impact on the Texas power network. Lack of coordination between the AMoD system and the power network can cause a 4.4% increase in the price of electricity in Dallas-Fort Worth; conversely, coordination between the AMoD system and the power network could reduce electricity expenditure compared to the case where no cars are present (despite the increased demand for electricity) and yield savings of up $147M/year. Finally, we provide a receding-horizon implementation and assess its performance with agent-based simulations. Collectively, the results of this paper provide a first-of-a-kind characterization of the interaction between electric-powered AMoD systems and the power network, and shed additional light on the economic and societal value of AMoD.Comment: Extended version of the paper presented at Robotics: Science and Systems XIV and accepted by TCNS. In Version 4, the body of the paper is largely rewritten for clarity and consistency, and new numerical simulations are presented. All source code is available (MIT) at https://dx.doi.org/10.5281/zenodo.324165

Uncertain demand prediction for guaranteed automated vehicle fleet performance

Mobility-on-demand (MoD) services offer a convenient and efficient transportation option, using technology to replace traditional modes. However, the flexibility of MoD services also presents challenges in controlling the system. One of the major issues is supply-demand imbalance, caused by uneven stochastic travel demand. To address this, it is crucial to predict the network behavior and proactively adapt to future travel demand.In this thesis, we present a stochastic model predictive controller (SMPC) that accounts for uncertainties in travel demand predictions. Our method make use of Gaussian Process Regression (GPR) to estimate passenger travel demand and predict time patterns with uncertainty bounds. The SMPC integrates these demand predictions into a receding horizon MoD optimization and uses a probabilistic constraining method with a user-defined confidence interval to guarantee constraint satisfaction. This result in a Chance Constrained Model Predictive Control (CCMPC) solution. Our approach has two benefits: incorporating travel demand uncertainty into the MoD optimization and the ability to relax the solution into a simpler Mixed-Integer Linear Program (MILP). Our simulation results demonstrate that this method reduces median customer wait time by 4% compared to using only the mean prediction from GPR. By adjusting the confidence bound, near-optimal performance can be achieved