Randomized greedy sensor selection: Leveraging weak submodularity

A Hashemi, M Ghasemi, H Vikalo… - IEEE Transactions on …, 2020 - ieeexplore.ieee.org
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 …

Online active perception for partially observable Markov decision processes with limited budget

M Ghasemi, U Topcu - 2019 IEEE 58th Conference on Decision …, 2019 - ieeexplore.ieee.org
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 …

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 …

Submodular observation selection and information gathering for quadratic models

A Hashemi, M Ghasemi, H Vikalo… - … on Machine Learning, 2019 - proceedings.mlr.press
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 …

On the benefits of progressively increasing sampling sizes in stochastic greedy weak submodular maximization

A Hashemi, H Vikalo… - IEEE Transactions on …, 2022 - ieeexplore.ieee.org
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 …

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 …

Randomized sensor selection for nonlinear systems with application to target localization

SD Bopardikar, O Ennasr, X Tan - IEEE Robotics and …, 2019 - ieeexplore.ieee.org
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 …

Aggregation-scheduling based mechanism for energy-efficient multivariate sensor networks

M Ibrahim, H Harb, A Nasser, A Mansour… - IEEE Sensors …, 2022 - ieeexplore.ieee.org
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 …

Randomized greedy algorithms for sensor selection in large-scale satellite constellations

M Hibbard, A Hashemi, T Tanaka… - 2023 American Control …, 2023 - ieeexplore.ieee.org
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 …

Evolutionary self-expressive models for subspace clustering

A Hashemi, H Vikalo - IEEE Journal of Selected Topics in …, 2018 - ieeexplore.ieee.org
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 …