SWARM
GEODESIC-VPC: SPATIAL PARTITIONING FOR MULTI-ROBOT COVERAGE PROBLEM
Vishnu G. Nair, K. R. Guruprasad
- Year
- 2020
- Citations
- 6
Abstract
In this paper, we address a problem of area coverage using multiple cooperating robots using a “partition and cover approach, where the area of interest is decomposed into as many cells as the robots, and each robot is assigned the task of covering a cell.
Keywords
RobotComputer sciencePartition (number theory)Mobile robotTask (project management)Cover (algebra)GeodesicArtificial intelligenceMathematicsEngineering
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