Optimization based AIMD saturated algorithms for public charging of electric vehicles

被引:5
作者
Shah, Saqib Nisar [1 ]
Incremona, Gian Paolo [1 ]
Bolzern, Paolo [1 ]
Colaneri, Patrizio [1 ]
机构
[1] Politecn Milan, Dipartimento Elettron Informaz & Bioingn, Piazza Leonardo Vinci 32, I-20133 Milan, Italy
关键词
AIMD; Distributed control; Electric vehicles; Optimal scheduling; Distributed management; FRAMEWORK; IMPACT;
D O I
10.1016/j.ejcon.2018.12.009
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
The Additive Increase Multiplicative Decrease (AIMD) algorithm is an interesting approach in congestion control of communication networks, as it maintains the good features of a distributed strategy, without sacrificing the network stability and robustness. Recent applications of these algorithms also concern other industrial fields such as Electric Vehicles (EVs) based transportation systems, for which the introduction of an optimal charging policy is an important challenge for power systems operation. Moreover, saturation constraints on the resource allocated to each vehicle need to be taken into account in order to avoid peak power requirements and grid overloads. Optimization based AIMD algorithms with saturation constraints are proposed in this paper for public charging of EVs. Specifically, a new AIMD approach is presented in order to capture the main advantages of optimal algorithms which minimize either the sum of charging times or the operation time of each vehicle, giving rise to a mixed AIMD strategy. Simulation results illustrate the performance of the proposal, even in comparison to the corresponding centralized optimal solutions. (C) 2018 European Control Association. Published by Elsevier Ltd. All rights reserved.
引用
收藏
页码:74 / 83
页数:10
相关论文
共 25 条
[1]  
[Anonymous], 14045064 ARXIV
[2]  
[Anonymous], 2010, INFOCOM 2010 P IEEE
[3]  
[Anonymous], TR509 DIG EQ CORP
[4]  
[Anonymous], 2016, AIMD DYNAMICS DISTRI
[5]   An independent H-TCP implementation under FreeBSD 7.0- Description and Observed Behaviour [J].
Swinburne University of Technology, Melbourne, Australia ;
不详 .
Comput Commun Rev, 2008, 3 (27-38)
[6]  
BARNSLEY MF, 1988, ANN I H POINCARE-PR, V24, P367
[7]   Positive Markov Jump Linear Systems [J].
Bolzern, Paolo ;
Colaneri, Patrizio .
FOUNDATIONS AND TRENDS IN SYSTEMS AND CONTROL, 2015, 2 (3-4) :275-427
[8]  
Crisostomi E., 2017, Electric and plug-in hybrid vehicle networks: optimization and control, V1st
[9]   A Markovian analysis of additive-increase multiplicative-decrease algorithms [J].
Dumas, V ;
Guillemin, F ;
Robert, P .
ADVANCES IN APPLIED PROBABILITY, 2002, 34 (01) :85-111
[10]   Promoting the use of end-to-end congestion control in the Internet [J].
Floyd, S ;
Fall, K .
IEEE-ACM TRANSACTIONS ON NETWORKING, 1999, 7 (04) :458-472