Search arXivSearch

arXiv · 2508.14224

A Data-Based Review of Battery Electric Vehicle and Traction Inverter Trends

Abstract

Battery electric vehicles (BEVs) have advanced significantly during the past decade, yet drivetrain energy losses continue to restrict practical range and elevate cost. A dataset comprising more than 1000 European-market BEVs (model years 2010-2025) is combined with detailed inverter-motor co-simulation to chart technology progress for and quantify the efficiency and cost-saving potential of partial-load optimised multi-level inverter (MLI) for 2030. Average drive-cycle range has climbed from 135 km to 455 km, while fleet-average energy consumption has remained virtually constant. Three inverter topologies are assessed to evaluate future efficiency and cost enhancements: a conventional two-level (2L) six halfbridge (B6) inverter with silicon (Si) and silicon carbide (SiC) devices, and two three-level (3L) T-type neutral point clamped (TNPC) and active neutral point clamped (ANPC) inverters tailored for partial-load operation. The 3L-TNPC inverter, realised with only 30% additional SiC chip area, lowers drive-cycle drivetrain losses by 0.67 kWh/100 km relative to a SiC 2L-B6 baseline. These results identify partial-load optimised MLIs as a cost-effective route to further reduce BEV energy consumption and total system cost.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Christoph Sachs, Martin Neuburger. 2025-08-19. A Data-Based Review of Battery Electric Vehicle and Traction Inverter Trends. https://arxiv.org/abs/2508.14224

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

KEEP EXPLORING

Related papers

Observability and parameter estimation of a generic model for aggregated distributed energy resources

We propose a novel framework for estimating the parameters of an aggregated distributed energy resources (DER A) model. First, we introduce a rigorous method to determine whether all model parameters are estimable. When they are not, our approach identifies the subset of parameters that can be estimated. The proposed framework offers new insights into the number and specific parameters that can be reliably estimated based on commonly available measurements. It also highlights the limitations of calibrating such models. Second, we introduce a Kalman filtering method to calibrate the DER A model. Since we account for nonlinear effects such as saturation and deadbands, we develop a specific mechanism to handle smoothing functions within the Kalman filter. Specifically, we consider the extended and the unscented Kalman filter. We demonstrate the effectiveness of the proposed framework on a modified IEEE 34-node distribution feeder with inverter- based resources. Our findings align with the North American Electric Reliability Corporation's parameterization guideline and underscore the importance of model calibration in accurately capturing the collective dynamics of distributed energy resources installed on distribution systems.

eess.SY

Salted Fisher Information for Hybrid Systems

Discrete events change how parameter-influence propagates in hybrid systems. Prevailing Fisher information for- mulations assume that sensitivities evolve smoothly according to continuous-time variational equations and therefore neglect the sensitivity updates induced by discrete events. This paper derives a Fisher information matrix formulation compatible with hybrid systems. To do so, we use the saltation matrix, which encodes the first-order transformation of sensitivities induced by discrete events. We call the resulting formulation the salted Fisher information matrix (SFIM). The proposed framework unifies continuous information accumulation during flows with discrete updates at event times. We also show that hybrid persistence of excitation is sufficient for the SFIM to be positive definite

eess.SY

Min-Max Grassmannian Optimization for Online Subspace Tracking

We propose GeRoST (Geometrically Robust Subspace Tracking), an online subspace tracking algorithm that models uncertainty in a subspace using a Grassmannian ball. We derive an exact scalar dual for the worst-case subspace problem, establish conditions for a unique worst-case subspace and a Riemannian gradient, and characterize the minimum radius needed to cover a dimensional extension of the target subspace. Each update uses either a spectral direction computed in a reduced subspace or the gradient of the window reconstruction loss. Our numerical experiments show that GeRoST achieves lower mean post-fault prediction error than GREAT in system identification. In video separation, it achieves higher precision and a better precision--recall balance, as measured by the F$_1$ score, than both GREAT and GRASTA at the reported thresholds, with lower recall and longer runtime.

eess.SY