Brandon Zhang
Papers
1
Total Citations
5
H-Index
1
About
Brandon Zhang is a rising star in computational geometry and robotics, whose work has already earned recognition on the international stage. His primary research focuses on algorithmic motion planning, particularly the development of efficient, scalable methods for coordinating the movement of multiple agents in constrained environments. Zhang’s most notable contribution came from his team’s winning entry, "gitastrophe," in the 2021 CG:SHOP Challenge. Their paper, "Coordinated Motion Planning Through Randomized k-Opt," introduced a novel heuristic that cleverly combines randomized local search with k-opt optimization to solve the complex problem of simultaneously moving square robots between configurations. This approach minimized both total distance traveled and makespan, outperforming all other competitors. While still early in his career—with his landmark paper accumulating 5 citations—the work’s impact is evident in its practical success and the subsequent attention it has drawn from the computational geometry community. Zhang’s achievement demonstrates a rare ability to translate theoretical insight into a winning, real-world solution, marking him as a promising innovator in multi-robot coordination and optimization.
Research Focus
Key Achievements
Top Papers
- 1Coordinated Motion Planning Through Randomized k-Opt (CG Challenge)5 citations · 2021