Randomized greedy sensor selection: Leveraging weak submodularity
We study the problem of estimating a random process from the observations collected by a
network of sensors that operate under resource constraints. When the dynamics of the …
network of sensors that operate under resource constraints. When the dynamics of the …
Online active perception for partially observable Markov decision processes with limited budget
Active perception strategies enable an agent to selectively gather information in a way to
improve its performance. In applications in which the agent does not have prior knowledge …
improve its performance. In applications in which the agent does not have prior knowledge …
A randomized approach to sensor placement with observability assurance
SD Bopardikar - Automatica, 2021 - Elsevier
Given a linear dynamical system, we provide a probabilistic treatment to the classic problem
of placing sensors in a set of candidate locations such that the observability Gramian of the …
of placing sensors in a set of candidate locations such that the observability Gramian of the …
Submodular observation selection and information gathering for quadratic models
We study the problem of selecting most informative subset of a large observation set to
enable accurate estimation of unknown parameters. This problem arises in a variety of …
enable accurate estimation of unknown parameters. This problem arises in a variety of …
On the benefits of progressively increasing sampling sizes in stochastic greedy weak submodular maximization
Many problems in signal processing and machine learning can be formalized as weak
submodular optimization tasks. For such problems, a simple greedy algorithm (Greedy) is …
submodular optimization tasks. For such problems, a simple greedy algorithm (Greedy) is …
On a relaxation of time-varying actuator placement
A Olshevsky - IEEE Control Systems Letters, 2020 - ieeexplore.ieee.org
We consider the time-varying actuator placement in continuous time, where the goal is to
maximize the trace of the controllability Grammian. A natural relaxation of the problem is to …
maximize the trace of the controllability Grammian. A natural relaxation of the problem is to …
Randomized sensor selection for nonlinear systems with application to target localization
Given a nonlinear dynamical system, this letter considers the problem of selecting a subset
of the total set of sensors that has provable guarantees on standard metrics related to the …
of the total set of sensors that has provable guarantees on standard metrics related to the …
Aggregation-scheduling based mechanism for energy-efficient multivariate sensor networks
Recently, the world has witnessed a technology revolution in many sectors and fields with
the aim to enhance the quality of life and the human security. Particularly, the integration of …
the aim to enhance the quality of life and the human security. Particularly, the integration of …
Randomized greedy algorithms for sensor selection in large-scale satellite constellations
As both the number and size of satellite constellations continue to increase, there likewise
exists a growing need for incorporating methods for autonomous sensor selection into these …
exists a growing need for incorporating methods for autonomous sensor selection into these …
Evolutionary self-expressive models for subspace clustering
The problem of organizing data that evolves over time into clusters is encountered in a
number of practical settings. We introduce evolutionary subspace clustering, a method …
number of practical settings. We introduce evolutionary subspace clustering, a method …