z-logo
open-access-imgOpen Access
Numerical simulations of agent navigation via Half-Sweep Modified Two-Parameter Over-Relaxation (HSMTOR)
Author(s) -
Farhah Athirah Musli,
Jumat Sulaiman,
Azali Saudi
Publication year - 2021
Publication title -
journal of physics. conference series
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.21
H-Index - 85
eISSN - 1742-6596
pISSN - 1742-6588
DOI - 10.1088/1742-6596/1988/1/012035
Subject(s) - relaxation (psychology) , laplace transform , computer science , mathematical optimization , collision , computer simulation , iterative method , mathematics , harmonic , algorithm , simulation , mathematical analysis , physics , acoustics , psychology , social psychology , computer security
The research on the efficiency of route navigation has been continuously developing. Especially, the capability of the generated route to provide a collision-free route for an agent to move in a particular environment. Thus, this study attempts to solve the route navigational problem iteratively via a numerical method. A new method called Half-Sweep Modified Two-Parameter Over-Relaxation (HSMTOR) is used to solve the navigational problems. For numerical simulation purposes, HSMTOR is used to obtain Laplace’s equation solutions called harmonic functions. A gradient descent search algorithm then utilizes the harmonic functions to provide a smooth and collision-free route for an agent to commute inside the environment. In addition, the formulation of the HSMTOR iterative method is presented. Several numerical experiments and simulations are conducted in order to verify the efficiency of the proposed method. The result shows that the proposed method performed better than the existing methods such as full-, half-sweep for Modified Successive Over-Relaxation, Modified Accelerated Over-Relaxation and Modified Two-Parameter Over-Relaxation respectively (FSMSOR, HSMSOR, FSMAOR, HSMAOR and FSMTOR).

The content you want is available to Zendy users.

Already have an account? Click here to sign in.
Having issues? You can contact us here