Abstract
This paper presents an analysis of the tradeoff between repeated communications and computations for a fast distributed computation of global decision variables in a model-predictive-control (MPC)-based coordinated control scheme. We consider a coordinated predictive control problem involving uncertain and constrained subsystem dynamics and employ a formulation that presents it as a distributed optimization problem with sets of local and global decision variables where the global variables are allowed to be optimized over a longer time interval. Considering a modified form of the dual-averaging-based distributed optimization scheme, we explore convergence bounds under ideal and non-ideal wireless communications and determine the optimal choice of communication cycles between computation steps in order to speed up the convergence per unit time of the algorithm. We apply the algorithm for a class of dynamic-policy based stochastic coordinated control problems and illustrate the results with a simulation example.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.