Related papers: When to Identify Is to Control: On the Controllabi…
Given a graph $G$ and a vertex $x\in V(G)$, a vertex set $S \subseteq V(G)$ is an $x$-geodominating set of $G$ if each vertex $v\in V(G)$ lies on an $x-y$ geodesic for some element $y\in S$. The minimum cardinality of an $x$-geodominating…
A dominating set of a graph $G=(V,E)$ is a subset of vertices $S\subseteq V$ such that every vertex $v\in V\setminus S$ has at least one neighbor in set $S$. The corresponding optimization problem is known to be NP-hard. The best known…
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 considers two types of boundary control problems for linear transport equations. The first one shows that transport solutions on a subdomain of a domain X can be controlled exactly from incoming boundary conditions for X under…
In this paper, we study the feasibility of a class of optimization-based boundary control of one-dimensional macroscopic traffic flow models, where stability and invariance are achieved by a single boundary control. We define the sets of…
We describe a convex programming approach to the calculation of lower bounds on the minimum cost of constrained decentralized control problems with nonclassical information structures. The class of problems we consider entail the…
This thesis investigates optimal trajectory tracking of nonlinear dynamical systems with affine controls. The control task is to enforce the system state to follow a prescribed desired trajectory as closely as possible. The concept of…
Designing distributed optimal controllers subject to communication constraints is a difficult problem unless structural assumptions are imposed on the underlying dynamics and information exchange structure, e.g., sparsity, delay, or spatial…
In this paper, we study the use of state-of-the-art nonlinear system identification techniques for the optimal control of nonlinear systems. We show that the nonlinear systems identification problem is equivalent to estimating the…
This paper presents a novel convex optimization-based method for finding the globally optimal solutions of a class of mixed-integer non-convex optimal control problems. We consider problems with non-convex constraints that restrict the…
In many problems in optimal control, one seeks to minimise an objective function subject to constraints on the velocity of the system. Imposing these constraints directly -- the ``hard-constrained'' approach -- is often analytically and…
A new class of control problems is discussed - homeostasis control. Homeostasis control problems can be considered as control problems with a given target set, in particular, as a problem of stabilizing the values of some target function,…
In this paper, we tackle the long-standing challenges of ensemble control analysis and design using a convex-geometric approach in a Hilbert space setting. Specifically, we formulate the control of linear ensemble systems as a convex…
We consider a continuous time stochastic optimal control problem under both equality and inequality constraints on the expectation of some functionals of the controlled process. Under a qualification condition, we show that the problem is…
We explore a reconfiguration version of the dominating set problem, where a dominating set in a graph $G$ is a set $S$ of vertices such that each vertex is either in $S$ or has a neighbour in $S$. In a reconfiguration problem, the goal is…
Controllability properties are studied for control-affine systems depending on a parameter and with constrained control values. The uncontrolled systems in dimension two and three are subject to a homoclinic bifurcation. This generates two…
We consider optimal control problems involving two constraint sets: one comprised of linear ordinary differential equations with the initial and terminal states specified and the other defined by the control variables constrained by simple…
Given an infeasible, unbounded, or pathological convex optimization problem, a natural question to ask is: what is the smallest change we can make to the problem's parameters such that the problem becomes solvable? In this paper, we address…
In this paper, we study the mixed-integer nonlinear set given by a separable quadratic constraint on continuous variables, where each continuous variable is controlled by an additional indicator. This set occurs pervasively in optimization…
A graph is said to be well-dominated if all its minimal dominating sets are of the same size. The class of well-dominated graphs forms a subclass of the well studied class of well-covered graphs. While the recognition problem for the class…