In this paper, we propose a new class of operator factorization methods to discretize the integral fractional Laplacian
A minplus fundamental solution semigroup for a class of approximate infinite dimensional optimal control problems
By exploiting minplus linearity, semiconcavity,
and semigroup properties of dynamic programming, a fundamental
solution semigroup for a class of approximate finite
horizon linear infinite dimensional optimal control problems is
constructed. Elements of this fundamental solution semigroup
are parameterized by the time horizon, and can be used to
approximate the solution of the corresponding finite horizon
optimal control problem for any terminal cost. They can also
be composed to compute approximations on longer horizons.
The value function approximation provided takes the form of
a minplus convolution of a kernel with the terminal cost. A
general construction for this kernel is provided, along with a
spectral representation for a restricted class of subproblems.
more »
« less
 Award ID(s):
 1908918
 NSFPAR ID:
 10170566
 Date Published:
 Journal Name:
 Proceedings of the American Control Conference
 ISSN:
 07431619
 Page Range / eLocation ID:
 794799
 Format(s):
 Medium: X
 Sponsoring Org:
 National Science Foundation
More Like this

for\begin{document}$ ( \Delta)^\frac{{ \alpha}}{{2}} $\end{document} . One main advantage is that our method can easily increase numerical accuracy by using highdegree Lagrange basis functions, but remain its scheme structure and computer implementation unchanged. Moreover, it results in a symmetric (multilevel) Toeplitz differentiation matrix, enabling efficient computation via the fast Fourier transforms. If constant or linear basis functions are used, our method has an accuracy of\begin{document}$ \alpha \in (0, 2) $\end{document} , while\begin{document}$ {\mathcal O}(h^2) $\end{document} for quadratic basis functions with\begin{document}$ {\mathcal O}(h^4) $\end{document} a small mesh size. This accuracy can be achieved for any\begin{document}$ h $\end{document} and can be further increased if higherdegree basis functions are chosen. Numerical experiments are provided to approximate the fractional Laplacian and solve the fractional Poisson problems. It shows that if the solution of fractional Poisson problem satisfies\begin{document}$ \alpha \in (0, 2) $\end{document} for\begin{document}$ u \in C^{m, l}(\bar{ \Omega}) $\end{document} and\begin{document}$ m \in {\mathbb N} $\end{document} , our method has an accuracy of\begin{document}$ 0 < l < 1 $\end{document} for constant and linear basis functions, while\begin{document}$ {\mathcal O}(h^{\min\{m+l, \, 2\}}) $\end{document} for quadratic basis functions. Additionally, our method can be readily applied to approximate the generalized fractional Laplacians with symmetric kernel function, and numerical study on the tempered fractional Poisson problem demonstrates its efficiency.\begin{document}$ {\mathcal O}(h^{\min\{m+l, \, 4\}}) $\end{document} 
null ; null ; null ; null (Ed.)Many imaging problems can be formulated as inverse problems expressed as finitedimensional optimization problems. These optimization problems generally consist of minimizing the sum of a data fidelity and regularization terms. In Darbon (SIAM J. Imag. Sci. 8:2268–2293, 2015), Darbon and Meng, (On decomposition models in imaging sciences and multitime HamiltonJacobi partial differential equations, arXiv preprint arXiv:1906.09502, 2019), connections between these optimization problems and (multitime) HamiltonJacobi partial differential equations have been proposed under the convexity assumptions of both the data fidelity and regularization terms. In particular, under these convexity assumptions, some representation formulas for a minimizer can be obtained. From a Bayesian perspective, such a minimizer can be seen as a maximum a posteriori estimator. In this chapter, we consider a certain class of nonconvex regularizations and show that similar representation formulas for the minimizer can also be obtained. This is achieved by leveraging minplus algebra techniques that have been originally developed for solving certain HamiltonJacobi partial differential equations arising in optimal control. Note that connections between viscous HamiltonJacobi partial differential equations and Bayesian posterior mean estimators with Gaussian data fidelity terms and logconcave priors have been highlighted in Darbon and Langlois, (On Bayesian posterior mean estimators in imaging sciences and HamiltonJacobi partial differential equations, arXiv preprint arXiv:2003.05572, 2020). We also present similar results for certain Bayesian posterior mean estimators with Gaussian data fidelity and certain nonlogconcave priors using an analogue of minplus algebra techniques.more » « less

Motivated by various distributed control applications, we consider a linear system with Gaussian noise observed by multiple sensors which transmit measurements over a dynamic lossy network. We characterize the stationary optimal sensor scheduling policy for the finite horizon, discounted, and longterm average cost problems and show that the value iteration algorithm converges to a solution of the average cost problem. We further show that the suboptimal policies provided by the rolling horizon truncation of the value iteration also guarantee geometric ergodicity and provide nearoptimal average cost. Lastly, we provide qualitative characterizations of the multidimensional set of measurement loss rates for which the system is stabilizable for a static network, significantly extending earlier results on intermittent observations.more » « less

We consider the problem of finitehorizon optimal control of a discrete linear timevarying system subject to a stochastic disturbance and fully observable state. The initial state of the system is drawn from a known Gaussian distribution, and the final state distribution is required to reach a given target Gaussian distribution, while minimizing the expected value of the control effort. We derive the linear optimal control policy by first presenting an efficient solution for the diffusionless case, and we then solve the case with diffusion by reformulating the system as a superposition of diffusionless systems. We show that the resulting solution coincides with a LQG problem with particular terminal cost weight matrix.more » « less

EditorinChief: George Yin (Ed.)This paper presents approaches to meanfield control, motivated by distributed control of multiagent systems. Control solutions are based on a convex optimization problem, whose domain is a convex set of probability mass functions (pmfs). The main contributions follow: 1. KullbackLeiblerQuadratic (KLQ) optimal control is a special case, in which the objective function is composed of a control cost in the form of KullbackLeibler divergence between a candidate pmf and the nominal, plus a quadratic cost on the sequence of marginals. Theory in this paper extends prior work on deterministic control systems, establishing that the optimal solution is an exponential tilting of the nominal pmf. Transform techniques are introduced to reduce complexity of the KLQ solution, motivated by the need to consider time horizons that are much longer than the intersampling times required for reliable control. 2. Infinitehorizon KLQ leads to a state feedback control solution with attractive properties. It can be expressed as either state feedback, in which the state is the sequence of marginal pmfs, or an open loop solution is obtained that is more easily computed. 3. Numerical experiments are surveyed in an application of distributed control of residential loads to provide grid services, similar to utilityscale battery storage. The results show that KLQ optimal control enables the aggregate power consumption of a collection of flexible loads to track a timevarying reference signal, while simultaneously ensuring each individual load satisfies its own quality of service constraints.more » « less