21 August 2020 in IEEE Transactions on Intelligent Transportation Systems
Acting as a key to future environmentally friendly transportation systems, electric vehicles (EVs) have attached importance to develop fast charging technologies to accomplish the requirement of vehicle users. However, fast charging behaviors would cause degradations in EVs' batteries, as well as negative effects like new demand peak and feeder overloads to the connected distribution network, especially when plugging in large scale EVs. Decentralized coordination is encouraged and our goal is to achieve an optimal strategy profile for EVs in a decentralized way considering both the need of fast charging and reducing degradations in batteries and the distribution network. In this article, we innovatively model the EV fast charging problem as an optimization coordination problem subject to the coupled feeder capacity constraints in the distribution network. The need of fast charging is expressed by the total charging time, and the relative tendency to fully charge within the desired time period. We introduce a ℓ₁-norm of the charging strategy which is non-convex to represent the total charging time, and apply the ℓ₁-norm minimization to approximate the sparse solution of ℓ₁-norm minimization. The shorter the charging horizon is the stronger willing of fast charging the user has. The objective of the optimization problem tradeoffs the EVs' battery degradation cost, the load regulation in the distribution network, the satisfaction of charging and the total charging time, which is non-separable among individual charging behaviors. Even though alternating direction method of multipliers (ADMM) has been widely applied in distributed optimization with separable objective and coupled constraints, its decentralized scheme cannot be applied directly to the underlying non-separable EV charging coordination problem. Hence, a hierarchical algorithm based on ADMM is proposed such that the convergence to the optimal strategies is guaranteed under certain step-size parameter. Furthermore, a receding horizon based algorithm is proposed considering the forecast errors on the base demand and the EV arrival distribution. The results are demonstrated via some simulation results.
8 July 2020 in IET Generation, Transmission & Distribution
The charging coordination of large‐scale electric vehicles (EVs) for avoiding the voltages at some nodes to drop below feasible ranges in distribution networks, which is formulated as a class of optimisation problems with a certain class of coupled constraints, is studied. Then the alternating direction method of multipliers (ADMM) is introduced to obtain the optimal charging strategies. However, due to the non‐separable property of the objective function which includes a non‐linear term of the total charging power of EV populations, it is difficult to decentralise the update step of the charging strategy in the ADMM method. Consequently, a novel decentralised hierarchical method is proposed by further developing an iterative update of best responses of individual EVs at each iteration step of the proposed ADMM method, such that individual EVs can implement the coordination behaviours locally and simultaneously without sharing any other private information except the charging power. Furthermore, the proposed approach does not require the objective function to be continuously differentiable. The convergence and optimality of the proposed method are verified and some numerical simulations are studied to illustrate the developed results.
26 August 2022 in IEEE Transactions on Smart Grid
The comprehensive utilization of multi-energy resources has been recognized as an effective way to improve the energy utilization efficiency. This paper proposes a distributed double-side multi-energy coordination framework to minimize the total system cost by optimizing the energy supply of energy hubs (EHs) and the energy consumption of consumers, considering the tradeoff between the fuel cost of EHs and the satisfaction of consumers. In this framework, EHs and consumers are modeled through a standardized matrix modeling method by applying which arbitrary combinations of energy forms could be handled, i.e., EHs could include more forms of coupled energy rather than two or three specific forms and consumers have both time-shifting and energy-shifting loads. Hence, consumers implement the integrated demand response (IDR) such that the energy demand can be shifted among different time intervals and different energy forms, e.g. from the electricity to the gas, to achieve individual benefits. Moreover, suppose that EHs and consumers communicate via a time-varying network and only exchange information with their neighbors. Under such topology, we develop a fully distributed sub-gradient averaging consensus algorithm with the energy supply-demand balance guaranteed at each time interval. The convergence and optimality of the proposed algorithm are verified theoretically, and the numerical simulation is presented to illustrate the developed results.
19 August 2024 in IEEE Transactions on Automatic Control
In this article, we consider a class of consensus optimization problems over a time-varying communication network wherein each agent can only interact with its neighbors. The target is to minimize the summation of all local and possibly nonsmooth objectives in the presence of different constraint sets per agent. To achieve this goal, we propose a novel distributed heavy-ball algorithm that combines the subgradient tracking technique with a momentum term related to history information. This algorithm promotes the distributed application of existing centralized accelerated momentum methods, especially for constrained nonsmooth problems. Under certain assumptions and conditions on the step-size and momentum coefficient, the convergence and optimality of the proposed algorithm can be guaranteed through a rigorous theoretical analysis, and a convergence rate of $\mathcal {O}(\text {ln}k/ \sqrt{k})$ in objective value is also established. Simulations on an $\ell _{1}$-regularized logistic-regression problem show that the proposed algorithm can achieve faster convergence than existing related distributed algorithms, while a case study involving a building energy management problem further demonstrates its efficacy.