Abstract
This paper describes the path generation of the wheeled robot with the obstacle avoidance. We think about work that the robot displays goods to the racks in the convenience store. The shortest path is generated from the map information using Dijkstra's Algorithm and Travelling Salesman Problem. When the obstacle that doesn't exist in the map is detected by the sensor,a new path is generated from the map and the sensor information.
