Dayakshini Sathish
Papers
2
Total Citations
6
H-Index
1
About
Dayakshini Sathish is pioneering adaptive path planning for autonomous mobile robots, with a focus on dynamic and unknown environments. Her key research areas include coverage path planning, multi-robot coordination, and frontier-based exploration. In her most influential work, she introduced the Dynamic Spanning Tree Coverage (D-STC) algorithm, which enhances robot navigation by handling both stationary and moving obstacles using a depth-first search methodology—a critical advancement for real-world deployment. Building on this, she developed MRSimEx-DSTC, a decentralized framework that integrates frontier-based exploration with D-STC, enabling multiple robots to collaboratively map and cover unknown spaces. Though early in her career, her 2025 paper on D-STC has already garnered 5 citations, signaling strong interest from the robotics community. Her contributions are particularly notable for addressing the gap between theoretical coverage algorithms and practical, dynamic scenarios. Sathish’s work is essential reading for researchers in autonomous navigation and multi-robot systems, offering scalable solutions that push the boundaries of robotic autonomy in unpredictable settings.
Research Focus
Key Achievements
Top Papers
- 1
- 2