M. Barbehenn

University of Illinois Urbana-Champaign

Papers

4

Total Citations

91

H-Index

4

About

Michael Barbehenn is a leading figure in geometric robot motion planning, with a career spanning foundational algorithmic work and integrated robotic systems. His primary research contributions center on developing efficient, hierarchical, and incremental approaches to motion planning, particularly through the innovative use of dynamic data structures. Barbehenn’s most impactful work, "Efficient search and hierarchical motion planning by dynamically maintaining single-source shortest paths trees" (1995, 68 citations), introduced a method to eliminate redundancy in hierarchical approximate cell decomposition by reusing search information across iterations—a significant advance that improved computational efficiency in complex planning problems. He further extended this concept with exact incremental motion planning algorithms, addressing a new class of problems where environments change over time. Beyond algorithmic theory, Barbehenn demonstrated a commitment to full-stack robotics with the GINKO system (1991), an integrated architecture combining learning, planning, perception, and execution. This work showcased his ability to bridge machine learning classification with configuration space planning, making his research valuable for both theoreticians and practitioners seeking practical, scalable solutions for autonomous robot navigation.

Research Focus

Key Achievements

4
H-Index
4
Papers
91
Total Citations
23
Avg Citations/Paper
🏆 Most Cited Paper
Efficient search and hierarchical motion planning by dynamically maintaining single-source shortest paths trees
68 citations · 1995
📈 Most Prolific Year: 2002 (2 Papers)
🤝 Key Collaborators: 1
🏛 Institutions: University of Illinois Urbana-Champaign

Top Papers

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

Key Collaborators

Contact & Links

Available for collaboration
Content generated · 13 days ago