This page has only limited features, please log in for full access.

Unclaimed
Zhengqi Jiang
Authors to whom correspondence should be addressed

Basic Info

Basic Info is private.

Honors and Awards

The user has no records in this section


Career Timeline

The user has no records in this section.


Short Biography

The user biography is not available.
Following
Followers
Co Authors
The list of users this user is following is empty.
Following: 0 users

Feed

Journal article
Published: 16 May 2020 in Electronics
Reads 0
Downloads 0

In a digital microgrid (DMG), different from an analogous microgrid, energy is transmitted in well-defined amounts and in a store-and-forward fashion. Nodes of a DMG network, or energy packet switches (EPSs), use supercapacitors as temporary energy storage units to control the amount of energy supplied to a load. An EPS aggregates energy coming from different inputs or sources and forwards it to other EPSs or to a load. Rather than referring to electrical power, we measure the delivery of it as energy. An EPS is built with many supercapacitors to be able to provide significant amounts of energy to one or multiple loads. An EPS dedicates a configurable number of supercapacitors to an energy flow. In this paper, we find the conditions to achieve the smallest energy loss in the supply of energy from energy sources to loads in a DMG and propose a routing algorithm to find a path with small capacitance in a DMG network built with store-and-forward energy nodes. In addition, because an EPS has a finite amount of capacitance, the number of flows that the DMG can sustain may be limited. Exacerbating this problem, the passive transfer of energy between energy units may suffer losses as a result of the capacitance used and energy transmitted between supercapacitors. Therefore, the path between a source and a load has to be carefully selected. To solve this problem, our proposed routing algorithm finds the smallest capacitance paths to enable the scalability of the DMG. We analyze a path of supercapacitor-based networks and underscore the conditions to achieve minimal energy losses, to minimize the path capacitance, and to balance these two conflicting objectives. We analyze these approaches and show numerical examples on a small power network. Results show that total energy loss in this DMG is path independent as this loss depends on only the voltage of the capacitors at Node 1; the node connected to the source. In addition, results show that by adopting the proposed algorithm, the scalability of the DMG can be increased by finding the smallest capacitance paths to transfer energy between the sources and the loads. We show how store-and-forward transfer works on an actual DMG testbed with two EPSs and two loads.

ACS Style

Zhengqi Jiang; Roberto Rojas-Cessa. Finding Efficient and Lower Capacitance Paths for the Transfer of Energy in a Digital Microgrid. Electronics 2020, 9, 822 .

AMA Style

Zhengqi Jiang, Roberto Rojas-Cessa. Finding Efficient and Lower Capacitance Paths for the Transfer of Energy in a Digital Microgrid. Electronics. 2020; 9 (5):822.

Chicago/Turabian Style

Zhengqi Jiang; Roberto Rojas-Cessa. 2020. "Finding Efficient and Lower Capacitance Paths for the Transfer of Energy in a Digital Microgrid." Electronics 9, no. 5: 822.

Journal article
Published: 09 August 2019 in Energies
Reads 0
Downloads 0

In this paper, we propose the greedy smallest-cost-rate path first (GRASP) algorithm to route power from sources to loads in a digital microgrid (DMG). Routing of power from distributed energy resources (DERs) to loads of a DMG comprises matching loads to DERs and the selection of the smallest-cost-rate path from a load to its supplying DERs. In such a microgrid, one DER may supply power to one or many loads, and one or many DERs may supply the power requested by a load. Because the optimal method is NP-hard, GRASP addresses this high complexity by using heuristics to match sources and loads and to select the smallest-cost-rate paths in the DMG. We compare the cost achieved by GRASP and an optimal method based on integer linear programming on different IEEE test feeders and other test networks. The comparison shows the trade-offs between lowering complexity and achieving optimal-cost paths. The results show that the cost incurred by GRASP approaches that of the optimal solution by small margins. In the adopted networks, GRASP trades its lower complexity for up to 18% higher costs than those achieved by the optimal solution.

ACS Style

Zhengqi Jiang; Vinit Sahasrabudhe; Ahmed Mohamed; Haim Grebel; Roberto Rojas-Cessa. Greedy Algorithm for Minimizing the Cost of Routing Power on a Digital Microgrid. Energies 2019, 12, 3076 .

AMA Style

Zhengqi Jiang, Vinit Sahasrabudhe, Ahmed Mohamed, Haim Grebel, Roberto Rojas-Cessa. Greedy Algorithm for Minimizing the Cost of Routing Power on a Digital Microgrid. Energies. 2019; 12 (16):3076.

Chicago/Turabian Style

Zhengqi Jiang; Vinit Sahasrabudhe; Ahmed Mohamed; Haim Grebel; Roberto Rojas-Cessa. 2019. "Greedy Algorithm for Minimizing the Cost of Routing Power on a Digital Microgrid." Energies 12, no. 16: 3076.