This document discusses using the A* algorithm to find the shortest path in an indoor positioning system. It begins with an introduction to indoor positioning and challenges with GPS indoor. It then provides an overview of how the A* algorithm works to find the shortest path between a starting and ending node, using cost functions. It explains that A* is an extension of Dijkstra's algorithm but is more efficient because it uses heuristics to guide its search. Examples are given comparing the performance of A* to Dijkstra's algorithm. The document concludes that A* finds the optimal shortest path faster than Dijkstra's algorithm for indoor positioning applications.