Large-scale dynamic system optimization using dual decomposition method with approximate dynamic programming

被引:5
作者
Rokhforoz, Pegah [1 ]
Kebriaei, Hamed [1 ,2 ]
Ahmadabadi, Majid Nili [1 ]
机构
[1] Univ Tehran, Sch Elect & Comp Engn, Coll Engn, Tehran, Iran
[2] Inst Res Fundamental Sci IPM, Sch Comp Sci, POB 19395-5746, Tehran, Iran
关键词
Multi-agent system; Approximate dynamic programming; Duality theory; Coupling constraint; CENTRALIZED RESOURCE-ALLOCATION; TIME NONLINEAR-SYSTEMS; TASK ALLOCATION; GRAPHICAL GAMES; CONVERGENCE; CONSTRAINTS; ALGORITHM;
D O I
10.1016/j.sysconle.2021.104894
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
In this paper, multi-agent dynamic optimization with a coupling constraint is studied. The aim is to minimize a strongly convex social cost function, by considering a linear stochastic dynamics for each agent and also coupling constraints among the agents. In order to handle the coupling constraint and also, to avoid high computational cost imposed by a centralized method for large scale systems, the dual decomposition method is used to decompose the problem into multiple individual sub-problems, while the dual variable is adjusted by a coordinator. Nevertheless, since each sub-problem is not a linear-quadratic (LQ) optimal control problem, and hence its closed-form solution does not exist, approximate dynamic programming (ADP) is utilized to solve the sub-problems. The main contribution of the paper is to propose an algorithm by considering the interrelated iterations of dual variable adjustment and ADP, and to prove the convergence of the algorithm to the global optimal solution of the social cost function. Additionally, the implementation of the proposed algorithm using a neural network is presented. Also, the computational advantage of the proposed algorithm in comparison with other bench-marking methods is discussed in simulation results. (C) 2021 Elsevier B.V. All rights reserved.
引用
收藏
页数:13
相关论文
共 50 条
[41]   Large-Scale Clustering Using Mathematical Programming [J].
Gnagi, Mario ;
Baumann, Philipp .
2017 IEEE INTERNATIONAL CONFERENCE ON INDUSTRIAL ENGINEERING AND ENGINEERING MANAGEMENT (IEEM), 2017, :789-793
[42]   Control of a networked microgrid system with an approximate dynamic programming approach [J].
Zhuo, Wenhao .
PROCEEDINGS OF THE 38TH CHINESE CONTROL CONFERENCE (CCC), 2019, :6571-6576
[43]   Practical Large-Scale Linear Programming using Primal-Dual Hybrid Gradient [J].
Applegate, David ;
Diaz, Mateo ;
Hinder, Oliver ;
Lu, Haihao ;
Lubin, Miles ;
O'Donoghue, Brendan ;
Schudy, Warren .
ADVANCES IN NEURAL INFORMATION PROCESSING SYSTEMS 34 (NEURIPS 2021), 2021, 34
[44]   Stochastic Optimization of Economic Dispatch for Microgrid Based on Approximate Dynamic Programming [J].
Shuai, Hang ;
Fang, Jiakun ;
Ai, Xiaomeng ;
Tang, Yufei ;
Wen, Jinyu ;
He, Haibo .
IEEE TRANSACTIONS ON SMART GRID, 2019, 10 (03) :2440-2452
[45]   Approximate dynamic programming based parameter optimization of particle swarm systems [J].
Kang Q. ;
Wang L. ;
An J. ;
Wu Q.-D. .
Zidonghua Xuebao/Acta Automatica Sinica, 2010, 36 (08) :1171-1181
[46]   An Integrated Decomposition and Approximate Dynamic Programming Approach for On-Demand Ride Pooling [J].
Yu, Xian ;
Shen, Siqian .
IEEE TRANSACTIONS ON INTELLIGENT TRANSPORTATION SYSTEMS, 2020, 21 (09) :3811-3820
[47]   From Single Commodity to Multiattribute Models for Locomotive Optimization: A Comparison of Optimal Integer Programming and Approximate Dynamic Programming [J].
Bouzaiene-Ayari, Belgacem ;
Cheng, Clark ;
Das, Sourav ;
Fiorillo, Ricardo ;
Powell, Warren B. .
TRANSPORTATION SCIENCE, 2016, 50 (02) :366-389
[48]   Route-reduction-based dynamic programming for large-scale satellite range scheduling problem [J].
Liu, Zhenbao ;
Feng, Zuren ;
Ren, Zhigang .
ENGINEERING OPTIMIZATION, 2019, 51 (11) :1944-1964
[49]   Policy Iteration Approximate Dynamic Programming Using Volterra Series Based Actor [J].
Guo, Wentao ;
Si, Jennie ;
Liu, Feng ;
Mei, Shengwei .
PROCEEDINGS OF THE 2014 INTERNATIONAL JOINT CONFERENCE ON NEURAL NETWORKS (IJCNN), 2014, :249-255
[50]   Cooperative Particle Swarm Optimization Decomposition Methods for Large-scale Optimization [J].
Clark, Mitchell ;
Ombuki-Berman, Beatrice ;
Aksamit, Nicholas ;
Engelbrecht, Andries .
2022 IEEE SYMPOSIUM SERIES ON COMPUTATIONAL INTELLIGENCE (SSCI), 2022, :1582-1591