Graph Theory-Based Programmable Topology Derivation of Multiport DC–DC Converters With Reduced Switches

Abstract

Different from the typical topology derivation of power electronics converters (PECs) depending on manual effort, this article aims to explore a programmable method based on graph theory for multiport dc–dc converters with reduced switches. By mathematically modeling converters with graph theory and transforming their working criteria into the corresponding graph constraints, the topology derivation can be automatically and conveniently solved with the aid of computer program. In this article, first, the principle of the proposed graph theory-based programmable method is introduced in detail. Then, it is employed to derive multiport dc–dc converters with reduced switches, and a diversity of new topologies are simultaneously excavated, among which a favorable one is selected to be theoretically introduced and experimentally verified. The proposed method remains relatively simple with the increasing number of ports, as the graph constraints of working criteria are almost the same for different number of ports. More importantly, because PECs can be essentially regarded as graphs with different components and their connecting relationships, the proposed method is applicable for many various converters.