Performance Analysis of Specification Computer and Mobile with Implementation Tawaf Virtual Reality using A* Algorithm and RVO System
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.
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 http://gamma.cs.unc.edu/ 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
Copyright (c) 2019 EMITTER International Journal of Engineering Technology
This work is licensed under a Creative Commons Attribution-NonCommercial-ShareAlike 4.0 International License.
The copyright to this article is transferred toÂ Politeknik Elektronika Negeri Surabaya(PENS)Â if and when the article is accepted for publication. The undersigned hereby transfers any and all rights in and to the paper including without limitation all copyrights to PENS. The undersigned hereby represents and warrants that the paper is original and that he/she is the author of the paper, except for material that is clearly identified as to its original source, with permission notices from the copyright owners where required. The undersigned represents that he/she has the power and authority to make and execute this assignment. The copyright transfer form can be downloaded here .
The corresponding author signs for and accepts responsibility for releasing this material on behalf of any and all co-authors. This agreement is to be signed by at least one of the authors who have obtained the assent of the co-author(s) where applicable. After submission of this agreement signed by the corresponding author, changes of authorship or in the order of the authors listed will not be accepted.