Kazbek K. Sultanov

Papers

Total Citations

H-Index

About

Kazbek K. Sultanov is a robotics researcher whose work focuses on the critical challenge of computational efficiency in sampling-based motion planning. His primary research areas include robot motion planning algorithms, collision detection optimization, and heuristic-driven pathfinding. Sultanov’s major contribution lies in addressing the performance bottlenecks of the RRT* family of planners—specifically, the time-intensive processes of collision checking and nearest neighbor search. In his influential 2017 paper, "Sparse tree heuristics for RRT* family motion planners," he introduced novel heuristic strategies that significantly reduce computational overhead by exploiting the fixed-obstacle structure of environments. This work, which has garnered 4 citations, demonstrates that for static environments, collision checking for a new candidate state can be reduced to constant time, a key insight for real-time robotic applications. Sultanov’s research is particularly notable for its practical impact on autonomous navigation and manipulation systems, where rapid, reliable path generation is essential. His contributions continue to influence the development of more efficient motion planning frameworks, making him a respected voice in the field of algorithmic robotics.