Area coverage is one of the emerging problems in multi-robot coordination. In this task a team of robots is cooperatively trying to observe or sweep an entire area, possibly containing obstacles, with their sensors or actuators. The goal is to build an efficient path for each robot which jointly ensure that every single point in the environment can be seen or swept by at least one of the robots while performing the task. © 2010 Springer-Verlag Berlin Heidelberg.
CITATION STYLE
Fazli, P. (2010). On multi-robot area coverage. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 6085 LNAI, pp. 384–387). https://doi.org/10.1007/978-3-642-13059-5_52
Mendeley helps you to discover research relevant for your work.