Pages that link to "Item:Q2668714"
From MaRDI portal
The following pages link to A mobile multi-agent sensing problem with submodular functions under a partition matroid (Q2668714):
Displaying 7 items.
- Exploiting submodularity to quantify near-optimality in multi-agent coverage problems (Q1737663) (← links)
- Policies for risk-aware sensor data collection by mobile agents (Q2151909) (← links)
- A new performance bound for submodular maximization problems and its application to multi-agent optimal coverage problems (Q2166001) (← links)
- Informative path planning as a maximum traveling salesman problem with submodular rewards (Q2345604) (← links)
- Improved approximation algorithms for \(k\)-submodular maximization under a knapsack constraint (Q6065659) (← links)
- Distributed strategy selection: a submodular set function maximization approach (Q6110260) (← links)
- An exact solution approach for the mobile multi‐agent sensing problem (Q6194842) (← links)