Randomized Greedy Sensor Selection: Leveraging Weak Submodularity

DOI10.1109/TAC.2020.2980924MaRDI QIDQ5853995zbMATH OpenOpenAlexFDO

Authors Abolfazl Hashemi, Mahsa Ghasemi, Haris Vikalo, Ufuk Topcu

Publication date 12 March 2021

Published in IEEE Transactions on Automatic Control (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1807.08627

Mathematics Subject Classification ID

Systems theory; control (93-XX)

Recommendations

• Submodularity and greedy algorithms in sensor scheduling for linear dynamical systems
• On a stochastic sensor selection algorithm with applications in sensor scheduling and sensor coverage
• Optimal Sensor Selection in Binary Heterogeneous Sensor Networks
• Sensor Array Design Through Submodular Optimization
• Approximate Supermodularity of Kalman Filter Sensor Selection
• Sensor selection for random field estimation in wireless sensor networks
• Distributed Sparsity-Aware Sensor Selection
• Submodular Utility Maximization for Deadline Constrained Data Collection in Sensor Networks
• A randomized approach to sensor placement with observability assurance
• A statistics-based sensor selection scheme for continuous probabilistic queries in sensor networks

Cited in

(3)

• Randomized greedy methods for weak submodular sensor selection with robustness considerations
• Data scheduling and state estimation for large-scale event-based sensor arrays
• Submodularity and greedy algorithms in sensor scheduling for linear dynamical systems

This page was built for publication: Randomized Greedy Sensor Selection: Leveraging Weak Submodularity

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5853995)