返回
Multi-robot repeated area coverage
DOI:10.1007/s10514-012-9319-7.png)
摘要
En 中文
We address the problem of repeated coverage of a target area, of any polygonal shape, by a team of robots having a limited visual range. Three distributed Cluster-based algorithms, and a method called Cyclic Coverage are introduced for the problem. The goal is to evaluate the performance of the repeated coverage algorithms under the effects of the variables: Environment Representation, and the Robots' Visual Range. A comprehensive set of performance metrics are considered, including the distance the robots travel, the frequency of visiting points in the target area, and the degree of balance in workload distribution among the robots. The Cyclic Coverage approach, used as a benchmark to compare the algorithms, produces optimal or near-optimal solutions for the single robot case under some criteria. The results can be used as a framework for choosing an appropriate combination of repeated coverage algorithm, environment representation, and the robots' visual range based on the particular scenario and the metric to be optimized.
Keyword:
Multi-robot systems
Teamwork
Coordination
Area Coverage
Visibility Graph
Constrained Delaunay Triangulation
Uninformed Clustering Coverage
Edge-based Clustering Coverage
Node-based Clustering Coverage
Cyclic Coverage
Chained Lin-Kernighan Algorithm
Double-Minimum Spanning Tree
期刊
IF:
4.3
论文数:
1.7K
被引数:
5.0K
机构
引用论文
Nano-sized LaMnO3 powders prepared by spray pyrolysis from spray solution containing citric acid从含柠檬酸的喷雾溶液中通过喷雾热解制备纳米LaMnO3粉末
Investigation of morphologies and characterization of rare earth metal samarium hexacyanoferrate and its composite with surfactant intercalated graphene oxide for sensor applications
RSC Adv.
IF0
Estrogen receptor mediated activity in bankside groundwater, with flood suspended particulate matter and floodplain soil – An approach combining tracer substance, bioassay and target analysis
Chemosphere
IF0

