Performance analysis for multi-robot exploration strategies

4Citations
Citations of this article
12Readers
Mendeley users who have this article in their library.
Get full text

Abstract

In this note, we compare four different exploration strategies and analyze the performance in terms of exploration time and amount of exploration per time step. In order to provide a suitable reference for comparison, we derive an upper bound for the theoretically achievable increase of explored area per time step. The comparison itself is done using a comprehensive empirical evaluation resulting in statistically significant performance differences. © 2010 Springer-Verlag Berlin Heidelberg.

Cite

CITATION STYLE

APA

Frank, S., Listmann, K., Haumann, D., & Willert, V. (2010). Performance analysis for multi-robot exploration strategies. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 6472 LNAI, pp. 399–410). https://doi.org/10.1007/978-3-642-17319-6_37

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free