Abstract
Actually, path planning is one of the most crucial aspects of mobile robots study. The primary goal of this research is to develop a solution to the path planning issues that occur when a “mobile robot” operates in a static environment. The problem is handled by finding a collision-free path that meets the given criteria for the shortest distance with quite the smoothness of the path. Two nature-inspired metaheuristic algorithms are used in the computation. By leading a hybrid “gray wolf optimization” with the “particle swarm optimization” (HGWO-PSO) computation that restricts the distance and follows path perfection guidelines, the primary shape is improved. In addition, simulation findings reveal that the proposed HGWO-PSO method is deeply serious in terms of path optimality when compared to path planning approaches such as group search optimizer GSO, PSO, artificial bee colony ABC, and GWO.
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: Bulletin of Electrical Engineering and Informatics
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.
