Exploiting submodularity to quantify near-optimality in multi-agent coverage problems
type: Item
instance of: scholarly article
title: Exploiting submodularity to quantify near-optimality in multi-agent coverage problems
zbMATH Open document ID: 1415.93030
author: Xinmiao Sun
author: Christos G. Cassandras
author: Xiangyu Meng
published in: Automatica
publication date: 2019-04-24T00:00:00Z
Mathematics Subject Classification ID: 93A14
Mathematics Subject Classification ID: 68T42
zbMATH DE Number: 7047085
zbMATH Keywords: optimal coverage
zbMATH Keywords: multi-agent systems
zbMATH Keywords: submodular set function
zbMATH Keywords: greedy algorithm
zbMATH Keywords: gradient method
MaRDI profile type: Publication
full work available at URL: j.automatica.2018.11.020
OpenAlex ID: W2904310653
cites work: The generalized maximal covering location problem
cites work: Q4209222
cites work: Sensor networks and cooperative control
cites work: Submodular set functions, matroids and the greedy algorithm: Tight worst- case bounds and some generalizations of the Rado-Edmonds theorem
cites work: Q4196269
cites work: Distributed coverage control for concave areas by a heterogeneous Robot-Swarm with visibility sensing constraints
cites work: The budgeted maximum coverage problem
cites work: Q3096108
cites work: An analysis of approximations for maximizing submodular set functions—I
cites work: Q3785827
cites work: Approximation for maximizing monotone non-decreasing set functions with a greedy method
cites work: String Submodular Functions With Curvature Constraints
cites work: Distributed Coverage Control and Data Collection With Mobile Sensor Networks
Wikidata QID: Q128836075
DOI: 10.1016/J.AUTOMATICA.2018.11.020
description: scientific article; zbMATH DE number 7047085