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
OTHER
📊 26,957 cites
Statistical Learning Theory
Yuhai Wu, Vladimir Vapnik
1999
PERCEPTION
📊 22,245 cites
Artificial intelligence: a modern approach
1995
OTHER
📊 18,993 cites
Applied Nonlinear Control
Jean-Jacques Slotine, Weiping Li
1991
SWARM
📊 14,853 cites
A new optimizer using particle swarm theory
R.C. Eberhart, James Kennedy
2002