Adaptive path finding algorithm in dynamic environment for warehouse robot

• Main Authors: Ng, Mun Kit, Chong, Yung Wey, Ko, Kwang man, Park, Young Hoon, Leau, Yu Beng
• Format: Article
• Language: English
• Published: Springer 2020
• Subjects: TJ Mechanical engineering and machinery
• Online Access: https://eprints.ums.edu.my/id/eprint/25314/7/Adaptive%20path%20finding%20algorithm%20in%20dynamic%20environment%20for%20warehouse%20robot.pdf; https://eprints.ums.edu.my/id/eprint/25314/; https://doi.org/10.1007/s00521-020-04764-3

Warehouse robots have been widely used by manufacturers and online retailer to automate good delivery process. One of the fundamental components when designing a warehouse robot is path finding algorithm. In the past, many path finding algorithms had been proposed to identify the optimal path and improve the efficiency in different conditions. For example, A* path finding algorithm is developed to obtain the shortest path, while D* obtains a complete coverage path from source to destination. Although these algorithms improved the efficiency in path finding, dynamic obstacle that may exist in warehouse environment was not considered. This paper presents AD* algorithm, a path finding algorithm that works in dynamic environment for warehouse robot. AD* algorithm is able to detect not only static obstacle but also dynamic obstacles while operating in warehouse environment. In dynamic obstacle path prediction, image of the warehouse environment is processed to identify and track obstacles in the path. The image is pre-processed using perspective transformation, dilation and erosion. Once obstacle has been identified using background subtraction, the server will track and predict future path of the dynamic object to avoid the obstacle.