Papers
1
Total Citations
2
H-Index
1
About
Hyeyun Yang is a rising researcher in computational geometry and multi-agent path planning, with a focus on developing efficient algorithms for coordinated robotic movement. Her most-cited work, "Coordinated Path Planning through Local Search and Simulated Annealing" (2022), addresses the third computational geometry challenge, where square robots must navigate an integer grid from start to target points without collisions with each other or obstacles. This paper introduces a novel approach that combines local search heuristics with simulated annealing to solve complex coordination problems, demonstrating significant improvements in path efficiency and collision avoidance. While her citation count is still growing—with 2 citations for this key paper—her contribution stands out for tackling a notoriously difficult optimization problem in robotics and computational geometry. Yang’s work is particularly notable for its practical relevance to warehouse automation, autonomous vehicle coordination, and multi-robot systems, offering a scalable solution to real-world path planning challenges. As an emerging voice in her field, she represents the next generation of researchers pushing the boundaries of algorithmic design for multi-agent systems.
Research Focus
Key Achievements
Top Papers
- 1Coordinated Path Planning through Local Search and Simulated Annealing2 citations · 2022