The Path Planning Study of Autonomous Greeting Robot based on Ant Colony Algorithm

In order to realize the autonomous greeting and greeting of the field guests, the autonomous greeting robot needs to collect and analyze the environmental data. Through the optimization algorithm, an optimal autonomous moving path from the starting point of greeting to a certain guest is found. In this paper, aiming at the autonomous greeting robot, the path planning problem of the autonomous greeting robot based on ant colony algorithm is proposed, and the related design scheme is given. The simulation example shows that the greeting robot can visit specific guests in the shortest path and time. It can effectively ensure that the robot avoids obstacles and other guests in the process of moving. It verifies the feasibility and validity of the path planning proposed in this paper, and lays a theoretical foundation for the further application of the autonomous greeting robot in non-specific environment.