E. Delfaraz

Papers

Total Citations

H-Index

About

E. Delfaraz is a researcher in theoretical computer science and robotics, with a primary focus on multi-robot systems and algorithmic exploration. Their most-cited work, "Multi-robot exploration on grids with a bounded time" (2021), tackles the fundamental problem of minimizing robot teams for exploring rectangular grid environments under strict time constraints. This offline setting study provides critical insights into the trade-offs between robot numbers and exploration efficiency, establishing foundational bounds for multi-robot coordination. While their citation count is currently modest, Delfaraz's contributions are significant for advancing our understanding of time-bounded exploration in discrete environments—a problem with direct applications to search-and-rescue, automated mapping, and warehouse logistics. Their work on determining the minimum number of robots required to explore an \(n \times m\) grid within a predefined time \(T\) offers a rigorous mathematical framework that bridges theoretical guarantees with practical deployment considerations. For students and researchers entering the field of multi-robot systems, Delfaraz's research provides essential building blocks for designing efficient, scalable exploration algorithms under real-world temporal constraints.