We address robustness and efficiency in a family of multi-robot coverage algorithms, based on spanning-tree coverage of approximate cell decomposition. We ...
Dec 31, 2008 · This paper examines robustness and efficiency in multi-robot coverage. We focus on coverage using a map of a static work-area (known as off-line coverage).
Indeed, a common assumption is that non-redundancy leads to improved coverage time. We address robustness and efficiency in a family of multi-robot coverage.
We present a polynomial-time redundant coverage algorithm, whose coverage time is optimal, and which is able to address robots heterogeneous in speed and fuel.
We present a polynomial-time redundant coverage algorithm, whose coverage time is optimal, and which is able to address robots heterogeneous in speed and fuel.
Redundancy, Efficiency and Robustness in Multi-Robot Coverage
www.researchgate.net › ... › Robustness
Previous investigations of multi-robot coverage focus on completeness of the coverage, and on eliminating redundancy, but do not formally address robustness.
It is shown that locally changing the coverage direction (alignment) in each cell can improve coverage time, and that this allows for merging bordering ...
People also ask
What is redundancy in robots?
How do robots increase efficiency?
We address robustness and efficiency in a family of multi-robot coverage algorithms, based on spanning-tree coverage of approximate cell decomposition. We ...
Dive into the research topics of 'On redundancy, efficiency, and robustness in coverage for multiple robots'. Together they form a unique fingerprint. Sort by ...
Motivated by potential efficiency and robustness gains, there is growing interest in the use of multiple robots for coverage. In coverage, robots visit ...