A generic battery-cycling optimization framework with learned sampling and early stopping strategies
Ontology highlight
ABSTRACT: Summary Battery optimization is challenging due to the huge cost and time required to evaluate different configurations in experiments or simulations. Optimizing the cycling performance is especially costly since battery cycling is extremely time consuming. Here, we introduce an optimization framework building on recent advances in machine learning, which optimizes battery parameters efficiently to significantly reduce the total cycling time. It consists of a pruner and a sampler. The pruner, using the Asynchronous Successive Halving Algorithm and Hyperband, stops unpromising cycling batteries to save the budget for further exploration. The sampler, using Tree of Parzen Estimators, predicts the next promising configurations based on query history. The framework can deal with categorical, discrete, and continuous parameters and can run in an asynchronously parallel way to allow multiple simultaneous cycling cells. We demonstrated the performance by a parameter-fitting problem for calendar aging. Our framework can foster both simulations and experiments in the battery field. Graphical abstract Highlights • A battery-parameter optimization framework is proposed with a pruner and a sampler• The framework can optimize categorical, discrete, and continuous variables• An early-stopping strategy is introduced to reduce the high cycling cost• Parameter fitting problems are investigated to demonstrate fast optimization The bigger picture There are many parameters to optimize for a battery, in both simulations and experiments, from design to manufacturing. It is time consuming and costly to evaluate the lifetime performance of batteries since it takes a long period to cycle them. We introduce a generic framework leveraging machine-learning algorithms. The framework is designed to optimize battery parameters to enhance cycling performance in a systematic and efficient way, which allows parallel cyclers, stops unpromising cycles, and automatically yields new configurations of parameters. The framework could reduce the average cycling time per battery from years to months/weeks for cycling experiments or from weeks to days/hours for cycling computations. This method is flexible to scale up for many applications, from fundamental research to industrial development in batteries and other similar fields. Evaluating battery performance typically requires cycling the cells hundreds or thousands of times. Thus, it is time costly to evaluate the effect of battery parameters on its performance and even more expensive to optimize the parameters. We introduced a generic framework leveraging machine learning incorporated with a pruner and a sampler to efficiently optimize the battery parameters. It allows parallel cyclers, stops unpromising cycles, and automatically yields new configurations of parameters. The framework showed excellent results in our demonstration.
SUBMITTER: Deng C
PROVIDER: S-EPMC9278511 | biostudies-literature |
REPOSITORIES: biostudies-literature
ACCESS DATA