Search arXiv⌕ Search
Home/Archive/arXiv

arXiv · 2009.03726

Modeling and Analysis of Dynamic Charging for EVs: A Stochastic Geometry Approach

Duc Minh Nguyen·Mustafa A. Kishk·Mohamed-Slim Alouini
View original source ↗Read source document ↗Export metadata ↓

Abstract

With the increasing demand for greener and more energy efficient transportation solutions, electric vehicles (EVs) have emerged to be the future of transportation across the globe. However, currently, one of the biggest bottlenecks of EVs is the battery. Small batteries limit the EVs driving range, while big batteries are expensive and not environmentally friendly. One potential solution to this challenge is the deployment of charging roads, i.e., dynamic wireless charging systems installed under the roads that enable EVs to be charged while driving. In this paper, we use tools from stochastic geometry to establish a framework that enables evaluating the performance of charging roads deployment in metropolitan cities. We first present the course of actions that a driver should take when driving from a random source to a random destination in order to maximize dynamic charging during the trip. Next, we analyze the distribution of the distance to the nearest charging road. This distribution is vital for studying multiple performance metrics such as the trip efficiency, which we define as the fraction of the total trip spent on charging roads. Next, we derive the probability that a given trip passes through at least one charging road. The derived probability distributions can be used to assist urban planners and policy makers in designing the deployment plans of dynamic wireless charging systems. In addition, they can also be used by drivers and automobile manufacturers in choosing the best driving routes given the road conditions and level of energy of EV battery.

Explore related subjects

stat.APeess.SPmath.PR

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Duc Minh Nguyen, Mustafa A. Kishk, Mohamed-Slim Alouini. 2020-09-08. Modeling and Analysis of Dynamic Charging for EVs: A Stochastic Geometry Approach. https://arxiv.org/abs/2009.03726

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

KEEP EXPLORING

Related papers

arXiv2026

Auditing Bayesian Graph Alignment: Diagnostic Comparisons and Reference Failure

Bayesian graph alignment estimates correspondence probabilities, but convergence of an alignment-score trace need not imply accurate correspondence marginals. We audit this gap on 240 new exact graph pairs from four source families, 240 larger pairs with 20-100 vertices, and a separate 60-case exact implementation check. Under an explicit edge-flip likelihood, we compare three samplers and score, marginal, indicator, categorical, and classifier-based diagnostics. Marginal disagreement improves error discrimination over score R-hat for the exact informed sampler, but its improvement for vanilla local sampling is uncertain. Assignment-based R* and short indicator panels are competitive; no diagnostic dominates across samplers and endpoints. At larger sizes, diagnostics predict subsequent marginal changes, not posterior error, and classification performance depends on the drift threshold. Disjoint-window and held-out-chain checks attenuate but preserve positive associations. Only 22 of 240 original reference sets pass an agreement screen. On forty failure-selected cases, eightfold SMC particle escalation does not resolve disagreement, whereas additional rejuvenation helps. Longer informed runs remain unstable. An elementary feasible-alignment bound demonstrates severely unrepresentative SMC and informed-chain scores in concentrated 100-vertex cases, independently of approximate reference consensus. We also exhibit common-start chains with near-zero disagreement despite exact marginal error near .967. These results support assignment-sensitive auditing while identifying limits of finite budgets, diagnostic rankings, and reference agreement as evidence of accuracy.

stat.AP↗
arXiv2026

GeoDose-CP: Graph-Local Conformal Inference for Continuous-Treatment Earth Observation

Reliable intervention-oriented uncertainty quantification from Earth observation (EO) remains challenging when continuous treatment shifts, spatial dependence, limited support, and satellite-outcome uncertainty must be addressed simultaneously. Existing causal, conformal, and spatial approaches address parts of this problem, but their direct combination does not generally recover the appropriate interventional reference law because candidate reassignment jointly alters treatment likelihood, standardized residuals, and graph-dependent residual likelihood. This study presents GeoDose-CP, a support-aware conformal framework for localized stochastic potential outcomes under continuous or mixed continuous-atomic treatment. Its central methodological contribution is a graph-local target-orbit law that jointly represents intervention-induced treatment shift, the inverse outcome-scale Jacobian, and spatial residual dependence. The framework further provides exact weighted candidate inversion, a scalable sparse approximation with explicit discrepancy accounting, and refusal under inadequate support. Evaluation used controlled known-truth experiments, MineDoseBench, treatment-density sensitivity analysis, external conformal comparators, and a multi-mine New South Wales (NSW) study. In MineDoseBench, GeoDose-CP achieved mean selective coverage of 0.9692 across 27 configurations and a minimum local q0.05 of 0.8951; exact-sparse auditing produced nine inclusion disagreements over 2,700 targets. In the NSW study, the absence of an auditable longitudinal rehabilitation treatment rendered treatment-dependent inference nonoperational rather than forcing inference through a proxy exposure.

stat.AP↗
arXiv2026

Interpreting relative utility for probabilistic predictions

At a fixed threshold, relative utility (RU) measures the net-benefit gain of a prediction model over the better of treat-all and treat-none relative to the corresponding gain under perfect outcome classification. We illustrate that RU equal to 1 therefore represents perfect outcome classification at that fixed threshold, not perfect probabilistic prediction. However, even when every predicted probability equals the true probability, observed RU can equal 0. In a simple constant-risk setting, this occurs with probability approaching 1 as the sample size increases. Consequently, the distance from observed RU to 1 should not in general be interpreted as improvement achievable by a better prediction for binary probabilities.

stat.AP↗