About

Subhash Suri is a leading figure in computational geometry and robotics, whose work bridges the gap between abstract geometric theory and practical robot motion. His research focuses on path planning, sensor-based exploration, and the design of algorithms for simple robots with minimal capabilities. Suri’s most influential contribution is his foundational work on curvature-constrained shortest paths, where he proved that a point robot with bounded turning radius can find optimal, collision-free paths inside a convex polygon—a problem with 78 citations that remains central to autonomous vehicle navigation. He also made seminal advances in computing the intersection-depth of polyhedra (147 citations), a key result for collision detection in 3D environments. In a highly cited series of papers (2008, 51 citations), Suri demonstrated that robots with only combinatorial, non-metric sensing can still perform complex geometric reasoning, such as exploring unknown environments and counting targets. His work on minimum link paths (58 citations) and visibility graph reconstruction (2012) further solidified his reputation. With over 400 total citations across his top papers, Suri’s research has profoundly influenced both theoretical computer science and practical robotics, offering elegant solutions to fundamental problems in motion planning and geometric reasoning.

Research Focus

Key Achievements

12
H-Index
20
Papers
546
Total Citations
27
Avg Citations/Paper
🏆 Most Cited Paper
Computing the intersection-depth of polyhedra
147 citations · 1993
📈 Most Prolific Year: 2008 (3 Papers)
🤝 Key Collaborators: 23
🏛 Institutions: Core Competence, University of California, Santa Barbara, Washington University in St. Louis, Bell (Canada), University of California System

Top Papers

  1. 1
  2. 2
  3. 3
  4. 4
  5. 5
  6. 6
  7. 7
  8. 8
  9. 9
  10. 10

Key Collaborators

Contact & Links

Available for collaboration
Content generated · 13 days ago