Path planning is crucial for autonomous mobile robots to navigate in unknown settings. Achieving autonomous navigation in indoor environments without collisions with static or dynamic obstacles, reaching the destination quickly, and meeting the requirements of specific work scenarios are essential challenges. Over the years, various path planning algorithms have been proposed in the literature, each with advantages and limitations. This paper provides a brief overview of advanced indoor path planning algorithms for wheeled mobile robots, listing classical algorithms as well as recent advancements. These algorithms' fundamental principles, features, and computational complexities are discussed and analyzed. Furthermore, this paper highlights some challenges and open research questions in path planning. This survey aims to provide readers with a concise review of existing indoor wheeled mobile robot path planning techniques and their applications, to inspire future research in this vital field of robotics.