The emerging all-electric aircraft (AEA), which usually uses lithium-ion batteries (LIBs) as the energy supply unit, has constant mass but variable propulsive performance. The available voltage and power of an electrified propulsion system can vary regarding battery current and capacity consumption. The dynamic features distinguish AEA from its conventional counterpart driven by fossil fuel, thus necessitating the reconsideration of performance prediction. This article proposes a capacity discretization-based method to efficiently predict the range of AEA. The core idea is to discretize AEA states on capacity consumption nodes. At each node, the maximum horizontal flight distance is determined by numerical optimization and accumulated as the range. To guarantee computational tractability, the crude nonlinear programming problem (NLP) is convexified iteratively based on the previous solution. Compared to a benchmark Breguet equation, the proposed method reflects the influence of the voltage drop feature on the AEA range and improves the prediction precision by 15.22%. Further numerical cases show that the iterative convex programming method is superior to the nonlinear programming paradigm with computational time reduced by 77.60%.
A Range Prediction Method for All-Electric Aircraft by Capacity Discretization-Based Iterative Convex Programming
IEEE Transactions on Transportation Electrification ; 10 , 2 ; 3455-3467
2024-06-01
1563253 byte
Aufsatz (Zeitschrift)
Elektronische Ressource
Englisch
Iterative refinement of the discretization of the Dynamic Programming state grid
Kraftfahrwesen | 2016
|Iterative refinement of the discretization of the Dynamic Programming State Grid
Springer Verlag | 2016
|An Iterative Convex Programming Method for Rocket Landing Trajectory Optimization
Springer Verlag | 2020
|Hybrid electric vehicle real-time prediction energy management method based on convex programming
Europäisches Patentamt | 2023
|