Megnath Ramesh
Papers
2
Total Citations
29
H-Index
2
About
Megnath Ramesh is a robotics researcher whose work centers on autonomous navigation and coverage path planning, with a particular focus on enabling robots to operate efficiently in complex, real-world environments. His major contributions lie in developing algorithms that minimize robot travel time by reducing the number of turns required during coverage tasks. In his highly cited 2022 paper, "Optimal Partitioning of Non-Convex Environments for Minimum Turn Coverage Planning" (24 citations), Ramesh introduced a novel method for partitioning irregular indoor spaces to plan paths that significantly cut down on turning maneuvers, a key bottleneck in battery-powered robotics. Building on this, his 2024 work, "Anytime Replanning of Robot Coverage Paths for Partially Unknown Environments" (5 citations), addresses the critical challenge of dynamic obstacle avoidance. This paper proposes a flexible, anytime replanning strategy that allows a robot to adapt its optimal coverage path on-the-fly when encountering previously unknown static obstacles, without sacrificing efficiency. Ramesh’s research is notable for bridging the gap between theoretical optimality and practical, real-time adaptability, making his work highly relevant for applications in automated cleaning, inspection, and agricultural robotics.
Research Focus
Key Achievements
Top Papers
- 1
- 2