Megnath Ramesh — accepted AI-conference papers

2026

Minimum-Length Coverage Path Planning for Grid Environments with Approximation Guarantees

Megnath Ramesh, Frank Imeson, Baris Fidan, Stephen L. Smith

ICRA 2026poster

We focus on planning minimum-length robot paths to cover environments using the robot's sensor or coverage (e.g. cleaning) tool. Many algorithms use the following framework: (i) compute a grid decomposition of the environment, (ii) partition the grid to be covered by non-overlapping coverage lines (…

Cited by 0 Source ↗Scholar ↗

2022

Optimal Partitioning of Non-Convex Environments for Minimum Turn Coverage Planning

Megnath Ramesh, Frank Imeson, Baris Fidan, Stephen L. Smith

RA-L 2022

In this letter, we tackle the problem of planning an optimal coverage path for a robot operating indoors. Many existing approaches attempt to discourage turns in the path by covering the environment along the least number of <italic xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://

Cited by 21 Source ↗Scholar ↗