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

Sadeghi, Armin; Asghar, Ahmad Bilal; Smith, Stephen L.

doi:10.1007/978-3-030-66723-8_20

Cited by 2 publications

(1 citation statement)

References 25 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…A preliminary version of this work appeared in [8], which proposed a distributed algorithm for the synchronous case that achieved a constant factor approximation along with a preliminary numerical validation. In this paper, we extend the results in [8] in the following ways. First, we provide bounds on the run-time and the number of messages passed between the robots.…”

Section: Introductionmentioning

confidence: 99%

Distributed Multirobot Coverage Control of Nonconvex Environments With Guarantees

Sadeghi

Asghar

Smith

2023

IEEE Trans. Control Netw. Syst.

Self Cite

View full text Add to dashboard Cite

In this paper, we revisit the problem of distributed coverage with a fleet of robots in convex and nonconvex environments. In the majority of approaches for this problem, the environment is partitioned, each robot is assigned to a partition and each robot moves toward a location that improves the service quality in its partition. These approaches converge to a locally optimal solution, however, there is no guarantee on the quality of the locally optimal solution with respect to the globally optimal solution. We propose distributed algorithms for the coverage problem in convex continuous, non-convex continuous and metric graphs. We consider sub-additive sensing functions, which capture scenarios where the service quality of a location is proportional to the distance between the robot and the location. For these sensing functions, we provide the first constant factor approximation algorithms for the distributed coverage problem. We also characterize the time and communication complexity of the proposed algorithm and show that the robots converge to a near-optimal solution in polynomial time. The approximation factor guarantees on the solution quality requires twice the conventional communication range, however, the extensive simulation results show that the proposed algorithm provides close to optimal solution with the conventional communication range as well, and outperforms several existing algorithms in convex, non-convex continuous environments and metric graphs.

show abstract

Section: Introductionmentioning

confidence: 99%