動態負載下可重組式電池組之控制演算法

Abstract

鋰離子電池在網絡實體系統上廣泛的應用，吸引眾多關於高能源效率之電池系統的研究。可重組式電池組被提出作為提升系統可靠性及能源效率之解決方案。近期研究中，關於如何在重組過程中同時最大化使用時間及最小化開關次數，尚未被完整的研究。此篇論文中，基於簡化電池模型的假設，我們設計一個開關控制演算法，使電池組供給常負載達到最長使用時間且開關次數至多為最小值之兩倍。此演算法更進一步地被推廣至動態負載。模擬結果顯示我們所提出的演算法有良好的結果。

The broad applications of lithium-ion batteries in cyber-physical systems attract intensive research on building energy-efficient battery systems. Reconfigurable battery packs have been proposed to improve reliability and energy efficiency. Despite recent efforts, how to simultaneously maximize battery usage time and minimize switching count during reconfiguration is rarely addressed. In this work, we devise a control algorithm that, under a simplified battery model, achieves the longest usage time under a given constant power-load while the switching count is at most twice above the minimum. It is further generalized for arbitrary power-loads. Simulation experiments show promising benefits of the proposed algorithm.