Unmanned Shopping System Based On Multi-robot Collaborative Path Planning

With the rapid development of the Internet of Things and modern e-commerce,Internet commerce has had a huge impact on the traditional retail industry,and the development of "new retail" is imminent.In traditional supermarkets,customers need to go to the store to select the goods and then return to the cashier counter to wait in line,and then check out.For the cashier,each customer's product needs to be scanned.The procedure is cumbersome and complicated,so this article is based on The traditional way of shopping proposes a new way of shopping-an intelligent shopping system based on multi-robots.The system realizes an unmanned shopping supermarket in the true sense.The multi-robot collaborative unmanned shopping system is mainly divided into two parts:WEB unmanned shopping system and multi-robot collaboration.The main research contents are as follows:(1)Propose a hybrid control structure suitable for unmanned shopping system.It mainly processes and distributes commodity order tasks,robot position,and status information through a centralized control structure,and enables the robot to complete the path planning of the task independently through a distributed control structure.(2)Constructing a WEB unmanned shopping system,using the front-end and back-end separation method,the WEB system is divided into three parts:the front-end,the server-side,and the database,respectively,to realize the interactive interface,logic function and data storage.(3)For the path planning problem of multi-robot collaboration,using the traditional Dijkstra algorithm to plan the path will inevitably cause conflicts.In this regard,this paper proposes a method based on priority and timetable to improve Dijkstra's algorithm to solve various conflicts encountered between multiple robots.(4)Use the grid map method to simulate the supermarket environment,and build the simulation system through Javaweb.The improved algorithm is simulated through the built simulation system,and the data obtained is compared and analyzed.On this basis,by analyzing and verifying the simulated data,the improved Dijkstra algorithm can effectively solve the path planning problem of multi-robot collaboration.