Randomized greedy methods for weak submodular sensor selection with robustness considerations

DOI10.1016/j.automatica.2024.111984MaRDI QIDQ6659283zbMATH OpenFDO

Authors Ege Can Kaya, Takashi Tanaka, Ufuk Topcu, Abolfazl Hashemi

Publication date 8 January 2025

Published in Automatica (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.automatica.2024.111984

zbMATH Keywords

aerospacedecision making and autonomydistributed optimization for large-scale systemslarge scale optimization problemsmodeling and decision making in complex systemsprobabilistic robustnessrobustness analysissensor data fusion

Mathematics Subject Classification ID

Systems theory; control (93-XX)

Recommendations

• scientific article; zbMATH DE number 5968956
• Structured Robust Submodular Maximization: Offline and Online Algorithms
• Robust monotone submodular function maximization
• Robust monotone submodular function maximization
• Adaptive robust submodular optimization and beyond

Cites work

• A threshold of ln n for approximating set cover
• An analysis of approximations for maximizing submodular set functions—I
• An analysis of the greedy algorithm for the submodular set covering problem
• Approximate submodularity and its applications: subset selection, sparse approximation and dictionary selection
• Approximating the least core value and least core of cooperative games with supermodular costs
• Auctions, market mechanisms and their applications. First international ICST conference, AMMA 2009, Boston, MA, USA, May 8--9, 2009. Revised Selected Papers
• Concentration Inequalities and Martingale Inequalities: A Survey
• Deterministic Nonperiodic Flow
• scientific article; zbMATH DE number 5968956 (Why is no real title available?)
• On the benefits of progressively increasing sampling sizes in stochastic greedy weak submodular maximization
• Randomized Greedy Sensor Selection: Leveraging Weak Submodularity
• Restricted strong convexity implies weak submodularity
• Robust optimization
• Robust optimization-methodology and applications
• Submodular maximization with cardinality constraints
• The budgeted maximum coverage problem
• The design of approximation algorithms

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

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