Related papers: Shortest-path recovery from signature with an opti…
We study the minimization of the expected costs under stochastic constraint at the terminal time. The first and the main result says that for a power type of costs, the value function is the minimal positive solution of a second order…
Imagine that unlabelled tokens are placed on the edges of a graph, such that no two tokens are placed on incident edges. A token can jump to another edge if the edges having tokens remain independent. We study the problem of determining the…
Solving stochastic optimal control problems with quadratic control costs can be viewed as approximating a target path space measure, e.g. via gradient-based optimization. In practice, however, this optimization is challenging in particular…
Solutions to optimal control problems can be discontinuous, even if all the functionals defining the problem are smooth. This can cause difficulties when numerically computing solutions to these problems. While conventional numerical…
We introduce a method for efficiently computing the exact shortest path to the boundary of a mesh from a given internal point in the presence of self-intersections. We provide a formal definition of shortest boundary paths for…
We study minimum-variance feedback-control design for a networked control system with retarded dynamics, where inter-agent communication is subject to latency. We prove that such a design can be solved efficiently for circular formations…
In this paper, we deal with the containment control problem in presence of antagonistic interactions. In particular, we focus on the cases in which it is not possible to contain the entire network due to a constrained number of control…
In this paper, we investigate optimal control of network-coupled subsystems where the dynamics and the cost couplings depend on an underlying undirected weighted graph. The graph coupling matrix in the dynamics may be the adjacency matrix,…
For optimal control problems on finite graphs in continuous time, the dynamic programming principle leads to value functions characterized by systems of nonlinear ordinary differential equations. In this paper, we consider the case of…
Many combinatorial optimization problems can be formulated as the search for a subgraph that satisfies certain properties and minimizes the total weight. We assume here that the vertices correspond to points in a metric space and can take…
Identifying shortest paths between nodes in a network is an important task in many applications. Recent work has shown that a malicious actor can manipulate a graph to make traffic between two nodes of interest follow their target path. In…
In the context of optimal control, we consider the inverse problem of Lagrangian identification given system dynamics and optimal trajectories. Many of its theoretical and practical aspects are still open. Potential applications are very…
We address the problem of sampling from terminally constrained distributions with pre-trained flow-based generative models through an optimal control formulation. Theoretically, we characterize the value function by a…
Optimal control theory deals with finding protocols to steer a system between assigned initial and final states, such that a trajectory-dependent cost function is minimized. The application of optimal control to stochastic systems is an…
Path following controllers make the output of a control system approach and traverse a pre-specified path with no apriori time parametrization. In this paper we present a method for path following control design applicable to framed curves…
We study some optimal control problems on networks with junctions, approximate the junctions by a switching rule of delay-relay type and study the passage to the limit when $\varepsilon$, the parameter of the approximation, goes to zero.…
This paper is concerned with the design of optimal control for finite-dimensional control-affine nonlinear dynamical systems. We introduce an optimal control problem that specifically optimizes nonlinear observability in addition to…
In this paper, we solve the problem of simultaneously driving in minimum time to arbitrary final conditions, N two level quantum systems subject to independent controls. The solution of this problem is obtained via an explicit description…
This paper proposes a new fast and stable algorithm for the reconstruction of the plasma boundary from discrete magnetic measurements taken at several locations surrounding the vacuum vessel. The resolution of this inverse problem takes two…
A problem of reconstruction of the topology and the respective edge resistance values of an unknown circular planar passive resistive network using limitedly available resistance distance measurements is considered. We develop a multistage…