Search Results - "Olshevsky, Alexander"
-
1
Deterministic and Randomized Actuator Scheduling With Guaranteed Performance Bounds
Published in IEEE transactions on automatic control (01-04-2021)“…In this article, we investigate the problem of actuator selection for linear dynamical systems. We develop a framework to design a sparse actuator schedule for…”
Get full text
Journal Article -
2
Minimal Reachability is Hard To Approximate
Published in IEEE transactions on automatic control (01-02-2019)“…In this note, we consider the problem of choosing, which nodes of a linear dynamical system should be actuated so that the state transfer from the system's…”
Get full text
Journal Article -
3
Nonasymptotic Concentration Rates in Cooperative Learning-Part II: Inference on Compact Hypothesis Sets
Published in IEEE transactions on control of network systems (01-09-2022)“…In this article, we study the problem of cooperative inference, where a group of agents interacts over a network and seeks to estimate a joint parameter that…”
Get full text
Journal Article -
4
Nonasymptotic Concentration Rates in Cooperative Learning-Part I: Variational Non-Bayesian Social Learning
Published in IEEE transactions on control of network systems (01-09-2022)“…In this article, we studied the problem of cooperative inference where a group of agents interacts over a network and seeks to estimate a joint parameter that…”
Get full text
Journal Article -
5
Graph diameter, eigenvalues, and minimum-time consensus
Published in Automatica (Oxford) (01-02-2014)“…We consider the problem of achieving average consensus in the minimum number of linear iterations on a fixed, undirected graph. We are motivated by the task of…”
Get full text
Journal Article -
6
Guest Editorial Special Issue on Dynamics and Behaviors in Social Networks
Published in IEEE transactions on control of network systems (01-09-2022)Get full text
Journal Article -
7
On the NP-Hardness of Checking Matrix Polytope Stability and Continuous-Time Switching Stability
Published in IEEE transactions on automatic control (01-02-2009)“…Motivated by questions in robust control and switched linear dynamical systems, we consider the problem checking whether all convex combinations of k matrices…”
Get full text
Journal Article -
8
Improved approximation algorithms for the quality of service multicast tree problem
Published in Algorithmica (01-04-2005)Get full text
Journal Article -
9
Minimal Reachability is Hard To Approximate
Published 27-10-2017“…In this note, we consider the problem of choosing which nodes of a linear dynamical system should be actuated so that the state transfer from the system's…”
Get full text
Journal Article -
10
Graph diameter, eigenvalues, and minimum-time consensus
Published 27-11-2012“…We consider the problem of achieving average consensus in the minimum number of linear iterations on a fixed, undirected graph. We are motivated by the task of…”
Get full text
Journal Article