Related papers: Nonlinear optimal control via occupation measures …
In this work, we investigate a neural network based solver for optimal control problems (without / with box constraint) for linear and semilinear second-order elliptic problems. It utilizes a coupled system derived from the first-order…
This work addresses the occupation measure relaxation of calculus of variations problems, which is an infinite-dimensional linear programming relaxation amenable to numerical approximation by a hierarchy of semidefinite optimization…
We consider the problem of nonlinear stochastic optimal control. This problem is thought to be fundamentally intractable owing to Bellman's "curse of dimensionality". We present a result that shows that repeatedly solving an open-loop…
We propose an efficient algorithm for the optimal control problems (OCPs) of nonlinear switched systems that optimizes the control input and switching instants simultaneously for a given switching sequence. We consider the switching…
We consider integer-restricted optimal control of systems governed by abstract semilinear evolution equations. This includes the problem of optimal control design for certain distributed parameter systems endowed with multiple actuators,…
Optimality conditions in the form of a variational inequality are proved for a class of constrained optimal control problems of stochastic differential equations. The cost function and the inequality constraints are functions of the…
We propose a robust model predictive control (MPC) method for discrete-time linear time-invariant systems with norm-bounded additive disturbances and model uncertainty. In our method, at each time step we solve a finite time robust optimal…
Nonconvex optimization problems with an L1-constraint are ubiquitous, and are found in many application domains including: optimal control of hybrid systems, machine learning and statistics, and operations research. This paper shows that…
This two-part paper is concerned with the problem of minimizing a linear objective function subject to a bilinear matrix inequality (BMI) constraint. In this part, we first consider a family of convex relaxations which transform BMI…
Bernstein polynomial approximation to a continuous function has a slower rate of convergence as compared to other approximation methods. "The fact seems to have precluded any numerical application of Bernstein polynomials from having been…
A problem of computing time-fuel optimal control for state transfer of a single input linear time invariant (LTI) system to the origin is considered. The input is assumed to be bounded. Since, the optimal control is bang-off-bang in nature,…
This paper develops a method to learn optimal controls from data for bilinear systems without a priori knowledge of the system dynamics. Given an unknown bilinear system, we first characterize when the available data is suitable to solve…
This paper addresses finite-time horizon optimal control of single-loop networked control systems with stochastically modeled communication channel and disturbances. To cope with the uncertainties, an optimization-based control scheme is…
Efficient methods to provide sub-optimal solutions to non-convex optimization problems with knowledge of the solution's sub-optimality would facilitate the widespread application of nonlinear optimal control algorithms. To that end,…
This paper studies (single-time and multitime) optimal control problems on a nonholonomic manifold (described either by the kernel of a Gibbs-Pfaff form or by the span of appropriate vector fields). For both descriptions we analyse:…
This paper examines solution methods for mathematical programs with complementarity constraints (MPCC) obtained from the time-discretization of optimal control problems (OCPs) subject to nonsmooth dynamical systems. The MPCC theory and…
We consider the general polynomial optimization problem $P: f^*=\min \{f(x)\,:\,x\in K\}$ where $K$ is a compact basic semi-algebraic set. We first show that the standard Lagrangian relaxation yields a lower bound as close as desired to the…
Optimal control of a mobile robot system is formulated. Multiobjective criteria of time and energy is employed. The optimal control problem is formulated as a nonlinear programming problem (NLP). The problem is solved using the direct…
Model Predictive Control (MPC) has exhibited remarkable capabilities in optimizing objectives and meeting constraints. However, the substantial computational burden associated with solving the Optimal Control Problem (OCP) at each…
We consider the problem of finding the best memoryless stochastic policy for an infinite-horizon partially observable Markov decision process (POMDP) with finite state and action spaces with respect to either the discounted or mean reward…