Optimal composition of heterogeneous multi-agent teams for coverage problems with performance bound guarantees

DOI10.1016/j.automatica.2020.108961zbMath1441.93017arXiv2003.05587OpenAlexW3011815789MaRDI QIDQ2184512

Shirantha Welikala, Chuangchuang Sun, Christos G. Cassandras

Publication date: 29 May 2020

Published in: Automatica (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2003.05587

zbMATH Keywords

optimizationmulti-agent systemscooperative control

Mathematics Subject Classification ID

Mixed integer programming (90C11) Nonlinear programming (90C30) Multi-agent systems (93A16)

Related Items (4)

A new performance bound for submodular maximization problems and its application to multi-agent optimal coverage problems ⋮ Event-driven receding horizon control for distributed persistent monitoring in network systems ⋮ Greedy initialization for distributed persistent monitoring in network systems ⋮ Optimal coverage control of stationary and moving agents under effective coverage constraints

Cites Work

• 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
• Exploiting submodularity to quantify near-optimality in multi-agent coverage problems
• Improved bounds for the greedy strategy in optimization problems with curvature
• An analysis of approximations for maximizing submodular set functions—I
• Distributed Coverage Control and Data Collection With Mobile Sensor Networks
• Approximation for maximizing monotone non-decreasing set functions with a greedy method

This page was built for publication: Optimal composition of heterogeneous multi-agent teams for coverage problems with performance bound guarantees