Design and Develop Optimal Pathfinding Algorithm Applied in Book Accessing and Returning for Autonomous Mobile Robot in Library

Design and Develop Optimal Pathfinding Algorithm Applied in Book Accessing and Returning for Autonomous Mobile Robot in Library

Keywords:Robot Operating System, Pathfinding, Genetic Algorithms, K-means Clustering, Traveling Salesman Problem
Abstract:Design and Develop Optimal Pathfinding Algorithm Applied in Book Accessing and Returning for Autonomous Mobile Robot in Library This paper presents a visual optimal pathfinding algorithm that avoids obstacles on the way to the destination in a simulation environmentand the idea took inspiration from the optimization for solving the Traveling Salesman ProblemFirstlyusing a we Library AutomationBy autonomously navigating to the location of books using robotsConsulting ServiceAnnouncing upon reaching the book locationCollection ClassificationScanning book information through QR codes to know the location and type of booksA visual optimal pathfinding algorithm is proposed to avoid obstacles in reaching the destination in a simulated environmentThe method first uses a webcam to scan book information through QR codes to know the books location and type and sends the location information to the robot for autonomous navigationThenK-means clustering and genetic algorithms are used to calculate and visualize the borrowing or returning book sequence listThe optimal algorithm is then applied on the ROS platform to ensure precise robot operationadjusting the parameters of global and local cost maps and global and local plannersThe robot will follow the calculated sequence and announce upon successfully reaching the book locationTo track whether the robot is working correctlysoftware for users to observe the robots operation was also created