Automatic dining car system based on A* algorithm

Abstract

To solve the problem of selling dining and getting the most profit in a certain time by two devices, this project is divided into two parts, one is the detection and the other is route planning, these two parts are combined to find the nearest suitable selling position and plan the optimal path from the current position to that point. Firstly, achieve the function of detecting the center points of the densely populated areas based on the work of tracing the areas contours and the center point of the object by OpenCV, then select the nearest point. Then find out whether the point is on the road, if yes, the point will be the endpoint, if not, use BFS (Breadth-first search) to find the nearest point of the selected point which is on the road. Finally, use the A* algorithm to plan an optimal route between the current position of the car and the endpoint. Furthermore, the heuristic function is used to optimize the algorithm to achieve maximum profit.