Multi-robot sensor-based coverage path planning using capacitated arc routing approach


IEEE International Conference on Control Applications/International Symposium on Intelligent Control, St Petersburg, Rusya, 8 - 10 Temmuz 2009, ss.1146-1147 identifier identifier

  • Yayın Türü: Bildiri / Tam Metin Bildiri
  • Cilt numarası:
  • Doi Numarası: 10.1109/cca.2009.5281159
  • Basıldığı Şehir: St Petersburg
  • Basıldığı Ülke: Rusya
  • Sayfa Sayıları: ss.1146-1147


In this study, a novel sensor-based coverage algorithm is proposed for multi-robots considering energy capacities of the mobile robots. Firstly, the environment is modeled by a Generalized Voronoi diagram-based graph to guarantee complete sensor based coverage. Secondly, depending on required arc set, an initial complete coverage route is created by using Chinese Postman Problem (CPP) and/or Rural Postman Problem (RPP). Then this initial route is partitioned among robots using Ulusoy's algorithm, which was developed for basic capacitated arc routing (CARP), by considering robot energy capacities. Although the multi-robot sensor-based coverage problem resembles CARP, there are some differences. Therefore, Ulusoy's algorithm is modified and used for this problem. The developed algorithm is coded in C++ and implemented on P3-DX mobile robots in MobileSim simulation environment.