Abstract: Due to the rapid development of human industry and the increase in human population, high-rise buildings having complex structures appear to be expected. To maintain the sanitation of such facilities, workers make a full route to check a countless number of trash cans without knowing the emptiness of the trash can, which results in inefficiencies for workers to travel unnecessary trips. Hence, this research paper explores pathfinding algorithms, such as the A* algorithm, RRT algorithm, Floyd algorithm, Dijkstra Algorithm, and Bellman-Ford Algorithm, that can be successfully and efficiently applied to the interior building and function as navigation for workers to travel in the optimal path, assuming the smart trashcan provides the information of its emptiness. This will allow workers to travel on the optimal path, saving labor costs and time and improving overall sanitation and management of trash in high-rise buildings. The evaluation of the pathfinding algorithms has been done on the grid/graph form of the simplified interior building with varying vertices and edges. More profound research on pathfinding algorithms has been presented in this research paper.
Keywords: path optimization, pathfinding algorithm, interior space, smart trash can.
Title: Path Optimization within an Interior Space or Building: Application of Shortest-Path Algorithm
Author: Justin Choi
International Journal of Computer Science and Information Technology Research
ISSN 2348-1196 (print), ISSN 2348-120X (online)
Vol. 10, Issue 4, October 2022 - December 2022
Page No: 3-9
Research Publish Journals
Website: www.researchpublish.com
Published Date: 13-October-2022
