Related papers: Minimal Actuator Placement with Bounds on Control …
In this paper, we study optimal actuator location of the minimum norm controls for a multi-dimensional heat equation with control defined in the space $L^p(0,T;L^2(\Omega))$. The actuator domain $\omega$ is quite general in the sense that…
In this letter, we investigate the problem of actuator scheduling for networked control systems. Given a stochastic linear system with a number of actuators, we consider the case that one actuator is activated at each time. This problem is…
The problem of monotone submodular maximization has been studied extensively due to its wide range of applications. However, there are cases where one can only access the objective function in a distorted or noisy form because of the…
In many problems, agents cooperate locally so that a leader or fusion center can infer the state of every agent from probing the state of only a small number of agents. Versions of this problem arise when a fusion center reconstructs an…
We develop approximation algorithms for set-selection problems with deterministic constraints, but random objective values, i.e., stochastic probing problems. When the goal is to maximize the objective, approximation algorithms for probing…
In this manuscript we study the following optimization problem with volume constraint: \[ \min\left\{\frac{1}{p}\int_{\Omega} |\nabla v|^pdx- \int_{\partial \Omega} gv\,dS \colon v \in W^{1, p} \left(\Omega\right), \text{ and } |\{v>0\}|…
We consider the following node-capacitated network design problem. The input is an undirected graph, set of demands, uniform node capacity and arbitrary node costs. The goal is to find a minimum node-cost subgraph that supports all demands…
We describe an approach for finding upper bounds on an ODE dynamical system's maximal Lyapunov exponent among all trajectories in a specified set. A minimization problem is formulated whose infimum is equal to the maximal Lyapunov exponent,…
Finding shortest paths in a given network (e.g., a computer network or a road network) is a well-studied task with many applications. We consider this task under the presence of an adversary, who can manipulate the network by perturbing its…
The Hospital Residents setting models important problems like school choice, assignment of undergraduate students to degree programs, among many others. In this setting, fixed quotas are associated with the programs that limit the number of…
Stable states in complex systems correspond to local minima on the associated potential energy surface. Transitions between these local minima govern the dynamics of such systems. Precisely determining the transition pathways in complex and…
This paper addresses the problem of selecting the minimum number of dedicated sensors to achieve observability in the presence of unknown inputs, namely, the state and input observability, for linear time-invariant systems. We assume that…
We consider the optimization of the vector of grasping forces that support a known generalized force acting on the grasped object---a rigid body or a mechanism. Working in the framework of finite-dimensional normed vector spaces and their…
In this paper, we study the problem of reducing the energy consumption in a mobile communication network; we select the smallest set of active base stations that can preserve the quality of service (the minimum data rate) required by the…
This paper presents a provably optimal, real-time capable energy management policy for race cars that provides simple human-driver-implementable control cues. Specifically, we first formulate the energy-constrained minimum-lap-time control…
This paper proposes a game-theoretic method to address the problem of optimal detector placement in a networked control system under cyber-attacks. The networked control system is composed of interconnected agents where each agent is…
We consider a class of popular distributed non-convex optimization problems, in which agents connected by a network $\mathcal{G}$ collectively optimize a sum of smooth (possibly non-convex) local objective functions. We address the…
The submodular knapsack problem (SKP), which seeks to maximize a submodular set function by selecting a subset of elements within a given budget, is an important discrete optimization problem. The majority of existing approaches to solving…
We present a quantum algorithm for finding the minimum of a function based on multistep quantum computation and apply it for optimization problems with continuous variables, in which the variables of the problem are discretized to form the…
In an interference network, joint power and admission control aims to support a maximum number of links at their specified signal to interference plus noise ratio (SINR) targets while using a minimum total transmission power. In our…