Related papers: Shortest-path recovery from signature with an opti…
The maximum hands-off control is the optimal solution to the L0 optimal control problem. It has the minimum support length among all feasible control inputs. To avoid computational difficulties arising from its combinatorial nature, the…
We consider an optimal control problem where the state is governed by a free boundary problem called the two-phase membrane problem and the control appears in the coefficients of the characteristic function of the positivity and negativity…
We give the solution to the minimum-energy control problem for linear stochastic systems. The problem is as follows: given an exactly controllable system, find the control process with the minimum expected energy that transfers the system…
In this paper we consider a constrained parabolic optimal control problem. The cost functional is quadratic and it combines the distance of the trajectory of the system from the desired evolution profile together with the cost of a control.…
We study the problem of computing a minimum equivalent digraph (also known as the problem of computing a strong transitive reduction) and its maximum objective function variant, with two types of extensions. First, we allow to declare a set…
This paper presents an optimization based framework to automate system repair against omega-regular properties. In the proposed formalization of optimal repair, the systems are represented as Kripke structures, the properties as…
In this paper, we study linearly constrained policy optimization over the manifold of Schur stabilizing controllers, equipped with a Riemannian metric that emerges naturally in the context of optimal control problems. We provide extrinsic…
The shortest path problem in graphs is fundamental to AI. Nearly all variants of the problem and relevant algorithms that solve them ignore edge-weight computation time and its common relation to weight uncertainty. This implies that taking…
We explicitly compute the optimal cost for a class of example problems in geometric quantum control. These problems are defined by a Cartan decomposition of $su(2^n)$ into orthogonal subspaces $\mathfrak{l}$ and $\mathfrak{p}$ such that…
In this paper, we propose an original approach to stochastic control problems. We consider a weak formulation that is written as an optimization (minimization) problem on the space of probability measures. We then introduce a penalized…
In this article, we propose a new paradigm of control, called a maximum-hands-off control. A hands-off control is defined as a control that has a much shorter support than the horizon length. The maximum-hands-off control is the…
We consider three shortest path problems in directed graphs with random arc lengths. For the first and the second problems, a risk measure is involved. While the first problem consists in finding a path minimizing this risk measure, the…
This paper treats an optimal scheduling problem of control nodes in networked systems. We newly introduce both the L0 and l0 constraints on control inputs to extract a time-varying small number of effective control nodes. As the cost…
This paper investigates a pattern formation control problem for a multi-agent system modeled with given interaction topology, in which $m$ of the $n$ agents are chosen as leaders and consequently a control signal is added to each of the…
In this article we consider shape optimization problems as optimal control problems via the method of mappings. Instead of optimizing over a set of admissible shapes a reference domain is introduced and it is optimized over a set of…
We develop a kernel-based solver for path-dependent PDEs (PPDEs) along with a convergence theory. Our numerical scheme leverages signature kernels, a recently introduced class of kernels on path-space. Specifically, we solve an optimal…
This article is concerned with the reconstruction of obstacle $\O$ immersed in a fluid flowing in a bounded domain $\Omega$ in the two dimensional case. We assume that the fluid motion is governed by the Stokes-Brinkmann equations. We make…
Here and in a follow-on paper, we consider a simple control problem in which the underlying dynamics depend on a parameter $a$ that is unknown and must be learned. In this paper, we assume that $a$ is bounded, i.e., that $|a| \le…
The shortest path problem in graphs is a cornerstone of AI theory and applications. Existing algorithms generally ignore edge weight computation time. We present a generalized framework for weighted directed graphs, where edge weight can be…
We present a novel particle filtering framework for continuous-time dynamical systems with continuous-time measurements. Our approach is based on the duality between estimation and optimal control, which allows reformulating the estimation…