S. Sathiya Keerthi
Papers
4
Total Citations
1,488
H-Index
3
About
S. Sathiya Keerthi is a pioneer in computational geometry and robotics, best known for his landmark 1988 work on distance computation between convex objects. His algorithm for rapidly computing the Euclidean distance between polytopes in three-dimensional space—cited over 1,470 times—remains a foundational tool in robotics, computer graphics, and collision detection, offering near-linear computational cost in the number of vertices. This contribution alone has shaped decades of research in motion planning and physical simulation. Keerthi has also advanced non-holonomic path planning, developing numerical methods for optimal robot trajectories under kinematic constraints, such as car-like robots with bounded turning radii. His work on collision avoidance for articulated planar robots introduced geometrically intuitive distance-function-based heuristics, while his later research on potential-field path planning innovatively connected local minima and maxima to construct adjacency graphs for robust navigation. Though some of his papers have modest citation counts, their conceptual depth—particularly the 1988 distance algorithm—demonstrates enduring impact. Keerthi’s career reflects a commitment to solving fundamental geometric problems that underpin autonomous systems, making him a key figure in the development of efficient, real-time robotic motion and interaction with complex environments.
Research Focus
Key Achievements
Top Papers
- 1
- 2
- 3
- 4