scholarly journals Cubic Spline Interpolation-Based Robot Path Planning Using a Chaotic Adaptive Particle Swarm Optimization Algorithm

2020 ◽  
Vol 2020 ◽  
pp. 1-20 ◽  
Author(s):  
Jianfang Lian ◽  
Wentao Yu ◽  
Kui Xiao ◽  
Weirong Liu

This paper proposed a cubic spline interpolation-based path planning method to maintain the smoothness of moving the robot’s path. Several path nodes were selected as control points for cubic spline interpolation. A full path was formed by interpolating on the path of the starting point, control points, and target point. In this paper, a novel chaotic adaptive particle swarm optimization (CAPSO) algorithm has been proposed to optimize the control points in cubic spline interpolation. In order to improve the global search ability of the algorithm, the position updating equation of the particle swarm optimization (PSO) is modified by the beetle foraging strategy. Then, the trigonometric function is adopted for the adaptive adjustment of the control parameters for CAPSO to weigh global and local search capabilities. At the beginning of the algorithm, particles can explore better regions in the global scope with a larger speed step to improve the searchability of the algorithm. At the later stage of the search, particles do fine search around the extremum points to accelerate the convergence speed of the algorithm. The chaotic map is also used to replace the random parameter of the PSO to improve the diversity of particle swarm and maintain the original random characteristics. Since all chaotic maps are different, the performance of six benchmark functions was tested to choose the most suitable one. The CAPSO algorithm was tested for different number of control points and various obstacles. The simulation results verified the effectiveness of the proposed algorithm compared with other algorithms. And experiments proved the feasibility of the proposed model in different dynamic environments.

2018 ◽  
Vol 27 (05) ◽  
pp. 1850015 ◽  
Author(s):  
Chinmaya Sahu ◽  
Priyadarshi Biplab Kumar ◽  
Dayal R. Parhi

The current investigation is focused on the development of a novel navigational controller for the optimized path planning and navigation of humanoid robots. The proposed navigational controller works on the principle of adaptive particle swarm optimization. To improve the working pattern of a simple particle swarm optimization controller, some modifications are done to the controlling parameters of the algorithm. The input parameters to the controller are the sensory information in forms of obstacle distances, and the output from the controller is the required turning angle to safely reach the target position by avoiding the obstacles present in the path. By applying the logic of the adaptive particle swarm optimization, humanoid robots are tested in simulation environments. To validate the results, an experimental platform is also developed under laboratory conditions, and a comparison has been performed between the simulation and experimental results. To test the proposed controller in both static and dynamic environments, it is implemented in the navigation of single as well as multiple humanoid robots. Finally, to ensure the efficacy of the proposed controller, it is compared with some of the existing techniques available for navigational purpose.


2020 ◽  
Vol 2020 ◽  
pp. 1-12 ◽  
Author(s):  
Xun Li ◽  
Dandan Wu ◽  
Jingjing He ◽  
Muhammad Bashir ◽  
Ma Liping

The existing particle swarm optimization (PSO) algorithm has the disadvantages of application limitations and slow convergence speed when solving the problem of mobile robot path planning. This paper proposes an improved PSO integration scheme based on improved details, which integrates uniform distribution, exponential attenuation inertia weight, cubic spline interpolation function, and learning factor of enhanced control. Compared with other standard functions, our improved PSO (IPSO) can achieve better optimal results with less number of iteration steps than the different four path planning algorithms developed in the existing literature. IPSO makes the optimal path length with less than 20 iteration steps and reduces the path length and simulation time by 2.8% and 1.1 seconds, respectively.


Sign in / Sign up

Export Citation Format

Share Document