Implementation of a multi-robot coverage algorithm on a two-dimensional, grid-based environment
MetadataShow full item record
With the development and advancement in the technology of control and multi-robot systems, robot agents are likely to take over mine countermeasure (MCM) missions one day. The path planning coverage algorithm is an essential topic for research; the combination of an efficient algorithm and accurate sensors can save time and human lives. The objective of this work is to implement a path planning coverage algorithm for a multi-robot system in a two-dimensional, grid-based environment. We assess the applicability of a topology-based algorithm to the MCM mission. First, we provide an overview of multi-robot coverage algorithms. Second, we select one algorithm, analyze it, and test its performance. Then the algorithm is evaluated in nine experiments using different numbers of robots and obstacles. Finally, the results are assessed by how much time the steps took and how many free points are not visited when the algorithm is finished. The outcome indicates that efficiency decreases as the number of robots or obstacles increases. This thesis concludes with recommendations for ways to improve the efficiency of the algorithm as well as how to perform the experiments cost effectively in a real environment.
RightsCopyright is reserved by the copyright owner.
Showing items related by title, author, creator and subject.
Sjoberg, Eric J. (Monterey, California. Naval Postgraduate School, 2007-09);Robots are rapidly becoming more involved in everyday military operations. As robots become more capable, their tasks will increase to include such roles as exploring enemy controlled buildings and caves. The goal of ...
Albayrak, Okay (Monterey, California. Naval Postgraduate School, 1996-06);In the literature, formation problems for idealized distributed autonomous mobile robots were studied. Idealized robots are represented by a dimensionless point, are able to instantaneously move in any direction and are ...
Geometric formation with uniform distribution and movement in formation of distributed mobile robots Alptekin, Gokhan (Monterey, California. Naval Postgraduate School, 1996-06);The formation problem of distributed mobile robots was studied in the literature for idealized robots. Idealized robots are able to instantaneously move in any direction, and are equipped with perfect range sensors. In ...