Abstract
The problem of computing optimal control inputs is studied for networks of dynamical linear systems, with respect to separable input constraints and a separable quadratic cost over a finite time-horizon. The main results concern network structures for which the iterates of three feasible-point algorithms can be computed exactly on a subsystem-by-subsystem basis with access restricted to local model-data and algorithm-state information. In particular, hop-based network proximity bounds are investigated for algorithms based on projected gradient, random co-ordinate descent and Jacobi iterations, via graph-based characterisations of various aspects of an equivalent static formulation of the optimal control problem.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: 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.
