Path Planning for Mobile Robots in Dynamic Environments Using Particle Swarm Optimization

2009 ◽  
Author(s):  
P. Raja ◽  
S. Pugazhenthi
Keyword(s):  
Particle Swarm Optimization ◽  
Path Planning ◽  
Mobile Robots ◽  
Particle Swarm ◽  
Dynamic Environments ◽  
Swarm Optimization

scholarly journals A Heuristic Elastic Particle Swarm Optimization Algorithm for Robot Path Planning

Information ◽  
2019 ◽  
Vol 10 (3) ◽  
pp. 99 ◽  
Author(s):  
Haiyan Wang ◽  
Zhiyu Zhou
Keyword(s):  
Particle Swarm Optimization ◽  
Path Planning ◽  
Mobile Robots ◽  
Optimization Algorithm ◽  
Particle Swarm Optimization Algorithm ◽  
Optimal Path ◽  
Particle Swarm ◽  
A Algorithm ◽  
Swarm Optimization ◽  
Elastic Particle

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.

scholarly journals An Improved Simulated Annealing Particle Swarm Optimization Algorithm for Path Planning of Mobile Robots Using Mutation Particles

2021 ◽  
Vol 2021 ◽  
pp. 1-12
Author(s):  
Jianzhang Lu ◽  
Zhihao Zhang
Keyword(s):  
Particle Swarm Optimization ◽  
Simulated Annealing ◽  
Path Planning ◽  
Mobile Robots ◽  
Human Life ◽  
Optimal Path ◽  
Particle Swarm ◽  
Autonomous Driving ◽  
Pso Algorithm ◽  
Swarm Optimization

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.

scholarly journals Autonomous navigation and obstacle avoidance of an omnidirectional mobile robot using swarm optimization and sensors deployment

2020 ◽  
Vol 17 (3) ◽  
pp. 172988142092949 ◽  
Author(s):  
Fatin Hassan Ajeil ◽  
Ibraheem Kasim Ibraheem ◽  
Ahmad Taher Azar ◽  
Amjad J Humaidi
Keyword(s):  
Particle Swarm Optimization ◽  
Path Planning ◽  
Mobile Robot ◽  
Particle Swarm ◽  
Bat Algorithm ◽  
Dynamic Environments ◽  
Swarm Optimization ◽  
Hybrid Particle ◽  
Hybrid Particle Swarm Optimization ◽  
Planning Algorithms

The present work deals with the design of intelligent path planning algorithms for a mobile robot in static and dynamic environments based on swarm intelligence optimization. Two modifications are suggested to improve the searching process of the standard bat algorithm with the result of two novel algorithms. The first algorithm is a Modified Frequency Bat algorithm, and the second is a hybridization between the Particle Swarm Optimization with the Modified Frequency Bat algorithm, namely, the Hybrid Particle Swarm Optimization-Modified Frequency Bat algorithm. Both Modified Frequency Bat and Hybrid Particle Swarm Optimization-Modified Frequency Bat algorithms have been integrated with a proposed technique for obstacle detection and avoidance and are applied to different static and dynamic environments using free-space modeling. Moreover, a new procedure is proposed to convert the infeasible solutions suggested via path the proposed swarm-inspired optimization-based path planning algorithm into feasible ones. The simulations are run in MATLAB environment to test the validation of the suggested algorithms. They have shown that the proposed path planning algorithms result in superior performance by finding the shortest and smoothest collision-free path under various static and dynamic scenarios.

Sign in / Sign up

Export Citation Format

Share Document