Sparse Optimal Control of Networks with Multiplicative Noise via Policy Gradient
Abstract¶
We give algorithms for designing near-optimal sparse controllers using policy gradient with applications to control of systems corrupted by multiplicative noise, which is increasingly important in emerging complex dynamical networks. Various regularization schemes are examined and incorporated into the optimization by the use of gradient, subgradient, and proximal gradient methods. Numerical experiments on a large networked system show that the algorithms converge to performant sparse mean-square stabilizing controllers.
Summary¶
Showed that one can use policy gradient to automatically design the placement of sensors and actuators in a controller for linear systems with multiplicative noise. Achieved by encoding the preference for certain kinds of sparsity patterns with sparsity-promoting convex regularizers in the objective function.
Links¶
Knowledge Base
External
Tags¶
Similar Papers¶
Derivative-Free Methods for Policy Optimization: Guarantees for Linear Quadratic Systems
Derivative-Free Methods for Policy Optimization
LQR through the Lens of First Order Methods: Discrete-time Case
LQR through the Lens of First Order Methods