Performance Analysis of Specification Computer and Mobile with Implementation Tawaf Virtual Reality using A* Algorithm and RVO System

Moh. Zikky, M. Jainal Arifin, Kholid Fathoni, Agus Zainal Arifin


High-Performance Computer (HPC) is computer systems that are built to be able to solve computational loads. HPC can provide a high-performance technology and short the computing processes timing. This technology was often used in large-scale industries and several activities that require high-level computing, such as rendering virtual reality technology. In this research, we provide Tawaf’s Virtual Reality with 1000 of Pilgrims and realistic surroundings of Masjidil-Haram as the interactive and immersive simulation technology by imitating them with 3D models. Thus, the main purpose of this study is to calculate and to understand the processing time of its Virtual Reality with the implementation of tawaf activities using various platforms; such as computer and Android smartphone. The results showed that the outer-line or outer rotation of Kaa’bah mostly consumes minimum times although he must pass the longer distance than the closer one.  It happened because the agent with the closer area to Kaabah is facing the crowded peoples. It means an obstacle has the more impact than the distances in this case.


Performance device, VR Tawaf simulation, HPC for crowded simulation

Full Text:



R. Narain, A. Golas, S. Curtis, and M. C. Lin. Aggregate Dynamics for Dense Crowd Simulation. University of North Carolina at Chapel Hill.

S. Curtis, S. J. Guy, B.Zafar, and D. Manocha. Virtual Tawaf: A Case Study in Simulating the Behavior of Dense, Heterogeneous Crowds. In LARGE.

M. P. Stennett, D. M. Romano, and O. A. Kurdi. Modelling and Simulation of Tawaf and Sa’yee: A Survey of Recent Work in the Field. 29th ESM’ 2015, 26-28 Oct 2015, Leicester, UK.

Yenie Syukriyah, (2016). Penerapan Algoritma A*(STAR) Untuk Mencari Rute Tercepat Dengan Hambatan. Bandung, Indonesia

Jur Van Den Berg, et al. Reciprocal Velocity Obstacles for Real-time Multi-Agent Navigation. 2008 IEEE International Conference on Robotics and AutomationPasadena, CA, USA.

Reza Olfati-Saber, 2004. Flocking for Multi-Agent Dynamic Systems: Algorithms and Theory. California Institute of Technology

Maxim Likhachev, Anytime Dynamic A*: An Anytime, Replanning Algorithm, Carnegie Mellon University Pittsburgh, PA, USA

DOI: 10.24003/emitter.v7i1.321


  • There are currently no refbacks.

Copyright (c) 2019 EMITTER International Journal of Engineering Technology

EMITTER Journal Editorial Office


Politeknik Elektronika Negeri Surabaya

Jl. Raya ITS - Kampus PENS Sukolilo Surabaya 60111, INDONESIA   Telp : +62 31 594 7280   Fax : +62 31 594 6114