Mobile Robot Path Planning Algorithm Based on NSGA-II

Abstract

Path planning for mobile robots is a key technology in robotics. To address the issues of local optima trapping and non-smooth paths in mobile robot path planning, a novel algorithm based on the NSGA-II (Non-dominated Sorting Genetic Algorithm II) is proposed. The algorithm utilizes a search window approach for population initialization, which improves the quality of the initial population. An innovative fitness function is designed as the objective function for optimization iterations. A probability-based selection strategy is employed for population selection and optimization, enhancing the algorithm’s ability to escape local minima and preventing premature convergence to suboptimal solutions. Furthermore, a path smoothing algorithm is developed by incorporating Bézier curves. By connecting multiple segments of Bézier curves, the problem of the high computational complexity associated with high-degree Bézier curves is addressed, while simultaneously achieving smooth paths. Simulation results demonstrated that the proposed path planning algorithm exhibited fewer iterations, superior path quality, and path smoothness. Compared to other methods, the proposed approach demonstrated better overall performance and practical applicability.