Host: The Japan Society of Mechanical Engineers
Name : [in Japanese]
Date : June 28, 2023 - July 01, 2023
In this study, we developed a shopping assistance robot system. First, we attempted to create an algorithm to find an efficient route to visit multiple sales floors of a product. This algorithm is based on the solution of the Traveling Salesman Problem. The Traveling Salesman Problem is the problem of finding the shortest path that visits all given cities one at a time. By combining the 2-opt method, which is one of the methods for solving the traveling salesman problem, and the A* algorithm, which is a method for finding the shortest path between two points, we were able to create a route that efficiently visits the sales points of multiple products.