SWARM
Task reallocation in multi-robot formations
Noa Agmon, Gal A. Kaminka, Sarit Kraus, Meytal Traub
- Year
- 2010
- Citations
- 6
- Access
- Open access
Abstract
This paper considers the task reallocation problem, where k robots are to be extracted from a coordinated group of N robots in order to perform a new task. The interaction between the team members and the cost associated with this interaction are represented by a directed weighted graph. Consider a group of N robots organized in a formation. The graph is the monitoring graph which represents the sensorial capabilities of the robots, i.e., which robot can sense the other and at what cost.
Keywords
RobotTask (project management)Computer scienceGraphTime complexityArtificial intelligenceAlgorithmTheoretical computer scienceMathematical optimizationMathematics
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
Open access📊 20,501 cites
Fractional Differential Equations
Igor Podlubný
2025
OTHER
📊 18,993 cites
Applied Nonlinear Control
Jean-Jacques Slotine, Weiping Li
1991