Sparse optimal control of networks with multiplicative noise via policy gradient
Not on the map. Why?
Abstract (arXiv)
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.
Key facts. Cited by 1 paper in the map (data through 14 Oct 2026). First posted on arXiv 28 May 2019.
Builds on
No reference list yet.
Built on by
Citing papers per year: 2025: 1.
1 paper.
- 2025Policy Gradient for LQR with Domain Randomizationcited by 5
- 2025Policy Gradient for LQR with Domain Randomization31 Mar 2025