Global Smooth Path Planning for Mobile Robots Using a Novel Adaptive Particle Swarm Optimization

Author(s):  
Guoming Zhang ◽  
Chunyu Li ◽  
Ming Gao ◽  
Li Sheng
Information ◽  
2019 ◽  
Vol 10 (3) ◽  
pp. 99 ◽  
Author(s):  
Haiyan Wang ◽  
Zhiyu Zhou

Path planning, as the core of navigation control for mobile robots, has become the focus of research in the field of mobile robots. Various path planning algorithms have been recently proposed. In this paper, in view of the advantages and disadvantages of different path planning algorithms, a heuristic elastic particle swarm algorithm is proposed. Using the path planned by the A* algorithm in a large-scale grid for global guidance, the elastic particle swarm optimization algorithm uses a shrinking operation to determine the globally optimal path formed by locally optimal nodes so that the particles can converge to it rapidly. Furthermore, in the iterative process, the diversity of the particles is ensured by a rebound operation. Computer simulation and real experimental results show that the proposed algorithm not only overcomes the shortcomings of the A* algorithm, which cannot yield the shortest path, but also avoids the problem of failure to converge to the globally optimal path, owing to a lack of heuristic information. Additionally, the proposed algorithm maintains the simplicity and high efficiency of both the algorithms.


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-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.


2021 ◽  
Vol 2021 ◽  
pp. 1-12
Author(s):  
Jianzhang Lu ◽  
Zhihao Zhang

Artificial intelligence technology has brought tremendous changes to human life and production methods. Mobile robots, UAVs, and autonomous driving technology have gradually entered people’s daily life. As a typical issue for a mobile robot, the planning of an optimal mobile path is very important, especially in the military and emergency rescue. In order to ensure the efficiency of operation and the accuracy of the path, it is crucial for the robot to find the optimal path quickly and accurately. This paper discusses a new method and MP-SAPSO algorithm for addressing the issue of path planning based on the PSO algorithm by combining particle swarm optimization (PSO) algorithm with the simulated annealing (SA) algorithm and mutation particle and adjusting the parameters. The MP-SAPSO algorithm improves the accuracy of path planning and the efficiency of robot operation. The experiment also demonstrates that the MP-SAPSO algorithm can be used to effectively address path planning issue of mobile robots.


Sign in / Sign up

Export Citation Format

Share Document