Abstract
<p>Efficient conflict-free routing scheduling of automated guided vehicles (AGVs) in automated logistic systems can improve delivery time, prevent delays, and decrease handling cost. Once potential conflicts present themselves on their road ahead, AGVs may wait for a while until the potential conflicts disappear besides altering their routes. Therefore, AGV conflict-free routing scheduling involves making routing and waiting time decisions simultaneously. This work constructs a conflict-free routing scheduling model for AGVs with consideration of waiting time. The process of the model is based on calculation of the travel time and conflict analysis at the links and nodes. A guided ant colony optimization (GACO) algorithm, in which ants are guided to avoid conflicts by adding a guidance factor to the state transition rule, is developed to solve the model. Simulations are conducted to validate the effectiveness of the model and the solution method.</p>
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 callMore From: IAES International Journal of Robotics and Automation (IJRA)
Disclaimer: 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.
