Home /Research /BSA-CM: A Multi-robot Coverage Algorithm
SWARM

BSA-CM: A Multi-robot Coverage Algorithm

Enríque González, Eduardo A. Gerlein

Year
2009
Citations
16

Abstract

This paper presents the development of a multi-robot 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.

Keywords

RobotComputer scienceTask (project management)Extension (predicate logic)AlgorithmNegotiationArtificial intelligenceReal-time computingEngineeringSystems engineering

Related papers

Browse all SWARM papers