Abstract
Automated guided vehicles (AGVs) have been regarded as a promising means for the future delivery industry by many logistic companies. Several AGV-based delivery systems have been proposed, but they generally have drawbacks in delivering and locating baggage by magnet line, such as the high maintenance cost, and it is hard to change the trajectory of AGV. This article considers using multi-AGVs as delivery robots to coordinate and sort baggage in the large international airport. This system has the merit of enlarging the accuracy of baggage sorting and delivering. Due to the inaccurate transportation efficiency, a time-dependent stochastic baggage delivery system is proposed and a stochastic model is constructed to characterize the running priority and optimal path planning for multi-AGVs according to the flight information. In the proposed system, ultra-wideband technology is applied to realize precisely positioning and navigation for multi-AGVs in the baggage distribution center. Furthermore, the optimal path planning algorithm based on time-window rules and rapidly exploring random tree algorithm is considered to avoid collision and maneuverability constraints and to determine whether the running path for each AGV is feasible and optimal. Computer simulations are conducted to demonstrate the performance of the proposed method.
Highlights
With the continuous development of aviation technology and the rapid improvement of economic growth, alternative long-distance flights replace other sorts of transportation as the priority for the majority of customers who want convenient and prompt service
Based on the above analysis, in this article, by analyzing the characteristic of automated guided vehicle (AGV) operation, we find that traditional baggage transportation is based on the magnetic wire in the international airport; the lack of required Automated guided vehicles (AGVs),[3] the limited path planning,[4] and the traffic constraint conditions[5] will lead to inaccurate transportation of baggage
To solve the problem in path planning for multi-AGVs, we propose one path planning method combined with the time-window algorithm and the rapidly-exploring random tree (RRT) algorithm
Summary
With the continuous development of aviation technology and the rapid improvement of economic growth, alternative long-distance flights replace other sorts of transportation as the priority for the majority of customers who want convenient and prompt service. These problems will lead to more extra time for baggage screening, sorting, and transportation. 4. As for the collision problem, the stochastic timedependent path planning algorithm, combined with the RRT algorithm and time window, is provided to the multi-AGVs, which makes the relatively optimal trajectory from the departure point to the baggage collection terminal (BCT). The last section is a brief conclusion of this article
Sign-in/Register to view highlights & summary Sign-in/Register to access full text options 
Free) 
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 call
