Abstract
The guide path layout is one of the most important variables in the design of automated guided vehicle systems (AGVS). Many alternative guide path configurations have been proposed in previous research. Two of the simplest are the shortest path and shortest single-loop configurations. However, the optimal solutions to these two problems have not been easy to obtain. In this paper, we show why by proving the NP-completeness of these problems using graph theoretic methods.
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.
