Stefano Leonardi

University of Trento

Papers

4

Total Citations

176

H-Index

3

About

Stefano Leonardi is a researcher whose work spans two distinct but complementary domains: theoretical computer science, particularly online algorithms and combinatorial optimization, and applied robotics, with a focus on human-robot interaction and autonomous navigation. His most significant contribution to the algorithms community is his foundational work on the Online Travelling Salesman Problem (OLTSP), which addresses the challenge of efficiently serving dynamically arriving requests in metric spaces — a problem with critical applications in logistics, scheduling, and robotics. This work, published across 1999 and 2001, has garnered over 170 citations, establishing Leonardi as a key figure in competitive analysis and online optimization. More recently, he has pivoted toward practical robotics challenges, developing innovative "teach-by-showing" navigation frameworks in which human operators physically guide mobile robots through unstructured environments, effectively training safe path-planning behaviors without requiring pre-mapped spaces. This human-in-the-loop approach addresses one of the most persistent barriers to deploying robots in real-world, populated settings. Leonardi's career reflects a rare ability to bridge rigorous theoretical foundations with pragmatic engineering solutions, making his research valuable to both the algorithms and robotics communities.

Research Focus

Key Achievements

3
H-Index
4
Papers
176
Total Citations
44
Avg Citations/Paper
🏆 Most Cited Paper
Algorithms for the On-Line Travelling Salesman1
167 citations · 2001
📈 Most Prolific Year: 2001 (1 Papers)
🤝 Key Collaborators: 9
🏛 Institutions: University of Trento

Top Papers

  1. 1
  2. 2
  3. 3
  4. 4

Key Collaborators

Contact & Links

Available for collaboration
Content generated · 14 days ago