Marjan Abedin

Papers

Total Citations

H-Index

About

Marjan Abedin is a researcher in robotics and computational geometry, with a central focus on multi-agent path planning and optimization on discrete grids. Her most-cited work, "An optimal algorithm for two robots path planning problem on the grid" (2013, 16 citations), provides a foundational solution for coordinating two autonomous agents in a grid-based environment, minimizing total travel distance while avoiding collisions. This contribution addresses a core challenge in multi-robot systems, with implications for warehouse automation, search-and-rescue operations, and distributed robotics. Abedin’s algorithm is notable for its theoretical optimality, offering a clear benchmark for subsequent research in cooperative pathfinding. Her work bridges algorithmic theory and practical robotics, demonstrating how efficient grid-based solutions can scale to real-world applications. With 16 citations, this paper remains a key reference for researchers exploring optimal coordination in constrained spaces. Abedin’s research continues to influence the design of scalable, collision-free motion planning strategies, making her a valuable voice in the robotics community.