Improving critical buildings energy resilience via shared autonomous electric vehicles -- A sequential optimization framework

Jinming Liu; Adam Abdin; Jakob Puchinger

Home/Archive/arXiv

arXiv · 2603.12771

Improving critical buildings energy resilience via shared autonomous electric vehicles -- A sequential optimization framework

Jinming Liu·Adam Abdin·Jakob Puchinger

View original source ↗Read source document ↗Export metadata ↓

Abstract

The interdependence between electric power systems and transportation systems is rapidly increasing due to the high adoption of Electric Vehicles (EVs) and their charging infrastructures. Electric vehicles can represent additional load for the power system, but can also bring new opportunities for contributing to the efficient and resilient operations of the power grid. This is mainly because of their ability to provide back power to the system when it is not used for transportation, essentially serving as a moving battery source for the power grid. This so-called Vehicle-to-Grid (V2G), Vehicle-to-Building (V2B), or, generally, Vehicle-to-X (V2X) capability of EVs has been extensively studied in the literature. However, the upcoming development of autonomous driving systems and their integration within sharing mobility services can significantly add to the possibilities of interaction between the transportation system and the power grid. This paradigm is studied to a much lesser extent in the existing literature. Shared Autonomous Electric Vehicles (SAEVs) could allow for more control of the actions of the fleet allowing for large-scale coordinated responses both to mobility and energy demands. This coordinated response can be particularly useful for providing emergency power services in case of power loss while maintaining a high level of transportation service. Thus, improving the overall resilience of the system. In this work, we develop a dynamic optimization framework to evaluate the potential contribution of the SAEV fleet for improving critical buildings' energy resilience via V2B services. The model considers passengers' pick-up and transportation, relocation of vehicles, and battery charging and discharging. Power outage scenarios for critical buildings are considered and the potential of the SAEV fleet to fully or partially respond to the emergency power outage is studied. In addition, sensitivity analysis for key parameters such as the outage parameters is introduced. The results of the case study for the Ile-de-France region in France shows that the SAEV fleet has the potential to provide V2B service for critical building at an acceptable loss of passenger total waiting time on the transportation side. Furthermore, it is shown that it is capable of satisfying the emergency power load at a lower cost compared to investing in extra backup generators unless the outage occurs at significantly high frequencie

Explore related subjects

math.OC

Keep this discovery

BibTeX RIS

Jinming Liu, Adam Abdin, Jakob Puchinger. 2026-03-13. Improving critical buildings energy resilience via shared autonomous electric vehicles -- A sequential optimization framework. https://arxiv.org/abs/2603.12771

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

KEEP EXPLORING

Related papers

arXiv2026

Deterministic and Random Bipartite Matching on General Networks: Convex Flow Reformulation, Asymptotic Properties, and Fast Algorithms

Minimum-distance bipartite matching on general networks has numerous applications various fields. This paper first focuses on deterministic problems and presents an exact edgewise-separable convex-flow reformulation. By introducing a smooth monotone rearrangement approximation of the edge-wise imbalance profiles, the convex-flow reformulation's can be solved efficiently. If we further conduct a first-order resistance-based approximation of the convex program, a one-step Laplacian-based estimator can be analytically derived in closed forms. The paper also studies random problems where supply and demand points are randomly distributed. We show that the expected optimal matching distance scales with the square root of the number of points if the supply/demand point distributions are identical, or linearly otherwise. In the former case, the optimal flow is proven to be centered, symmetric, and sub-Gaussian. In the latter case, the limiting resistance network characterizes how supply-demand imbalance is redistributed and motivates a fast algorithm that approximate the optimal flow based on the limiting resistance. Numerical experiments show that the proposed estimators closely approximate the exact matching cost while substantially reducing computation time. The proven theoretical properties of the random matching solution are numerically verified by large-scale Monte Carlo simulations.

math.OC↗

arXiv2026

Conformal-DRO: Distributionally Robust Optimization with Conformalized Ambiguity Set

Data-driven distributionally robust optimization (DRO) typically treats the conditional outcome law as fixed and uses ambiguity sets to capture estimation error. This paper studies latent distributional heterogeneity, where each instance has an unobserved law but contributes only one observation, so uncertainty persists even if the mixture law is known. We propose Conformal-DRO, which uses nested conformal regions to construct an ambiguity set for the future latent law. Under exchangeability, the set covers this law with probability at least $1-\alpha$ in finite samples, without estimating underlying latent laws or their mixing mechanism. The conformal path induces a data-driven transport geometry, while $\alpha$ determines the radius. The worst-case problem reduces to a finite linear program over conformal shells and admits sparse adversarial solutions. The resulting robust value provides a finite-sample certificate for the selected decision's expected cost.

math.OC↗

arXiv2026

The best approximation tuple: an extension of the Cheney-Goldstein algorithm and results to the multiple sets case

In this paper we extend the algorithm and several results published in the celebrated 1959 paper of Cheney and Goldstein about the best approximation pair (BAP) problem in two separate directions. One is the consideration of more than two sets. The other is the ability to handle each set as an intersections of a finite family of sets. We call the resulting problem the "Best Approximation Tuple (BAT) problem". The fundamental observation that leads to this generalizations is to recognize and handle one set (the "pivot set") as different from the remaining sets (the "satellite sets") instead of seeking cycles as the minimizers of a target functional. This enable us to overcome a certain theoretical obstacle related to cycles and minimizers of general functionals. We prove the convergence of the algorithm to the unique solution of the problem in the Euclidean case with strictly convex and compact satellite sets. Because of the lack of Fej\'er monotonicity, our convergence analysis is not standard, and is based on almost unknown properties of orthogonal projections regarding equality and inequality in the definition of nonexpansiveness.

math.OC↗