Optimal robot base placements for coverage tasks. - Institut Pascal
Conference Papers Year : 2018

Optimal robot base placements for coverage tasks.

Rawan Kalawoun
  • Function : Author
Sebastien Lengagne
Youcef Mezouar
  • Function : Author

Abstract

Robotic coverage problem is addressed in several fields: painting, stripping, grist-blasting, etc. In multi-robot systems, the collaboration between robots reduces the cycle time and increases the coverage task accuracy. However, the robot base placement must be deeply studied to attend those goals. In this article, we propose a new approach in order to assign tasks within a multiple robots system. In addition, we develop an optimization strategy to find the optimal number of robots with their optimal poses required to cover the entire surface. To assess our method, our algorithm was tested on regular surfaces such as cylinder and hemisphere, and on a complex surface represented in a car shell.

Domains

Automatic
Fichier principal
Vignette du fichier
Kalawoun_CASE2018.pdf (2.62 Mo) Télécharger le fichier
Origin Files produced by the author(s)

Dates and versions

hal-01913861 , version 1 (29-09-2024)

Identifiers

  • HAL Id : hal-01913861 , version 1

Cite

Rawan Kalawoun, Sebastien Lengagne, Youcef Mezouar. Optimal robot base placements for coverage tasks.. 14th IEEE International Conference on Automation Science and Engineering (CASE 2018), Aug 2018, Munich, Germany. ⟨hal-01913861⟩
49 View
0 Download

Share

More