Iyad M. I. AbuHadrous

Work place: Engineering Department, Palestine Technical College, Deir El-Balah, Palestine

E-mail: ihadrous@ptcdb.edu.ps


Research Interests: Robotics


Iyad M. Abuhadrous is an associative professor at the Engineering Professions Department, Palestine Technical College College-Deir El-Ballah (PTCDB), Palestine. Dr. Abuhadrous received his B.S. degree in Electronics Engineering from Yarmouk University, Irbid, Jordan in 1997, and M.S. degree in Robotics from UPMC (Paris VI) and INSTN, Paris-France in the year 2000 and the Ph.D. degree in Robotics and Control from Ecole des Mines de Paris, in 2005. He held several positions such as vice dean for Planning and Development at PTCDB, head of Engineering Professions Department at PTCDB. He has over 20 years of teaching and research experience and has published many papers in national and international conferences and journals. His research interest includes mobile robots, robotics manipulators, automatic control, and Microcontrollers.

Author Articles
An Improved Sampling Dijkstra Approach for Robot Navigation and Path Planning

By Ayman H. Tanira Iyad M. I. AbuHadrous

DOI: https://doi.org/10.5815/ijisa.2023.06.05, Pub. Date: 8 Dec. 2023

The task of path planning is extremely investigated in mobile robotics to determine a suitable path for the robot from the source point to the target point. The intended path should satisfy purposes such as collision-free, shortest-path, or power-saving. In the case of a mobile robot, many constraints should be considered during the selection of path planning algorithms such as static or dynamic environment and holonomic or non-holonomic robot. There is a pool of path-planning algorithms in the literature. However, Dijkstra is still one of the effective algorithms due to its simplicity and capabilities to compute single-source shortest-path to every position in the workspace. Researchers propose several versions of the Dijkstra algorithm, especially in mobile robotics. In this paper, we propose an improved approach based on the Dijkstra algorithm with a simple sampling method to sample the workspace to avoid an exhaustive search of the Dijkstra algorithm which consumes time and resources. The goal is to identify the same optimal shortest path resulting from the Dijkstra algorithm with minimum time and number of turns i.e., a smoothed path. The simulation results show that the proposed method improves the Dijkstra algorithm with respect to the running time and the number of turns of the mobile robot and outperforms the RRT algorithm concerning the path length.

[...] Read more.
Other Articles