Asian Science Citation Index is committed to provide an authoritative, trusted and significant information by the coverage of the most important and influential journals to meet the needs of the global scientific community.  
ASCI Database
308-Lasani Town,
Sargodha Road,
Faisalabad, Pakistan
Fax: +92-41-8815544
Contact Via Web
Suggest a Journal
Articles by A. Saudi
Total Records ( 2 ) for A. Saudi
  A.A. Dahalan , A. Saudi and J. Sulaiman
  In recent years, a significant amount of research on robot path planning problems has been devoted. The main goal of this problem is to construct a collision-free path from arbitrary start location to a specified end position in their environment. In this study, numerical technique, specifically on family of Accelerated Over-Relaxation (AOR) iterative methods will be used in attempt to solve mobile robot problem iteratively. It’s lean on the use of Laplace’s equation to constrain the generation of a potential values. By applying a finite-difference technique, the experiment shows that it is able to generate smooth path between the starting positions to specified destination. The simulation results shows the proposed methods performs faster solution and smoother path compared to the previous research.
  A.A. Dahalan , W.K. Ling , A. Saudi and J. Sulaiman
  Mobile robots have been undergoing constant research and development to improve its capability, especially, in its ability plan its path and move to specified destination in a given environment. However, there is much room for improvement of mobile robot path planning efficiency. This study attempts to improve the path planning efficiency of mobile robots by solving the path planning problems iteratively by using numerical method. This method of solution is based on harmonic function that applies the Laplace’s equation to control the generation of potential function over the regions found in the mobile robot’s configuration space. This study proposed the application of Half-Sweep Modified Accelerated Over-Relaxation (HSMAOR) iterative method to solve the mobile robot path planning problem. By using approximation finite scheme, the experiment was able to produce smooth path planning for the mobile robot to move from its starting point to its goal point. Other than that, the experiment also shows that this numerical method of solving path planning problem is faster and is able to produce smoother path for the mobile robot’s point to point movements.
Copyright   |   Desclaimer   |    Privacy Policy   |   Browsers   |   Accessibility