<![CDATA[Optimal path navigation in indoor environments is a crucial problem in the development of robotic systems and location-based services due to complex spatial structures, the presence of obstacles, and limited available pathways. The A* algorithm, as a heuristic-based pathfinding method, is widely used; however, its performance degrades on high-resolution grid maps because of the increasing number of nodes that must be explored. This study proposes the integration of the A* algorithm with an adaptive grid simplification method (Gridadapte) to improve pathfinding efficiency without sacrificing route quality. The research methodology includes grid-based indoor map modeling, the application of Gridadapte to reduce cell density in low-obstacle areas, and the implementation of the A* heuristic function for optimal path search. Performance evaluation is conducted through simulations on several indoor map scenarios by comparing conventional A* and Gridadapte-based A* in terms of the number of explored nodes, path length, and computation time. Simulation results show that the proposed approach significantly reduces the number of search nodes by 30–45% and accelerates computation time by 25–40% compared to A* on regular grids, while the resulting path length remains optimal and does not experience a significant increase. These findings indicate that Gridadapte is effective in reducing the A* search space while preserving the topological structure of the environment. Therefore, the combination of A* and Gridadapte is proven to enhance both the efficiency and accuracy of pathfinding in complex indoor environments. This approach has strong potential for application in autonomous robotic systems, smart building guidance systems, and location-based Internet of Things (IoT) applications in indoor settings such as hospitals, campuses, and shopping malls.]]>
