A mobile multi-agent sensing problem with submodular functions under a partition matroid
From MaRDI portal
Publication:2668714
DOI10.1016/j.cor.2021.105265OpenAlexW3138865409MaRDI QIDQ2668714
Publication date: 7 March 2022
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cor.2021.105265
Related Items (2)
Improved approximation algorithms for \(k\)-submodular maximization under a knapsack constraint ⋮ An exact solution approach for the mobile multi‐agent sensing problem
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- An innovative multi-agent search-and-rescue path planning approach
- Maximizing lifetime in wireless sensor networks with multiple sensor families
- Submodular set functions, matroids and the greedy algorithm: Tight worst- case bounds and some generalizations of the Rado-Edmonds theorem
- Efficient sensor network management for asset localization
- Optimising the barrier coverage of a wireless sensor network with hub-and-spoke topology using mathematical and simulation models
- Exploiting submodularity to quantify near-optimality in multi-agent coverage problems
- Distributed greedy algorithm for multi-agent task assignment problem with submodular utility functions
- Improved bounds for the greedy strategy in optimization problems with curvature
- Combinatorial auctions with decreasing marginal utilities
- A sub-modular receding horizon solution for mobile multi-agent persistent monitoring
- Maximizing a Monotone Submodular Function Subject to a Matroid Constraint
- An improved approximation algorithm for combinatorial auctions with submodular bidders
- An analysis of approximations for maximizing submodular set functions—I
- Optimal Approximation for Submodular and Supermodular Optimization with Bounded Curvature
- Consensus and Cooperation in Networked Multi-Agent Systems
- Distributed Submodular Maximization With Limited Information
- Distributed Subgradient Methods for Multi-Agent Optimization
- Deterministic (½ + ε)-Approximation for Submodular Maximization over a Matroid
- Submodular Maximization with Cardinality Constraints
- Online submodular welfare maximization: Greedy is optimal
- Approximation for maximizing monotone non-decreasing set functions with a greedy method
This page was built for publication: A mobile multi-agent sensing problem with submodular functions under a partition matroid
