Approximation Algorithms for Distributed Multi-robot Coverage in Non-convex Environments

DOI10.1007/978-3-030-66723-8_20zbMath1469.68134arXiv2005.02471OpenAlexW3167897096MaRDI QIDQ3381981

Ahmad Bilal Asghar, Stephen L. Smith, Armin Sadeghi

Publication date: 20 September 2021

Published in: Algorithmic Foundations of Robotics XIV (Search for Journal in Brave)

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

zbMATH Keywords

sensor networksdistributed robots

Mathematics Subject Classification ID

Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Approximation algorithms (68W25) Artificial intelligence for robotics (68T40)

Cites Work

• Unnamed Item
• Approximating $k$-Median via Pseudo-Approximation
• Coverage problems in sensor networks
• Approximation algorithms for metric facility location and k -Median problems using the primal-dual schema and Lagrangian relaxation
• A Stochastic and Dynamic Vehicle Routing Problem in the Euclidean Plane
• Local Search Heuristics for k-Median and Facility Location Problems
• Planning Algorithms
• Local-Search based Approximation Algorithms for Mobile Facility Location Problems: (Extended Abstract)

This page was built for publication: Approximation Algorithms for Distributed Multi-robot Coverage in Non-convex Environments