Performance-Guaranteed Solutions for Multi-Agent Optimal Coverage Problems using Submodularity, Curvature, and Greedy Algorithms (2403.14028v2)
Abstract: We consider a class of multi-agent optimal coverage problems in which the goal is to determine the optimal placement of a group of agents in a given mission space so that they maximize a coverage objective that represents a blend of individual and collaborative event detection capabilities. This class of problems is extremely challenging due to the non-convex nature of the mission space and of the coverage objective. With this motivation, greedy algorithms are often used as means of getting feasible coverage solutions efficiently. Even though such greedy solutions are suboptimal, the submodularity (diminishing returns) property of the coverage objective can be exploited to provide performance bound guarantees. Moreover, we show that improved performance bound guarantees (beyond the standard (1-1/e) performance bound) can be established using various curvature measures of the coverage problem. In particular, we provide a brief review of all existing popular applicable curvature measures, including a recent curvature measure that we proposed, and discuss their effectiveness and computational complexity, in the context of optimal coverage problems. We also propose novel computationally efficient techniques to estimate some curvature measures. Finally, we provide several numerical results to support our findings and propose several potential future research directions.
- An Inequality for Polymatroid Functions and its Applications. Discrete Applied Mathematics, 131(2):255–281, 2003.
- The Generalized Maximum Coverage Problem. Information Processing Letters, 108(1):15–22, 2008.
- Submodular Set Functions, Matroids and The Greedy Algorithm: Tight Worst-Case Bounds and Some Generalizations of The Rado-Edmonds Theorem. Discrete Applied Mathematics, 7(3):251–274, 1984.
- Location of Bank Accounts to Optimize Float: An Analytic Study of Exact and Approximate Algorithms. Management Science, 23(8):789–810, 1977.
- Improved Bounds for The Greedy Strategy in Optimization Problems with Curvature. Journal of Combinatorial Optimization, 37(4):1126–1149, 2018.
- Voronoi-Based Coverage Control with Connectivity Maintenance for Robotic Sensor Networks. In Intl. Symp. on Multi-Robot and Multi-Agent Systems, pages 148–154, 2019.
- An Analysis of Approximations for Maximizing Submodular Set Functions—I. Mathematical Programming, 14(1):265–294, 1978.
- A Sub-Modular Receding Horizon Approach to Persistent Monitoring for A Group of Mobile Agents Over an Urban Area. In IFAC-PapersOnLine, volume 52, pages 217–222, 2019.
- Optimal Composition of Heterogeneous Multi-Agent Teams for Coverage Problems with Performance Bound Guarantees. Automatica, 117:108961, 2020.
- Exploiting Submodularity to Quantify Near-Optimality in Multi-Agent Coverage Problems. Automatica, 100:349–359, feb 2019.
- Approximation for Maximizing Monotone Non-Decreasing Set Functions with A Greedy Method. Journal of Combinatorial Optimization, 31(1):29–43, 2016.
- Asymptotic Analysis for Greedy Initialization of Threshold-Based Distributed Optimization of Persistent Monitoring on Graphs. In Proc. of 21st IFAC World Congress, volume 53, pages 3433–3438, 2020. URL: https://www.sciencedirect.com/science/article/pii/S2405896320322734, doi:10.1016/j.ifacol.2020.12.1670.
- Distributed Non-Convex Optimization of Multi-Agent Systems Using Boosting Functions to Escape Local Optima. IEEE Trans. on Automatic Control, 2020.
- A New Performance Bound for Submodular Maximization Problems and Its Application to Multi-Agent Optimal Coverage Problems. Automatica, 144:110493, 2022.
- Dynamic Coverage Control Based on K-Means. IEEE Trans. on Industrial Electronics, 69(5):5333–5341, 2022.
- M Zhong and C G Cassandras. Distributed Coverage Control and Data Collection with Mobile Sensor Networks. IEEE Trans. on Automatic Control, 56(10):2445–2455, 2011.
- Shirantha Welikala (21 papers)
- Christos G. Cassandras (116 papers)