Maksim Roslavtsev
Papers
1
Total Citations
1
H-Index
1
About
Maksim Roslavtsev is a researcher specializing in mobile robot navigation, with a particular focus on low-resource path planning algorithms. His work centers on the implementation and optimization of Bug family algorithms—local path planning methods that operate without the need for environmental mapping, offering a computationally efficient alternative to modern map-dependent approaches. His most cited paper, "Implementation of Rev1 and Rev2 Bug Family Algorithms in ROS Noetic" (2024), demonstrates how these algorithms significantly reduce CPU and memory load by avoiding the gradual accumulation of environmental data. This contribution is particularly impactful for resource-constrained robotic platforms, where traditional navigation methods often overload hardware. With 1 citation to date, his work is gaining recognition for addressing a critical bottleneck in autonomous navigation. Roslavtsev’s research bridges the gap between theoretical algorithm design and practical deployment in ROS, making his findings valuable for students and engineers seeking efficient, scalable solutions for mobile robotics in real-world applications.
Research Focus
Key Achievements
Top Papers
- 1Implementation of Rev1 and Rev2 Bug Family Algorithms in ROS Noetic1 citations · 2024