Randomized greedy methods for weak submodular sensor selection with robustness considerations

DOI10.1016/j.automatica.2024.111984MaRDI QIDQ6659283

Abolfazl Hashemi, Unnamed Author, Takashi Tanaka, Ege Can Kaya, Ufuk Topcu

Publication date: 8 January 2025

Published in: Automatica (Search for Journal in Brave)

zbMATH Keywords

robustness analysisaerospaceprobabilistic robustnessdecision making and autonomysensor data fusionlarge scale optimization problemsdistributed optimization for large-scale systemsmodeling and decision making in complex systems

Mathematics Subject Classification ID

Systems theory; control (93-XX)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Auctions, market mechanisms and their applications. First international ICST conference, AMMA 2009, Boston, MA, USA, May 8--9, 2009. Revised Selected Papers
• The budgeted maximum coverage problem
• An analysis of the greedy algorithm for the submodular set covering problem
• Robust optimization-methodology and applications
• Restricted strong convexity implies weak submodularity
• Approximating the least core value and least core of cooperative games with supermodular costs
• The Design of Approximation Algorithms
• A threshold of ln n for approximating set cover
• Concentration Inequalities and Martingale Inequalities: A Survey
• An analysis of approximations for maximizing submodular set functions—I
• Deterministic Nonperiodic Flow
• Submodular Maximization with Cardinality Constraints
• Randomized Greedy Sensor Selection: Leveraging Weak Submodularity
• On the benefits of progressively increasing sampling sizes in stochastic greedy weak submodular maximization

This page was built for publication: Randomized greedy methods for weak submodular sensor selection with robustness considerations