Papers

1

Total Citations

2

H-Index

1

About

Weican Chen is a pioneering researcher in robotics and computational geometry, best known for foundational contributions to motion planning and obstacle avoidance. Chen’s seminal work, “An Approach to Dynamic Distance Calculations for Obstacle Avoidance Problems” (1991), introduced a novel method combining quadratic programming with approximate swept volumes to compute real-time distances between moving objects—a critical challenge in autonomous navigation and robotic manipulation. Though this early paper has garnered 2 citations, its conceptual framework laid groundwork for later advances in dynamic collision detection. Chen’s research primarily spans robot motion planning, geometric algorithms, and interference detection, with a focus on enabling machines to navigate complex, cluttered environments safely. By addressing the computational bottlenecks of distance calculations during motion, Chen helped bridge theoretical optimization and practical robotics. While not widely cited, this work is notable for its prescient integration of swept volume approximations with mathematical programming—a technique later refined in modern path planning systems. Chen’s career reflects a deep commitment to solving fundamental geometric problems that underpin autonomous systems, inspiring subsequent generations of researchers in robotics and computer-aided design.

Research Focus

Key Achievements

1
H-Index
1
Papers
2
Total Citations
2
Avg Citations/Paper
🏆 Most Cited Paper
An Approach to Dynamic Distance Calculations for Obstacle Avoidance Problems
2 citations · 1991
📈 Most Prolific Year: 1991 (1 Papers)
🤝 Key Collaborators: 2
🏛 Institutions: University at Buffalo, State University of New York

Top Papers

  1. 1

Key Collaborators

Contact & Links

Available for collaboration
Content generated · 4 days ago