N.K. Sancheti
Papers
1
Total Citations
3
H-Index
1
About
N.K. Sancheti is a robotics researcher whose work focuses on the foundational challenge of autonomous robot navigation, particularly through the development of novel path planning algorithms. His most cited work, "Path planning: an approach based on connecting all the minimizers and maximizers of a potential function" (2003, 3 citations), introduces an innovative method that improves upon traditional potential field approaches. Rather than simply avoiding obstacles, Sancheti’s technique constructs an adjacency graph by systematically connecting all local minima and maxima of the potential function defined in the robot’s configuration space. This elegant solution effectively addresses the common problem of robots becoming trapped in local minima, offering a more robust and complete path planning strategy. While his citation count is modest, the conceptual depth of this work demonstrates a sophisticated understanding of optimization and graph theory applied to robotics. Sancheti’s contribution is particularly valuable for researchers exploring theoretical foundations of motion planning, as his approach provides a principled framework for navigating complex environments by leveraging the global structure of the potential landscape.
Research Focus
Key Achievements
Top Papers
- 1