Abstract
With the development of the e-commerce business, there are high expectations for the use of automated transport robots to improve the efficiency of warehouses. In this study, we propose a path planning method based on Model Predictive Control (MPC) that optimizes the performance of the entire warehouse for multiple robots. In general, when the MPC is used to execute path planning, global path planning such as Dijkstra algorithm are used together. This is because, if the MPC is used alone, the existence of a local optimal solution will cause a situation where the robot cannot move. However, in order to use the global route, it is necessary to prepare the precise map information of the warehouse in advance. In this study, we propose a path planning method that avoids deadlock without using global path by improving an objective function for the MPC. The effectiveness of the proposed method is verified in a numerical simulation.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
