Multi-Robot Weighted Coverage Path Planning: a Solution based on the DARP Algorithm - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year : 2022

Multi-Robot Weighted Coverage Path Planning: a Solution based on the DARP Algorithm

Abstract

Covering a given area with a team of mobile robots in a minimum time is a well-studied problem with many real-world applications. A rarely studied subject, however, is the case of a weighted plane: due to the necessity of taking time-consuming measurements or having to traverse different kinds of terrains, the coverage time may vary over the environment and the path planning needs to be adapted accordingly. In this paper, we present an adapted version of a state-of-the-art mCPP (multi-robot coverage path planning) approach, the DARP algorithm, to make it suitable to deal with weighted environments. In particular, we propose several modifications to DARP that allow overcoming some of its limitations and, as a result, obtain an increased convergence rate and decreased convergence time with respect to the original version. Furthermore, as proved by extensive simulations, these improvements are also noticed in the unweighted version of the problem.
Fichier principal
Vignette du fichier
DARP_based_mwCPP_hal.pdf (578.63 Ko) Télécharger le fichier
Origin Files produced by the author(s)

Dates and versions

hal-03798217 , version 1 (05-10-2022)

Identifiers

  • HAL Id : hal-03798217 , version 1

Cite

Olivier Idir, Alessandro Renzaglia. Multi-Robot Weighted Coverage Path Planning: a Solution based on the DARP Algorithm. ICARCV 2022 - 17th International Conference on Control, Automation, Robotics and Vision, Dec 2022, Singapore, Singapore. pp.1-7. ⟨hal-03798217⟩
104 View
146 Download

Share

Gmail Mastodon Facebook X LinkedIn More