Hostname: page-component-76d6cb85b7-kcxw8 Total loading time: 0 Render date: 2026-07-15T01:07:39.705Z Has data issue: false hasContentIssue false

A distributed control algorithm for area search by a multi-robot team

Published online by Cambridge University Press:  29 April 2016

Ahmad Baranzadeh*
Affiliation:
School of Electrical Engineering and Telecommunications, The University of New South Wales, Sydney, NSW 2052, Australia. E-mail: a.savkin@unsw.edu.au
Andrey V. Savkin
Affiliation:
School of Electrical Engineering and Telecommunications, The University of New South Wales, Sydney, NSW 2052, Australia. E-mail: a.savkin@unsw.edu.au
*
*Corresponding author. E-mail: a.baranzadeh@unsw.edu.au

Summary

In this paper, we present a novel algorithm for exploring an unknown environment using a team of mobile robots. The suggested algorithm is a grid-based search method that utilizes a triangular pattern which covers an area so that exploring the whole area is guaranteed. The proposed algorithm consists of two stages. In the first stage, all the members of the team make a common triangular grid of which they are located on the vertices. In the second stage, they start exploring the area by moving between vertices of the grid. Furthermore, it is assumed that the communication range of the robots is limited, and the algorithm is based on the information of the nearest neighbours of the robots. Moreover, we apply a new mapping method employed by robots during the search operation. A mathematically rigorous proof of convergence with probability 1 of the algorithm is given. Moreover, our algorithm is implemented and simulated using a simulator of the real robots and environment and also tested via experiments with Adept Pioneer 3DX wheeled mobile robots.

Information

Type
Articles
Copyright
Copyright © Cambridge University Press 2016 

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

Article purchase

Temporarily unavailable