Efficient Coverage Path Planning for Mobile Disinfecting Robots Using Graph-Based Representation of Environment

30Citations
Citations of this article
39Readers
Mendeley users who have this article in their library.

Abstract

The effective disinfection of hospitals is paramount in lowering the COVID-19 transmission risk to both patients and medical personnel. Autonomous mobile robots can perform the surface disinfection task in a timely and cost-effective manner, while preventing the direct contact of disinfecting agents with humans. This paper proposes an end-to-end coverage path planning technique that generates a continuous and uninterrupted collision-free path for a mobile robot to cover an area of interest. The aim of this work is to decrease the disinfection task completion time and cost by finding an optimal coverage path using a new graph-based representation of the environment. The results are compared with other existing state-of-the-art coverage path planning approaches. It is shown that the proposed approach generates a path with shorter total travelled distance (fewer number of overlaps) and smaller number of turns.

Cite

CITATION STYLE

APA

Nasirian, B., Mehrandezh, M., & Janabi-Sharifi, F. (2021). Efficient Coverage Path Planning for Mobile Disinfecting Robots Using Graph-Based Representation of Environment. Frontiers in Robotics and AI, 8. https://doi.org/10.3389/frobt.2021.624333

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