To address the discontinuous ℓ0-type sparsity penalty, smooth non-convex sparsity approximations are introduced that preserve differentiability while retaining sparse threshold behavior and characterize a quasi-threshold sparse structure of the resulting optimal feedback policies in non-affine stochastic systems with control-dependent noise.
Abstract
Sparse ergodic control provides a natural framework for long-run stochastic decision-making under resource constraints. Existing formulations, however, are typically restricted to control-affine systems with control-independent diffusion. When the diffusion coefficient depends explicitly on the control input, the associated ergodic Hamilton–Jacobi–Bellman (HJB) equation becomes non-separable through the term trax, u∇2V, so classical arguments based on control-affine separability no longer apply directly. In this work, we study sparse ergodic control of stochastic systems with control-dependent diffusion and nonlinear dynamics within a viscosity-solution and learning-based framework. To address the discontinuous ℓ0-type sparsity penalty, we introduce smooth non-convex sparsity approximations that preserve differentiability while retaining sparse threshold behavior. Within a viscosity-solution framework, we analyze the existence and uniqueness properties of the associated ergodic pair and establish localized approximation error estimates for the smooth approximation. We further characterize a quasi-threshold sparse structure of the resulting optimal feedback policies in non-affine stochastic systems with control-dependent noise. On the computational side, we develop a Physics-Informed Neural Network (PINN)-based solver with adaptive residual-driven sampling for high-dimensional sparse ergodic HJB equations, together with a distributed monotone-inspired iterative scheme for weakly coupled multi-agent systems. Numerical experiments on multi-robot swarm navigation and renewable-integrated smart-grid control demonstrate that the proposed methods produce sparse control policies while preserving stable long-run performance under stochastic disturbances.
This work takes the exploratory, reinforcement learning (RL) framework of Wang, Zariphopoulou, and Zhou with relaxed controls and entropy regularization with the objective to develop theoretically grounded, efficient and scalable RL algorithms to learn both the optimal value functions and optimal feedback control polic...
Jing-Sheng Ma, Gao-Zhan Wang, Jian-Feng Zhang et al.· 1 citation
This work estimates convergence rates of value functions for particle approximations of a controlled nonlinear filtering problem and establishes uniform value-function error bounds of order under smoothness of the data, uniform ellipticity, and regularity of this Hamiltonian.
Erhan Bayraktar, Ibrahim Ekren, Xi-Hao He et al.· 0 citations
A regularized PINNs framework that incorporates Tikhonov regularization to solve terminal-state tracking optimal control constrained by parabolic partial differential equations is proposed, establishing a consistency result showing that PINNs minimizers nearly attain the continuous regularized objective under residual...
This work introduces SCMO (Stochastic Control Measure Optimizer), a gradient-free particle method derived from entropy regularized stochastic control, and proves finite-candidate consistency and shows that the signed, curvature-dependent effect of nonmatched covariance can reduce the resulting upper bound on the approx...
Stochastic quantization defines a Euclidean quantum field theory as the equilibrium of a fictitious-time Langevin dynamics, which reaches the Gibbs measure asymptotically and is formulated as a finite-time stochastic optimal control problem.
It is shown that the state distribution of the system can be tractably approximated over time by Gaussian mixture distributions, with formal error bounds in Wasserstein distance, which yields closed-form expressions for expected costs and chance constraints.
Konstantinos Prattis, Luca Laurenti, A. Dabiri· 0 citations
We use cookies to run the site and, with your consent, for analytics and to show ads.
See our Cookie Policy.