Ratijit Mitra

Indian Institute of Technology Kanpur

Papers

3

Total Citations

13

H-Index

2

About

Ratijit Mitra is an emerging researcher specializing in multi-robot systems and autonomous coverage path planning, with a particular focus on developing scalable algorithms for exploring unknown environments. His work addresses one of robotics' central challenges: how to efficiently coordinate multiple robots to systematically cover large, complex workspaces without prior knowledge of the terrain. Mitra's most significant contribution lies in advancing centralized online coverage path planning frameworks. His 2022 paper on scalable online coverage path planning (7 citations) laid important groundwork by examining the trade-offs between distributed and centralized multi-robot planners, demonstrating that centralized approaches can achieve notably more efficient path coverage. Building on this, his 2024 work introduced a horizon-based, synchronous, on-demand planning algorithm (5 citations) that improved upon existing receding horizon methods by optimizing when and how robots' paths are computed and executed. His most recent 2025 contribution further advances concurrent multi-robot planning within this receding horizon framework. Though early in his career, Mitra has accumulated 13 citations across three focused publications, reflecting growing interest in his research trajectory. Students working in autonomous robotics, swarm systems, or warehouse automation will find his progressive body of work particularly valuable for understanding modern multi-robot coordination strategies.

Research Focus

Key Achievements

2
H-Index
3
Papers
13
Total Citations
4
Avg Citations/Paper
🏆 Most Cited Paper
Scalable Online Coverage Path Planning for Multi-Robot Systems
7 citations · 2022
📈 Most Prolific Year: 2022 (1 Papers)
🤝 Key Collaborators: 2
🏛 Institutions: Indian Institute of Technology Kanpur

Top Papers

  1. 1
  2. 2
  3. 3

Key Collaborators

Contact & Links

Available for collaboration
Content generated · 14 days ago