Submodular optimization for heterogeneous UAV deployment
From MaRDI portal
Cites work
- An analysis of approximations for maximizing submodular set functions—I
- Branch-and-Bound Search for Experimental Designs Based on D Optimality and Other Criteria
- Efficient Sensor Placement for Signal Reconstruction Based on Recursive Methods
- Finite normalized tight frames
- Greedy selection for heterogeneous sensors
- Greedy sensor selection: leveraging submodularity based on volume ratio of information ellipsoid
- Group Greedy Method for Sensor Placement
- scientific article; zbMATH DE number 432498 (Why is no real title available?)
- Near-Optimal Sensor Placement for Linear Inverse Problems
- Near-optimal sensor placements in Gaussian processes: theory, efficient algorithms and empirical studies
- Optimized sensor placement for urban flow measurement
- Sensor Placement by Maximal Projection on Minimum Eigenspace for Linear Inverse Problems
- Sensor Scheduling With Time, Energy, and Communication Constraints
- Sensor Selection via Convex Optimization
- Sparsity-Promoting Sensor Selection for Non-Linear Measurement Models
- Spatial Field Reconstruction and Sensor Selection in Heterogeneous Sensor Networks With Stochastic Energy Harvesting
- Submodular set functions, matroids and the greedy algorithm: Tight worst- case bounds and some generalizations of the Rado-Edmonds theorem
- UAV target tracking with bandit-based data fusion
This page was built for publication: Submodular optimization for heterogeneous UAV deployment
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7314345)
