Payam Khanteimouri

Papers

Total Citations

H-Index

About

Payam Khanteimouri is a researcher in algorithmic robotics and computational geometry, with a focus on multi-agent path planning and optimization on discrete structures. His most cited work, "An optimal algorithm for two robots path planning problem on the grid" (2013), introduces a provably efficient solution for coordinating two robots navigating a grid environment, addressing fundamental challenges in collision-free motion planning. This contribution, with 16 citations, demonstrates his ability to combine theoretical rigor with practical constraints, offering insights into optimality and complexity in multi-robot systems. Khanteimouri’s research extends to graph-based algorithms and discrete optimization, where he explores how to minimize path lengths and computational overhead. His work is particularly relevant to autonomous systems, warehouse logistics, and robotics, where efficient coordination is critical. By establishing optimal bounds for two-robot scenarios, he lays groundwork for scaling to more complex multi-agent problems. Khanteimouri’s achievements reflect a commitment to foundational algorithmic advances that bridge theory and application, making him a notable figure in the field of algorithmic robotics.