• Yadlapaty Srinivas
• Dr. Rajeev Yadav

Terrain coverage offers a broad range of applications in our daily lives, from small-scale activities such as floor cleaning, grass mowing, and harvesting to large-scale missions such as hazardous terrain inspection and combat surveillance. These jobs are tedious, time-consuming, and occasionally dangerous. This thesis investigates the issue of online terrain coverage (when the map of the environment is unknown in advance) utilizing numerous mobile robots. Cluster, Allocate, Cover (CAC), a centralized method based on frontier propagation, is presented. Using an optimum allocation method, the CAC algorithm generates clusters of known border cells and assigns them to specific robots. Despite the benefits provided by CAC, it has two drawbacks: it is not resistant to failures and it does not cover the landscape in a continuous manner. Another method suggested in this thesis, known as FAST, is fully distributed and resistant to numerous robot failures. FAST robots follow a predefined path while covering the unknown territory in a mutually exclusive way, resulting in vast, unbroken, and continuous regions to be covered.

Terrain coverage, range small-scale activities, hazardous, Multi-Robot,

"A STUDY AN EFFICIENT APPROACH FOR ONLINE MULTI-ROBOT TERRAIN COVERAGE", International Journal of Emerging Technologies and Innovative Research (www.jetir.org), ISSN:2349-5162, Vol.6, Issue 3, page no.414-426, March-2019, Available :http://www.jetir.org/papers/JETIR1903M50.pdf

"A STUDY AN EFFICIENT APPROACH FOR ONLINE MULTI-ROBOT TERRAIN COVERAGE", International Journal of Emerging Technologies and Innovative Research (www.jetir.org | UGC and issn Approved), ISSN:2349-5162, Vol.6, Issue 3, page no. pp414-426, March-2019, Available at : http://www.jetir.org/papers/JETIR1903M50.pdf