Skip to main navigation Skip to search Skip to main content

BSA-CM: A multi-robot coverage algorithm

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

13 Scopus citations

Abstract

This paper presents the development of a multirobot platform which performs a coverage task based in a multiagent approach. Characteristics and requirements looking for intentional cooperation in a multi-agent system are analyzed, as well as the requirements and strategies to accomplish a multi-robot coverage. BSA-CM is designed as extension of the basic BSA single robot coverage algorithm. The multirobot approach is supported by a negotiation mechanism intended to assign a partial covering task to the best suited robot.

Original languageEnglish
Title of host publicationProceedings - 2009 IEEE/WIC/ACM International Conference on Intelligent Agent Technology, IAT 2009
Pages383-386
Number of pages4
DOIs
StatePublished - 2009
Event2009 IEEE/WIC/ACM International Conference on Web Intelligence and Intelligent Agent Technology, WI-IAT 2009 - Milano, Italy
Duration: 15 Sep 200918 Sep 2009

Publication series

NameProceedings - 2009 IEEE/WIC/ACM International Conference on Intelligent Agent Technology, IAT 2009
Volume2

Conference

Conference2009 IEEE/WIC/ACM International Conference on Web Intelligence and Intelligent Agent Technology, WI-IAT 2009
Country/TerritoryItaly
CityMilano
Period15/09/0918/09/09

Keywords

  • Cooperative systems
  • Covering
  • Mapping
  • Mobile robot motion-planning
  • Mobile robots

Fingerprint

Dive into the research topics of 'BSA-CM: A multi-robot coverage algorithm'. Together they form a unique fingerprint.

Cite this