TY - JOUR
T1 - Design of Real-Time Implementable Distributed Suboptimal Control
T2 - An LQR Perspective
AU - Jaleel, Hassan
AU - Shamma, Jeff S.
N1 - Funding Information:
Manuscript received April 16, 2017; revised July 31, 2017; accepted August 20, 2017. Date of publication September 19, 2017; date of current version December 14, 2018. This work was supported by the King Abdullah University of Science and Technology. Recommended by Associate Editor Y. Mostofi. (Corresponding author: Hassan Jaleel.) The authors are with the King Abdullah University of Science and Technology, Computer, Electrical and Mathematical Sciences and Engineering Division, Thuwal 23955–6900, Saudi Arabia (e-mail: has-san.jaleel@kaust.edu.sa; jeff.shamma@kaust.edu.sa). Digital Object Identifier 10.1109/TCNS.2017.2754362
Publisher Copyright:
© 2017 IEEE.
PY - 2018/12
Y1 - 2018/12
N2 - We propose a framework for multiagent systems in which the agents compute their control actions in real time, based on local information only. The novelty of the proposed framework is that the process of computing a suboptimal control action is divided into two phases: An offline phase and an online phase. In the offline phase, an approximate problem is formulated with a cost function that is close to the optimal cost in some sense and is distributed, that is, the costs of non-neighboring nodes are not coupled. This phase is centralized and is completed before the deployment of the system. In the online phase, the approximate problem is solved in real time by implementing any efficient distributed optimization algorithm. To quantify the performance loss, we derive upper bounds for the maximum error between the optimal performance and the performance under the proposed framework. Finally, the proposed framework is applied to an example setup in which a team of mobile nodes is assigned the task of establishing a communication link between two base stations with minimum energy consumption. We show through simulations that the performance under the proposed framework is close to the optimal performance, and the suboptimal policy can be efficiently implemented online.
AB - We propose a framework for multiagent systems in which the agents compute their control actions in real time, based on local information only. The novelty of the proposed framework is that the process of computing a suboptimal control action is divided into two phases: An offline phase and an online phase. In the offline phase, an approximate problem is formulated with a cost function that is close to the optimal cost in some sense and is distributed, that is, the costs of non-neighboring nodes are not coupled. This phase is centralized and is completed before the deployment of the system. In the online phase, the approximate problem is solved in real time by implementing any efficient distributed optimization algorithm. To quantify the performance loss, we derive upper bounds for the maximum error between the optimal performance and the performance under the proposed framework. Finally, the proposed framework is applied to an example setup in which a team of mobile nodes is assigned the task of establishing a communication link between two base stations with minimum energy consumption. We show through simulations that the performance under the proposed framework is close to the optimal performance, and the suboptimal policy can be efficiently implemented online.
KW - Distributed optimization approximate dynamic programming
KW - linear quadratic regulator (LQR)
KW - real-time systems
UR - http://www.scopus.com/inward/record.url?scp=85030623711&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=85030623711&partnerID=8YFLogxK
U2 - 10.1109/TCNS.2017.2754362
DO - 10.1109/TCNS.2017.2754362
M3 - Article
AN - SCOPUS:85030623711
SN - 2325-5870
VL - 5
SP - 1717
EP - 1728
JO - IEEE Transactions on Control of Network Systems
JF - IEEE Transactions on Control of Network Systems
IS - 4
M1 - 8046098
ER -