Abstract
The problem of path planning is a hot and exclusive research topic on multiple Automatic Guided Vehicles (multi-AGVs) systems. Many research results have been reported, but outrightly solving path planning problem from the perspective of reducing traffic congestion have faced obstacles. A collision-free path planning procedure based on a modified A-star Algorithm for multi-AGVs logistics sorting system is proposed in this paper. AGVs are now a poplar way to handle materials in latest smart warehouses. Many researches have been conducted and new technologies are still being developed. There is wide scale research on algorithms to help in scheduling, routing and path planning. Multi-AGVs are used to load goods automatically in a packaging factory. To ensure an effective and safe collision free path planning, this work investigates movement, scheduling and routing, speed manipulation and efficiency of machinery to target positions. The A-star algorithm with grid method to map out a typical warehouse scenario into multiple nodes was used. To have the shortest possible path, for obstacle avoidance, we employed the Braitenberg model. The waiting strategy is used for conflict resolution at intersections.
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 callMore From: International Journal for Innovation Education and Research
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.
