Abstract
The paper presents the methodology to obtain the path planning of an AGV in the presence of elliptical forbidden regions. The algorithms to compute the shortest unconstrained Euclidean distances are presented. In case of the elliptical forbidden regions Further Reduced Search Area (FRSA) Technique is used. This approach overcomes the inadequacies of earlier techniques and can yield solutions to problems involving elliptical forbidden regions. The MATLAB programming is graphic interactive and enables the user to continuously monitor the state and progress of computation. Min-sum criteria have been used to find optimum location of a new facility through revised Hook and Jeeves search method.
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 Review of Mechanical Engineering (IREME)
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.
