Performance analysis of A* algorithm to determine shortest path of fire fighting robot

Abstract

A∗ Algorithm is one of Best First Search Algorithm, that combines Uniform Cost Search and Greedy Best-First Search Algorithm. This paper will discuss performance analysis of A∗ Algorithm in the case of KRPAI (Indonesian Fire Fighting Robot Contest). Time complexity and space complexity is the criteria that we use in this paper. Time complexity is the time needed by algorithm to process the command. Whereas, space complexity is the memory usage by algorithm to process the command. Based on the experiments, A∗ Algorithm need an average of 4.270,72 and 14.192 bytes of memory to find a solution. We expect a lot of future search will improve the mapping capability of firefighting robot. Therefore, someday firefighting robot can be implemented in real life, and will reduce the fire disaster victims.