e-Repository BATAN

Advanced Search

A Comparative Study of the Algorithms for Path finding to Determine the Adversary Path in Physical Protection System of Nuclear Facilities

Dinan Andiwijayakusuma, DA and Alim Mardhi, AM and Safitri, Atikah and T. Asmoro, TA (2019) A Comparative Study of the Algorithms for Path finding to Determine the Adversary Path in Physical Protection System of Nuclear Facilities. In: Seminar SENTEN Palembang 2018, 4 - 5 Juli 2018, UNIVERSITAS SRIWIJAYA - PALEMBANG 2018.

Full text not available from this repository.

Abstract

Abstract The shortest path algorithm is the process of finding a path on a weighted graph that minimizes the number of the weights of the path-forming side. Thus, the resulting path is the distance that has the least weight or distance. In physical protection systems (PPS), the implementation of the shortest path algorithm is determining the most vulnerable adversary path to penetrate the physical protection system of a nuclear facility. The paths between points at a facility passed by the adversary will form a directed and weighted graph. The weights on the graph represent the ability of a protective device (e.g. CCTV, sensor, alarm etc.). The formed graph will be processed using algorithms to determine the most vulnerable path. In this paper, we study and examine the performance of two types of algorithms namely Dijkstra and A*. The purpose of this study is to compare the two algorithms which we will use it to determine the most vulnerable path related to the physical protection system of nuclear facilities. Our results show that the A* algorithm provides more efficient path results than the Dijkstra algorithm. D. Andiwijayakusuma1, A. Mardhi1, I. Savitri2 and T. Asmoro2

Item Type: Conference or Workshop Item (Paper)
Subjects: Keselamatan dan Keamanan Nuklir
Divisions: Pusat Teknologi dan Keselamatan Reaktor Nuklir
Depositing User: USER PTKRN BATAN
Date Deposited: 21 Apr 2020 06:58
Last Modified: 21 Apr 2020 06:58
URI: http://repo-nkm.batan.go.id/id/eprint/9545

Actions (login required)

View Item View Item