In this paper,a bioinspired path planning approach for mobile robots is proposed.The approach is based on the sparrow search algorithm,which is an intelligent optimization algorithm inspired by the group wisdom,foragi...In this paper,a bioinspired path planning approach for mobile robots is proposed.The approach is based on the sparrow search algorithm,which is an intelligent optimization algorithm inspired by the group wisdom,foraging,and anti-predation behaviors of sparrows.To obtain high-quality paths and fast convergence,an improved sparrow search algorithm is proposed with three new strategies.First,a linear path strategy is proposed,which can transform the polyline in the corner of the path into a smooth line,to enable the robot to reach the goal faster.Then,a new neighborhood search strategy is used to improve the fitness value of the global optimal individual,and a new position update function is used to speed up the convergence.Finally,a new multi-index comprehensive evaluation method is designed to evaluate these algorithms.Experimental results show that the proposed algorithm has a shorter path and faster convergence than other state-ofthe-art studies.展开更多
基金supported by the National Key R&D Program of China(Grant No.2018YFB1309200)the Opening Project of Shanghai Robot Industry R&D and Transformation Functional Platform.
文摘In this paper,a bioinspired path planning approach for mobile robots is proposed.The approach is based on the sparrow search algorithm,which is an intelligent optimization algorithm inspired by the group wisdom,foraging,and anti-predation behaviors of sparrows.To obtain high-quality paths and fast convergence,an improved sparrow search algorithm is proposed with three new strategies.First,a linear path strategy is proposed,which can transform the polyline in the corner of the path into a smooth line,to enable the robot to reach the goal faster.Then,a new neighborhood search strategy is used to improve the fitness value of the global optimal individual,and a new position update function is used to speed up the convergence.Finally,a new multi-index comprehensive evaluation method is designed to evaluate these algorithms.Experimental results show that the proposed algorithm has a shorter path and faster convergence than other state-ofthe-art studies.
