Exploiting submodularity to quantify near-optimality in multi-agent coverage problems
From MaRDI portal
Publication:1737663
DOI10.1016/j.automatica.2018.11.020zbMath1415.93030OpenAlexW2904310653MaRDI QIDQ1737663
Xiangyu Meng, Xinmiao Sun, Christos G. Cassandras
Publication date: 24 April 2019
Published in: Automatica (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.automatica.2018.11.020
Related Items
A new performance bound for submodular maximization problems and its application to multi-agent optimal coverage problems ⋮ A mobile multi-agent sensing problem with submodular functions under a partition matroid ⋮ Optimal composition of heterogeneous multi-agent teams for coverage problems with performance bound guarantees ⋮ Sectorial coverage control with load balancing in non-convex hollow environments ⋮ Optimal coverage control of stationary and moving agents under effective coverage constraints ⋮ An exact solution approach for the mobile multi‐agent sensing problem ⋮ Coverage control for heterogeneous mobile sensor networks with bounded position measurement errors ⋮ Coverage control for mobile sensor networks with time-varying communication delays on a closed curve
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Submodular set functions, matroids and the greedy algorithm: Tight worst- case bounds and some generalizations of the Rado-Edmonds theorem
- The budgeted maximum coverage problem
- Distributed coverage control for concave areas by a heterogeneous Robot-Swarm with visibility sensing constraints
- Sensor networks and cooperative control
- String Submodular Functions With Curvature Constraints
- An analysis of approximations for maximizing submodular set functions—I
- Distributed Coverage Control and Data Collection With Mobile Sensor Networks
- The generalized maximal covering location problem
- Approximation for maximizing monotone non-decreasing set functions with a greedy method
