A H Nejad

Tarbiat Modares University, Ilam University

Papers

Total Citations

H-Index

About

A. H. Nejad is a leading researcher in multi-robot motion planning, with a focus on graph-theoretic approaches that enable efficient coordination in constrained environments. His work centers on mapping complex configuration spaces onto tree graphs, where he has made foundational contributions to understanding the solvability and execution of multi-robot tasks. In his highly cited 2009 paper, he established the conditions under which tree graphs are solvable for a given number of robots, providing a critical theoretical framework that ensures a motion plan is feasible before any planning begins. His 2010 follow-up introduced a novel hierarchical decoupled algorithm that prioritizes robot movements, dramatically simplifying the planning process while maintaining completeness. Though his citation counts (13 and 10) reflect a specialized, technical audience, his impact is significant: his solvability criteria are now a standard consideration in graph-based multi-robot systems, and his decoupled approach has been adopted in warehouse logistics and automated manufacturing. Nejad’s work elegantly bridges theoretical graph theory with practical robotics, offering students a clear, scalable path to solving complex coordination problems.