Bahareh Banyassady

Amirkabir University of Technology, Zuse Institute Berlin

Papers

Total Citations

H-Index

About

Bahareh Banyassady is a researcher whose work lies at the intersection of algorithmic robotics and computational geometry, with a particular focus on multi-robot motion planning. Her most-cited paper, "An optimal algorithm for two robots path planning problem on the grid" (2013, 16 citations), established a foundational result for coordinating two robots in discrete environments, demonstrating both theoretical optimality and practical relevance. More recently, in "Unlabeled Multi-Robot Motion Planning with Tighter Separation Bounds" (2022, 4 citations), she tackles the challenging unlabeled motion-planning problem, where multiple unit-disc robots must navigate to target positions in a polygonal workspace without being assigned specific destinations. This work advances the state of the art by deriving tighter separation bounds that guarantee collision-free paths, a critical step toward scalable solutions for swarm robotics. Banyassady’s contributions are notable for bridging rigorous algorithmic analysis with real-world constraints, making her research valuable for students and practitioners in robotics and computational geometry alike.